Global and Local Quadratic Minimization

Journal of Global Optimization

Volumn 10, Issue 1, 1997, Pages 77-90

  Best, M J ^a   Ding, B ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Global optimization; Non convex quadratic program; Parametric quadratic programming

Indexed keywords

EID: 0346760603     PISSN: 09255001     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1008278114178     Document Type: Article

References (13)

1. Best, M. J. (1996-to appear), An algorithm for the solution of the parametric quadratic programming problem, in Applied Mathematics and Parallel Computing - Festschrift for Klaus Ritter, Herbert Fischer, Bruno Riedmüller and Stefan Schäffler (Editors), Heidelburg, Physica-Verlag.
2. Best, M. J., and Ritter, K. (1985), Linear Programming: Active Set Analysis and Computer Programs, Prentice-Hall Inc., Englewood Cliffs New Jersey.
3. Best, M. J., and Ritter, K. (to appear), Quadratic Programming: Active Set Analysis and Computer Programs, Prentice-Hall, Englewood Cliffs, New Jersey.
4. Best, M. J., and Ding, B. (1995), On the continuity of the minimum in parametric quadratic programs, Journal of Optimization Theory and Applications 86, 245-250.
5. Best, M. J., and Ding, B. (1996-in preparation), A decomposition method for non-convex quadratic programs.
6. Floudas, C. A., and Pardalos, P. M. (1990), A Collection of Test Problems for Constrained Global Optimization Algorithms, volume 455 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, Germany.
7. Konno, H., Kuno, T. and Yajima, T. (1991), Parametric simplex algorithms for solving a special class of nonconvex minimization problems, Journal of Global Optimization 1, 65-82.
8. Kough, F. (1979), The indefinite quadratic programming problem, Operations Research 27, 516-533.
9. Murty, K. G. and Kabadi, S. N. (1987), Some NP-complete problems in quadratic and nonlinear programming, Mathematical Programming 39, 117-129.
10. Pardalos, P. M. (1990), Polynomial time algorithms for some classes of constrained nonconvex quadratic problems, Optimization 21, 843-853.
11. Pardalos, P. M., Glick, J. H., and Rosen, J. B. (1987), Global minimization of indefinite quadratic problems, Computing 39, 281-291.
12. Pardalos, P. M. and Schnitger, G. (1988), Checking local optimality in constrained quadratic programming is NP-hard, Operations Research Letters 7, 33-35.
13. Pardalos, P. M., and Vavasis, S. A. (1991), Quadratic programming with one negative eigenvalue is NP-hard, Journal of Global Optimization 1, 15-22.