Condition numbers and error bounds in convex programming
From MaRDI portal
Publication:959930
DOI10.1007/S10107-007-0132-6zbMATH Open1167.90012OpenAlexW2026600343MaRDI QIDQ959930FDOQ959930
Authors: Adama Coulibaly, J.-P. 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
Recommendations
Convex programming (90C25) Convexity of real functions of several variables, generalizations (26B25)
Cites Work
- Convex Analysis
- Error bounds in mathematical programming
- 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
- Title not available (Why is that?)
- Least concave utility functions
- First-Order and Second-Order Conditions for Error Bounds
- Title not available (Why is that?)
- On the sensitivity analysis of Hoffman constants for systems of linear inequalities
- Well behaved asymptotical convex functions
- Convex Functions with Unbounded Level Sets and Applications to Duality Theory
- Second-order conditions in \(C^{1,1}\) constrained vector optimization
- Approximation of set-valued functions by single-valued one
- Error bounds for nondifferentiable convex inequalities under a strong Slater constraint qualification
Cited In (18)
- METRIC REGULARITY—A SURVEY PART II. APPLICATIONS
- Minimizing Condition Number via Convex Programming
- On verified numerical computations in convex programming
- Slopes, error bounds and weak sharp Pareto minima of a vector-valued map
- Two properties of condition numbers for convex programs via implicitly defined barrier functions
- Error bounds and a condition number for the absolute value equations
- Verifiable sufficient conditions for the error bound property of second-order cone complementarity problems
- Dual characterizations of three distance functions
- A unified characterization of nonlinear scalarizing functionals in optimization
- Linear programming sensitivity measured by the optimal value worst-case analysis
- Title not available (Why is that?)
- On the basic properties and the structure of power cells
- A note on the condition numbers of convex sets
- Condition number theorems in linear-quadratic optimization
- The Condition Number of Riemannian Approximation Problems
- An Oriented Distance Function Application to Gap Functions for Vector Variational Inequalities
- A Condition Number for Differentiable Convex Inequalities
- Convexity and Variational Analysis
This page was built for publication: Condition numbers and error bounds in convex programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q959930)
