Abstract
In this paper we study second-order differential properties of an optimal-value functionϕ(x). It is shown that under certain conditionsϕ(x) possesses second-order directional derivatives, which can be calculated by solving corresponding quadratic programs. Also upper and lower bounds on these derivatives are introduced under weaker assumptions. In particular we show that the second-order directional derivative is infinite if the corresponding quadratic program is unbounded. Finally sensitivity results are applied to investigate asymptotics of estimators in parametrized nonlinear programs.
Similar content being viewed by others
References
R. Bellman,Introduction to matrix analysis (McGraw-Hill, New York, 1960).
J.H. Bigelow and N.Z. Shapiro, “Implicit function theorems for mathematical programming and for systems of inequalities”,Mathematical Programming 6 (1974) 141–156.
J.M. Danskin,The theory of max-min and its applications to weapons allocation problems, (Springer-Verlag, New York, 1967).
J. Dupačová, “Stability in stochastic programming with recourse-estimated parameters”,Mathematical Programming 28 (1984) 72–83.
A.V. Fiacco and G.P. McCormick,Nonlinear programming: Sequential unconstrained minimization techniques (Wiley, New York, 1968).
A.V. Fiacco, “Sensitivity analysis for nonlinear programming using penalty methods”,Mathematical Programming 10 (1976) 287–311.
A.V. Fiacco,Introduction to sensitivity and stability analysis in nonlinear programming (Academic Press, New York, 1983).
J. Gauvin and F. Dubeau, “Differential properties of the marginal functions in mathematical programming”,Mathematical Programming Study 19 (1982) 101–119.
B. Gollan, “On the marginal function in nonlinear programming”,Mathematics of Operations Research 9 (1984) 208–221.
K. Jittorntrum, “Solution point differentiability without strict complementarity in nonlinear programming”,Mathematical Programming Study 21 (1984) 127–138.
O.L. Mangasarian and S. Fromovitz, “The Fritz John necessary optimality conditions in the presence of equality and inequality constraints”,Journal of Mathematical Analysis and Applications 17 (1967) 37–47.
R.M. Pringle and A.A. Rayner,Generalized inverse matrices with applications to statistics, Griffin Statistical Monograph Series, London, 1971.
C.R. Rao,Linear statistical inference and its applications (Wiley, New York, 1973).
S.M. Robinson, “Perturbed Kuhn—Tucker points and rates of convergence for a class of nonlinearprogramming algorithms”,Mathematical Programming 7 (1974) 1–16.
S.M. Robinson, “Strongly regular generalized equations”,Mathematics of Operations Research 5 (1980) 43–62.
S.M. Robinson, “Generalized equations and their solutions, Part II: Applications to nonlinear programming”,Mathematical Programming Study 19 (1982) 200–221.
R.T. Rockafellar, “Generalized subgradients in mathematical programming”, in: A. Bachem, M. Grötschel and B. Korte, eds.,Mathematical programming, The state of the art (Springer-Verlag, Berlin, 1983).
R.T. Rockafellar, “Marginal values and second-order necessary conditions for optimality”,Mathematical Programming 26 (1983) 245–286.
A. Shapiro, “Asymptotic distribution theory in the analysis of covariance structures (a unified approach)”,South African Statistical Journal 17 (1983) 33–81.
A. Shapiro, “Second order derivatives of extremal-value functions and optimality conditions for semi-infinite programs”,Mathematics of Operations Research 10 (1985) 207–219.
A. Shapiro, “Asymptotic distribution of test statistics in the analysis of moment structures under inequality constraints”,Biometrika 72 (1985) 133–144.
A. Shapiro, “On differentiability of metric projections in ℝn, 1: Boundary case”, Research Report 6/85, University of South Africa, Pretoria, South Africa.
J.E. Spingarn, “Fixed and variable constraints in sensitivity analysis”,SIAM J. Control and Optimization 18 (1980) 297–310.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Shapiro, A. Second order sensitivity analysis and asymptotic theory of parametrized nonlinear programs. Mathematical Programming 33, 280–299 (1985). https://doi.org/10.1007/BF01584378
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01584378