An efficient algorithm for globally minimizing sum of quadratic ratios problem with nonconvex quadratic constraints

Applied Mathematics and Computation

Volumn 189, Issue 2, 2007, Pages 1624-1636

  Qu, Shao Jian ^a   Zhang, Ke Cun ^a   Zhao, Jia Kun ^a  

^a XI'AN JIAOTONG UNIVERSITY   (China)

Author keywords

Branch and bound; Lagrangian relaxation; QSRP

Indexed keywords

ALGORITHMS; BRANCH AND BOUND METHOD; CONSTRAINT THEORY; GLOBAL OPTIMIZATION; LAGRANGE MULTIPLIERS; PROBLEM SOLVING;

LAGRANGIAN RELAXATION; QUADRATIC RATIOS PROBLEM WITH NONCONVEX QUADRATIC CONSTRAINTS (QSRP); RECTANGULAR PARTITION;

QUADRATIC PROGRAMMING;

EID: 34249077665     PISSN: 00963003     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.amc.2006.12.034     Document Type: Article

References (19)

1. Konno H., and Inori M. Bond protfolio optimization problems and their application to index tracking: a partial optimization approach. Journal of Operations Research Society of Japan 39 (1996) 295-306
2. Davidon W.C. Conic approximation and collinear scaling for optimizers. SIAM Journal of Numerical Analysis 17 (1980) 268-281
3. Wenyu S., and Yaxiang Y. A conic trust-region method for nonlinearly constrained optimization. Annals of Operations Research 103 (2001) 175-191
4. Ariyawansa K.A. Deriving collinear scaling algorithms as extensions of quasi-Newton methods and the local convergence of DFP and BFGS related collinear scaling algorithm. Mathematical Programming 49 (1990) 23-48
5. Ibaraki T. Parametric approaches to fractional programs. Mathematical Programming 26 (1983) 345-362
6. Chadha S.S. Fractional programming with absolute-value functions. European Journal of Operational Research 141 (2002) 233-238
7. Kuno T. A branch-and-bound algorithm for maximizing the sum of several linear ratios. Journal of Global Optimization 22 (2002) 155-174
8. Shen P.P., and Wang C.F. Global optimization for sum of linear ratios problem with coefficients. Applied Mathematics and Computation 176 (2006) 219-229
9. Benson H.P. Using concave envelopes to globally solve the nonlinear sum of ratios problem. Journal of Global Optimization 22 (2002) 343-364
10. Benson H.P. Global optimization algorithm for the nonlinear sum of ratios problem. Journal of Optimization Theory and Application 112 (2002) 1-29
11. Freund R.W., and Jarre F. Solving the sum-of-ratios problem by an interior-point method. Journal of Global Optimization 19 (2001) 83-102
12. Horst R., and Tuy H. Global Optimization, Deterministic Approaches (1990), Springer, Berlin
13. Sorensen D.C. Implicit application of polynomial filters in a K-step Arnoldi method. SIAM Journal on Matrix Analysis and Applications 13 (1992) 357-385
14. Voorhis T.V. A global optimization algorithm using lagrangian underestimates and the interval Newton method. Journal of Global Optimization 24 (2002) 349-370
15. Dur M., and Horst R. Lagrange duality and partitioning techniques in nonconvex global optimization. Journal of Optimization Theory and Applications 95 (1997) 347-369
16. Gotoh J.Y., and Konno H. Maximization of the ratio of two convex quadratic functions over a polytope. Computational Optimization and Applications 20 (2001) 43-60
17. Kearfott R.B. Rigorous Global Search: Continuous Problems. Nonconvex Optimization and Its Applications vol. 13 (1996), Kluwer Academic Publishers, Dordrecht
18. Benson H.P. On the global optimization of sums of linear fractional functions over a convex set. Journal of Optimization Theory and Application 121 (2004) 19-39
19. An L.T.H., and Tao P.D. A branch and bound method via d.c. optimization algorithms and ellipsoidal technique for box constrained nonconvex quadratic problems. Journal of Global Optimization 13 (1998) 171-206