Condition-Based Complexity of Convex Optimization in Conic Linear Form via the Ellipsoid Algorithm
- 1 January 1999
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Optimization
- Vol. 10 (1), 155-176
- https://doi.org/10.1137/s105262349732829x
Abstract
No abstract availableThis publication has 13 references indexed in Scilit:
- Primal-Dual Interior-Point Methods for Self-Scaled ConesSIAM Journal on Optimization, 1998
- Self-Scaled Barriers and Interior-Point Methods for Convex ProgrammingMathematics of Operations Research, 1997
- Condition Numbers, the Barrier Method, and the Conjugate-Gradient MethodSIAM Journal on Optimization, 1996
- Ill-Posedness and the Complexity of Deciding Existence of Solutions to Linear ProgramsSIAM Journal on Optimization, 1996
- Semidefinite ProgrammingSiam Review, 1996
- Incorporating Condition Measures into the Complexity Theory of Linear ProgrammingSIAM Journal on Optimization, 1995
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial OptimizationSIAM Journal on Optimization, 1995
- Some perturbation theory for linear programmingMathematical Programming, 1994
- The dual of a fractional linear programJournal of Mathematical Analysis and Applications, 1973
- Programming with linear fractional functionalsNaval Research Logistics Quarterly, 1962