On the Complexity of Semidefinite Programs
Authors:
- 1 June 1997
- journal article
- Published by Springer Nature in Journal of Global Optimization
- Vol. 10 (4) , 351-365
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Las Vegas algorithms for linear and integer programming when the dimension is smallJournal of the ACM, 1995
- A randomized scheme for speeding up algorithms for linear and convex programming problems with high constraints-to-variables ratioMathematical Programming, 1993
- On the Computational Complexity of Approximating Solutions for Real Algebraic FormulaeSIAM Journal on Computing, 1992
- On the computational complexity and geometry of the first-order theory of the reals. Part I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the realsJournal of Symbolic Computation, 1992
- Geometric Algorithms and Combinatorial Optimization1988
- Convex Analysis1970