Abstract
Consider a parametric nonlinear optimization problem subject to equality and inequality constraints. Conditions under which a locally optimal solution exists and depends in a continuous way on the parameter are well known. We show, under the additional assumption of constant rank of the active constraint gradients, that the optimal solution is actually piecewise smooth, hence B-differentiable. We show, for the first time to our knowledge, a practical application of quadratic programming to calculate the directional derivative in the case when the optimal multipliers are not unique.
Similar content being viewed by others
References
A. Auslender and R. Cominetti, “First and second order sensitivity analysis of nonlinear programs under directional constraint qualification conditions,”Optimization 21 (1990) 351–363.
B. Bank, J. Guddat, D. Klatte, B. Kummer and K. Tammer,Non-linear Parametric Optimization (Akademie-Verlag, Berlin, 1982).
J.F. Bonnans, “Directional derivatives of optimal solutions in smooth nonlinear programming,”Journal of Optimization Theory and Applications 73 (1992) 27–45.
J.F. Bonnans, A.D. Ioffe and A. Shapiro, “Développement de solutions exactes et approchées en programmation non linéaire,”Comptes Rendus de l'Académie des Sciences Paris 315 (1992) 119–123.
J.F. Bonnans, A.D. Ioffe and A. Shapiro, “Expansion of exact and approximate solutions in nonlinear programming,” in: W. Oetlli and D. Pallaschke, eds.,Advances in Optimization, Proceedings of the 6th French—German Conference on Optimization, Lecture Notes in Economics and Mathematical Systems, Vol. 382 (Springer, Berlin, 1992) pp. 103–117.
S. Dafermos, “Sensitivity analysis in variational inequalities,”Mathematics of Operations Research 13 (1988) 421–434.
S. Dempe, “Directional differentiability of optimal solutions under Slater's condition,”Mathematical Programming 59 (1993) 49–69.
A.V. Fiacco,Introduction to Sensitivity and Stability Analysis in Nonlinear Programming (Academic Press, New York, 1983).
J. Gauvin, “A necessary and sufficient regularity condition to have bounded multipliers in nonconvex programming,”Mathematical Programming 12 (1977) 136–138.
J. Gauvin and R. Janin, “Directional behaviour of optimal solutions in nonlinear mathematical programming,”Mathematics of Operation Reaserch 14 (1988) 629–649.
B. Gollan, “On the marginal function in nonlinear programming,”Mathematics of Operations Research 9 (1984) 208–221.
R. Janin, “Directional derivative of the marginal function in nonlinear programming,”Mathematical Programming Study 21 (1984) 110–126.
K. Jittorntrum, “Solution point differentiability without strict complementarity in nonlinear programming,”Mathematical Programming Study 21 (1984) 127–138.
M. Kojima, “Strongly stable stationary solutions in nonlinear programs,” in: S.M. Robinson, ed.,Analysis and Computation of Fixed Points (Academic Press, New York, 1980) pp. 93–138.
L. Kuntz and S. Scholtes, “Structural analysis of nonsmooth mappings, inverse functions, and metric projections,”Journal of Mathematical Analysis and Applications 188 (1994) 346–386.
J. Kyparisis, “Uniqueness and differentiability of solutions of parametric nonlinear complementarity problems,”Mathematical Programming 36 (1986) 105–113.
J. Kyparisis, “Sensitivity analysis framework for variational inequalities,”Mathematical Programming 38 (1987) 203–213.
J. Kyparisis, “Perturbed solutions of variational inequality problems over polyhedral sets,”Journal of Optimization Theory and Applications 57 (1988) 295–305.
J. Kyparisis, “Sensitivity analysis for nonlinear programs and variational inequalities with nonunique multipliers,”Mathematics of Operations Research 15 (1990) 286–298.
J.S. Pang and D. Ralph, “Piecewise smoothness, local invertibility, and parametric analysis of normal maps,”Mathematics of Operations Research, to appear.
S.M. Robinson, “Strongly regular generalized equations,”Mathematics of Operations Research 5 (1980) 43–62.
S.M. Robinson, “Implicit B-differentiability in generalized equations,” Technical Report No. 2854, Mathematics Research Center, University of Wisconsin (Madison, WI, 1985).
S.M. Robinson, “Local structure of feasible sets in nonlinear programming, Part III: Stability and sensitivity,”Mathematical Programming Study 30 (1987) 45–66.
S.M. Robinson, “An implicit-function theorem for a class of nonsmooth functions,”Mathematics of Operations Research 16 (1991) 292–309.
A. Shapiro, “Second order sensitivity analysis and asymptotic theory of parameterized nonlinear programs,”Mathematical Programming 33 (1985) 280–299.
A. Shapiro, “Sensitivity analysis of nonlinear programs and differentiability properties of metric projections,”SIAM Journal on Control and Optimization 26 (1988) 628–645.
A. Shapiro, “Perturbation analysis of optimization problems in Banach spaces,”Numerical Functional Analysis and Optimization 13 (1992) 97–116.
A. Shapiro and J.F. Bonnans, “Sensitivity analysis of parameterized programs under cone constraints,”SIAM Journal on Control and Optimization 30 (1992) 1409–1422.
Author information
Authors and Affiliations
Additional information
This author's research was supported by the Australian Research Council.
Rights and permissions
About this article
Cite this article
Ralph, D., Dempe, S. Directional derivatives of the solution of a parametric nonlinear program. Mathematical Programming 70, 159–172 (1995). https://doi.org/10.1007/BF01585934
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01585934