Semidefinite programming relaxations for semialgebraic problems

Mathematical Programming, Series B

Volumn 96, Issue 2, 2003, Pages 293-320

  Parrilo, Pablo A ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

Convex optimization; Polynomial equations real algebraic geometry; Semidefinite programming; Sums of squares

Indexed keywords

ALGEBRA; GEOMETRY; NONLINEAR EQUATIONS; POLYNOMIALS; PROBLEM SOLVING;

CONVEX OPTIMIZATION; MULTIVARIATE POLYNOMIALS; POLYNOMIAL EQUATIONS REAL ALGEBRAIC GEOMETRY; SEMIALGEBRAIC PROBLEMS; SEMIDEFINITE PROGRAMMING; SUMS OF SQUARES;

MATHEMATICAL PROGRAMMING;

EID: 1542266056     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10107-003-0387-5     Document Type: Article

References (55)

1. [BCR98] Bochnak, J., Coste, M., Roy, M-F.: Real Algebraic Geometry. Springer, 1998
2. [BL68] Bose, N.K., Li, C.C.: A quadratic form representation of polynomials of several variables and its applications. IEEE Transactions on Automatic Control 14, 447-448 (1968)
3. [Bos82] Bose, N.K.: Applied multidimensional systems theory. Van Nostrand Reinhold, 1982
4. [BPR96] Basu, S., Pollack, R., Roy, M.-F.: On the combinatorial and algebraic complexity of quantifier elimination. J. ACM 43(6), 1002-1045 (1996)
5. [Bro87] Brownawell, W.D.: Bounds for the degrees in the Nullstellensatz. Annals of Mathematics 126, 577-591 (1987)
6. [BS91] Berenstein, C.A., Struppa, D.C.: Recent improvements in the complexity of the effective Nullstellensatz. Linear Algebra and its Applications 157(2), 203-215 (1991)
7. [CL77] Choi, M.D., Lam, T.Y.: An old question of Hilbert. Queen's papers in pure and applied mathematics 46, 385-405 (1977)
8. [CLO97] Cox, D.A., Little, J.B., O'Shea, D.: Ideals, varieties, and algorithms: an introduction to computational algebraic geometry and commutative algebra. Springer, 1997
9. [CLR95] Choi, M.D., Lam, T.Y., Reznick, B.: Sums of squares of real polynomials. Proceedings of Symposia in Pure Mathematics 58(2), 103-126 (1995)
10. [CPS92] Cottle, R.W., Pang, J.S., Stone, R.E.: The linear complementarity problem. Academic Press, 1992
11. [Dia62] Diananda, P.H.: On non-negative forms in real variables some or all of which are non-negative. Proceedings of the Cambridge Philosophical Society 58, 17-25 (1962)
12. [dKP02] de Klerk, E., Pasechnik, D.V.: Approximating the stability number of a graph via copositive programming. SIAM J. Optim. 12(4), 875-892 (2002)
13. [Fer98] Ferrier, Ch.: Hilbert's 17th problem and best dual bounds in quadratic minimization. Cybernetics and Systems Analysis 34(5), 696-709 (1998)
14. [Fu98] Fu, M.: Comments on A procedure for the positive definiteness of forms of even order. IEEE Transactions on Automatic Control 43(10), 1430 (1998)
15. [GP01] Gatermann, K., Parrilo, P.A.: Symmetry groups, semidefinite programs, and sums of squares. Submitted, available from arXiv:math.AC/0211450, 2002
16. [GV02] Grigoriev, D., Vorobjov, N.: Complexity of Null- and Positivstellensatz proofs. Annals of Pure and Applied Logic 113(1-3), 153-160 (2002)
17. [GW95] Goemans, M.X., Williamson, D.P.: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. ACM 42(6), 1115-1145 (1995)
18. [HH96] Hasan, M.A., Hasan, A.A.: A procedure for the positive definiteness of forms of even order. IEEE Transactions on Automatic Control 41(4), 615-617 (1996)
19. [Ily92] Ilyushechkin, N.V.: The discriminant of the characteristic polynomial of a normal matrix. Math. Zameski 51, 16-23 (1992)
20. ; Englis translation in Math. Notes 51, 230-235 (1992)
21. [Kol88] Kollár, J.: Sharp effective Nullstellensatz. J. Amer. Math. Soc. 1, 963-975 (1988)
22. [Las01] Lasserre, J.B.: Global optimization with polynomials and the problem of moments. SIAM J. Optim. 11(3), 796-817 (2001)
23. [Lau] Laurent, M.: A comparison of the Sherali-Adams, Lovász-Schrijver and Lasserre relaxations for 0-1 programming. Technical Report PNA-R0108, CWI, Amsterdam, 2001
24. [Lax98] Lax, P.D.: On the discriminant of real symmetric matrices. Communications on Pure and Applied Mathematics LI, 1387-1396 (1998)
25. [Lov94] Lovász, L.: Stable sets and polynomials. Discrete mathematics 124, 137-153 (1994)
26. [LS91] Lovász, L., Schrijver, A.: Cones of matrices and set-functions and 0-1 optimization. SIAM J. Optim. 1(2), 166-190 (1991)
27. [Mis93] Mishra, B.: Algorithmic Algebra. Springer-Verlag, 1993
28. [MK87] Murty, K.G., Kabadi, S.N.: Some NP-complete problems in quadratic and nonlinear programming. Mathematical Programming 39, 117-129 (1987)
29. [Mun99] Munro, N.: editor. The Use of Symbolic Methods in Control System Analysis and Design, volume 56 of Control engineering series. IEE Books, 1999
30. [Nes00] Nesterov, Y.: Squared functional systems and optimization problems. In: J.B.G. Frenk, C. Roos, T. Terlaky, S. Zhang, editors, High Performance Optimization, pages 405-440. Kluwer Academic Publishers, 2000
31. [Par00a] Parrilo, P.A.: On a decomposition for multivariable forms via LMI methods. In: Proceedings of the American Control Conference, 2000
32. [Par00b] Parrilo, P.A.: Structured semidefinite programs and semialgebraic geometry methods in robustness and optimization. PhD thesis, California Institute of Technology, May 2000. Available at http://www.cds. caltech.edu/~pablo/
33. [Par02a] Parrilo, P.A.: An explicit construction of distinguished representations of polynomials nonnegative over finite sets. Technical Report IfA Technical Report AUT02-02. Available from http://www.aut.ee.ethz.ch/ ~parrilo, ETH Zürich, 2002
34. [Par02b] Parrilo, P.A.: Positivstellensatz and distinguished representations approaches for optimization: a comparison. In preparation, 2002
35. [PPP02] Prajna, S., Papachristodoulou, A., Parrilo, P.A.: SOSTOOLS: Sum of squares optimization tool-box for MATLAB, 2002. Available from http://www.cds.caltech.edu/sostools and http://www.aut.ee.ethz.ch/~parrilo/ sostools
36. [PR01] Powers, V., Reznick, B.: A new bound for Pólya's theorem with applications to polynomials positive on polyhedra. J. Pure Appl. Algebra 164(1-2), 221-229 (2001)
37. [PS01] Parrilo, P.A., Sturmfels, B.: Minimizing polynomial functions. Submitted to the DIMACS volume of the Workshop on Algorithmic and Quantitative Aspects of Real Algebraic Geometry in Mathematics and Computer Science. Available from arXiv:math.OC/010 3170, 2001
38. [PW98] Powers, V., Wörmann, T.: An algorithm for sums of squares of real polynomials. Journal of pure and applied algebra 127, 99-104 (1998)
39. [QDRT98] Quist, A.J., De Klerk, E., Roos, C., Terlaky, T.: Copositive relaxation for general quadratic programming. Optimization methods and software 9, 185-208 (1998)
40. [Raj93] Rajwade, A.R.: Squares, volume 171 of London Mathematical Society Lecture Note Series. Cambridge University Press, 1993
41. [Rez78] Reznick, B.: Extremal PSD forms with few terms. Duke Mathematical Journal 45(2), 363-374 (1978)
42. [Rez95] Reznick, B.: Uniform denominators in Hilbert's seventeenth problem. Math Z. 220, 75-97 (1995)
43. [Rez00] Reznick, B.: Some concrete aspects of Hilbert's 17th problem. In: Contemporary Mathematics, volume 253, pages 251-272. American Mathematical Society, 2000
44. [SA90] Sherali, H.D., Adams, W.P.: A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems. SIAM J. Disc. Math. 3(3), 411-430 (1990)
45. [SA99] Sherali, H.D., Adams, W.P.: A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems. Kluwer Academic Publishers, 1999
46. [Sch91] Schmüdgen, K.: The k-moment problem for compact semialgebraic sets. Math. Ann. 289, 203-206 (1991)
47. [Sho87] Shor, N.Z.: Class of global minimum bounds of polynomial functions. Cybernetics 23(6), 731-734 (1987);
48. Russian orig.: Kibernetika, 6, 9-11 (1987)
49. [Sho98] Shor, N.Z.: Nondiferentiable Optimization and Polynomial Problems. Kluwer Academic Publishers, 1998
50. [Ste74] Stengle, G.: A Nullstellensatz and a Positivstellensatz in semialgebraic geometry. Math. Ann. 207, 87-97(1974)
51. [Ste96] Stengle, G.: Complexity estimates for the Schmüdgen Positivstellensatz. J. Complexity 12(2), 167-174 (1996)
52. [Stu99] Sturm, J.: SeDuMi version 1.03. September 1999. Available from http://www.unim-aas.nl/~sturm/software/sedumi.html
53. [Väl86] Väliaho, H.: Criteria for copositive matrices. Linear Algebra and its applications 81, 19-34 (1986)
54. [VB96] Vandenberghe, L., Boyd, S.: Semidefinite programming. SIAM Review 38(1), 49-95 (1996)
55. [WSV00] Wolkowicz, H., Saigal, R., Vandenberghe, L.: editors. Handbook of Semidefinite Programming. Kluwer, 2000