A Simplicial Branch-and-Bound Method for Solving Nonconvex All-Quadratic Programs

Journal of Global Optimization

Volumn 13, Issue 4, 1998, Pages 417-432

  Raber, Ulrich ^a  

^a UNIVERSITY OF TRIER   (Germany)

Author keywords

Branch and bound; Global optimization; Indefinite quadratic optimization under indefinite quadratic constraints

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; GLOBAL OPTIMIZATION; ITERATIVE METHODS; PROBLEM SOLVING;

BILINEAR OPTIMIZATION PROBLEMS; BRANCH-AND-BOUND; INTEGRATED CIRCUIT DESIGN; QUADRIATIC CONSTRAINTS;

QUADRATIC PROGRAMMING;

EID: 0002315226     PISSN: 09255001     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1008377529330     Document Type: Article

References (26)

1. Al-Khayyal, Faiz A. and Falk, J.E. (1983), Jointly constrained biconvex programming, Annals of Operations Research 25: 169-180.
2. Al-Khayyal, Faiz A., Larsen, C. and Van Voorhis, T. (1995), A relaxation method for nonconvex quadratically constrained quadratic programs, Journal of Global Optimization 6: 215-230.
3. Al-Khayyal, Faiz A. and Van Voorhis, T. (1996), Accelerating convergence of branch-and-bound algorithms for quadratically constrained optimization problems, in C.A. Floudas (ed.), State of the An in Global Optimization: Computational Methods and Applications, Kluwer Academic Publishers, Dordrecht/Boston/London.
4. Conway, J.H. and Sloane, N.J.A. (1993), Sphere Packings, Lattices and Groups, 2nd edn, Springer, New York.
5. Demands, E.V. and Tang, C.S. (1992), Linear control of a Markov production system, Operations Research 40: 259-278.
6. Filar, J.A. and Schultz, T.A. (1987), Bilinear programming and structured stochastic games, Journal of Optimization Theory and Applications 53: 85-104.
7. Fujic, T. and Kojima, M. (1997), Semidefinite programming relaxation for nonconvex quadratic programs, Journal of Global Optimization 10: 367-380.
8. Horst, R. (1997), On generalized bisection of n-simplices, Mathematics of Computation 66(218): 691-698.
9. Horst, R. and Pardalos, P.M. (1995), Handbook of Global Optimization, Kluwer Academic Publishers, Dordrecht/Boston/London.
10. Horst, R., Pardalos, P.M. and Thoai, N.V. (1995), Introduction to Global Optimization, Kluwer Academic Publishers, Dordrecht/Boston/London.
11. Horst, R. and Raber, U. (1998), Convergent outer approximation algorithms for solving unary programs, Journal of Global Optimization 13: 123-149.
12. Horst, R. and Tuy, H. (1996), Global Optimization: Deterministic Approaches, 3rd enlarged edn, Springer, Heidelberg.
13. Johnson, L.W., Riess, R.D. and Arnold, J.T. (1993), Introduction to Linear Algebra, 3rd edn, Addison-Wesley Publishing Company.
14. Phan-huy-Hao, E. (1982), Quadratically constrained quadratic programming: Some applications and a method for solution, Zeitschrift für Operations Research 26: 105-119.
15. Thai Quynh Phing, Pham Dinh Tao and Le Thi Hoai An, (1994), A method for solving d.c. programming problems, Application to fuel mixture nonconvex optimization problems, Journal of Global Optimization 6: 87-105.
16. Raber, U. (1996), Global Optimization with Indefinite Quadratic Constraints, Diploma Thesis (in German), University of Trier.
17. Rutenberg, D.P. and Shaftel, T.L. (1971), Product design: Sub-assemblies for multiple markets, Managment Science 18: B220-B231.
18. Ramana, M. (1993), An Algorithmic Analysis of Multiquadratic and Semidefinite Programming Problems, Ph.D. Thesis, The Johns Hopkins University, Baltimore.
19. Sherali, H.D. and Alameddine, A. (1992), A new reformulation-linearization technique for bilinear programming problems, Journal of Global Optimization 2: 379-410.
20. Sherali, H.D. and Tuncbilek, C.H. (1992), A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique, Journal of Global Optimization 2: 101-112.
21. Shor, N.Z. (1987), Quadratic optimization problems, Soviet J. Computer and Systems Sciences 25: 1-11.
22. Shor, N.Z. (1998), Nondifferentiable Optimization and Polynomial Problems, Kluwer Academic Publishers, Dordrecht/Boston/London.
23. Visweswaran, V. and Floudas, C.A. (1990), A global optimization algorithm (GOP) for certain classes of nonconvex NLP's: II. Applications of theory and test problems, Computers and Chemical Engineering 14: 1417-1434.
24. Visweswaran, V. and Floudas, C.A. (1993), Primal-relaxed dual global optimization approach, Journal of Optimization Theory and Applications 78: 187-225.
25. Visweswaran, V. and Floudas, C.A. (1993), New properties and computational improvement of the GOP algorithm for problems with quadratic objective function and constraints, Journal of Global Optimization 3: 439-462
26. Weintraub, A. and Vera, J. (1991), A cutting plane approach for chance-constrained linear programs, Operations Research 39: 776-785.