Introduction to semidefinite, conic and polynomial optimization

International Series in Operations Research and Management Science

Volumn 166, Issue , 2012, Pages 1-22

  Anjos, Miguel F ^a   Lasserre, Jean B ^b  

^a GERAD   (Canada)

^b LAAS CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84940751969     PISSN: 08848289     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-1-4614-0769-0_1     Document Type: Chapter

References (29)

1. de Klerk, E.: Aspects of Semidefinite Programming. Kluwer Academic Publishers, Dordrecht, (2002)
2. de Klerk, E., Pasechnik, D. V., Schrijver, A.: Reduction of symmetric semidefinite programs using the regular _-representation. Math. Program. 109, 613-624 (2007)
3. Gaterman, K., Parrilo, P.: Symmetry group, semidefinite programs and sums of squares. J. Pure Appl. Alg. 192, 95-128 (2004)
4. Goemans, M. X., Williamson, D. P.: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. Assoc. Comput. Mach. 42(6), 1115-1145 (1995)
5. Golub, G. H., Van Loan, C. F.: Matrix Computations. Johns Hopkins University Press, Baltimore, MD, third edition (1996)
6. Grötschel, M., Lovász, L., Schrijver, A.: Geometric Algorithms and Combinatorial Optimization. Springer-Verlag, Berlin, second edition (1993)
7. Henrion, D., Lasserre, J. B., Lofberg, Y.: Gloptipoly 3: moments, optimization and semidefinite programming. Optim. Methods and Software 24, 761-779 (2009)
8. Horn, R. A., Johnson, C. R.: Matrix Analysis. Cambridge University Press, Cambridge (1990)
9. Krivine, J. L.: Anneaux préordonnés. J. Anal. Math. 12, 307-326 (1964)
10. Laraki, R., Lasserre, J. B.: Semidefinite programming for min-max problems and games. Math. Program. 1-28 http: //dx. doi. org/10. 1007/s10107-010-0353-y
11. Lasserre, J. B.: Global optimization with polynomials and the problem of moments. SIAM J. Optim. 11, 796-817 (2001)
12. Lasserre, J. B.: Polynomial programming: LP-relaxations also converge. SIAM J. Optim. 15, 383-393 (2004)
13. Lasserre, J. B.: Convergent SDP-relaxations in polynomial optimization with sparsity. SIAM J. Optim. 17, 822-843 (2006)
14. Lasserre, J. B.: Moments, Positive Polynomials and Their Applications. Imperial College Press, London (2009)
15. Lasserre, J. B.: Convexity in semi-algebraic geometry and polynomial optimization. SIAM J. Optim. 19, 1995-2014 (2009)
16. 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)
17. Laurent, M., Rendl, F.: Semidefinite programming and integer programming. In: Aardal, K., Nemhauser, G., Weismantel, R. (eds.) Handbook on Discrete Optimization, Elsevier (2005)
18. Parrilo, P. A.: Semidefinite programming relaxations for semialgebraic problems. Math. Program. Ser. B 96, 293-320 (2003)
19. Parrilo, P. A.: Polynomial games and sum of squares optimization. Proceedings of the 45th IEEE Conference on Decision and Control, San Diego, pp. 2855-2860 (2006)
20. Prajna, S., Papachristodoulou A., Parrilo, P.: Introducing SOSTOOLS: a general purpose sum of squares programming solver. Proceedings of the 41st IEEE Conference on Decison and Control, Las Vegas, pp. 741-746 (2002)
21. Putinar, M.: Positive polynomials on compact semi-algebraic sets. Indiana Univ. Math. J. 42, 969-984 (1993)
22. Ramana, M. V.: An exact duality theory for semidefinite programming and its complexity implications. Math. Program., 77(2, Ser. B), 129-162 (1997)
23. Schmüdgen, K.: The K-moment problem for compact semi-algebraic sets. Math. Ann. 289, 203-206 (1991)
24. Schweighofer, M.: Optimization of polynomials on compact semialgebraic sets. SIAM J. Optim. 15, 805-825 (2005)
25. Vallentin, F.: Symmetry in semidefinite programs. Linear Alg. Appl. 430, 360-369 (2009)
26. Waki, S., Kim, S., Kojima, M., Maramatsu, M.: Sums of squares and semidefinite programming relaxations for polynomial optimization problems witth structured sparsity. SIAMJ. Optim. 17, 218-242 (2006)
27. Waki, H., Kim, S., Kojima, M., Muramatsu, M., Sugimoto, H.: SparsePOP: a Sparse Semidefinite Programming Relaxation of Polynomial Optimization Problems. ACM Trans. Math. Software 35(2), 15: 1-15: 13 (2008)
28. Wolkowicz, H., Anjos, M. F.: Semidefinite programming for discrete optimization and matrix completion problems. Discrete Appl. Math., 123(1-2), 513-577 (2002)
29. Wolkowicz, H., Saigal, R., Vandenberghe, L. (eds.): Handbook of Semidefinite Programming. Kluwer Academic Publishers, Boston, MA (2000)