Abstract
We characterize the property of obtaining a solution to a convex program by minimizing over the feasible region a linearization of the objective function at any of its solution points (Minimum Principle Sufficiency). For the case of a monotone linear complementarity problem this MPS property is completely equivalent to the existence of a nondegenerate solution to the problem. For the case of a convex quadratic program, the MPS property is equivalent to the span of the Hessian of the objective function being contained in the normal cone to the feasible region at any solution point, plus the cone generated by the gradient of the objective function at any solution point. This in turn is equivalent to the quadratic program having a weak sharp minimum. An important application of the MPS property is that minimizing on the feasible region a linearization of the objective function at a point in a neighborhood of a solution point gives an exact solution of the convex program. This leads to finite termination of convergent algorithms that periodically minimize such a linearization.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
F.A. Al-Khayyal and J. Kyparisis, “Finite convergence of algorithms for nonlinear programs and variational inequalities,” to appear in:Journal of Optimization Theory and Applications.
D.P. Bertsekas, “Necessary and sufficient conditions for a penalty method to be exact,”Mathematical Programming 9 (1975) 8–99.
J.V. Burke and M.C. Ferris, “The sharpness of functions on sets,” in preparation (1991).
P.H. Calamai and J.J. Moré, “Projected gradient methods for linearly constrained problems,”Mathematical Programming 39 (1987) 93–116.
J.C. Dunn, “On the convergence of projected gradient processes to singular critical points,”Journal of Optimization Theory and Applications 55 (1987) 203–216.
M.C. Ferris, “Finite termination of the proximal point algorithm,”Mathematical Programming 50 (1991) 359–366.
M.C. Ferris, “Weak sharp minima and penalty functions in mathematical programming,” Technical Report 779, Computer Sciences Department, University of Wisconsin (Madison, WI, 1988).
A.J. Goldman and A.W. Tucker, “Theory of linear programming,” in: H.W. Kuhn, and A.W. Tucker, eds.,Linear Inequalities and Related Systems (Princeton University Press, Princeton, NJ. 1956) pp. 53–97.
O.L. Mangasarian,Nonlinear Programming (McGraw-Hill, New York, 1969).
O.L. Mangasarian, “Locally unique solutions of quadratic programs, linear and nonlinear complementarity problems,”Mathematical Programming 19 (1980) 200–212.
O.L. Mangasarian, “Optimal simplex tableau characterization of unique and bounded solutions of linear programs,”Journal of Optimization Theory and Applications 35 (1981) 123–128.
O.L. Mangasarian, “A stable theorem of the alternative: an extension of the Gordan theorem,”Linear Algebra and its Applications 41 (1981) 209–223.
O.L. Mangasarian, “Error bounds for nondegenerate monotone linear complementarity problems,”Mathematical Programming (Series B) 48 (1990) 437–445.
O.L. Mangasarian, “A simple characterization of solution sets of convex programs,”Operations Research Letters 7(1) (1988) 21–26.
O.L. Mangasarian and R.R. Meyer, “Nonlinear perturbation of linear programs,”SIAM Journal on Control and Optimization 17(6) (1979) 745–752.
R.R. Meyer, “Continuity properties of linear programs,” Technical Report 373, Computer Sciences Department, University of Wisconsin (Madison, WI, 1979).
B.T. Polyak,Introduction to Optimization (Optimization Software, Inc., Publications Division, New York, 1987).
B.T. Polyak and N.V. Tretiyakov, “Concerning an iterative method for linear programming and its economic interpretation,”Economics and Mathematical Methods 8(5) (1972) 740–751. [English translation:Matekon 10(3) (1974) 81–100.]
S. M. Robinson, “Local structure of feasible sets in nonlinear programming, Part II: Nondegeneracy,”Mathematical Programming Study 22 (1984) 217–230.
T.-H. Shiau, “Iterative linear programming for linear complementarity and related problems,” Technical Report 507, Computer Sciences Department, University of Wisconsin (Madison, WI, 1983).
Author information
Authors and Affiliations
Additional information
This material is based on research supported by National Science Foundation Grants DCR-8521228 and CCR-8723091, and Air Force Office of Scientific Research Grants AFOSR 86-0172 and AFOSR and AFOSR 89-0410.
Rights and permissions
About this article
Cite this article
Ferris, M.C., Mangasarian, O.L. Minimum principle sufficiency. Mathematical Programming 57, 1–14 (1992). https://doi.org/10.1007/BF01581071
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01581071