Journal of the Korean Operations Research and Management Science Society (한국경영과학회지)

The Korean Operations Research and Management Science Society (한국경영과학회)
권호 표지

A Survey: SDP, its Duality, Complexity and Applications

SDP의 개관: 쌍대성, 계산복잡성 및 응용

  • Published : 2001.06.01
Download PDF
⟨ Previous Next ⟩

Abstract

SDP (Semidefinite Programming), as a sort of “cone-LP”, optimizes a linear function over the intersection of an affine space and a cone that has the origin as its apex. SDP, however, has been developed in the process of searching for better solution methods for NP-hard combinatorial optimization problems. We surveyed the basic theories necessary to understand SDP researches. First, We examined SDP duality, comparing it to LP duality, which is essential for the interior point method, Second, we showed that SDP can be optimized from an interior solution in polynomial time with a desired error limit. finally, we summarized several research papers that showed SDP can improve solution methods for some combinatorial optimization problems, and explained why SDP has become one of the most important research topics in optimization. We tried to integrate SDP theories. relatively diverse and complicated. to survey research papers with our own perspective, and thus to help researcher to pursue their SDP researches in depth.

Keywords

References

  1. SIAM J. Optimization v.5 no.1 Interior point methods in semidefinite programming with applications to combinatorial optimizations Alizadeh, F.
  2. Technical Report 659 Primal-dual interior-point methods for semidefinite programming Alizadeh F.;J.P. Haeberly;M. Overton
  3. Mathematical Programming v.80 Approximating the independence number via the θ-function Alon, N.;N. Kahale
  4. Research report A strengthened SDP relaxation via a second lifting for the Max-Cut problem Anjos, M.;H. Wolkowicz
  5. Research report A tight semidefinite relaxation of the cut polytope Anjos, M.;H. Wolkowicz
  6. Research Report CORR 98-31 Strong duality for a trust-region type relaxation of the quadratic assignment problem Anstreicher, K;X. Chen;H. Wolkowicz;Y. Yuan
  7. Theory and Algorithms Nonlinear Programming Bazaraa, M.S.;C.M. Shetty
  8. Technical Report Solving large-scale sparse semidefinite programs for combinatorial optimization Benson, S.;Y. Ye;X. Zhang
  9. Bulletin of American Mathematical Society v.21 no.1 On a theory of computation and complexity over real numbers: NP-completeness, recursive functions and universal machines Blum, L.;M. Shub;S. Smale
  10. Proc. of 3rd European Symp. on Algs. v.LNCS979 A geometric approach to betweenness Chor, B.;M. Sudan
  11. CWI report Relaxations of the satisfiability problem using semidefinite programming de Klerk, E.;H.V. Maaren;J.P. Warners
  12. J. Res. Nat. Bureau of Standards v.69B Maximum matching and a polyhedron with 0,1-vertices Edmonds, J.
  13. Proc. of 3rd Israel Symp. on Theory of Computing and systems Approximating the value of two prover proof systems, with applications to MAX 2SAT and MAX DICUT Feige, U.;M.X. Goemans
  14. Proc. of 4th Integer Programming and Combinatorial Optimization Conference Improved approximation algorithms for MAX k-CUT and MAX BISECTION Frieze, A.;M. Jerrum
  15. Computers and Intractability: A guide to the theory of NP-completeness Garey, M.R.;D.S. Johnson
  16. Mathematical Programming v.79 Semidefinite programming in combinatorial optimization Goemans, M.X.
  17. Documenta Mathematica v.Extra Volume ICM III Semidefinite programming and combinatorial optimization Goemans, M.X.
  18. Computing Semidefinite programs and association schemes Goemans, M.X.;F. Rendl
  19. Proc 26th Annual ACM symposium on Theory of Computing 0.878-approximation algorithms for MAX CUT and MAX-2SAT Goemans, M.X.;D.P. Williamson
  20. J. ACM v.42 Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming Goemans, M.X.;D.P. Williamson
  21. Combinatorica v.1 no.2 The ellipsoid method and its consequences in combinatorial optimization Grotschel, M.;L. Lovasz;A. Schrijver
  22. Annals of Discrete Mathematics v.21 Polynomial algorithms for perfect graphs Grotschel, M.;L. Lovasz;A. Schrijver
  23. Geometric Algorithms and Combinatorial Optimization Grotschel, M.;L. Lovasz;S. Schrijver
  24. Solving quadratic (0,1)-problems by semidefinite programs and cutting planes Helmberg, C.;F. Rendl
  25. SIAM J. Optimi. v.6 An interior-point method for semidefinite programming Helmberg, C.;F. Rendl;R.J. Vanderbei;H. Wolkowicz
  26. A semidefinite programming approach to the quadratic knapsack problem Helmberg, C.;F. Rendl;R. Weismantel
  27. Technical Report An improved rounding method and semidefinite programming relaxation for graph partition Han, Q.;Y. Ye;H. Zhang;J. Zhang
  28. Journal of ACM v.45 Approximate graph coloring by semidefinite programming Karger, D.;R. Motwani;M. Sudan
  29. Combinatorica v.4 A new polynomial -time algorithm for linear programming Karmarkar, N.
  30. IEEE Transactions on Information Theory v.25 no.1 On the Shannon capacity of a graph Lovasz, L.
  31. SIAM J. Optimi. v.1 no.2 Cones of matrices and set-functions and 0-1 optimization Lovasz, L.;A. Schrijver
  32. Duality results for conic convex programming Luo, Z.Q.;J.F. Sturm;S. Zhang
  33. Proc. 36th Symp. on Foundations of Computer Science Derandomizing semidefinite programming based approximation algorithms Mahajan, S.;H. Ramesh
  34. Combinatorial and Graph Thoeretic Problems in Linear Algebra, volume 50 of The IMA Volumes in Mathematics and its Applications Eigenvalue methods in combinatorial optimization Mohar, B.;S. Poljak;Brualdi, R.;S. Friedland;V. Klee(eds)
  35. SIAM Studies in Applied Mathematics Interiorpoint polynomial algorithms in convex programming Nesterov, Y.;A. Nemirovskii
  36. Society for Industrial and Applied Mathematics Interior point polynomial methods in convex programming: theory and applications Nesterov, Y.;A. Nemirovskii
  37. Combinatorial Optimization: Algorithms and Complexity Papadimitriou, C.H.;K. Steiglitz
  38. Proc. IPCO V, Lec. Note on Computer Sciences 1084 Cone-LP's and semidefinite programs: Geometry and a simplex-type method Pataki, G.
  39. Department of Combinatorics and Optimization On the generic properties of convex optimization problems in conic form Pataki, G.;L. Tuncel
  40. SIAM J. Optimization Nonpolyhedral relaxations of graph-bisection problems Poljak, S.;F. Rendl
  41. DIMACS Tech. An exact duality theory for semidefinite programming and its complexity implications Ramana, M.
  42. SIAM J. Optimization Strong duality for semidefinite programming Ramana, M.;L. Tuncel;H. Wolkowicz
  43. SIAM J. Discrete Mathematics A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems Sherali, H.D.;W.P. Adams
  44. Lagrange Multipliers Revisited: A Contribution to Nonlinear Programming Slater, M.
  45. Approximation Algorithms for Combinatorial Optimization Finding dense subgraphs with semidefinite programming Srivastav, A.;K. Wolf;Jansen, K.;J. Rolim(eds.)
  46. SIAM Review Semidefinte programming Vandenberghe, L.;S. Boyd
  47. Discrete Applied Mathematics v.96/97 Semidefinite relaxations for the graph partitioning problem Wolkowicz, H.;Q. Zhao
  48. SIAM J. Computing v.19 A class of projective transformations for linear programming Ye, Y.
  49. Technical Report A .699-approximation algorithm for max-bisection Ye, Y.
  50. Technical Report Approximation of dense-n/2-subgraph and the complement of min-bisection Ye, Y.;J. Zhang
  51. Journal of Combinatorial Optimizatoin Semidefinite programming relaxations for the quadratic assignment problem Zhao, Q.;S.E. Karisch;F. Rendle;H. Wolkowicz