A robust algorithm for quadratic optimization under quadratic constraints

Journal of Global Optimization

Volumn 37, Issue 4, 2007, Pages 557-569

  Tuy, Hoang ^a   Hoai Phuong, N T ^a  

^a INSTITUTE OF MATHEMATICS   (Viet Nam)

Author keywords

Branch reduce and bound successive incumbent transcending algorithm; Essential optimal solution; Nonconvex global optimization; Quadratic optimization under quadratic constraints; Robust solution

Indexed keywords

APPROXIMATION THEORY; CONSTRAINT THEORY; OPTIMIZATION; PERTURBATION TECHNIQUES; PROBLEM SOLVING;

BRANCH-REDUCE-AND-BOUND SUCCESSIVE INCUMBENT TRANSCENDING ALGORITHM; ESSENTIAL OPTIMAL SOLUTIONS; NONCONVEX GLOBAL OPTIMIZATION; QUADRATIC OPTIMIZATION UNDER QUADRATIC CONSTRAINTS; ROBUST SOLUTIONS;

ALGORITHMS;

EID: 33847323552     PISSN: 09255001     EISSN: 15732916     Source Type: Journal    
DOI: 10.1007/s10898-006-9063-7     Document Type: Article

References (18)

1. Al-Khayyal, F.A., Larsen, C., van Voorhis, T.: A relaxation method for nonconvex quadraticaly constrained quadratic programs. J. Glob. Optim. 6, 215-230 (1995)
2. Audet, C., Hansen, P., Jaumard, B., Savard, G.: A branch and cut algorithm for nonconvex quadratically constrained quadratic programming. Math. Program. Ser. A 87, 131-152 (2000)
3. Dembo, R.S.: A set of geometric programming test problems and their solutions. Math. Program. 10, 192-213 (1976)
4. Floudas, C.A.: Deterministic Global Optimization. Kluwer, Dordrecht (1999)
5. Floudas, C.A. et al.: Handbook of Test Problems in Local and Global Optimization. Kluwer, Dordrecht (1999)
6. Horst, R., Tuy, H.: Global Optimization: Deterministic Approaches, 3rd edn. Springer, Berlin (1996)
7. Lasserre, J.: Global optimization with polynomials and the problem of moments. SIAM J. Optim. 11, 796-817 (2001)
8. Phong, T.Q., Tao, P.D., Hoai An, L.T.: A method for solving d.c. programming problems. application to fuel mixture nonconvex optimization problem. J. Glob. Optim. 6, 87-105 (1995)
9. Sherali, H.D., Tuncbilek, C.H.: A global opimization algorithm for polynomial programming using a reformulation-linearization technique. J. Glob. Optim. 2, 101-112 (1992)
10. Sherali, H.D., Tuncbilek, C.H.: A reformulation-convexification approach for solving nonconvex quadratic programming problems. J. Glob. Optim. 7, 1-31 (1995)
11. Shor, N.Z., Stetsenko, S.I.: Quadratic Extremal Problems and Nondifferentiable Optimization. Naukova Dumka, Kiev in Russian (1989)
12. Shor, N.Z.: Nondifferentiable Optimization and Polynomial Problems. Kluwer, Dordrecht (1998)
13. Tuy, H.: Convex Analysis and Global Optimization. Kluwer, Dordrecht (1998)
14. Tuy, H.: Monotonic optimization: problems and solution approaches. SIAM J. Optim. 11(2), 464-494 (2000)
15. Tuy, H., Al-Khayyal, F., Thach, P.T.: Monotonic optimization: branch and cut methods. In: Audet, C., Hansen, P., Savard, G. (eds.) Essays and Surveys on Global Optimization, pp. 39-78. Springer, Berlin (2005)
16. Tuy, H.: Robust solution of nonconvex global optimization problems. J. Glob. Optim. 32, 307-323 (2005)
17. Tuy, H.: Polynomial optimization: a robust approach. Pac. J. Optim. 1, 357-374 (2005)
18. Tuy, H., Minoux, M., Hoai-Phuong, N.T.: Discrete monotonie optimization with application to a discrete location problem. SIAM J. Optim. 17, 78-97 (2006)