Abstract
In this paper some new theoretic results on piecewise differentiable exact penalty functions are presented. Sufficient conditions are given for the existence of exact penalty functions for inequality constrained problems more general than concave and several classes of such functions are presented.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
M. Bellmore, H.J. Greenberg and J.J. Jarvis, “Generalized penalty-function concepts in mathematical optimization,”Operations Research 18 (1970) 2.
D.L. Berman, “Minimizing a function without calculating derivatives,”Journal of The Association for Computing Machinery 16 (1969) 2.
R.P. Brent, “Algorithms for finding zeros and extrema of functions without calculating derivatives,” Ph. D. dissertation, Department of Computer Science, Stanford University, Stanford, Calif. (February, 1971) (STAN-CS-71-198).
M. Canon, C. Cullum and E. Polak, “Constrained minimization problems in finite-dimensional spaces,”SIAM Journal of Control 4 (1966) 528–547.
A.R. Conn, “A gradient type method of locating constrained minima,” Ph. D. Thesis, University of Waterloo, Waterloo, Ont. (1971).
J.P. Evans and F.J. Gould, “Stability in nonlinear programming,”Operations Research 18 (1970) 1.
J.P. Evans and F.J. Gould, “Stability and exponential penalty functions techniques in nonlinear programming,” Institute of Statistics Mimeo Series No. 723, University of North Carolina (November, 1970).
J.P. Evans and F.J. Gould, “On using equality constraint algorithms for inequality constrained problems,”Mathematical Programming 2 (1972) 3.
J.E. Falk, “Lagrange multipliers and nonlinear programming,”Journal of Mathematical Analysis and its Applications 19 (1967) 141–159.
A.V. Fiacco and G.P. McCormick,Nonlinear programming: Sequential unconstrained minimization techniques (Wiley, New York, 1968).
R. Fletcher, “A class of methods for nonlinear programming with termination and convergence properties,” in:Integer and Nonlinear Programming, Ed. J. Abadie (North-Holland, Amsterdam, 1970).
R. Fletcher, “An exact penalty function for nonlinear programming with inequalities,” T.P. 478 Atomic Energy Research Establishment, Harwell (February, 1972).
F.J. Gould, “A class of inside-out algorithms for general programs,”Management Science 16 (1970) 5.
F.J. Gould, “Continuously differentiable exact penalty functions for nonlinear programs with tolerances,” Institute of Statistics Mimeo Series No. 744, University of North Carolina (1971).
F.J. Gould, “Nonlinear duality theorems,”Cahiers d'Etude Research Operationelle, to appear.
F.J. Gould and J.W. Tolle, “A necessary and sufficient constraint qualification,”SIAM Journal of Applied Mathematics 20 (1971) 164–171.
J. Greenstadt, “A variable metric method using no derivatives,” IBM, New York Scientific Center, Data Processing Division, Technical Report No. 320-2991 (June, 1970).
F.A. Lootsma, “Boundary properties of penalty functions for constrained minimization,” Philips Research Reports Supplements, Eindhoven (1970).
O. Mangasarian, “Techniques of optimization,” Technical Report No. 124, Computer Sciences Department, The University of Wisconsin (May, 1971).
O.H. Merrill, “Applications and extensions of an algorithm that computes fixed points of certain upper semi-continuous point set mappings,” Ph. D. dissertation, Department of Industrial Engineering, University of Michigan, Ann Arbor, Mich. (1972).
Papaioannou and Kempthorne, “Parallel tangents and steepest descent optimization algorithm — A computer implementation with application to partially linear models,” Aerospace Research Laboratories, ARL 70-0117 (July, 1970).
T. Pietrzykowski, “An exact potential method for constrained maxima,”SIAM Journal of Numerical Analysis 6 (1969) 2.
M.J.D. Powell, “An efficient method for finding the minimum of a function of several variables without calculating derivatives,”The Computer Journal 7 (1964).
M.J.D. Powell, “A method for nonlinear constraints in minimization problems,” in:Optimization, Ed. R. Fletcher (Academic Press, New York, 1969).
M.J.D. Powell, “Recent advances in unconstrained optimization,” T.P. 430, Mathematics Branch, Atomic Energy Research Establishment, Harwell (November, 1970).
M.J.D. Powell, “Unconstrained minimization algorithms without computation of derivatives,” Report HL72/1713, TP483, Theoretic Physics Division, Atomic Energy Research Establishment, Harwell (April, 1972).
R.T. Rockafellar, “New applications of duality in nonlinear programming,” Seventh international symposium on mathematical programming, The Hague (September, 1970).
J.D. Roode, “Generalized Lagrangian functions in mathematical programming,” Thesis, Leiden.
D.A. Sprecher,Elements of real analysis (Academic Press, New York, 1970).
W.I. Zangwill, “Minimizing a function without calculating derivatives,”The Computer Journal 10 (1967) 3.
W.I. Zangwill, “Nonlinear programming via penalty functions,”Management Science 13 (1967) 5.
Author information
Authors and Affiliations
Additional information
This research was partially supported by a grant from the Office of Naval Research; contract number N00014-67-A-0321-0003 (NR047-095).
Rights and permissions
About this article
Cite this article
Evans, J.P., Gould, F.J. & Tolle, J.W. Exact penalty functions in nonlinear programming. Mathematical Programming 4, 72–97 (1973). https://doi.org/10.1007/BF01584647
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01584647