On the Complexity of Semidefinite Programs

Journal of Global Optimization

Volumn 10, Issue 4, 1997, Pages 351-365

  Porkolab, Lorant ^a   Khachiyan, Leonid ^b  

^a RUTGERS UNIVERSITY   (United States)

^b RUTGERS UNIVERSITY   (United States)

Author keywords

Bounds on solutions; Complexity; Semidefinite programming

Indexed keywords

EID: 0001316562     PISSN: 09255001     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1008203903341     Document Type: Article

References (11)

1. Adler, I. and Shamir, R. (1990), A Randomized Scheme for Speeding Up Algorithms for Linear and Convex Quadratic Programming Problems with a High Constraints-to-Variables Ratio, Math. Programming 61 (1993), 39-52.
2. Chazelle, B. and Matousek, J. (1993), On Linear-Time Deterministic Algorithms for Optimization Problems in Fixed Dimension, Proc. of the 4th ACM-SIAM Symp. on Discrete Algorithms, 281-290.
3. Clarkson, K.L. (1995), Las Vegas Algorithms for Linear and Integer Programming When the Dimension Is Small, J. of ACM 42 (1995), 488-499.
4. Grötschel, M., Lovász, L. and Schrijver, A. (1988), Geometric Algorithms and Combinatorial Optimization, Springer, Berlin.
5. Mignotte, M. (1982), Some Useful Bounds, in Buchberger, B., Collins, G.E., and Loos, R. (eds.) in cooperation with Albrecht, R., Computer Algebra, Symbolic and Algebraic Computation (Second Edition), Springer, Wien.
6. Ramana, M.V. (1993) An Algorithmic Analysis of Multiquadratic and Semidefinite Programming Problems, Ph.D. Thesis, The Johns Hopkins University, Baltimore.
7. Ramana, M.V. (1995) An Exact Duality Theory for Semidefinite Programming and its Complexity Implications, DIMACS Technical Report 95-02.
8. Renegar, J. (1992a) On the Computational Complexity of Approximating Solutions for Real Algebraic Formulae, SIAM J. on Computing 21 (1992), 1008-1025.
9. Renegar, J. (1992b) 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 Reals, J. of Symbolic Computation 13 (1992), 255-299.
10. Rockafellar, T.R., Convex Analysis, Princeton University Press, NJ, 1970.
11. Schrijver, A. (1986) Theory of Linear and Integer Programming, Wiley, New York.