A geometric analysis of Renegar's condition number, and its interplay with conic curvature

DOI10.1007/s10107-007-0203-8zbMath1163.90029OpenAlexW2100911354MaRDI QIDQ1013969

Robert M. Freund, Alexandre Belloni

Publication date: 24 April 2009

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

Full work available at URL: http://hdl.handle.net/1721.1/54761

Mathematics Subject Classification ID

Sensitivity, stability, parametric optimization (90C31) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)

Related Items

A geometrical stability condition for compressed sensing, Solidity indices for convex cones, Inradius and circumradius of various convex cones arising in applications, Strange behaviors of interior-point methods for solving semidefinite programming problems in polynomial optimization, Geometric measures of convex sets and bounds on problem sensitivity and robustness for conic linear optimization, Some preconditioners for systems of linear inequalities, On properties of different notions of centers for convex cones, A Data-Independent Distance to Infeasibility for Linear Conic Systems, Unnamed Item, The Condition Number of Riemannian Approximation Problems, Probabilistic analysis of the Grassmann condition number

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Strong convexity of sets and functions
• Some perturbation theory for linear programming
• Complexity of convex optimization using geometry-based measures and a reference point
• Linear programming, complexity theory and elementary functional analysis
• Some characterizations and properties of the ``distance to the ill-posedness and the condition measure of a conic linear system
• Strong and Weak Convexity of Sets and Functions
• Condition-Based Complexity of Convex Optimization in Conic Linear Form via the Ellipsoid Algorithm
• An Efficient Re-scaled Perceptron Algorithm for Conic Systems