Global optimization for a class of fractional programming problems
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 su...
Uložené v:
| Vydané v: | Journal of global optimization Ročník 45; číslo 3; s. 337 - 353 |
|---|---|
| Hlavní autori: | , , , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
Boston
Springer US
01.11.2009
Springer Nature B.V |
| Predmet: | |
| ISSN: | 0925-5001, 1573-2916 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Shrnutí: | 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. |
|---|---|
| Bibliografia: | ObjectType-Article-1 SourceType-Scholarly Journals-1 content type line 14 |
| ISSN: | 0925-5001 1573-2916 |
| DOI: | 10.1007/s10898-008-9378-7 |