Differential stability of convex optimization problems with possibly empty solution sets

DOI10.1007/s10957-018-1431-1zbMath1416.49016arXiv1805.01656OpenAlexW2963267434MaRDI QIDQ2420772

Duong Thi Viet An, Jen-Chih Yao

Publication date: 7 June 2019

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1805.01656

zbMATH Keywords

conjugate functionoptimal value functionparametric convex programming\(\varepsilon \)-subdifferentials\(\varepsilon \)-normal directions

Mathematics Subject Classification ID

Convex programming (90C25) Sensitivity, stability, parametric optimization (90C31) Set-valued and variational analysis (49J53) Sensitivity analysis for optimization problems on manifolds (49Q12)

Related Items (4)

Differential stability of convex discrete optimal control problems with possibly empty solution sets ⋮ Differential stability in a multi-objective optimal control problems with a possibly empty solution set ⋮ Differential stability of convex optimization problems under weaker conditions ⋮ Differential stability properties in convex scalar and vector optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Further results on differential stability of convex optimization problems
• Variational geometric approach to generalized differential and conjugate calculi in convex analysis
• 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
• Calculus Without Derivatives
• Sensitivity Analysis of Optimal Value Functions of Convex Parametric Programs with Possibly Empty Solution Sets
• 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

This page was built for publication: Differential stability of convex optimization problems with possibly empty solution sets