Differentiability with respect to parameters of solutions to convex programming problems

1. F.H. Clarke, “On the inverse function theorem”,Pacific Journal of Mathematics 64 (1976) 97–102.

   Google Scholar 

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

   Google Scholar 

3. S. Fitzpatrick and R.R. Phelps, “Differentiability of the metric projection in Hilbert space”,Transactions of American Mathematical Society 270 (1982) 483–501.

   Google Scholar 

4. W.W. Hager, “Lipschitz continuity for constrained processes”,SIAM Journal on Control and Optimization 17 (1979) 321–338.

   Google Scholar 

5. J.-B. Hiriart-Urruty, “At what points is the projection mapping differentiable”,American Mathematical Monthly 89 (1982) 456–458.

   Google Scholar 

6. R.B. Holmes, “Smoothness of certain metric projection on Hilbert space”,Transactions of American Mathematical Society 184 (1973) 87–100.

   Google Scholar 

7. K. Jittorntrum, “Sequential algorithms in nonlinear programming”, Ph.D Thesis, Australian National University, (Canberra, Australia, 1978).

   Google Scholar 

8. K. Jittorntrum, “Solution point differentiability without strict complementarity in nonlinear programming”,Mathematical Programming Study 21 (1984) 127–138.

   Google Scholar 

9. K. Malanowski, “Differential sensitivity of solutions to convex programming problems without strict complementarity assumptions”, Technical Report No. ZTS 3-4/83, Systems Research Institute of the Polish Academy of Sciences (Warsaw, Poland, 1983).

   Google Scholar 

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

    Google Scholar 

Download references