Abstract
A nonlinear programming problem with inequality constraints and with unknown vectorx is converted to an unconstrained minimization problem in unknownsx and λ, where λ is a vector of Lagrange multipliers. It is shown that, if the original problem possesses standard convexity properties, then local minima of the associated unconstrained problem are in fact global minima of that problem and, consequently, Kuhn-Tucker points for the original problem. A computational procedure based on the conjugate residual scheme is applied in thexλ-space to solve the associated unconstrained problem. The resulting algorithm requires only first-order derivative information on the functions involved and will solve a quadratic programming problem in a finite number of steps.
Similar content being viewed by others
References
Arrow, K. J., andHurwicz, L.,Gradient Method for Concave Programming. I. Local Results, Studies in Linear and Non-Linear Programming, Edited by K. J. Arrow, L. Hurwicz, and H. Uzawa, Stanford Press, Stanford, California, 1958.
Luenberger, D. G.,The Conjugate Residual Method for Minimization, SIAM Journal on Numerical Analysis, Vol. 7, No. 3, 1970.
Fletcher, R., andReeves, C. M.,Function Minimization by Conjugate Gradients, Computer Journal, Vol. 7, No. 2, 1964.
Author information
Authors and Affiliations
Additional information
Communicated by A. V. Balakrishnan
This research was supported by the National Science Foundation under Grant No. GK-16125. The author is indebted to the referee for several valuable comments and suggestions for improvement.
Rights and permissions
About this article
Cite this article
Luenberger, D.G. An approach to nonlinear programming. J Optim Theory Appl 11, 219–227 (1973). https://doi.org/10.1007/BF00935189
Issue Date:
DOI: https://doi.org/10.1007/BF00935189