An ellipsoidal branch and boun d algorithm for global optimizati on

SIAM Journal on Optimization

Volumn 20, Issue 2, 2009, Pages 740-758

  Hager, William W ^a   Phan, Dzung T ^a  

^a UNIVERSITY OF FLORIDA   (United States)

Author keywords

Affine underestimation; Ball approximation; Branch and bound; Convex relaxation; Global optimization; Weakly convex

Indexed keywords

BALL APPROXIMATION; BRANCH AND BOUNDS; BRANCH-AND-BOUND ALGORITHMS; CONVEX RELAXATION; D-ALGORITHM; FEASIBLE SET; GRADIENT PROJECTION ALGORITHMS; LOWER BOUNDS; OBJECTIVE FUNCTIONS; TEST PROBLEM;

CONTROL THEORY; CONVEX OPTIMIZATION; GLOBAL OPTIMIZATION; LINEAR PROGRAMMING; OPTIMIZATION; RELAXATION PROCESSES; SPHERES;

APPROXIMATION ALGORITHMS;

EID: 70450197168     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/080729165     Document Type: Article

References (27)

1. L. T. H. AN, An efficient algorithm for globally minimizing a quadratic function under convex quadratic constraints, Math. Program., 87 (2000), pp. 401-426.
2. E. G. BIRGIN, J. M. MARTÍNEZ, AND M. RAYDAN, Nonmonotone spectral projected gradient methods for convex sets, SIAM J. Optim., 10 (2000), pp. 1196-1211.
3. E. G. BIRGIN, J. M. MARTÍNEZ, AND M. RAYDAN, Algorithm 813: SPG - software for convexconstrained optimization, ACM Trans. Math. Software, 27 (2001), pp. 340-349.
4. M. CELIS, J. E. DENNIS, AND R. A. TAPIA, A trust region strategy for nonlinear equality constrained optimization, in Numerical Optimization 1984, SIAM, Philadelphia, 1985, pp. 71-82.
5. X. D. CHEN AND Y. YUAN, A note on quadratic forms, Math. Program., 86 (1999), pp. 187-197.
6. X. D. CHEN AND Y. YUAN, On local solutions of the cdt subproblem, SIAM J. Optim., 10 (1999), pp. 359-383.
7. P. L. COMBETTES AND T. PENNANEN, Proximal methods for cohypomonotone otperators, SIAM J. Control, 43 (2004), pp. 731-742.
8. C. A. FLOUDAS AND V. VISWESWARAN, Quadratic optimization, in Handbook of Global Optimization, R. Horst and P. Pardalos, eds., Kluwer Academic, Norwell, MA, 1994, pp. 217-270.
9. W. W. HAGER, Applied Numerical Linear Algebra, Prentice-Hall, Englewood Cliffs, NJ, 1988.
10. W. W. HAGER AND S. GOWDA, Stability in the presence of degeneracy and error estimation, Math. Program., 85 (1999), pp. 181-192.
11. W. W. HAGER AND H. ZHANG, A new active set algorithm for box constrained optimization, SIAM J. Optim., 17 (2006), pp. 526-557.
12. M. HEINKENSCHLOSS, On the solution of a two ball trust region subproblem, Math. Program., 64 (1994), pp. 249-276.
13. R. HORST, P. M. PARDALOS, AND N. V. THOAI, Introduction to Global Optimization, Kluwer Academic Publishers, Dordrecht, Holland, 1995.
14. A. N. IUSEM, T. PENNANEN, AND B. F. SVAITER, Inexact variants of the proximal point algorithm without monotonicity, SIAM J. Optim., 13 (2003), pp. 1080-1097.
15. G. D. LI AND Y. YUAN, Computing a Celis-Dennis-Tapia step, J. Comput. Math., 23 (2005), pp. 463-478.
16. A. LIN, A class of method for projection on a convex set, Adv. Model. Optim., 5 (2003), pp. 211-221.
17. A. LIN AND S. P. HAN, A class of methods for projection on the intersection of several ellipsoids, SIAM J. Optim., 15 (2005), pp. 129-138.
18. J. LINDEROTH, A simplicial branch and bound algorithm for solving quadratically constrained quadratic programs, Math. Program., 103 (2005), pp. 251-282.
19. J. M. MARTÍNEZ AND S. A. SANTOS, A trust-region strategy for minimization on arbitrary domains, Math. Program., 68 (1995), pp. 267-301.
20. J. M. PENG AND Y. YUAN, Optimality conditions for the minimization of a quadratic with two quadratic constraints, SIAM J. Optim., 7 (1997), pp. 579-594.
21. T. PENNANEN, Local convergence of the proximal point algorithm and multiplier methods without monotonicity, Math. Oper. Res., 27 (2002), pp. 170-191.
22. U. RABER, A simplicial branch and bound method for solving nonconvex all-quadratic programs, J. Global Optim., 13 (1998), pp. 417-432.
23. N. Z. SHOR, Cut-off method with space extension in convex programming problems, Cybernet. System Anal., 1 (1977), pp. 94-97.
24. L. N. TREFETHEN AND D. BAU III, Numerical Linear Algebra, SIAM, Philadelphia, 1997.
25. J. P. VIAL, Strong and weak convexity of sets and functions, Math. Oper. Res., 8 (2) (1983), pp. 231-259.
26. Y. YE AND S. ZHANG, New results on quadratic minimization, SIAM J. Optim., 14 (2003), pp. 245-267.
27. D. B. YUDIN AND A. S. NEMIROVSKI, Informational complexity and effective methods for the solution of convex extremal problems, Ekonom. Mat. Metody., 12 (1976), pp. 550-559 (in Russian).