Second-order sensitivity analysis in factorable programming: Theory and applications

Second-order sensitivity analysis methods are developed for analyzing the behavior of a local solution to a constrained nonlinear optimization problem when the problem functions are perturbed slightly. Specifically, formulas involving third-order tensors are given to compute second derivatives of components of the local solution with respect to the problem parameters. When in addition, the problem functions are factorable, it is shown that the resulting tensors are polyadic in nature.

[1]  Alexander Graham,et al.  Kronecker Products and Matrix Calculus: With Applications , 1981 .

[2]  Garth P McCormick Global solutions to factorable nonlinear optimization problems using separable programming techniques , 1985 .

[3]  G. Bliss Lectures on the calculus of variations , 1946 .

[4]  R. Dembo Sensitivity analysis in geometric programming , 1982 .

[5]  G. McCormick Second Order Conditions for Constrained Minima , 1967 .

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

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

[8]  Anthony V. Fiacco,et al.  Sensitivity analysis for nonlinear programming using penalty methods , 1976, Math. Program..

[9]  A. Linnemann,et al.  Higher-order necessary conditions for infinite and semi-infinite optimization , 1982 .

[10]  G. McCormick Nonlinear Programming: Theory, Algorithms and Applications , 1983 .

[11]  G. McCormick,et al.  The polyadic structure of factorable function tensors with applications to high-order minimization techniques , 1986 .

[12]  James J. Filliben,et al.  DATAPLOT—an interactive high-level language for graphics, non-linear fitting, data analysis, and mathematics , 1981, SIGGRAPH '81.

[13]  J. E. Falk,et al.  An Algorithm for Separable Nonconvex Programming Problems , 1969 .

[14]  L. Pennisi An Indirect Sufficiency Proof for the Problem of Lagrange with Differential Inequalities as Added Side Conditions , 1953 .

[15]  A. Fiacco,et al.  Nonlinear Programming Sensitivity Analysis Results Using Strong Second Order Assumptions. , 1978 .

[16]  A. D. Young Mathematics for Operations Research , 1978 .

[17]  Garth P. McCormick,et al.  Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems , 1976, Math. Program..