A geometric analysis of Renegar’s condition number, and its interplay with conic curvature
- 4 January 2008
- journal article
- Published by Springer Science and Business Media LLC in Mathematical Programming
- Vol. 119 (1), 95-107
- https://doi.org/10.1007/s10107-007-0203-8
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Complexity of convex optimization using geometry-based measures and a reference pointMathematical Programming, 2004
- Some characterizations and properties of the “distance to ill-posedness” and the condition measure of a conic linear systemMathematical Programming, 1999
- Condition-Based Complexity of Convex Optimization in Conic Linear Form via the Ellipsoid AlgorithmSIAM Journal on Optimization, 1999
- Linear programming, complexity theory and elementary functional analysisMathematical Programming, 1995
- Some perturbation theory for linear programmingMathematical Programming, 1994
- Strong and Weak Convexity of Sets and FunctionsMathematics of Operations Research, 1983
- Strong convexity of sets and functionsJournal of Mathematical Economics, 1982