Sensitivity analysis for nonlinear programming using penalty methods

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”.

[1]  S. Bochner,et al.  Several complex variables , 1949 .

[2]  M. Hestenes Calculus of variations and optimal control theory , 1968 .

[3]  G. Zoutendijk Nonlinear Programming: A Numerical Survey , 1966 .

[4]  G. Dantzig,et al.  On the continuity of the minimum set of a continuous function , 1967 .

[5]  Anthony V. Fiacco,et al.  Nonlinear programming;: Sequential unconstrained minimization techniques , 1968 .

[6]  W. A. Thornton,et al.  Structural synthesis of an ablating thermostructural panel. , 1968 .

[7]  G. McCormick,et al.  Selected applications of nonlinear programming , 1968 .

[8]  R. Meyer The Validity of a Family of Optimization Methods , 1970 .

[9]  Floyd J. Gould,et al.  Stability in Nonlinear Programming , 1970, Oper. Res..

[10]  C. D. Mote,et al.  Optimization methods for engineering design , 1971 .

[11]  F. A. Lootsma,et al.  Numerical methods for non-linear optimization , 1974 .

[12]  Harvey J. Greenberg,et al.  Extensions of the Evans-Gould Stability Theorems for Mathematical Programs , 1972, Oper. Res..

[13]  Stephen M. Robinson,et al.  Perturbed Kuhn-Tucker points and rates of convergence for a class of nonlinear-programming algorithms , 1974, Math. Program..

[14]  Anthony V. Fiacco,et al.  Computational experience in sensitivity analysis for nonlinear programming , 1974, Math. Program..

[15]  James H. Bigelow,et al.  Implicit function theorems for mathematical programming and for systems of inequalities , 1974, Math. Program..

[16]  A. Fiacco Convergence properties of local solutions of sequences of mathematical programming problems in general spaces , 1974 .