Abstract
It is shown that the existence of a strict local minimum satisfying the constraint qualification of [16] or McCormick's [12] second order sufficient optimality condition implies the existence of a class of exact local penalty functions (that is ones with a finite value of the penalty parameter) for a nonlinear programming problem. A lower bound to the penalty parameter is given by a norm of the optimal Lagrange multipliers which is dual to the norm used in the penalty function.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
D.P. Bertsekas, “Necessary and sufficient conditions for a penalty method to be exact”,Mathematical Programming 9 (1975) 87–99.
C. Charalambous, “A lower bound for the controlling parameters of the exact penalty functions”,Mathematical Programming 15 (1978) 278–290.
S. Dolecki and S. Rolewicz, “Exact penalty for local minima”,SIAM Journal on Control and Optimization 17 (1979).
J.P. Evans, F.J. Gould and J.W. Tolle, “Exact penalty functions in nonlinear programming”,Mathematical Programming 4 (1973) 72–97.
A.V. Fiacco and G.P. McCormick,Nonlinear programming: sequential unconstrained minimization techniques (Wiley, New York, 1968).
U.M. Garcia Palomeres and O.L. Mangasarian, “Superlinearly convergent quasi-Newton algorithms for nonlinearly constrained optimization problems”,Mathematical Programming 11 (1976) 1–13.
S.-P. Han, “Superlinearly convergent variable metric algorithms for general nonlinear programming problems”,Mathematical Programming 11 (1976) 263–282.
S.-P. Han, “A global convergent method for nonlinear programming”,Journal of Optimization Theory and Applications 22 (1977) 297–309.
A.S. Householder,The theory of matrices in numerical analyais (Blaisdell, New York, 1964).
S.P. Howe, “New conditions for exactness of a simple penalty function”,SIAM Journal on Control 11 (1973) 378–381.
W. Karush, “Minima of functions of several variables with inequalities as side conditions”, Master of Science Dissertation, Department of Mathematics, University of Chicago (Chicago, December 1939).
G.P. McCormick, “Second order conditions for constrained minima”,SIAM Journal on Applied Mathematics 15 (1967) 641–652.
O.L. Mangasarian,Nonlinear programming (McGraw-Hill, New York, 1969).
O.L. Mangasarian, “Nonlinear programming theory and computation”, in: J.J. Modor and S.E. Elmaghraby, eds.,Handbook of Operations Research (Van Nostrand Reinhold, New York, 1978), pp. 245–265.
O.L. Mangasarian, “Uniqueness of solution in linear programming”,Linear Algebra and its Applications 25 (1979) 151–162.
O.L. Mangasarian and S. Fromovitz, “The Fritz John necessary optimality conditions in the presence of equality constraints”,Journal of Mathematical Analysis and Applications 17 (1967) 34–47.
T. Pietrzykowski, “An exact potential method for constrained maxima”,SIAM Journal on Numerical Analysis 6 (1969) 299–304.
T. Pietrzykowski, “The potential method for conditioeenal maxima in the locally compact metric spaces”,Numerische Mathematik 14 (1970) 325–329.
M.J.D. Powell, “The convergence of variable metric methods for nonlinearly constrained optimization calculations” in: O.L. Mangasarian, R.R. Meyer and S.M. Robinson, eds.,Nonlinear programming 3 (Academic Press, New York, 1978) pp. 27–64.
S.M. Robinson, “Stability theory for systems of inequalities, part II: Differentiable nonlinear systems”,SIAM Journal on Numerical Analysis 13 (1976) 497–513.
R.T. Rockafellar,Convex analysis (Princeton University Press, Princeton, N.J. 1970).
K. Truemper, “Note on finite convergence of exterior penalty functions”,Management Science 21 (1975) 600–606.
W.I. Zangwill, “Nonlinear programming via penalty functions”,Management Science 13 (1967) 344–358.
Author information
Authors and Affiliations
Additional information
Sponsored by the United States Army under Contract No. DAAG29-75-C-0024 and by the National Science Foundation under Grant No. MCS74-20584 A02.
Rights and permissions
About this article
Cite this article
Han, S.P., Mangasarian, O.L. Exact penalty functions in nonlinear programming. Mathematical Programming 17, 251–269 (1979). https://doi.org/10.1007/BF01588250
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01588250