Semidefinite characterization and computation of zero-dimensional real radical ideals

Foundations of Computational Mathematics

Volumn 8, Issue 5, 2008, Pages 607-647

  Lasserre, Jean Bernard ^a,b   Laurent, Monique ^c   Rostalski, Philipp ^d  

^a LAAS CNRS   (France)

^b INSTITUT DE MATHÉMATIQUES DE TOULOUSE   (France)

^c CWI   (Netherlands)

^d ETH ZURICH   (Switzerland)

Author keywords

(Real) radical ideal; Algebraic geometry; Semidefinite programming; Zero dimensional ideal

Indexed keywords

(REAL) RADICAL IDEAL; ALGEBRAIC GEOMETRY; COMPLEX COMPONENTS; NUMERICAL LINEAR ALGEBRA; SEMI-DEFINITE PROGRAMMING; SEMIDEFINITE OPTIMIZATION; ZERO-DIMENSIONAL; ZERO-DIMENSIONAL IDEAL;

ALGORITHMS; LINEAR ALGEBRA;

MATHEMATICAL PROGRAMMING;

EID: 52949150070     PISSN: 16153375     EISSN: 16153383     Source Type: Journal    
DOI: 10.1007/s10208-007-9004-y     Document Type: Article

References (45)

1. E. Becker and R. Neuhaus, Computation of real radicals of polynomial ideals, in Computational Algebraic Geometry (F. Eyssette and A. Galligo, eds.), Progress in Mathematics, Vol. 109, pp. 1-20, Birkhäuser, Boston, 1993.
2. E. Becker and J. Schmid, On the real Nullstellensatz, in Algorithmic Algebra and Number Theory (B. H. Matzat, G.-M. Greuel, G. Hiss, eds.), pp. 173-185, Springer, New York, 1997.
3. E. Becker T. Wörmann 1996 Radical computations of zero-dimensional ideals and real root counting Math. Comput. Simul. 42 561 569
4. F. Bihan, J. M. Rojas, and C. E. Stella, First steps in algorithmic fewnomial theory, 2004. Available from http://www.arxiv.org/abs/math/0411107.
5. F. Bihan and F. Sottile, New fewnomial upper bounds from Gale dual polynomial systems, Moscow Math. J., 7(3) (2007).
6. D. Bini and B. Mourrain, Polynomial test suite, 1996. Available from http://www-sop.inria.fr/saga/POL.
7. J. Bochnak, M. Coste, and M.-F. Roy, Géométrie Algébrique Réelle, Springer, New York, 1987.
8. M. Caboara, P. Conti, and C. Traverso, Yet another ideal decomposition algorithm, in Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, Lecture Notes in Computer Science, Vol. 1255, pp. 39-54, Springer, Berlin, 1997.
9. P. Conti and C. Traverso, Algorithms for the real radical, Preprint, 1998.
10. D. Cox, J. Little, and D. O'Shea, Ideals, Varieties and Algorithms, Springer, New York, 1997.
11. D. Cox, J. Little, and D. O'Shea, Using Algebraic Geometry, Springer, New York, 1998.
12. R. Curto and L. Fialkow, Solution of the truncated complex moment problem for flat data, Mem. Amer. Math. Soc. 119(568) (1996).
13. R. Curto L. Fialkow 2000 The truncated complex K-moment problem Trans. Amer. Math. Soc. 352 2825 2855
14. R. Curto L. Fialkow 2002 Solution of the singular quartic moment problem J. Oper. Theory 48 315 354
15. E. de Klerk, Aspects of Semidefinite Programming-Interior Point Algorithms and Selected Applications, Kluwer Academic, Amsterdam, 2002.
16. A. Dickenstein and I. Z. Emiris (eds.), Solving Polynomial Equations: Foundations, Algorithms, and Applications, Algorithms and Computation in Mathematics, Vol. 14, Springer, Berlin, 2005.
17. D. Eisenbud C. Huneke W. Vasconcelos 1992 Direct methods for primary decompositions Invent. Math. 110 207 235
18. G.-M. Greuel, G. Pfister, and H. Schönemann, Singular 3.0. A computer algebra system for polynomial computations, Centre for Computer Algebra, University of Kaiserslautern, 2005. Available from http://www.singular. uni-kl.de.
19. P. Gianni B. Trager G. Zacharias 1988 Gröbner bases and primary decomposition of polynomial ideals J. Symb. Comput. 6 149 167
20. D. Goldfarb K. Scheinberg 1998 Interior point trajectories in semidefinite programming SIAM J. Optim. 8 871 886
21. D. Henrion and J. B. Lasserre, Detecting global optimality and extracting solutions in gloptiPoly, in Positive Polynomials in Control (D. Henrion and A. Garulli, eds.), Lectures Notes in Control and Information Sciences, Vol. 312, pp. 293-310, Springer, New York, 2005.
22. A. G. Khovanski, Fewnomials, Am. Math. Soc., Providence, 1991.
23. T. Krick and A. Logar, An algorithm for the computation of the radical of an ideal in the ring of polynomials, in Applied Algebra, Algebraic Algorithms and Error-Correcting Codes (New Orleans, LA, 1991), Lecture Notes in Computer Science, Vol. 539, pp. 195-205, Springer, Berlin, 1991.
24. Y. N. Lakshman and D. Lazard, On the complexity of zero-dimensional algebraic systems, in Effective Methods in Algebraic Geometry (T. Mora and C. Traverso, eds.), Progress in Mathematics, Vol. 94, pp. 217-226, Birkhäuser, Boston, 1991.
25. J. B. Lasserre 2001 Global optimization with polynomials and the problem of moments SIAM J. Optim. 11 796 817
26. J. B. Lasserre 2006 A moment approach to analyze zeros of triangular polynomial sets Trans. Amer. Math. Soc. 358 1403 1420
27. M. Laurent 2005 Revisiting two theorems of Curto and Fialkow Proc. Amer. Math. Soc. 133 10 2965 2976
28. M. Laurent 2007 Semidefinite representations for finite varieties Math. Program. 109 1 26
29. M. Laurent, Moment matrices and optimization over polynomials-A survey on selected topics, Preprint, 2005. Available from http://homepages.cwi.nl/ ~monique/.
30. J. Löfberg, YALMIP: A toolbox for modeling and optimization in MATLAB, in Proceedings of CACSD, Taipei, Taiwan, 2004. Available from http://control.ee.ethz.ch/~joloef/yalmip.php.
31. B. Mourrain, A new criterion for normal form algorithms, in Proc. Conf. AAECC-13, Honolulu, 1999 (M. Fossorier et al., eds.), Lecture Notes in Computer Science, Vol. 1719, pp. 431-443, Springer, Berlin, 1999.
32. P. Pedersen, M.-F. Roy, and A. Szpirglas, Counting real zeros in the multivariate case, in Computational Algebraic Geometry (F. Eyssette, A. Galligo, eds.), Progress in Mathematics, Vol. 109, pp. 203-224, Birkhäuser, Boston, 1993.
33. G. Reid and L. Zhi, Solving nonlinear polynomial system via symbolic-numeric elimination method, in Proceedings of the International Conference on Polynomial System Solving, 2004.
34. N. Revol F. Rouillier 2005 Motivations for an arbitrary precision interval arithmetic and the MPFI library Reliable Comput. 11 1 16
35. F. Rouillier 1999 Solving zero-dimensional systems through the rational univariate representation J. Appl. Algebra Eng. Commun. Comput. 9 433 461
36. A. Seidenberg 1974 Constructions in algebra Trans. Amer. Math. Soc. 197 273 313
37. A. J. Sommese and C. W. Wampler, The Numerical Solution of Systems of Polynomials Arising in Engineering and Science, World Scientific, Singapore, 2005.
38. G. Stengle 1974 A Nullstellensatz and a Positivstellensatz in semialgebraic geometry Math. Ann. 207 87 97
39. H.J. Stetter, Numerical Polynomial Algebra, SIAM, Philadelphia, 2004.
40. J. F. Sturm 1999 Using SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones Optim. Methods Softw. 11/12 625 653 Special issue on Interior Point Methods (CD supplement with software)
41. J. F. Sturm 2002 Implementation of interior point methods for mixed semidefinite and second order cone optimization problems Optim. Methods Softw. 17 6 1105 1154
42. L. Vandenberghe S. Boyd 1996 Semidefinite programming SIAM Rev. 38 1 49 95
43. J. Verschelde 1999 Algorithm 795: PHCpack: A general-purpose solver for polynomial systems by homotopy continuation ACM Trans. Math. Softw. 25 2 251 276
44. J. Verschelde K. Gatermann 1995 Symmetric Newton polytopes for solving sparse polynomial systems Adv. Appl. Math. 16 1 95 127
45. H. Wolkowicz, R. Saigal, and L. Vandenberghe (eds.), Handbook of Semidefinite Programming, Kluwer Academic, Boston, 2000.