• 한국의학물리학회:학술대회논문집
• /
• 한국의학물리학회 2005년도 제30회 춘계학술대회
• /
• 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.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2001년도 하계학술대회 논문집 D
• /
• 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.

• Journal of Electrical Engineering and Technology
• /
• 제10권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.

• 산업경영시스템학회지
• /
• 제15권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에 적응하여, 그 수치해 결과를 보여서 그 타당성음 검토하였다.

• 대한전자공학회논문지
• /
• 제22권2호
• /
• pp.82-89
• /
• 1985

MCO 문제의 해석을 하기 위한 weight P-norm방법을 연구하여 새로운 non-inferior해를 구하였다. Weight 최소화방법을 MOSFET NAND 게이트에 적용하여 최적 non-inferior해를 구하였다. 또한 본 논문에서 응용한 최소화방법은 목적함수가 non-convex일때도 적용된다. 본 논문의 최소화 방법의 결과를 Lightner의 결과와 비교하여 효율성을 입증하였다.

• Management Science and Financial Engineering
• /
• 제12권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.

• Journal of Multimedia Information System
• /
• 제1권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.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권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.

• 한국음향학회지
• /
• 제41권6호
• /
• pp.637-646
• /
• 2022

임의의 곡면 배열에서 단위 빔 형성에 사용되는 부배열은 조향 방위마다 기하학적 형상이 다르다. 이 때문에 조향 방위 별 부배열의 빔 패턴은 항상 균일하지 않다. 본 논문에서는 볼록 최적화를 이용한 빔 형성 기법을 곡면 배열에 적용하고, 조향 방위별 빔 성능의 균일성이 향상되는 것을 보였다. 시뮬레이션은 절단 구면 형상의 곡면 배열에 대해 수행되었다. 고각 3 dB 빔 폭의 표준 편차가 크게 감소하였으나 반대급부로 지향 지수도 감소하는 것을 관찰했다. 이를 완화시키기 위한 하나의 방법으로 쉐이딩 함수를 이용한 최적화 기법을 제안한다.

• 제어로봇시스템학회논문지
• /
• 제21권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.