Abstract
In an earlier study [4], we have established that for the local optimal solution point of a nonlinear programming problem to be stable with respect to small perturbations only the linear independence and a strong second order condition are needed. The strict complementarity condition is not. The optimal solution of the perturbed problem is a unique continuous function of the perturbation parameter. In this study, we extend the results in [4] by investigating, without strict complementarity, differentiability properties of the optimal solution point with respect to the perturbation parameter. It is possible to show that, even though the optimal solution point may not be differentiable with respect to the perturbation parameter, its directional derivative with respect to any directional perturbation always exists and is the unique solution of a system of equations and inequalities. A possible method for computing the directional derivative is also suggested.
Preview
Unable to display preview. Download preview PDF.
References
J.H. Bigelow and N.E. Shapiro, “Implicit function theorems for mathematical programming and for systems of inequalities”, Mathematical Programming 6 (1974) 141–156.
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).
K. Jittorntrum, “Sequential algorithms in nonlinear programming”, Dissertation, The Australian National University, Canberra (1978).
K. Jittorntrum, “Accelerated convergence for the Powell/Hestenes multiplier method”, Mathematical Programming 18 (1980) 197–214.
K. Jittorntrum and M.R. Osborne, “Trajectory analysis and extrapolation in barrier function methods”, Journal of the Australian Mathematical Society (series B) 20 (1978) 352–369.
K. Jittorntrum and M.R. Osborne, “A modified barrier function method with improved rate of convergence for degenerate problems”, Journal of the Australian Mathematical Society (series B) 21 (1980) 305–329.
D.G. Luenberger, Introduction to linear and nonlinear programming (Addison-Wesley, Reading, MA, 1973).
J.M. Ortega and W.C. Rheinbodt, Iterative solution of nonlinear equations in several variables (Academic Press, New York, 1970).
S.M. Robinson, “Strongly regular generalized equations”, Mathematics of Operations Research 5 (1980) 43–62.
R.W.H. Sargent, “On the parametic variation of constraint sets and solutions of minimization problems”, Written version of the talk presented at the 10th International Symposium on Mathematical Programming, Montreal, August, 1979.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1984 The Mathematical Programming Society, Inc.
About this chapter
Cite this chapter
Jittorntrum, K. (1984). Solution point differentiability without strict complementarity in nonlinear programming. In: Fiacco, A.V. (eds) Sensitivity, Stability and Parametric Analysis. Mathematical Programming Studies, vol 21. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0121215
Download citation
DOI: https://doi.org/10.1007/BFb0121215
Received:
Revised:
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-00912-9
Online ISBN: 978-3-642-00913-6
eBook Packages: Springer Book Archive