This is a preview of subscription content, log in via an institution to check access.
References
R.L. Armacost and A.V. Fiacco, “Computational experience in sensitivity analysis for nonlinear programming”,Mathematical Programming 6 (1974) 301–326.
R.L. Armacost and A.V. Fiacco, “Second-order parametric sensitivity analysis in NLP and estimates by penalty function methods”, Tech. Paper Serial T-324, The Institute for Management Science and Engineering, The George Washington University, Washington, DC (1975).
D.P. Bertsekas, “Multiplier methods: a survey”,Automatica 12 (1976) 133–145.
J.D. Buys, “Dual algorithms for constrained optimization problems”,Ph.D. thesis, University of Leiden (1972).
A.V. Fiacco, “Sensitivity analysis for nonlinear programming using penalty methods”,Mathematical Programming 10 (1976) 287–311.
A.V. Fiacco and G.P. McCormick,Nonlinear programming: Sequential unconstrained minimization techniques (Wiley, New York, 1968).
R. Fletcher, “An ideal penalty function for constrained optimization”,Journal of the Institute of Mathematics and its Applications 15 (1975) 319–342.
R.T. Rockafellar, “A dual approach to solving nonlinear programming problems by unconstrained optimization”,Mathematical Programming 5 (1973) 354–373.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Buys, J.D., Gonin, R. The use of augmented lagrangian functions for sensitivity analysis in nonlinear programming. Mathematical Programming 12, 281–284 (1977). https://doi.org/10.1007/BF01593794
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01593794