Abstract
A new programming algorithm for nonlinear constrained optimization problems is proposed. The method is based on the penalty function approach and thereby circumyents the necessity to maintain feasibility at each iteration, but it also behaves much like the gradient projection method. Although only first-order information is used, the algorithm converges asymptotically at a rate which is independent of the magnitude of the penalty term; hence, unlike the simple gradient method, the asymptotic rate of the proposed method is not affected by the ill-conditioning associated with the introduction of the penalty term. It is shown that the asymptotic rate of convergence of the proposed method is identical with that of the gradient projection method.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Rosen, J. B.,The Gradient Projection Method for Nonlinear Programming: Part II, Nonlinear Constraints, SIAM Journal on Applied Mathematics, Vol. 9, pp. 514–532, 1961.
Fiacco, A. V., andMcCormick, G. P.,Nonlinear Programming: Sequential Unconstrained Minimization Techniques, John Wiley and Sons, New York, New York, 1968.
Abadie, J., andCarpentier, J.,Generalization of the Wolfe Reduced Gradient Method to the Case of Nonlinear Constraints, Optimization, Edited by R. Fletcher, Academic Press, New York, New York, 1969.
Zangwill, W. I.,Nonlinear Programming via Penalty Functions, Management Science, Vol. 13, pp. 344–358, 1967.
Luenberger, D. G.,Optimization by Vector Space Methods, John Wiley and Sons, New York, New York, 1969.
Luenberger, D. G.,Convergence Rate of a Penalty Function Scheme, Journal of Optimization Theory and Applications, Vol. 7, pp. 39–51, 1971.
Antosiewicz, H. A., andRheinboldt, W. C.,Numerical Analysis and Functional Analysis, Survey of Numerical Analysis, Chapter 14, Edited by J. Todd, McGraw-Hill Book Company, New York, New York, 1962.
Luenberger, D. G.,The Gradient Projection Method Along Geodesics, Management Science, Vol. 18, pp. 620–631, 1972.
Wolfe, P.,On the Convergence of Gradient Methods under Constraint, IBM, Watson Research Center, Yorktown Heights, New York, Report No. Rz-204, 1966.
Zangwill, W. I.,Nonlinear Programming: A Unified Approach, Prentice Hall, Englewood Cliffs, New Jersey, 1969.
Author information
Authors and Affiliations
Additional information
Communicated by Y. C. Ho
Dedicated to Professor M. R. Hestenes
This research was supported by the National Science Foundation, Grant No. GK-16125.
Rights and permissions
About this article
Cite this article
Luenberger, D.G. A combined penalty function and gradient projection method for nonlinear programming. J Optim Theory Appl 14, 477–495 (1974). https://doi.org/10.1007/BF00932843
Issue Date:
DOI: https://doi.org/10.1007/BF00932843