Abstract
We present a method which when applied to certain non-convex QP will locatethe globalminimum, all isolated local minima and some of the non-isolated localminima. The method proceeds by formulating a (multi) parametric convex QP interms ofthe data of the given non-convex QP. Based on the solution of the parametricQP,an unconstrained minimization problem is formulated. This problem ispiece-wisequadratic. A key result is that the isolated local minimizers (including theglobalminimizer) of the original non-convex problem are in one-to-one correspondencewiththose of the derived unconstrained problem.
The theory is illustrated with several numerical examples. A numericalprocedure isdeveloped for a special class of non-convex QP's. It is applied to a problemfrom theliterature and verifies a known global optimum and in addition, locates apreviously unknown local minimum.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
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.
Best, M. J., and Ritter, K. (1985), Linear Programming: Active Set Analysis and Computer Programs, Prentice-Hall Inc., Englewood Cliffs New Jersey.
Best, M. J., and Ritter, K. (to appear), Quadratic Programming: Active Set Analysis and Computer Programs, Prentice-Hall, Englewood Cliffs, New Jersey.
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.
Best, M. J., and Ding, B. (1996-in preparation), A decomposition method for non-convex quadratic programs.
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.
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.
Kough, F. (1979), The indefinite quadratic programming problem, Operations Research 27, 516–533.
Murty, K. G. and Kabadi, S. N. (1987), Some NP-complete problems in quadratic and nonlinear programming, Mathematical Programming 39, 117–129.
Pardalos, P. M. (1990), Polynomial time algorithms for some classes of constrained nonconvex quadratic problems, Optimization 21, 843–853.
Pardalos, P.M., Glick, J. H., and Rosen, J. B. (1987), Global minimization of indefinite quadratic problems, Computing 39, 281–291.
Pardalos, P. M. and Schnitger, G. (1988), Checking local optimality in constrained quadratic programming is NP-hard, Operations Research Letters 7, 33–35.
Pardalos, P.M., and Vavasis, S. A. (1991), Quadratic programming with one negative eigenvalue is NP-hard, Journal of Global Optimization 1, 15–22.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Best, M.J., Ding, B. Global and Local Quadratic Minimization. Journal of Global Optimization 10, 77–90 (1997). https://doi.org/10.1023/A:1008278114178
Issue Date:
DOI: https://doi.org/10.1023/A:1008278114178