Directional differentiability of optimal solutions under Slater's condition
From MaRDI portal
Publication:2366608
DOI10.1007/BF01581237zbMath0783.90097MaRDI QIDQ2366608
Publication date: 30 August 1993
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
contingent derivativedirectional derivativedirectional differentiabilityconvex parametric optimization
Convex programming (90C25) Quadratic programming (90C20) Sensitivity, stability, parametric optimization (90C31) Nonsmooth analysis (49J52)
Related Items
The generalized jacobian of the optimal solution in parametric optimization ⋮ Computing optimal incentives via bilevel programming ⋮ Implications of the constant rank constraint qualification ⋮ Generalized Sensitivity Analysis of Nonlinear Programs ⋮ Quasidifferntiability of optimal solutions in parametric optimal solutions in parametric nonlinear optimization ⋮ Sensitivity analysis for variational inequalities ⋮ Generalized sensitivity analysis of nonlinear programs using a sequence of quadratic programs ⋮ A collision detection approach for maximizing the material utilization ⋮ Bilevel road pricing: theoretical analysis and optimality conditions ⋮ On an algorithm solving two-level programming problems with nonunique lower level solutions ⋮ Improving the performance of a traffic system by fair rerouting of travelers
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Implicit functions and sensitivity of stationary points
- Introduction to sensitivity and stability analysis in nonlinear programming
- Approximation to a set-valued mapping. I: A proposal
- A semistrong sufficiency condition for optimality in nonconvex programming and its connection to the perturbation problem
- A globally convergent algorithm based on imbedding and parametric optimization
- Sensitivity analysis for nonsmooth generalized equations
- The Fritz John necessary optimality conditions in the presence of equality and inequality constraints
- Directional derivative of the marginal function in nonlinear programming
- 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
- Directional Behaviour of Optimal Solutions in Nonlinear Mathematical Programming
- On the directional derivative of the optimal solution mapping without linear independence constraint qualification
- Strongly Regular Generalized Equations
- Generalized equations and their solutions, part II: Applications to nonlinear programming
- A necessary and sufficient regularity condition to have bounded multipliers in nonconvex programming
- An algorithm for determining all extreme points of a convex polytope
