On the directional derivative of the optimal solution mapping without linear independence constraint qualification
From MaRDI portal
Publication:3832337
DOI10.1080/02331938908843460zbMath0676.90072OpenAlexW1996651511MaRDI QIDQ3832337
Publication date: 1989
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331938908843460
sensitivitydirectional derivativesecond-order sufficient conditionset mappingconvex parametric programmingsmooth perturbations
Sensitivity, stability, well-posedness (49K40) Sensitivity, stability, parametric optimization (90C31)
Related Items (4)
Directional differentiability of optimal solutions under Slater's condition ⋮ A necessary and a sufficient optimality condition for bilevel programming problems ⋮ The marginal value formula on regions of stability ⋮ Improving the performance of a traffic system by fair rerouting of travelers
Cites Work
- Unnamed Item
- Unnamed Item
- Introduction to sensitivity and stability analysis in nonlinear programming
- Approximation to a set-valued mapping. I: A proposal
- An algorithm for solving two-level convex optimization problems
- Solution point differentiability without strict complementarity in nonlinear programming
- Second order sensitivity analysis and asymptotic theory of parametrized nonlinear programs
- Differentiability with respect to parameters of solutions to convex programming problems
- Lipschitzian Solutions of Perturbed Nonlinear Programming Problems
- Sensitivity Analysis of Nonlinear Programs and Differentiability Properties of Metric Projections
- Strongly Regular Generalized Equations
- Generalized equations and their solutions, part II: Applications to nonlinear programming
- Implicit function theorems for mathematical programming and for systems of inequalities
- A necessary and sufficient regularity condition to have bounded multipliers in nonconvex programming
- An implicit function theorem
This page was built for publication: On the directional derivative of the optimal solution mapping without linear independence constraint qualification