Typical convex program is very well posed

DOI10.1007/s10107-005-0625-0zbMath1082.49030MaRDI QIDQ2576732

Alexander D. Ioffe, Roberto Lucchetti

Publication date: 14 December 2005

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-005-0625-0

zbMATH Keywords

convex programming; Lipschitz stability; well-posed problems; concave/convex functions

Mathematics Subject Classification ID

90C25: Convex programming

49K40: Sensitivity, stability, well-posedness

90C31: Sensitivity, stability, parametric optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Well-posed optimization problems
• Convex functions, monotone operators and differentiability.
• Partially monotone operators and the generic differentiability of convex- concave and biconvex mappings
• Porosity and \(\sigma\)-porosity
• Contrôle dans les inéquations variationelles elliptiques
• Extended well-posedness of optimization problems
• A Variational Principle for Problems with Functional Constraints
• Frechet Differentiation of Convex Functions in a Banach Space with a Separable Dual
• The Generic Nature of Optimality Conditions in Nonlinear Programming
• Porous Sets in Best Approximation Theory
• Generic well‐posedness of optimization problems in topological spaces
• Well-posedness criteria in optimization with application to the calculus of variations
• Porosity of ill-posed problems
• Variational Principles and Well-Posedness in Optimization and Calculus of Variations
• Gradients of Convex Functions