Differential stability of convex optimization problems under weaker conditions
DOI10.1080/02331934.2019.1687697zbMath1432.49020OpenAlexW2989350002MaRDI QIDQ5213376
Nguyen Van Tuyen, Duong Thi Viet An, Markus A. Köbis
Publication date: 3 February 2020
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2019.1687697
subdifferentialsoptimal value functionparametric convex programming\(\varepsilon\)-subdifferentials\(\varepsilon\)-normal directions
Convex programming (90C25) Sensitivity, stability, parametric optimization (90C31) Set-valued and variational analysis (49J53) Sensitivity analysis for optimization problems on manifolds (49Q12)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Further results on differential stability of convex optimization problems
- Subgradients of marginal functions in parametric mathematical programming
- Subdifferential calculus using \(\varepsilon\)-subdifferentials
- Approximate Euler-Lagrange inclusion, approximate transversality condition, and sensitivity analysis of convex parametric problems of calculus of variations
- Calculus rules for global approximate minima and applications to approximate subdifferential calculus
- Subdifferential stability analysis for convex optimization problems via multiplier sets
- Differential stability of convex optimization problems with possibly empty solution sets
- Weaker conditions for subdifferential calculus of convex functions
- On Subdifferentials of Optimal Value Functions
- Lipschitz properties of the scalarization function and applications
- A closedness condition and its applications to DC programs with convex constraints
- Subdifferentials and SNC property of scalarization functionals with uniform level sets and applications
- Subgradients of Optimal-Value Functions in Dynamic Programming: The Case of Convex Systems Without Optimal Paths
- Subdifferential calculus without qualification conditions, using approximate subdifferentials: A survey
- Differential stability of convex optimization problems under inclusion constraints
- On the Subdifferentiability of Convex Functions
- Convex Analysis
- Subdifferential estimate of the directional derivative, optimality criterion and separation principles
This page was built for publication: Differential stability of convex optimization problems under weaker conditions