Skip to main content

Solution point differentiability without strict complementarity in nonlinear programming

  • Chapter
  • First Online:
Sensitivity, Stability and Parametric Analysis

Part of the book series: Mathematical Programming Studies ((MATHPROGRAMM,volume 21))

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J.H. Bigelow and N.E. Shapiro, “Implicit function theorems for mathematical programming and for systems of inequalities”, Mathematical Programming 6 (1974) 141–156.

    Article  MATH  MathSciNet  Google Scholar 

  2. A.V. Fiacco, “Sensitivity analysis for nonlinear programming using penalty methods”, Mathematical Programming 10 (1976) 287–311.

    Article  MATH  MathSciNet  Google Scholar 

  3. A.V. Fiacco and G.P. McCormick, Nonlinear programming: Sequential unconstrained minimization techniques (Wiley, New York, 1968).

    MATH  Google Scholar 

  4. K. Jittorntrum, “Sequential algorithms in nonlinear programming”, Dissertation, The Australian National University, Canberra (1978).

    Google Scholar 

  5. K. Jittorntrum, “Accelerated convergence for the Powell/Hestenes multiplier method”, Mathematical Programming 18 (1980) 197–214.

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  8. D.G. Luenberger, Introduction to linear and nonlinear programming (Addison-Wesley, Reading, MA, 1973).

    MATH  Google Scholar 

  9. J.M. Ortega and W.C. Rheinbodt, Iterative solution of nonlinear equations in several variables (Academic Press, New York, 1970).

    MATH  Google Scholar 

  10. S.M. Robinson, “Strongly regular generalized equations”, Mathematics of Operations Research 5 (1980) 43–62.

    Article  MATH  MathSciNet  Google Scholar 

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

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Anthony V. Fiacco

Rights and permissions

Reprints 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

Publish with us

Policies and ethics