{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T11:09:57Z","timestamp":1764587397451},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2007,10,23]],"date-time":"2007-10-23T00:00:00Z","timestamp":1193097600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Found Comput Math"],"published-print":{"date-parts":[[2008,10]]},"DOI":"10.1007\/s10208-007-9004-y","type":"journal-article","created":{"date-parts":[[2007,10,22]],"date-time":"2007-10-22T17:34:09Z","timestamp":1193074449000},"page":"607-647","source":"Crossref","is-referenced-by-count":69,"title":["Semidefinite Characterization and Computation of Zero-Dimensional Real Radical Ideals"],"prefix":"10.1007","volume":"8","author":[{"given":"Jean Bernard","family":"Lasserre","sequence":"first","affiliation":[]},{"given":"Monique","family":"Laurent","sequence":"additional","affiliation":[]},{"given":"Philipp","family":"Rostalski","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,10,23]]},"reference":[{"key":"9004_CR1","series-title":"Progress in Mathematics","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-1-4612-2752-6_1","volume-title":"Computational Algebraic Geometry","author":"E. Becker","year":"1993","unstructured":"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.\u00a0109, pp.\u00a01\u201320, Birkh\u00e4user, Boston, 1993."},{"key":"9004_CR2","first-page":"173","volume-title":"Algorithmic Algebra and Number Theory","author":"E. Becker","year":"1997","unstructured":"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.\u00a0173\u2013185, Springer, New York, 1997."},{"key":"9004_CR3","doi-asserted-by":"crossref","first-page":"561","DOI":"10.1016\/S0378-4754(96)00033-X","volume":"42","author":"E. Becker","year":"1996","unstructured":"E. Becker and T. W\u00f6rmann, Radical computations of zero-dimensional ideals and real root counting, Math. Comput. Simul., 42 (1996), 561\u2013569.","journal-title":"Math. Comput. Simul."},{"key":"9004_CR4","unstructured":"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 ."},{"key":"9004_CR5","doi-asserted-by":"crossref","unstructured":"F. Bihan and F. Sottile, New fewnomial upper bounds from Gale dual polynomial systems, Moscow Math. J., 7(3) (2007).","DOI":"10.17323\/1609-4514-2007-7-3-387-407"},{"key":"9004_CR6","unstructured":"D. Bini and B. Mourrain, Polynomial test suite, 1996. Available from http:\/\/www-sop.inria.fr\/saga\/POL ."},{"key":"9004_CR7","volume-title":"G\u00e9om\u00e9trie Alg\u00e9brique R\u00e9elle","author":"J. Bochnak","year":"1987","unstructured":"J. Bochnak, M. Coste, and M.-F. Roy, G\u00e9om\u00e9trie Alg\u00e9brique R\u00e9elle, Springer, New York, 1987."},{"key":"9004_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/3-540-63163-1_4","volume-title":"Applied Algebra, Algebraic Algorithms and Error-Correcting Codes","author":"M. Caboara","year":"1997","unstructured":"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.\u00a01255, pp.\u00a039\u201354, Springer, Berlin, 1997."},{"key":"9004_CR9","unstructured":"P. Conti and C. Traverso, Algorithms for the real radical, Preprint, 1998."},{"key":"9004_CR10","volume-title":"Ideals, Varieties and Algorithms","author":"D. Cox","year":"1997","unstructured":"D. Cox, J. Little, and D. O\u2019Shea, Ideals, Varieties and Algorithms, Springer, New York, 1997."},{"key":"9004_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-6911-1","volume-title":"Using Algebraic Geometry","author":"D. Cox","year":"1998","unstructured":"D. Cox, J. Little, and D. O\u2019Shea, Using Algebraic Geometry, Springer, New York, 1998."},{"key":"9004_CR12","doi-asserted-by":"crossref","unstructured":"R. Curto and L. Fialkow, Solution of the truncated complex moment problem for flat data, Mem. Amer. Math. Soc. 119(568) (1996).","DOI":"10.1090\/memo\/0568"},{"key":"9004_CR13","doi-asserted-by":"crossref","first-page":"2825","DOI":"10.1090\/S0002-9947-00-02472-7","volume":"352","author":"R. Curto","year":"2000","unstructured":"R. Curto and L. Fialkow, The truncated complex K-moment problem, Trans. Amer. Math. Soc. 352 (2000), 2825\u20132855.","journal-title":"Trans. Amer. Math. Soc."},{"key":"9004_CR14","first-page":"315","volume":"48","author":"R. Curto","year":"2002","unstructured":"R. Curto and L. Fialkow, Solution of the singular quartic moment problem, J. Oper. Theory 48 (2002), 315\u2013354.","journal-title":"J. Oper. Theory"},{"key":"9004_CR15","doi-asserted-by":"crossref","DOI":"10.1007\/b105286","volume-title":"Aspects of Semidefinite Programming\u2014Interior Point Algorithms and Selected Applications","author":"E. Klerk de","year":"2002","unstructured":"E. de Klerk, Aspects of Semidefinite Programming\u2014Interior Point Algorithms and Selected Applications, Kluwer Academic, Amsterdam, 2002."},{"key":"9004_CR16","series-title":"Algorithms and Computation in Mathematics","volume-title":"Solving Polynomial Equations: Foundations, Algorithms, and Applications","year":"2005","unstructured":"A. Dickenstein and I. Z. Emiris (eds.), Solving Polynomial Equations: Foundations, Algorithms, and Applications, Algorithms and Computation in Mathematics, Vol.\u00a014, Springer, Berlin, 2005."},{"key":"9004_CR17","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/BF01231331","volume":"110","author":"D. Eisenbud","year":"1992","unstructured":"D. Eisenbud, C. Huneke, and W. Vasconcelos, Direct methods for primary decompositions, Invent. Math. 110 (1992), 207\u2013235.","journal-title":"Invent. Math."},{"key":"9004_CR18","unstructured":"G.-M. Greuel, G. Pfister, and H. Sch\u00f6nemann, 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 ."},{"key":"9004_CR19","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/S0747-7171(88)80040-3","volume":"6","author":"P. Gianni","year":"1988","unstructured":"P. Gianni, B. Trager, and G. Zacharias, Gr\u00f6bner bases and primary decomposition of polynomial ideals, J. Symb. Comput. 6 (1988), 149\u2013167.","journal-title":"J. Symb. Comput."},{"key":"9004_CR20","doi-asserted-by":"crossref","first-page":"871","DOI":"10.1137\/S105262349630009X","volume":"8","author":"D. Goldfarb","year":"1998","unstructured":"D. Goldfarb and K. Scheinberg, Interior point trajectories in semidefinite programming, SIAM J. Optim. 8 (1998), 871\u2013886.","journal-title":"SIAM J. Optim."},{"key":"9004_CR21","series-title":"Lectures Notes in Control and Information Sciences","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/10997703_15","volume-title":"Positive Polynomials in Control","author":"D. Henrion","year":"2005","unstructured":"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.\u00a0312, pp.\u00a0293\u2013310, Springer, New York, 2005."},{"key":"9004_CR22","doi-asserted-by":"crossref","DOI":"10.1090\/mmono\/088","volume-title":"Fewnomials","author":"A. G. Khovanski","year":"1991","unstructured":"A. G. Khovanski, Fewnomials, Am. Math. Soc., Providence, 1991."},{"key":"9004_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/3-540-54522-0_108","volume-title":"Applied Algebra, Algebraic Algorithms and Error-Correcting Codes","author":"T. Krick","year":"1991","unstructured":"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.\u00a0539, pp.\u00a0195\u2013205, Springer, Berlin, 1991."},{"key":"9004_CR24","series-title":"Progress in Mathematics","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1007\/978-1-4612-0441-1_14","volume-title":"Effective Methods in Algebraic Geometry","author":"Y. N. Lakshman","year":"1991","unstructured":"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.\u00a094, pp.\u00a0217\u2013226, Birkh\u00e4user, Boston, 1991."},{"key":"9004_CR25","doi-asserted-by":"crossref","first-page":"796","DOI":"10.1137\/S1052623400366802","volume":"11","author":"J. B. Lasserre","year":"2001","unstructured":"J. B. Lasserre, Global optimization with polynomials and the problem of moments, SIAM J. Optim. 11 (2001), 796\u2013817.","journal-title":"SIAM J. Optim."},{"key":"9004_CR26","doi-asserted-by":"crossref","first-page":"1403","DOI":"10.1090\/S0002-9947-05-03972-3","volume":"358","author":"J. B. Lasserre","year":"2006","unstructured":"J. B. Lasserre, A moment approach to analyze zeros of triangular polynomial sets, Trans. Amer. Math. Soc. 358 (2006), 1403\u20131420.","journal-title":"Trans. Amer. Math. Soc."},{"issue":"10","key":"9004_CR27","doi-asserted-by":"crossref","first-page":"2965","DOI":"10.1090\/S0002-9939-05-08133-5","volume":"133","author":"M. Laurent","year":"2005","unstructured":"M. Laurent, Revisiting two theorems of Curto and Fialkow, Proc. Amer. Math. Soc. 133(10) (2005), 2965\u20132976.","journal-title":"Proc. Amer. Math. Soc."},{"key":"9004_CR28","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10107-004-0561-4","volume":"109","author":"M. Laurent","year":"2007","unstructured":"M. Laurent, Semidefinite representations for finite varieties, Math. Program. 109 (2007), 1\u201326.","journal-title":"Math. Program."},{"key":"9004_CR29","unstructured":"M. Laurent, Moment matrices and optimization over polynomials\u2014A survey on selected topics, Preprint, 2005. Available from http:\/\/homepages.cwi.nl\/~monique\/ ."},{"key":"9004_CR30","unstructured":"J. L\u00f6fberg, 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 ."},{"key":"9004_CR31","series-title":"Lecture Notes in Computer Science","first-page":"431","volume-title":"Proc. Conf. AAECC-13, Honolulu, 1999","author":"B. Mourrain","year":"1999","unstructured":"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.\u00a01719, pp.\u00a0431\u2013443, Springer, Berlin, 1999."},{"key":"9004_CR32","series-title":"Progress in Mathematics","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/978-1-4612-2752-6_15","volume-title":"Computational Algebraic Geometry","author":"P. Pedersen","year":"1993","unstructured":"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.\u00a0109, pp.\u00a0203\u2013224, Birkh\u00e4user, Boston, 1993."},{"key":"9004_CR33","unstructured":"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."},{"key":"9004_CR34","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s11155-005-6891-y","volume":"11","author":"N. Revol","year":"2005","unstructured":"N. Revol and F. Rouillier, Motivations for an arbitrary precision interval arithmetic and the MPFI library, Reliable Comput. 11 (2005), 1\u201316.","journal-title":"Reliable Comput."},{"key":"9004_CR35","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1007\/s002000050114","volume":"9","author":"F. Rouillier","year":"1999","unstructured":"F. Rouillier, Solving zero-dimensional systems through the rational univariate representation, J. Appl. Algebra Eng. Commun. Comput. 9 (1999), 433\u2013461.","journal-title":"J. Appl. Algebra Eng. Commun. Comput."},{"key":"9004_CR36","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1090\/S0002-9947-1974-0349648-2","volume":"197","author":"A. Seidenberg","year":"1974","unstructured":"A. Seidenberg, Constructions in algebra, Trans. Amer. Math. Soc. 197 (1974), 273\u2013313.","journal-title":"Trans. Amer. Math. Soc."},{"key":"9004_CR37","doi-asserted-by":"crossref","DOI":"10.1142\/5763","volume-title":"The Numerical Solution of Systems of Polynomials Arising in Engineering and Science","author":"A. J. Sommese","year":"2005","unstructured":"A. J. Sommese and C. W. Wampler, The Numerical Solution of Systems of Polynomials Arising in Engineering and Science, World Scientific, Singapore, 2005."},{"key":"9004_CR38","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/BF01362149","volume":"207","author":"G. Stengle","year":"1974","unstructured":"G. Stengle, A Nullstellensatz and a Positivstellensatz in semialgebraic geometry, Math. Ann. 207 (1974), 87\u201397.","journal-title":"Math. Ann."},{"key":"9004_CR39","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898717976","volume-title":"Numerical Polynomial Algebra","author":"H.J. Stetter","year":"2004","unstructured":"H.J. Stetter, Numerical Polynomial Algebra, SIAM, Philadelphia, 2004."},{"key":"9004_CR40","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1080\/10556789908805766","volume":"11\/12","author":"J. F. Sturm","year":"1999","unstructured":"J. F. Sturm, Using SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones, Optim. Methods Softw. 11\/12 (1999), 625\u2013653. Special issue on Interior Point Methods (CD supplement with software).","journal-title":"Optim. Methods Softw."},{"issue":"6","key":"9004_CR41","doi-asserted-by":"crossref","first-page":"1105","DOI":"10.1080\/1055678021000045123","volume":"17","author":"J. F. Sturm","year":"2002","unstructured":"J. F. Sturm, Implementation of interior point methods for mixed semidefinite and second order cone optimization problems, Optim. Methods Softw. 17(6) (2002), 1105\u20131154.","journal-title":"Optim. Methods Softw."},{"issue":"1","key":"9004_CR42","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1137\/1038003","volume":"38","author":"L. Vandenberghe","year":"1996","unstructured":"L. Vandenberghe and S. Boyd, Semidefinite programming, SIAM Rev. 38(1) (1996), 49\u201395.","journal-title":"SIAM Rev."},{"issue":"2","key":"9004_CR43","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1145\/317275.317286","volume":"25","author":"J. Verschelde","year":"1999","unstructured":"J. Verschelde, Algorithm 795: PHCpack: A general-purpose solver for polynomial systems by homotopy continuation, ACM Trans. Math. Softw. 25(2) (1999), 251\u2013276.","journal-title":"ACM Trans. Math. Softw."},{"issue":"1","key":"9004_CR44","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1006\/aama.1995.1005","volume":"16","author":"J. Verschelde","year":"1995","unstructured":"J. Verschelde and K. Gatermann, Symmetric Newton polytopes for solving sparse polynomial systems, Adv. Appl. Math. 16(1) (1995), 95\u2013127.","journal-title":"Adv. Appl. Math."},{"key":"9004_CR45","volume-title":"Handbook of Semidefinite Programming","year":"2000","unstructured":"H. Wolkowicz, R. Saigal, and L. Vandenberghe (eds.), Handbook of Semidefinite Programming, Kluwer Academic, Boston, 2000."}],"container-title":["Foundations of Computational Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10208-007-9004-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10208-007-9004-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10208-007-9004-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T11:05:09Z","timestamp":1559127909000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10208-007-9004-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,10,23]]},"references-count":45,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2008,10]]}},"alternative-id":["9004"],"URL":"https:\/\/doi.org\/10.1007\/s10208-007-9004-y","relation":{},"ISSN":["1615-3375","1615-3383"],"issn-type":[{"value":"1615-3375","type":"print"},{"value":"1615-3383","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,10,23]]}}}