Abstract
In this paper we establish a theoretical basis for utilizing a penalty-function method to estimate sensitivity information (i.e., the partial derivatives) of a localsolution and its associated Lagrange multipliers of a large class of nonlinear programming problems with respect to a general parametric variation in the problem functions. The local solution is assumed to satisfy the second order sufficient conditions for a strict minimum. Although theoretically valid for higher order derivatives, the analysis concentrates on the estimation of the first order (first partial derivative) sensitivity information, which can be explicitly expressed in terms of the problem functions. For greater clarity, the results are given in terms of the mixed logarithmic-barrier quadratic-loss function. However, the approach is clearly applicable toany algorithm that generates a once differentiable “solution trajectory”.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
R.L. Armacost and A.V. Fiacco, “Computational experience in sensitivity analysis for nonlinear programming”,Mathematical Programming 6 (3) (1974) 301–326.
C. Berge,Topological spaces (The Macmillan Co., New York, 1963).
J.H. Bigelow and N.Z. Shapiro, “Implicit function theorems for mathematical programming and for systems of inequalities”,Mathematical Programming 6 (2) (1974) 141–156.
S. Bochner and W.T. Martin,Several complex variables (Princeton University Press, Princeton, N.J., 1948).
J. Bracken and G.P. McCormick,Selected applications of nonlinear programming (Wiley, New York, 1968).
J.D. Buys, “Dual algorithms for constrained optimization problems”, Ph.D. Thesis, University of Leyden, the Netherlands (1972).
B. Causey, “A method for sensitivity of a solution of a nonlinear program”, RAC manuscript (1971), unpublished.
G.B. Dantzig, J. Folkman and N. Shapiro, “On the continuity of the minimum set of a continuous function”,Journal of Mathematical Analysis and its Applications 17 (1967) 519–548.
J.P. Evans and F.J. Gould, “Stability in nonlinear programming”,Operations Research 18 (1) (1970).
A.V. Fiacco, “Convergence properties of local solutions of sequences of mathematical programming problems in general spaces”,Journal of Optimization Theory and its Applications 13 (1) (1974).
A.V. Fiacco and G.P. McCormick,Nonlinear programming: Sequential unconstrained minimization techniques (Wiley, New York, 1968).
R.L. Fox,Optimization methods for engineering design (Addison-Wesley, Reading, Mass., 1971).
H.J. Greenberg and W.P. Pierskalla, “Extensions of the Evans—Gould stability theorems for mathematical programs”,Operations Research 20 (1) (1972).
M.R. Hestenes,Calculus of variations and optimal control theory (Wiley, New York, 1966).
F.A. Lootsma (ed.),Numerical methods for non-linear optimization (Academic Press, London, 1972).
R. Meyer, “The validity of a family of optimization methods”,SIAM Journal on Control 3 (1) (1970).
W.C. Mylander, “Estimating the sensitivity of a solution of a nonlinear program”, RAC manuscript (1971), unplublished.
W.C. Mylander and R.L. Armacost, “A guide to a SUMT-Version 4 computer subroutine for implementing sensitivity analysis in nonlinear programming”, The George Washington University, Technical Paper Serial 287, Program in Logistics (1973).
S.M. Robinson, “Perturbed Kuhn—Tucker points and rates of convergence for a class of nonlinear-programming algorithms”,Mathematical Programming 7 (1) (1974).
L.A. Schmit, “A basis for assessing the state-of-the-art”, AGARDograph No. 149, NATO Advisory Group for Aerospace R&D, Neuilly-sur-Seine, France (1971).
W.A. Thornton and L.A. Schmit, “Structural synthesis of an ablating thermostructural panel”, Preprint No. 68-332, AIAA/ASME 9th Structures, structural dynamics and materials conference, Palm Springs, Calif. (1968).
G. Zoutendijk, “Non-linear programming: a numerical survey”,SIAM Journal on Control 4 (1) (1966).
Author information
Authors and Affiliations
Additional information
Supported by the U.S. Army Research Office, Durham.
Rights and permissions
About this article
Cite this article
Fiacco, A.V. Sensitivity analysis for nonlinear programming using penalty methods. Mathematical Programming 10, 287–311 (1976). https://doi.org/10.1007/BF01580677
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/BF01580677