An efficient algorithm for globally minimizing a quadratic function under convex quadratic constraints

Mathematical Programming, Series B

Volumn 87, Issue 3, 2000, Pages 401-426

  An, Le Thi Hoai ^a  

^a UNIVERSITÉ ET INSA DE ROUEN   (France)

Author keywords

Branch and bound; Combined DCA branch and bound; d.c. optimization; DCA; Dual method; Lagrangian duality; Projection subgradient method; Proximal point algorithm

Indexed keywords

EID: 0013532015     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/s101070050003     Document Type: Article

References (30)

1. Le Thi Hoai An (1997): Contribution à l'optimisation non convexe et l'optimisation globale. Habilitation à Diriger des Recherches, Université de Rouen, France, Juin 1997
2. Le Thi Hoai An, Pham Dinh Tao (1997): Solving a class of linearly constrained indefinite quadratic problems by D.c. algorithms. J. Glob. Optim. 11, 253-285
3. Le Thi Hoai An, Pham Dinh Tao (1998): A branch-and-bound method via d.c. optimization algorithm and ellipsoidal technique for box constrained nonconvex quadratic prosrammina problems. J. Glob. Optim. 13, 171-206
4. Le Thi Hoai An, Pham Dinh Tao, Le Dung Muu (1996): Numerical solution for optimization over the efficient set by d.c. optimization algorithm. Oper. Res. Lett. 19, 117-128
5. Bar-On, J.R., Grasse, K.A. (1994): Global Optimization of a quadratic functional with quadratic equality constraints. Technical note. J. Optim. Theory Appl. 82, 379-386
6. Ben Tal, A., Teboulle, M. (1996): Hidden convexity in some nonconvex quadratically constrained quadratic programming. Math. Program. 72, 51-63
7. Brezis, H. (1973): Opérateurs maximaux monotones. Mathematics Studies 5, North Holland, 1973
8. Grotschel, M., Lovasz, L., Schrijver, A. (1993): Geometric Algorithms and Combinatorial Optimization. Springer-Verlag, Berlin
9. Heinkenschloss, M. (1994): On the solution of a two ball trust region subproblem. Math. Program. 64, 249-276
10. Laurent, P.J. (1972): Approximation et Optimisation. Hermann, Paris
11. Lucidi, S., Palagi, L., Roma, M.: On some properties of quadratic programs with a convex quadratic constraint. SIAM J. Optim. 8, 105-122
12. 2AN), 27, 375-395
13. Mahey, P., Pham Dinh Tao (1995): Proximal decomposition of the graph of maximal monotone operator. SIAM J. Optim. 5, 454-168
14. Martinet, B. (1970): Régularisation d'inéquations variationelles par approximations successives. Revue Française d'Automatique, Informatique et Recherche Opérationnelle 4, 154-159
15. Martinez, J.M., Santos, S.A. (1995): A trust-region strategy for minimization on arbitrary domains. Math. Program. 68, 267-301
16. Pham Dinh Tao (1988): Duality in d.c. (difference of convex functions) optimization. Subgradient methods. Trends in Mathematical Optimization. International Series of Numer. Math. 84, Birkhauser, pp. 277-293
17. Pham Dinh Tao, Le Thi Hoai An (1994): Stabilité de la dualité lagrangienne en optimisation d.c. (diférence de deux fonctions convexes). C.R. Acad. Paris, t.318, Série I, 379-384
18. Pham Dinh Tao, Le Thi Hoai An (1998): D.c. optimization algorithms for solving the trust region subproblem. SIAM J. Optim. 8, 476-505
19. Pham Dinh Tao, Le Thi Hoai An (1997): Convex analysis approach to d.c. programming: Theory, Algorithm and Applications, Acta Math. Vietnam, (dedicated to Professor Hoang Tuy on the occasion of his 70th birthday) 22, 289-355
20. Pham Dinh Tao, Le Thi Hoai An (2000): D.c. programming approach and solution algorithm to the multidimensional scaling problem. To appear in "Local and Global Approaches to Nonconvex Optimization", Kluwer Academic Publishers
21. Peng, Ji.M., Yuan, Y. (1997): Optimality conditions for the minimization of a quadratic with two quadratic constraints. SIAM. J. Optim. 7, 579-594
22. Polyak, B. (1987): Introduction to Optimization. Optimization Software. Inc., Publication Division, New York
23. Rockafellar, R.T. (1976): Monotone operators and the proximal point algorithm. SIAM J. Control Optim. 14
24. Santos, S.A., Sorensen, D.C.: A new matrix-free algorithm for the large-scale trust-region subproblem.
25. Shor, N.Z. (1977): Cut-oof method with space extension in convex programming problems. Cybernetics 13, 94-96
26. Sorensen, D.C. (1992): Implicit application of polynomial filters in a K-step Arnoldi method. SIAM J. Matrix Anal. Appl. 13, 357-385
27. Stern, R.J., Wolkowicz, H. (1995): Indefinite trust region subproblems and nonsymmetric eigenvalue perturbations. SIAM J. Optim. 5, 286-313
28. Spingarn, J.E. (1983): Partial inverse of a monotone operator. Appl. Math. Optim. 10, 247-265
29. Ye, Y. (1992): On affine scaling algorithms for nonconvex quadratic programming. Math. Program. 56, 285-300
30. Yuan, Y. (1990): On a subproblem of trust region algorithms for constrained optimization. Math. Program. 47, 53-63