Abstract
Penalty and barrier methods are procedures for approximating constrained optimization problems by unconstrained problems. The approximation is accomplished in the case of penalty methods by adding to the objective function a term that prescribes a high cost for violation of the constraints, and in the case of barrier methods by adding a term that favors points interior to the feasible region over those near the boundary. Associated with these methods is a parameter c or μ that determines the severity of the penalty or barrier and consequently the degree to which the unconstrained problem approximates the original constrained problem. For a problem with n variables and m constraints, penalty and barrier methods work directly in the n-dimensional space of variables, as compared to primal methods that work in (n − m)-dimensional space.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Bibliography
T. Butler, A.V. Martin, On a method of courant for minimizing functionals. J. Math. Phys. 41, 291–299 (1962)
C.W. Carroll, The created response surface technique for optimizing nonlinear restrained systems. Oper. Res. 9(12), 169–184 (1961)
R. Courant, Calculus of variations and supplementary notes and exercises (mimeographed notes), supplementary notes by M. Kruskal and H. Rubin, revised and amended by J. Moser, New York University (1962)
A.V. Fiacco, G.P. McCormick, Nonlinear Programming: Sequential Uncon-strained Minimization Techniques (Wiley, New York, 1968)
K.R. Frisch, The logarithmic potential method for convex programming. Unpublished Manuscript, Institute of Economics, University of Oslo, Oslo (1955)
D. den Hertog, Interior point approach to linear, quadratic and convex programming, algorithms and complexity, Ph.D. thesis, Faculty of Mathematics and Informatics, TU Delft, BL Delft, 1992
F. Jarre, Interior-point methods for convex programming. Appl. Math. Optim. 26, 287–311 (1992)
C. Lemarechal, R. Mifflin, Nonsmooth optimization, in IIASA Proceedings III (Pergamon Press, Oxford, 1978)
E.S. Levitin, B.T. Polyak, Constrained minimization methods. Zh. vychisl. Math. Math. Fiz 6(5), 787–823 (1966)
F.A. Lootsma, Boundary properties of penalty functions for constrained minimization, Doctoral dissertation, Technical University, Eindhoven, May 1970
D.G. Luenberger, Optimization by Vector Space Methods (Wiley, New York, 1969)
D.G. Luenberger, A combined penalty function and gradient projection method for nonlinear programming, Internal Memo, Department of Engineering-Economic Systems, Stanford University (June 1970)
D.G. Luenberger, Control problems with kinks. IEEE Trans. Autom. Control AC-15(5), 570–575 (1970)
D.G. Luenberger, Convergence rate of a penalty-function scheme. J. Optim. Theory Appl. 7(1), 39–51 (1971)
D.D. Morrison, Optimization by least squares. SIAM J. Numer. Anal. 5, 83–88 (1968)
Y. Nesterov, A. Nemirovskii, Interior Point Polynomial Methods in Convex Programming: Theory and Algorithms (SIAM Publications, Philadelphia, 1994)
W.I. Zangwill, Nonlinear programming via penalty functions. Manag. Sci. 13(5), 344–358 (1967)
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Luenberger, D.G., Ye, Y. (2016). Penalty and Barrier Methods. In: Linear and Nonlinear Programming. International Series in Operations Research & Management Science, vol 228. Springer, Cham. https://doi.org/10.1007/978-3-319-18842-3_13
Download citation
DOI: https://doi.org/10.1007/978-3-319-18842-3_13
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-18841-6
Online ISBN: 978-3-319-18842-3
eBook Packages: Business and ManagementBusiness and Management (R0)