Abstract
This paper considers the global analysis of general quadratic programs in a finite number of steps. A procedure is presented for recursively finding either the global minimum or a halfline of the constraint set along which the minimand is unbounded below.
This is a preview of subscription content, log in via an institution to check access.
References
R. Bellman,Introduction to matrix analysis (McGraw Hill, 1970, 2nd Ed.).
C.A. Burdet, “General quadratic programming”, Management Sciences Research Rept. No. 272, GSIA, Carnegie-Mellon University (November, 1971).
R.W. Cottle, “Fundamentals of quadratic programming and linear complementarity”, Systems Optimization Laboratory, Department of Operations Research, Stanford University, Tech. Rept. SOL 77-21 (August, 1977).
B.C. Eaves, “On quadratic programming”,Management Science 17 (1971) 698–711.
B.C. Eaves, “A finite procedure for determining if a quadratic form is bounded below on a closed polyhedral convex set”,Mathematical Programming, to appear.
M. Frank and P. Wolfe, “An algorithm for quadratic programming”,Naval Research Logistics Quarterly 3 (1956) 95–110.
A.F. Perold, “A generalization of the Frank—Wolfe theorem”, Department of Operations Research, Stanford University, Tech. Rept. 77-18 (July, 1977).
J. Stoer and C. Witzgall,Convexity and optimization in finite dimensions I (Springer, New York, 1970).
Author information
Authors and Affiliations
Additional information
Research was partially supported by the U.S. Energy Research and Development Administration Contract EY-76-S-03-0326 PA #18; the Office of Naval Research Contracts N00014-75-C-0267 and N00014-75-C-0865; and the National Science Foundation Grants MCS76-20019 and MCS76-81259.
Rights and permissions
About this article
Cite this article
Perold, A.F. An alternative method for a global analysis of quadratic programs in a finite number of steps. Mathematical Programming 15, 105–109 (1978). https://doi.org/10.1007/BF01609005
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01609005