An investigation of using an RQP based method to calculate parameter sensitivity derivatives

Estimation of the sensitivity of problem functions with respect to problem variables forms the basis for many of our modern day algorithms for engineering optimization. The most common application of problem sensitivities has been in the calculation of objective function and constraint partial derivatives for determining search directions and optimality conditions. A second form of sensitivity analysis, parameter sensitivity, has also become an important topic in recent years. By parameter sensitivity, researchers refer to the estimation of changes in the modeling functions and current design point due to small changes in the fixed parameters of the formulation. Methods for calculating these derivatives have been proposed by several authors (Armacost and Fiacco 1974, Sobieski et al 1981, Schmit and Chang 1984, and Vanderplaats and Yoshida 1985). Two drawbacks to estimating parameter sensitivities by current methods have been: (1) the need for second order information about the Lagrangian at the current point, and (2) the estimates assume no change in the active set of constraints. The first of these two problems is addressed here and a new algorithm is proposed that does not require explicit calculation of second order information.

[1]  S. M. Sliwa,et al.  Experiences performing conceptual design optimization of transport aircraft , 1984 .

[2]  K. M. Riley,et al.  Sensitivity of Optimum Solutions of Problem Parameters , 1982 .

[3]  Lucien A. Schmit,et al.  Optimum design sensitivity based on approximation concepts and dual methods , 1982 .

[4]  J. Cullum,et al.  Some remarks on the symmetric rank-one update , 1979 .

[5]  G. A. Gabriele,et al.  AN INVESTIGATION OF NEW METHODS FOR ESTIMATING PARAMETER SENSITIVITIES , 1989 .

[6]  J. Sobieszczanski-Sobieski,et al.  Optimum sensitivity derivatives of objective functions in nonlinear programming , 1983 .

[7]  R. W. Mayne,et al.  Optimization With Discrete Variables Via Recursive Quadratic Programming: Part 2—Algorithm and Results , 1989 .

[8]  John E. Dennis,et al.  Numerical methods for unconstrained optimization and nonlinear equations , 1983, Prentice Hall series in computational mathematics.

[9]  G. Vanderplaats.  An efficient feasible directions algorithm for design synthesis , 1984 .

[10]  T. Gal,et al.  Linear parametric programming—A brief survey , 1984 .

[11]  李幼升,et al.  Ph , 1989 .

[12]  Nesa L'abbe Wu,et al.  Linear programming and extensions , 1981 .

[13]  K. Jittorntrum.  Solution point differentiability without strict complementarity in nonlinear programming , 1984 .

[14]  Jaroslaw Sobieszczanski-Sobieski,et al.  Structural sizing by generalized, multilevel optimization , 1987 .

[15]  Eric Sandgren.  THE UTILITY OF NONLINEAR PROGRAMMING ALGORITHMS. , 1977 .

[16]  Jessica Engel,et al.  Problem , 1902 .

[17]  R. T. Haftka,et al.  Selecting step sizes in sensitivity analysis by finite differences , 1985 .

[18]  J. Buys,et al.  The use of augmented lagrangian functions for sensitivity analysis in nonlinear programming , 1977, Math. Program..

[19]  P. Gill,et al.  Computing Forward-Difference Intervals for Numerical Optimization , 1983 .

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

[21]  G. N. Vanderplaats,et al.  Alternative methods for calculating sensitivity of optimized designs to problem parameters , 1987 .

[22]  Michael A. Saunders,et al.  Considerations of numerical analysis in a sequential quadratic programming method , 1986 .

[23]  G. A. Gabriele,et al.  An Investigation of Pshenichnyi’s Recursive Quadratic Programming Method for Engineering Optimization , 1987 .

[24]  G. Vanderplaats,et al.  Efficient calculation of optimum design sensitivity , 1984 .