Abstract
In this paper we motivate and describe an algorithm to solve the nonlinear programming problem. The method is based on an exact penalty function and possesses both global and superlinear convergence properties. We establish the global qualities here (the superlinear nature is proven in [7]). The numerical implementation techniques are briefly discussed and preliminary numerical results are given.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
J. Asaadi, “A computational comparison of some nonlinear programs”,Mathematical Programming 4 (1973) 144–154.
R.H. Bartels, A.R. Conn and J.W. Sinclair, “Minimization techniques for piecewise differentiable functions: Thel 1 solution to an overdetermined linear system”,SIAM Journal on Numerical Analysis 15 (1978) 224–241.
R.M. Chamberlain, “Some examples of cycling in variable metric methods for constrained optimization”,Mathematical Programming 16 (1979) 378–383.
C. Charalambous, “A lower bound for the controlling parameter of the exact penalty function”,Mathematical Programming 15 (1978) 278–290.
C. Charalambous, “On the conditions for optimality for the nonlinearl 1 problem”,Mathematical Programming 17 (1979) 123–135.
T.F. Coleman and A.R. Conn, “Second-order conditions for an exact penalty function”,Mathematical Programming 19 (1980) 178–185.
T.F. Coleman and A.R. Conn, “Nonlinear programming via an exact penalty function: Asymptotic analysis”,Mathematical Programming 24 (1982) 123–136. [This issue.].
A.R. Colville, “A comparative study of non-linear programming codes”, IBM New York Scientific Center Report 320-2949 (1968).
A.R. Conn and T. Pietrzykowski, “A penalty function method converging directly to a constrained optimum”,SIAM Journal on Numerical Analysis 14 (1977) 348–375.
P. Gill and W. Murray,Numerical methods for constrained optimization (Academic Press, London, 1974).
W. Murray and M. Wright, “Projected Lagrangian methods based on the trajectories of penalty and barrier functions”, Technical Report SOL 78-23 Department of Operations Research, Stanford University (Stanford, CA, 1978).
W. Murray and M. Overton, “Steplength algorithms for minimizing a class of non-differentiable functions”,Computing 23 (1979) 309–331.
M.J.D. Powell, “A method for non-linear constraints in minimization problems” in: R. Fletcher, ed.,Optimization (Academic Press, London, 1969).
J.B. Rosen and S. Suzuki, “Construction of non-linear programming test problems”,Communications of the ACM 8 (1965) 113.
W. Zangwill, “Nonlinear programming via penalty functions”,Management Science 13 (1967) 344–350.
Author information
Authors and Affiliations
Additional information
This work is supported in part by NSERC Grant No. A8639 and the U.S. Dept. of Energy.
Rights and permissions
About this article
Cite this article
Coleman, T.F., Conn, A.R. Nonlinear programming via an exact penalty function: Global analysis. Mathematical Programming 24, 137–161 (1982). https://doi.org/10.1007/BF01585101
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01585101