Global optimization for a class of fractional programming problems

Shu Cherng Fang, David Y. Gao, Ruey Lin Sheu, Wenxun Xing

研究成果: Article同行評審

23 引文 斯高帕斯(Scopus)

摘要

This paper presents a canonical dual approach to minimizing the sum of a quadratic function and the ratio of two quadratic functions, which is a type of non-convex optimization problem subject to an elliptic constraint. We first relax the fractional structure by introducing a family of parametric subproblems. Under proper conditions on the "problem-defining" matrices associated with the three quadratic functions, we show that the canonical dual of each subproblem becomes a one-dimensional concave maximization problem that exhibits no duality gap. Since the infimum of the optima of the parameterized subproblems leads to a solution to the original problem, we then derive some optimality conditions and existence conditions for finding a global minimizer of the original problem. Some numerical results using the quasi-Newton and line search methods are presented to illustrate our approach.

原文English
頁(從 - 到)337-353
頁數17
期刊Journal of Global Optimization
45
發行號3
DOIs
出版狀態Published - 2009 十一月

All Science Journal Classification (ASJC) codes

  • Computer Science Applications
  • Management Science and Operations Research
  • Control and Optimization
  • Applied Mathematics

指紋 深入研究「Global optimization for a class of fractional programming problems」主題。共同形成了獨特的指紋。

引用此