• Title/Summary/Keyword: non-convex optimization

Search Result 95, Processing Time 0.028 seconds

Feasibility Test of the Numerical Optimization for the Fast IMRT Planning

  • Cheong, Kwang-Ho;Suh, Tae-Suk;Dempsey, James F.
    • Proceedings of the Korean Society of Medical Physics Conference
    • /
    • 2005.04a
    • /
    • pp.79-82
    • /
    • 2005
  • In this study, we have tested the feasibility of the convex non-linear objective model and the line search optimization method for the fluence map optimization (FMO). We've created the convex nonlinear objective function with simple bound constraints and attained the optimal solution using well-known gradient algorithms with an Armijo line search that requires sufficient objective function decrease. The algorithms were applied to 10 head-and-neck cases. The numbers of beamlets were between 900 and 2,100 with a 3 mm isotropic dose grid. Nonlinear optimization methods could efficiently solve the IMRT FMO problem in well under a minute with high quality for clinical cases.

  • PDF

Active Contour Based Edge Detection Using Evolutionary Computation (진화 연산을 이용한 능동외곽기반의 윤곽선검출에 관한 연구)

  • Kang, Hyeon-Tae;Cho, Deok-Hwan;Hwang, Gi-Hyun;Mun, Kyeong-Jun;Park, June-Ho;Lee, Hwa-Seok
    • Proceedings of the KIEE Conference
    • /
    • 2001.07d
    • /
    • pp.2405-2407
    • /
    • 2001
  • In this paper, we apply and evolutionary computation(EC), probabilistic optimization algorithm, to active contour. A number of problems exist associated with such as algorithm initialization, existence of local minima, non-convex search space, and the selection of model parameters in conventional models. We propose an adequate fitness function for these problems. The determination of fitness function adequate to active contour using EC is important in search capability. As a result of applying the proposed method to non-convex object shape, we improve the unstability and contraction phenomena, in nature, of snake generated in deformable contour optimization.

  • PDF

Enhanced Particle Swarm Optimization for Short-Term Non-Convex Economic Scheduling of Hydrothermal Energy Systems

  • Jadoun, Vinay Kumar;Gupta, Nikhil;Niazi, K. R.;Swarnkar, Anil
    • Journal of Electrical Engineering and Technology
    • /
    • v.10 no.5
    • /
    • pp.1940-1949
    • /
    • 2015
  • This paper presents an Enhanced Particle Swarm Optimization (EPSO) to solve short-term hydrothermal scheduling (STHS) problem with non-convex fuel cost function and a variety of operational constraints related to hydro and thermal units. The operators of the conventional PSO are dynamically controlled using exponential functions for better exploration and exploitation of the search space. The overall methodology efficiently regulates the velocity of particles during their flight and results in substantial improvement in the conventional PSO. The effectiveness of the proposed method has been tested for STHS of two standard test generating systems while considering several operational constraints like system power balance constraints, power generation limit constraints, reservoir storage volume limit constraints, water discharge rate limit constraints, water dynamic balance constraints, initial and end reservoir storage volume limit constraints, valve-point loading effect, etc. The application results show that the proposed EPSO method is capable to solve the hard combinatorial constraint optimization problems very efficiently.

A STUDY ON THE MODIFIED GRADIENT METHOD FOR QUASI-DIFFERENTIABLE PROGRAMMING (유사 미분가능 최적화 문제에 있어서 수정 급상승법에 대한 연구)

  • 김준흥
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.15 no.26
    • /
    • pp.67-76
    • /
    • 1992
  • 변수의 어떤 값들에 대해 도함수를 가질 수 없는 함수를 최적화해야 하는 등. OR 에서는 여러 상황이 존재한다. 이것은 Convex Analysis〔12〕서 이론적인 differential calculus를 근저로 하는 Non-differentiable Optimization 또는 Non-smooth Optimization 을 취급하는 것이 된다. 이러한 종류의 미분이 가능하지 않은 최적화문제는 연속함수를 위한 종래의 최적화법으로는 그 해법자체가 갖고 있는 연속성의 한계를 극복할 수 없다. 따라서, 이러한 문제를 해결하기 위해 Demyanov〔4〕가 제시한 quasi-differental function의 정의와 이들 함수에 따른 몇가지 주요정리들을 언급하고, 그것들을 토대로 Non-differentiable optimization problem의 수치적인 방법을 수행하기 위해 일종의 modified gradient 법을 제시한다. 이를 이용해서 numerical experiment를 위한 방법을 구체화하여, unrestricted non-differentable optimization problem에 적응하여, 그 수치해 결과를 보여서 그 타당성음 검토하였다.

  • PDF

A Circuit Design Using Weight Minimization Method (Weight 최소화법을 이용한 외로 설계)

  • 김희석;임제택
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.22 no.2
    • /
    • pp.82-89
    • /
    • 1985
  • A new non-inferior solution is obtained by investigating method of weight p- norm to explain the conception of MCO (multiple criterion optimization) problem. And then the optimum non-inferior solution is obtained by the weight minimization method applied to objective function of MOSFET NAND rATEAlso this weight minimization method using weight P- norm methods can be applied to non-convex objective function. The result of this minimization method shows the efficiency in comparison with that of Lightner.

  • PDF

Quasiconcave Bilevel Programming Problem

  • Arora S.R.;Gaur Anuradha
    • Management Science and Financial Engineering
    • /
    • v.12 no.1
    • /
    • pp.113-125
    • /
    • 2006
  • Bilevel programming problem is a two-stage optimization problem where the constraint region of the first level problem is implicitly determined by another optimization problem. In this paper we consider the bilevel quadratic/linear fractional programming problem in which the objective function of the first level is quasiconcave, the objective function of the second level is linear fractional and the feasible region is a convex polyhedron. Considering the relationship between feasible solutions to the problem and bases of the coefficient submatrix associated to variables of the second level, an enumerative algorithm is proposed which finds a global optimum to the problem.

Finite Step Method for the Constrained Optimization Problem in Phase Contrast Microscopic Image Restoration

  • Adiya, Enkhbolor;Yadam, Bazarsad;Choi, Heung-Kook
    • Journal of Multimedia Information System
    • /
    • v.1 no.1
    • /
    • pp.87-93
    • /
    • 2014
  • The aim of microscopic image restoration is to recover the image by applying the inverse process of degradation, and the results facilitate automated and improved analysis of the image. In this work, we consider the problem of image restoration as a minimization problem of convex cost function, which consists of a least-squares fitting term and regularization terms with non-negative constraints. The finite step method is proposed to solve this constrained convex optimization problem. We demonstrate the convergence of this method. Efficiency and restoration capability of the proposed method were tested and illustrated through numerical experiments.

  • PDF

Optimization for Relay-Assisted Broadband Power Line Communication Systems with QoS Requirements Under Time-varying Channel Conditions

  • Wu, Xiaolin;Zhu, Bin;Wang, Yang;Rong, Yue
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.10
    • /
    • pp.4865-4886
    • /
    • 2017
  • The user experience of practical indoor power line communication (PLC) applications is greatly affected by the system quality-of-service (QoS) criteria. With a general broadcast-and-multi-access (BMA) relay scheme, in this work we investigate the joint source and relay power optimization of the amplify-and-forward (AF) relay systems used under indoor broad-band PLC environments. To achieve both time diversity and spatial diversity from the relay-involved PLC channel, which is time-varying in nature, the source node has been configured to transmit an identical message twice in the first and second signalling phase, respectively. The QoS constrained power allocation problem is not convex, which makes the global optimal solution is computationally intractable. To solve this problem, an alternating optimization (AO) method has been adopted and decomposes this problem into three convex/quasi-convex sub-problems. Simulation results show the fast convergence and short delay of the proposed algorithm under realistic relay-involved PLC channels. Compared with the two-hop and broadcast-and-forward (BF) relay systems, the proposed general relay system meets the same QoS requirement with less network power assumption.

Beam pattern analysis for beam homogenization of conformal array sonar (곡면 배열 소나의 빔 균일화를 위한 빔 패턴 분석)

  • Jeong-Ung, Choi;Wooyoung, Hong;Jun-Seok, Lim;Keunhwa, Lee
    • The Journal of the Acoustical Society of Korea
    • /
    • v.41 no.6
    • /
    • pp.637-646
    • /
    • 2022
  • Sub-arrays of arbitrary conformal array have different geometric shape through steering direction, thus the beam patterns of sub-arrays are always non-uniform. In this paper, we apply the beam pattern synthesis method using convex optimization into the conformal array, and shows the improvement of uniformity of beam performance. The simulation is performed with the conformal array of cut-sphere shape. As a result, the standard deviation of 3 dB beamwidth in elevation is greatly reduced but the directivity index is also reduced. To alleviate this trade-off, we propose a convex optimization using a shading function.

Structured Static Output Feedback Stabilization of Discrete Time Linear Systems (구조적인 제약이 있는 이산시간 선형시스템의 정적출력 되먹임 안정화 제어기 설계)

  • Lee, Joonhwa
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.21 no.3
    • /
    • pp.233-236
    • /
    • 2015
  • In this paper, a nonlinear optimization problem is proposed to obtain a structured static output feedback controller for discrete time linear systems. The proposed optimization problem has LMI (Linear Matrix Inequality) constraints and a non-convex objective function. Using the conditional gradient method, we can obtain suboptimal solutions of the proposed optimization problem. Numerical examples show the effectives of the proposed approach.