Condition numbers and error bounds in convex programming
From MaRDI portal
Publication:959930
DOI10.1007/S10107-007-0132-6zbMath1167.90012OpenAlexW2026600343MaRDI QIDQ959930
Adama Coulibaly, Jean-Pierre Crouzeix
Publication date: 16 December 2008
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-007-0132-6
Convex programming (90C25) Convexity of real functions of several variables, generalizations (26B25)
Related Items (9)
Error bounds and a condition number for the absolute value equations ⋮ METRIC REGULARITY—A SURVEY PART II. APPLICATIONS ⋮ Slopes, error bounds and weak sharp Pareto minima of a vector-valued map ⋮ Convexity and Variational Analysis ⋮ A note on the condition numbers of convex sets ⋮ Condition Number Theorems in Linear-Quadratic Optimization ⋮ An Oriented Distance Function Application to Gap Functions for Vector Variational Inequalities ⋮ A unified characterization of nonlinear scalarizing functionals in optimization ⋮ The Condition Number of Riemannian Approximation Problems
Cites Work
- Unnamed Item
- Unnamed Item
- Well behaved asymptotical convex functions
- Least concave utility functions
- Error bounds for nondifferentiable convex inequalities under a strong Slater constraint qualification
- Error bounds in mathematical programming
- Second-order conditions in \(C^{1,1}\) constrained vector optimization
- On the Sensitivity Analysis of Hoffman Constants for Systems of Linear Inequalities
- Computable Error Bounds For Convex Inequality Systems In Reflexive Banach Spaces
- A Condition Number for Differentiable Convex Inequalities
- Global Regularity Theorems
- Tangent Cones, Generalized Gradients and Mathematical Programming in Banach Spaces
- Convex Functions with Unbounded Level Sets and Applications to Duality Theory
- Approximation of set-valued functions by single-valued one
- First-Order and Second-Order Conditions for Error Bounds
- Convex Analysis
This page was built for publication: Condition numbers and error bounds in convex programming