Semidefinite bounds for the stability number of a graph via sums of squares of polynomials

Mathematical Programming

Volumn 110, Issue 1, 2007, Pages 145-173

  Gvozdenović, Nebojša ^a   Laurent, Monique ^a  

^a CWI   (Netherlands)

Author keywords

Semidefinite programming; Stability number of a graph; Sum of squares of polynomials

Indexed keywords

COMPUTER SCIENCE; CONVERGENCE OF NUMERICAL METHODS; LEAST SQUARES APPROXIMATIONS; POLYNOMIALS;

SEMIDEFINITE PROGRAMMING; STABILITY NUMBER OF A GRAPH; SUM OF SQUARES OF POLYNOMIALS;

GRAPH THEORY;

EID: 33947111045     PISSN: 00255610     EISSN: 14364646     Source Type: Journal    
DOI: 10.1007/s10107-006-0062-8     Document Type: Article

References (26)

1. Bomze, I.M., Klerk, E. de : Solving standard quadratic optimization problems via linear, semidefinite and copositive programming. J. Global Optim. 24, 163-185 (2002)
2. Boyd, S., Vandenberghe, L.: Semidefinite programming. SIAM Rev. 38, 49-95 (1996)
3. Busygin, S.: A New Trust Region Technique for the Maximum Weight Clique Problem. Discrete Appl. Math. 154(15), 2080-2096 (2006)
4. Delsarte, P.: An Algebraic Approach to the Association Schemes of Coding Theory. [Philips Research Reports Supplements (1973) No. 10] Philips Research Laboratories, Eindhoven (1973)
5. De Klerk, E., Pasechnik, D.V.: Approximating the stability number of a graph via copositive programming. SIAM J. Optim. 12, 875-892 (2002)
6. Grötschel, M., Loväsz, L., Schrijver, A.: Geometric Algorithms and Combinatorial Optimization. Springer, Berlin Heidelberg New York (1988)
7. Lasserre, J.B.: Global optimization with polynomials and the problem of moments. SIAM J. Optim. 11, 796-817 (2001)
8. Lasserre J.B. (2001) An explicit exact SDP relaxation for nonlinear 0 - 1 programs. In: Aardal K., Gerards A.M.H. (eds.) Lecture Notes in Computer Science, vol. 2081, pp. 293-303
9. Laurent, M.: A comparison of the Sherali-Adams, Lovász-Schrijver and Lasserre relaxations for 0 - 1 programming. Math. Oper. Res. 28, 470-496 (2003)
10. Laurent, M.: Strengthened semidefinite programming bounds for codes. Math. Program, (in press) (2006)
11. Laurent, M., Rendl, F.: Semidefinite programming and integer programming. In: Aardal, K., Nemhauser, G., Weismantel, R. (eds.) Handbook on Discrete Optimization, pp 393-514 (2005)
12. Lovász, L.: On the Shannon capacity of a graph. IEEE Trans. Inf. Theory 25, 1-7 (1979)
13. Lovász, L., Schrijver, A.: Cones of matrices and set-functions and 0-1 optimization. SIAM J. Optim. 1, 166-190 (1991)
14. McEliece, R.J., Rodemich, E.R., Rumsey, H.C.: The Lovász' bound and some generalizations. J. Comb. Inf. Syst. Sci. 3, 134-152 (1978)
15. Motzkin, T.S., Straus, E.G.: Maxima for graphs and a new proof of a theorem of Túran. Can. J. Math. 17, 533-540 (1965)
16. Parrilo, P.A.: Structured semidefinite programs and semialgebraic geometry methods in robustness and optimization. PhD thesis, California Institute of Technology (2000)
17. Peña, J.F., Vera, J.C., Zuluaga, L.F.: Computing the stability number of a graph via linear and Semideflnite programming. Preprint, 2005. Available at http://www.optimization-online.org/DB_HTML/2005/04/1106.html
18. Pólya, G.: Collected Papers, vol. 2, pp 309-313. MIT Press, Cambridge, Mass., London (1974)
19. Reznick, B.: Some concrete aspects of Hilbert's 17th problem. Preprint. Available at http://www.math.uiuc.edu/~reznick/
20. Reznick, B.: Sums of even powers of real linear forms. Memoirs of the American Mathematical Society, Number 463 (1992)
21. Schrijver, A.: A comparison of the Delsarte and Lovász bounds. IEEE Trans. Inf. Theory 25, 425-429 (1979)
22. Schrijver, A.: Combinatorial Optimization - Polyhedra and Efficiency. Springer, Berlin Heidelberg New York (2003)
23. Schrijver, A.: New code upper bounds from the Terwiliger algebra and semidefinite programming. IEEE Trans. Inf. Theory 51, 2859-2866 (2005)
24. Schweighofer, M.: Optimization of polynomials on compact semialgebraic sets. SIAM J. Optim. 15(3), 805-825 (2005)
25. Wolkowicz, H., Saigal, R., Vandenberghe, L. (eds.) (2000) Handbook of Semidefinite Programming. Kluwer, Boston/Dordrecht/London
26. Zuluaga, L.F., Vera, J.C., Peña, J.F.: LMI approximations for cones of positive semidefinite forms. SIAM J. Optim. 16(4), 1076-1091 (2006)