• 한국멀티미디어학회논문지
• /
• 제9권12호
• /
• pp.1636-1648
• /
• 2006

In this paper, we propose a new optimization approach to the rate control problem in a wired-cum-wireless network. A primal-dual interior-point(PDIP) algorithm is used to find the solution of the rate optimization problem. We show a comparison between the dual-based(DB) algorithm and PDIP algorithm for solving the rate control problem in the wired-cum-wireless network. The PDIP algorithm performs much better than the DB algorithm. The PDIP can be considered as an attractive method to solve the rate control problem in network. We also present a numerical example and simulation to illustrate our conclusions.

• 한국산업정보학회논문지
• /
• 제7권1호
• /
• pp.58-65
• /
• 2002

정수계획법모형에서 목적함수와 선형 제약조건식에 만족하는 최적해를 유도할 때, 선형 제약조건식으로 이루어지는 모든 가능해의 Convex set K에서 정수인 extreme point 또는 수정된 정수인 extreme point를 유도하여 목적함수Z의 최적해로 결정한다. 본 논문에서는 기저변수 벡터 $X_{B}$의 성분이 정수가 아닐 때 Branch & Bound 방법을 확장하여 $X_{B}$가 정수가 되도록 한다. 그리고 목적함수의 계수 $C_{j}$의 변동에 의하여 단계적으로 변하는 최적화를 유도함을 목적으로 한다. 한다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제14권11호
• /
• pp.4595-4610
• /
• 2020

In the practical communication environment, the accurate channel state information (CSI) is difficult to obtain, which will cause the mismatch of resource and degrade the system performance. In this paper, to account for the channel uncertainties, a robust power allocation scheme for a downlink Non-orthogonal multiple access (NOMA) heterogeneous network (HetNet) is designed to maximize energy efficiency (EE), which can ensure the quality of service (QoS) of users. We conduct the robust optimization model based on worse-case method, in which the channel gains belong to certain ellipsoid sets. To solve the non-convex non-liner optimization, we transform the optimization problem via Dinkelbach method and sequential convex programming, and the power allocation of small cell users (SCUs) is achieved by Lagrange dual approach. Finally, we analysis the convergence performance of proposed scheme. The simulation results demonstrate that the proposed algorithm can improve total EE of SCUs, and has a fast convergence performance.

• 한국항공우주학회지
• /
• 제50권11호
• /
• pp.771-781
• /
• 2022

순차 컨벡스 최적화 기법을 사용한 궤적 최적화로 무인기 기초 설계 형상의 성능 분석을 수행했다. 외부 공력 모델로 설계한 비선형 궤적 최적화 문제는 볼록화와 이산화를 통해 2차 원뿔 프로그램 문제로 근사 되었다. 알고리즘의 성능 향상을 위해 제약조건을 완화한 문제의 해를 초기 궤적으로 사용했다. 근사해의 반복적인 탐색으로 하강 궤적 최적화 문제들을 분석했으며 설계 형상의 구동부 성능에 따른 최대 도달 속도를 비교했다.

• Journal of applied mathematics & informatics
• /
• 제17권1_2_3호
• /
• pp.351-360
• /
• 2005

This paper finds a new class of generalized convex function which satisfies the following properties: It's level set is $\eta$-convex set; Every feasible Kuhn-Tucker point is a global minimum; If Slater's constraint qualification holds, then every minimum point is Kuhn-Tucker point; Weak duality and strong duality hold between primal problem and it's Mond-Weir dual problem.

• 한국수학교육학회지시리즈A:수학교육
• /
• 제28권1호
• /
• pp.41-45
• /
• 1989

Subdifferentiability of a vector-valued set function is defined first. Then in terms of zero-like functions, a perperly efficient solution of a convex programming problem with set functions will be characterized.

• Transactions on Control, Automation and Systems Engineering
• /
• 제4권4호
• /
• pp.324-329
• /
• 2002

In this paper, the guaranteed cost filtering design method for linear time delay systems with convex bounded uncertainties in discrete-time case is presented. The uncertain parameters are assumed to be unknown but belonging to known convex compact set of polytotype less conservative than norm bounded parameter uncertainty. The main purpose is to design a stable filter which minimizes the guaranteed cost. The sufficient condition for the existence of filter, the guaranteed cost filter design method, and the upper bound of the guaranteed cost are proposed. Since the proposed sufficient conditions are LMI(linear matrix inequality) forms in terms of all finding variables, all solutions can be obtained simultaneously by means of powerful convex programming tools with global convergence assured. Finally, a numerical example is given to check the validity of the proposed method.

• International Journal of Control, Automation, and Systems
• /
• 제1권3호
• /
• pp.271-281
• /
• 2003

In this paper, a new nonlinear programming approach is suggested to solve biaffine matrix inequality (BMI) problems in multiobjective and structured controls. It is shown that these BMI problems are reduced to nonlinear minimization problems. An algorithm that is easily implemented with existing convex optimization codes is presented for the nonlinear minimization problem. The efficiency of the proposed algorithm is illustrated by numerical examples.

• 정보처리학회논문지:컴퓨터 및 통신 시스템
• /
• 제3권1호
• /
• pp.1-6
• /
• 2014

현재까지 컨벡스헐 (convex hull) 의 계산 알고리즘들은 주로 점 집합 (point set) 에 대해 연구가 수행되어 왔다. 본 논문에서는 이산 공간에서 다양한 반경을 갖는 구 집합에 대한 컨벡스헐을 근사하는 방법을 제시한다. 구 집합에 대한 컨벡스헐 계산은, 특히 단백질 분자의 구조적인 특성을 연구하는 여러 응용분야에서 계산 효율성을 증대시키기 위한 기반 기술이라 할 수 있다. 분자에 대응하는 구의 집합에 대해 복셀 맵 (voxel map) 자료구조를 적용하고 이를 이용하여 컨벡스헐을 계산하는 알고리즘을 제시한다. 제안된 방법은 GPU를 활용한 병렬처리를 수행하여 평균적으로 6,400개 이하의 구가 포함된 집합에 대해 40ms 이내에 컨벡스헐을 계산하는 성능을 보인다.

• ETRI Journal
• /
• 제36권4호
• /
• pp.686-689
• /
• 2014

This paper studies energy-efficiency (EE) power allocation for cognitive radio MIMO-OFDM systems. Our aim is to minimize energy efficiency, measured by "Joule per bit" metric, while maintaining the minimal rate requirement of a secondary user under a total power constraint and mutual interference power constraints. However, since the formulated EE problem in this paper is non-convex, it is difficult to solve directly in general. To make it solvable, firstly we transform the original problem into an equivalent convex optimization problem via fractional programming. Then, the equivalent convex optimization problem is solved by a sequential quadratic programming algorithm. Finally, a new iterative energy-efficiency power allocation algorithm is presented. Numerical results show that the proposed method can obtain better EE performance than the maximizing capacity algorithm.