An exact duality theory for semidefinite programming and its complexity implications

Mathematical Programming, Series B

Volumn 77, Issue 1, 1997, Pages 129-162

  Ramana, Motakuri V ^a  

^a J Crayton Pruitt Family Department of Biomedical Engineering   (United States)

Author keywords

Complexity classes; Semidefinite programming; Strong duality; Theorems of the alternative

Indexed keywords

COMPUTATIONAL COMPLEXITY; DECISION THEORY; POLYNOMIALS; TURING MACHINES;

EXACT DUALITY THEORY; SEMIDEFINITE FEASIBILITY (SDFP); SEMIDEFINITE PROGRAMMING (SDP);

MATHEMATICAL PROGRAMMING;

EID: 0031146175     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (31)

1. F. Alizadeh, Combinatorial optimization with interior point methods and semi-definite matrices, Ph.D. Thesis, Computer Science Department, University of Minnesota, Minneapolis, MN, 1991.
2. F. Alizadeh, Interior point methods in semidefinite programming with applications to combinatorial optimization, SIAM J. Optimization 5 (1) 1995.
3. J. Borwein and H. Wolkowicz, Regularizing the abstract convex program, J. Math. Anal. Appl. 83 (1981).
4. S. Boyd, L. El Ghaoui, E. Feron and V. Balakrishnan, Linear Matrix Inequalities in System and Control Theory, Studies in Applied Mathematics, Vol. 15 (SIAM, Philadelphia, PA, 1994).
5. L. Blum, M. Shub and S. Smale, On a theory of computation and complexity over the real numbers: NP-completeness, recursive functions and universal machines. Bull. Amer. Math. Soc. (N.S.) 21 (1) (1989) 1-46.
6. A. Brøndsted, An Introduction to Convex Polytopes (Springer, New York, 1983).
7. V. Chvátal, Linear Programming (Freeman, New York, 1983).
8. R. Freund, Complexity of an algorithm for finding an approximate solution of a semi-definite program, with no regularity condition, Working Paper, OR 302-94, 1994.
9. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-completeness (Freeman, New York, 1979).
10. M.X. Goemans and D.P. Williamson, Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming, J. ACM 42 (1995) 1115-1145.
11. M. Grötschel, L. Lovász and A. Schrijver, Polynomial algorithms for perfect graphs, in: C. Berge and V. Chvátal, eds., Annals of Discrete Mathematics, Vol. 21 (North-Holland, Amsterdam, 1984).
12. M. Grötschel, L. Lovász and A. Schrijver, Geometric Algorithms and Combinatorial Optimization (Springer, Berlin, 1988).
13. R.B. Holmes, Geometric Functional Analysis and its Applications (Springer, New York, 1975).
14. R. Horn and C.R. Johnson, Matrix Analysis (Cambridge University Press, Cambridge, MA, 1985).
15. F. Jarre, An interior point method for minimizing the maximum eigenvalue of a linear combination of matrices, Report SOL 91-8, Dept. of OR, Stanford University, Stanford, CA, 1991.
16. D.S. Johnson, C.H. Papadimitriou and M. Yannakakis, How easy is local search?, J. Computer and System Science 37 (1988) 79-100.
17. L. Porkolab and L. Khachiyan, On the complexity of semidefinite programs, RUTCOR Research Report, RRR 40-95, Rutgers University, New Brunswick, NJ-08903; to appear in J. Global Optimization (1997).
18. L. Porkolab and L. Khachiyan, On the complexity of semidefinite programs, RUTCOR Research Report, RRR 40-95, Rutgers University, New Brunswick, NJ-08903; to appear in J. Global Optimization (1997).
19. Y. Nesterov and A. Nemirovskii, Interior Point Polynomial Methods for Convex Programming: Theory and Applications (SIAM, Philadelphia, PA, 1994).
20. M.L. Overton, Large-scale optimization of eigenvalues, SIAM J. Optimization 2 (1992) 88-120.
21. G. Pataki, Semidefinite and cone programming: Geometry and simplex-type methods, Ph.D. Thesis, GSIA, Carnegie Mellon University, Pittsburgh, under preparation.
22. M.V. Ramana, An algorithmic analysis of multiquadratic and semidefinite programming problems, Ph.D. Thesis, The Johns Hopkins University, Baltimore, MD, 1993.
23. M.V. Ramana and R.M. Freund, A gap-free corrected primal for semidefinite programming, in preparation, 1996.
24. M.V. Ramana and A.J. Goldman, Some geometric results in semidefinite programming, J. Global Optimization 7 (1995) 33-50.
25. M.V. Ramana and P.M. Pardalos, Semidefinite Programming, T. Terlaky, ed., Interior Point Methods in Mathematical Programming (Kluwer Academic Publishers, 1996) 369-398.
26. M.V. Ramana, E.R. Scheinerman and D. Ullman, Fractional isomorphism of graphs, Discrete Mathematics 132 (1994) 247-265.
27. M.V. Ramana, L. Tunçel and H. Wolkowicz, Strong duality in semidefinite programming, SIAM J. Optimization, to appear (1997).
28. T.R. Rockafellar, Convex Analysis (Princeton University Press, Princeton, NJ, 1970).
29. L. Vandenberghe and S. Boyd, Positive-definite programming, in: J.R. Birge and K.G. Murty, eds., Mathematical Programming: State of the Art 1994 (University of Michigan, 1994).
30. L. Vandenberghe and S. Boyd, Semidefinite programming, SIAM Review 38 (1996) 49-95.
31. H. Wolkowicz, Some applications of optimization in matrix theory, Linear Algebra and its Applications 40 (1981) 101-118.