Strong duality for semidefinite programming

SIAM Journal on Optimization

Volumn 7, Issue 3, 1997, Pages 641-662

  Ramana, Motakuri V ^a   Tunçel, Levent ^b   Wolkowicz, Henry ^b  

^a University of Florida   (United States)

^b UNIVERSITY OF WATERLOO   (Canada)

Author keywords

L wner partial order; Semidefinite linear programming; Strong duality; Symmetric positive semidefinite matrices

Indexed keywords

EID: 0031285890     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1052623495288350     Document Type: Article

References (39)

1. F. ALIZADEH, Interior point methods in semidefinite programming with applications to combinatorial optimization, SIAM J. Optim., 5 (1995), pp. 13-51.
2. E. ANDERSON AND P. NASH, Linear Programming in Infinite Dimensional Spaces, John Wiley and Sons, New York, 1987.
3. G. P. BARKER, The lattice of faces of a finite dimensional cone, Linear Algebra Appl., 7 (1973), pp. 71-82.
4. G. P. BARKER AND D. CARLSON, Cones of diagonally dominant matrices, Pacific J. Math., 57 (1975), pp. 15-32.
5. W. W. BARRETT, C. R. JOHNSON, AND R. LOEWY, The Real Positive Definite Completion Problem: Cycle Completability, Technical report, Department of Mathematics, College of William and Mary, Williamsburg, VA, 1993.
6. A. BEN-ISRAEL, Linear equations and inequalities on finite dimensional, real or complex, vector spaces: A unified theory, J. Math. Anal. Appl., 27 (1969), pp. 367-389.
7. A. BEN-TAL AND A. NEMIROVSKII, Potential reduction polynomial time method for truss topology design, SIAM J. Optim., 4 (1994), pp. 596-612.
8. A. BERMAN, Cones, Matrices and Mathematical Programming, Springer-Verlag, Berlin, New York, 1973.
9. F. BOHNENBLUST, Joint Positiveness of Matrices, California Institute of Technology, Pasadena, CA, 1948, manuscript.
10. J. M. BORWEIN AND H. WOLKOWICZ, Characterizations of optimality for the abstract convex program with finite dimensional range, J. Austral. Math. Soc. Ser. A, 30 (1981), pp. 390-411.
11. J. M. BORWEIN AND H. WOLKOWICZ, Regularizing the abstract convex program, J. Math. Anal. Appl., 83 (1981), pp. 495-530.
12. J. M. BORWEIN AND H. WOLKOWICZ, Characterizations of optimality without constraint qualification for the abstract convex program, Math. Programming Study, 19 (1982), pp. 77-100.
13. J. M. BORWEIN AND H. WOLKOWICZ, A simple constraint qualification in infinite dimensional programming, Math. Programming, 35 (1986), pp. 83-96.
14. S. BOYD, L. EL GHAOUI, E. FERON, AND V. BALAKRISHNAN, Linear matrix inequalities in system and control theory, in Studies in Applied Mathematics 15, SIAM, Philadelphia, PA, 1994.
15. C. DELORME AND S. POLJAK, The performance of an eigenvalue bound on the max-cut problem in some classes of graphs, Discrete Math., 111 (1993), pp. 145-156.
16. R. J. DUFFIN, Infinite programs, in Linear Equalities and Related Systems, A. W. Tucker, ed., Princeton University Press, Princeton, NJ, 1956, pp. 157-170.
17. R. M. FREUND, Complexity of an Algorithm for Finding an Approximate Solution of a Semidefinite Program with No Regularity Assumption, Technical report OR 302-94, MIT, Cambridge, MA, 1994.
18. K. GLASHOFF AND S. GUSTAFSON, Linear optimization and approximation, in Applied Mathematical Sciences 45, Springer-Verlag, Verlag Basel, 1978.
19. M. X. GOEMANS AND D. P. WILLIAMSON, Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming, Technical report, Department of Mathematics, MIT, 1994.
20. B. GRONE, C. JOHNSON, E. MARQUES DE SA, AND H. WOLKOWICZ, Positive definite completions of partial Hermitian matrices, Linear Algebra Appl., 58 (1984), pp. 109-124.
21. M. GUIGNARD, Generalized Kuhn-Tucker conditions for mathematical programming problems in a banach space, SIAM J. Control, 7 (1969), pp. 232-241.
22. C. HELMBERG, F. RENDL, R. J. VANDERBEI, AND H. WOLKOWICZ, An interior point method for sernidefinite programming, SIAM J. Optim., 6 (1996), pp. 342-361.
23. R. B. HOLMES, Geometric Functional Analysis and its Applications, Springer-Verlag, Berlin, 1975.
24. C. JOHNSON, B. KROSCHEL, AND H. WOLKOWICZ, An interior-point method for approximate positive semidefinite completions, Comput. Optim. Appl., to appear.
25. K. KRETSCHMER, Programming in paired spaces, Canad. J. Math., 13 (1961), pp. 221-238.
26. N. LEVINSON, A class of continuous linear programming problems, J. Math. Anal. Appl., 16 (1966), pp. 73-83.
27. L. LOVÁSZ AND A. SCHRIJVER, Cones of matrices and set-functions and 0-1 optimization, SIAM J. Optim., 1 (1991), pp. 166-190.
28. K. LÖWNER, Uber monotone matrixfunctionen, Math. Z., 49 (1934), pp. 375-392.
29. A. W. MARSHALL AND I. OLKIN, Inequalities: Theory of Majorization and its Applications, Academic Press, New York, NY, 1979.
30. Y. E. NESTEROV AND A. S. NEMIROVSKII, Interior Point Polynomial Algorithms in Convex Programming: Theory and Algorithms, SIAM, Philadelphia, PA, 1994.
31. F. PUKELSHEIM Optimal Design of Experiments, Wiley, New York, 1993.
32. M. V. RAMANA, An Algorithmic Analysis of Multiquadratic and Semidefinite Programming Problems, Ph.D. thesis, Johns Hopkins University, Baltimore, MD, 1993.
33. M. V. RAMANA, An Exact Duality Theory for Semidefinite Programming and its Complexity Implications, DIMACS Technical report 95-02R, RUTCOR, Rutgers University, New Brunswick, NJ, 1995.
34. T. W. REILAND, Optimality conditions and duality in continuous programming. ii. The linear problem revisited, J. Math. Anal. Appl., 77 (1980), pp.329-343.
35. R. T. ROCKAFELLAR, Convex Analysis, Princeton University Press, Princeton, NJ, 1970.
36. L. VANDENBERGHE AND S. BOYD, Semidefinite programming, SIAM Rev., 38 (1996), pp. 49-95.
37. H. WOLKOWICZ, Geometry of optimality conditions and constraint qualifications: The convex case, Math. Programming, 19 (1980), pp. 32-60.
38. H. WOLKOWICZ, Some applications of optimization in matrix theory, Linear Algebra Appl., 40 (1981), pp. 101-118.
39. Q. ZHAO, S. KARISCH, F. RENDL, AND H. WOLKOWICZ, Semidefinite Programming Relaxations for the Quadratic Assignment Problem, Research report, University of Waterloo, Waterloo, Ontario, Canada, 1995.