An Algorithm for Global Minimization of Linearly Constrained Quadratic Functions

Journal of Global Optimization

Volumn 16, Issue 1, 2000, Pages 77-93

  Barrientos, Oscar ^a   Correa, Rafael ^b  

^a Endesa Chile   (Chile)

^b UNIVERSITY OF CHILE   (Chile)

Author keywords

Branch and bound methods; Constrained global optimization; Duality techniques; Quadratic programming

Indexed keywords

EID: 0242356173     PISSN: 09255001     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1008306625093     Document Type: Article

References (19)

1. Auslender, A. (1976), Optimisation Méthodes Numériques, Masson, France.
2. Ben-Tal, A., Eiger, G. and Gershovitz, V. (1994), Global minimization by reducing the duality gap, Mathematical Programming 63: 193-212.
3. Bomze, I. and Danninger, G. (1994), A finite algorithm for solving general quadratic problem, Journal of Global Optimization 4: 1-16.
4. Falk, J.E. (1969), Lagrange Multipliers and Nonconvex Programs, SIAM J. Control 7: 534-545.
5. Geoffrion, A. (1972), Generalized Benders' decompositions, Journal of Optimization, Theory and Its Applications 10: 237-260.
6. Horst, R. and Tuy, H. (1993), Global Optimization (Deterministic Approaches), 2nd edition. Springer-Verlag, Berlin.
7. Kalantari, B. (1984), Large scale concave quadratic minimization and extensions, PhD thesis. Computer Sci. Dept., University of Minnesota.
8. Kough, P.F. (1979), The indefinite quadratic programming problem, Operations Research 27/3: 516-533.
9. Minoux, M. (1983), Programmation mathématique: Théorie et algorithmes, Vol. 1, Dunod, France.
10. Muller, R.K. (1979), A method for solving the indefinite quadratic programming A problem, Management Science 16/5: 333-339.
11. Murty, K.G. and Kabadi, S.N. (1987), Some NP-complete in quadratic and nonlinear programming, Mathematical Programming 39: 117-129.
12. Pardalos, P.M., Glick, J.H. and Rosen, J.B. (1987), Global minimization of indefinite quadratic problems, Computing 39: 281-291.
13. Pardalos, P.M. and Rosen, J.B. (1987), Constrained global optimization: Algorithms and Applications, Lecture Notes in Computer Science 268. Springer-Verlag, Berlin.
14. Pardalos, P.M. and Schnitger, G. (1988), Checking local optimality in constrained quadratic programming is NP-hard, OR Letters 7: 33-35.
15. Phillips, A.T. and Rosen, J.B. (1988), A parallel algorithm for constrained concave quadratic global minimization, Mathematical Programming 42: 421-488.
16. Rosen, J.B. and Pardalos, P.M. (1986), Global minimization of large scale constrained concave quadratic problems by separable programming, Mathematical Programming 34: 163-174.
17. Shectman, J.P. and Sahinidis, N.V. (1996), A finite algorithm for global minimization of separable concave programs, in: Floudas, C. A. and Pardalos, P.M. (eds.), State of the Art in Global Optimization: Computational Methods and Applications, Kluwer Academic Publishers, Boston, MA, 303-340.
18. Strekalovskii, A.S. (1993), The search for a global maximum of a convex functional on a admissible set, Comput. Maths. Math. Phys. Vol. 33, No. 3: 315-328.
19. Tuy, H. (1983), Global minimization of the difference of two convex functions, Select Topics in Operations Research and Mathematical Economics, Lecture Notes Econ. Math. Syst. 226: 98-118.