{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,15]],"date-time":"2026-06-15T17:40:29Z","timestamp":1781545229267,"version":"3.54.5"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2006,6,2]],"date-time":"2006-06-02T00:00:00Z","timestamp":1149206400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2007,1]]},"DOI":"10.1007\/s10107-004-0561-4","type":"journal-article","created":{"date-parts":[[2006,6,2]],"date-time":"2006-06-02T15:30:40Z","timestamp":1149262240000},"page":"1-26","source":"Crossref","is-referenced-by-count":54,"title":["Semidefinite representations for finite varieties"],"prefix":"10.1007","volume":"109","author":[{"given":"Monique","family":"Laurent","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2006,6,2]]},"reference":[{"key":"561_CR1","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/BF01581273","volume":"58","author":"Balas","year":"1993","unstructured":"Balas, E., Ceria, S., Cornu\u00e9jols, G.: A lift-and-project cutting plane algorithm for mixed 0-1 programs. Mathematical Programming 58, 295\u2013324 (1993)","journal-title":"Mathematical Programming"},{"key":"561_CR2","doi-asserted-by":"crossref","unstructured":"Basu, S., Pollack, R., Roy, M.-F.: Algorithms in Real Algebraic Geometry. Springer, 2003","DOI":"10.1007\/978-3-662-05355-3"},{"key":"561_CR3","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1137\/S1052623400382467","volume":"12","author":"Burer","year":"2002","unstructured":"Burer, S., Monteiro, R.D.C., Zhang, Y.: Rank-two heuristics for max-cut and other binary quadratic programs. SIAM Journal on Optimization 12, 503\u2013521 (2002)","journal-title":"SIAM Journal on Optimization"},{"key":"561_CR4","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/s10107-002-0356-4","volume":"94","author":"Burer","year":"2002","unstructured":"Burer, S., Monteiro, R.D.C., Zhang, Y.: Maximum stable set formulations and heuristics based on continuous optimization. Mathematical Programming 94, 137\u2013166 (2002)","journal-title":"Mathematical Programming"},{"key":"561_CR5","unstructured":"Cox, D.A., Little, J.B., O'Shea, D.: Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra. Springer, 1997"},{"key":"561_CR6","doi-asserted-by":"crossref","unstructured":"Cox, D.A., Little, J.B., O'Shea, D.: Using Algebraic Geometry. Graduate Texts in Mathematics, Number 185, Springer, New York, 1998","DOI":"10.1007\/978-1-4757-6911-1"},{"key":"561_CR7","doi-asserted-by":"crossref","unstructured":"Curto, R.E., Fialkow, L.A.: Solution of the truncated complex moment problem for flat data. Memoirs of the American Mathematical Society vol. 119, n. 568 (1996)","DOI":"10.1090\/memo\/0568"},{"key":"561_CR8","first-page":"47","volume":"1","author":"Fuglede","year":"1983","unstructured":"Fuglede, B.: The multidimensional moment problem. Expositiones Mathematicae 1, 47\u201365 (1983)","journal-title":"Expositiones Mathematicae"},{"key":"561_CR9","doi-asserted-by":"crossref","first-page":"490","DOI":"10.1137\/04060562X","volume":"16","author":"Jibetean","year":"2005","unstructured":"Jibetean, D., Laurent, M.: Semidefinite approximations for global unconstrained polynomial optimization. SIAM Journal on Optimization 16, 490\u2013514 (2005)","journal-title":"SIAM Journal on Optimization"},{"key":"561_CR10","doi-asserted-by":"crossref","unstructured":"Landau, H.: Classic background of the moment problem. In Moments in Mathematics, Proceedings of Symposia in Applied Mathematics, vol. 37, AMS, Providence, 1987, pp. 1\u201315","DOI":"10.1090\/psapm\/037\/921082"},{"key":"561_CR11","doi-asserted-by":"crossref","first-page":"796","DOI":"10.1137\/S1052623400366802","volume":"11","author":"Lasserre","year":"2001","unstructured":"Lasserre, J.B.: Global optimization with polynomials and the problem of moments. SIAM Journal on Optimization 11, 796\u2013817 (2001)","journal-title":"SIAM Journal on Optimization"},{"key":"561_CR12","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/3-540-45535-3_23","volume":"2081","author":"Lasserre","year":"2001","unstructured":"Lasserre, J.B.: An explicit exact SDP relaxation for nonlinear 0\u20131 programs. In: K. Aardal, A.M.H. Gerards, (eds.), Lecture Notes in Computer Science 2081, 293\u2013303 (2001)","journal-title":"In: K. Aardal, A.M.H. Gerards, (eds.), Lecture Notes in Computer Science"},{"key":"561_CR13","doi-asserted-by":"crossref","first-page":"631","DOI":"10.1090\/S0002-9947-01-02898-7","volume":"354","author":"Lasserre","year":"2001","unstructured":"Lasserre, J.B.: Polynomials nonnegative on a grid and discrete representations. Transactions of the American Mathematical Society 354, 631\u2013649 (2001)","journal-title":"Transactions of the American Mathematical Society"},{"key":"561_CR14","doi-asserted-by":"crossref","first-page":"470","DOI":"10.1287\/moor.28.3.470.16391","volume":"28","author":"Laurent","year":"2003","unstructured":"Laurent, M.: A comparison of the Sherali-Adams, Lov\u00e1sz-Schrijver and Lasserre relaxations for 0-1 programming. Mathematics of Operations Research 28, 470\u2013496 (2003)","journal-title":"Mathematics of Operations Research"},{"key":"561_CR15","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1137\/1.9780898718805.ch16","volume":"4","author":"Laurent","year":"2004","unstructured":"Laurent, M.: Semidefinite relaxations for Max-Cut. In: The Sharpest Cut: The Impact of Manfred Padberg and His Work. M. Gr\u00f6tschel, ed. MPS-SIAM Series in Optimization 4, 257\u2013290 (2004)","journal-title":"In: The Sharpest Cut: The Impact of Manfred Padberg and His Work. M. Gr\u00f6tschel, ed. MPS-SIAM Series in Optimization"},{"key":"561_CR16","doi-asserted-by":"crossref","first-page":"871","DOI":"10.1287\/moor.28.4.871.20508","volume":"28","author":"Laurent","year":"2003","unstructured":"Laurent, M.: Lower bound for the number of iterations in semidefinite relaxations for the cut polytope. Mathematics of Operations Research 28, 871\u2013883 (2003)","journal-title":"Mathematics of Operations Research"},{"key":"561_CR17","doi-asserted-by":"crossref","unstructured":"Laurent, M.: Revisiting two theorems of Curto and Fialkow on moment matrices. Preprint, 2004. To appear in Proceedings of the American Mathematical Society 133, 2965\u20132976 (2005)","DOI":"10.1090\/S0002-9939-05-08133-5"},{"key":"561_CR18","doi-asserted-by":"crossref","unstructured":"Lov\u00e1sz, L.: On the Shannon capacity of a graph. IEEE Transactions on Information Theory IT-25, 1\u20137 (1979)","DOI":"10.1109\/TIT.1979.1055985"},{"key":"561_CR19","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1137\/0801013","volume":"1","author":"Lov\u00e1sz","year":"1991","unstructured":"Lov\u00e1sz, L., Schrijver, A.: Cones of matrices and set-functions and 0-1 optimization. SIAM Journal on Optimization 1, 166\u2013190 (1991)","journal-title":"SIAM Journal on Optimization"},{"key":"561_CR20","doi-asserted-by":"crossref","first-page":"575","DOI":"10.4153\/CMB-2003-054-7","volume":"46","author":"Marshall","year":"2003","unstructured":"Marshall, M.: Optimization of polynomial functions. Canad. Math. Bull. 46, 575\u2013587 (2003)","journal-title":"Canad. Math. Bull."},{"key":"561_CR21","doi-asserted-by":"crossref","unstructured":"Nesterov, Y.: Squared functional systems and optimization problems. In: J.B.G. Frenk, C. Roos, T. Terlaky, S. Zhang, (eds.), High Performance Optimization, Kluwer Academic Publishers, 2000, pp. 405\u2013440","DOI":"10.1007\/978-1-4757-3216-0_17"},{"key":"561_CR22","unstructured":"Parrilo, P.A.: Structured semidefinite programs and semialgebraic geometry methods in robustness and optimization. PhD thesis, California Institute of Technology, May, 2000"},{"key":"561_CR23","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/s10107-003-0387-5","volume":"96","author":"Parrilo","year":"2003","unstructured":"Parrilo, P.A.: Semidefinite programming relaxations for semialgebraic problems. Mathematical Programming B 96, 293\u2013320 (2003)","journal-title":"Mathematical Programming B"},{"key":"561_CR24","unstructured":"Parrilo, P.A.: An explicit construction of distinguished representations of polynomials nonnegative over finite sets. Preprint, ETH, Z\u00fcrich, 2002"},{"key":"561_CR25","doi-asserted-by":"crossref","unstructured":"Parrilo, P., Sturmfels, B.: Minimizing polynomial functions. In: Algorithmic and quantitative real algebraic geometry, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 60, AMS, 2003, pp. 83\u201399","DOI":"10.1090\/dimacs\/060\/08"},{"key":"561_CR26","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/S0022-4049(97)83827-3","volume":"127","author":"Powers","year":"1998","unstructured":"Powers, V., W\u00f6rmann, T.: An algorithm for sums of squares of real polynomials. Journal of Pure and Applied Algebra 127, 99\u2013104 (1998)","journal-title":"Journal of Pure and Applied Algebra"},{"key":"561_CR27","doi-asserted-by":"crossref","first-page":"969","DOI":"10.1512\/iumj.1993.42.42045","volume":"42","author":"Putinar","year":"1993","unstructured":"Putinar, M.: Positive polynomials on compact semi-algebraic sets. Indiana University Mathematics Journal 42, 969\u2013984 (1993)","journal-title":"Indiana University Mathematics Journal"},{"key":"561_CR28","doi-asserted-by":"crossref","first-page":"805","DOI":"10.1137\/S1052623403431779","volume":"15","author":"Schweighofer","year":"2005","unstructured":"Schweighofer, M.: Optimization of polynomials on compact semialgebraic sets. SIAM Journal on Optimization 15, 805\u2013825 (2005)","journal-title":"SIAM Journal on Optimization"},{"key":"561_CR29","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1137\/0403036","volume":"3","author":"Sherali","year":"1990","unstructured":"Sherali, H.D., Adams, W.P.: A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems. SIAM Journal on Discrete Mathematics 3, 411\u2013430 (1990)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"561_CR30","first-page":"102","volume":"5","author":"Shor","year":"1987","unstructured":"Shor, N.Z.: An approach to obtaining global extremums in polynomial mathematical programming problems. Kibernetika 5, 102\u2013106 (1987)","journal-title":"Kibernetika"},{"key":"561_CR31","doi-asserted-by":"crossref","unstructured":"Sturmfels, B.: Solving Systems of Polynomial Equations. CBMS, Regional Conference Series in Mathematics, Number 97, AMS, Providence, 2002","DOI":"10.1090\/cbms\/097"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-004-0561-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-004-0561-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-004-0561-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T09:49:57Z","timestamp":1559123397000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-004-0561-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,6,2]]},"references-count":31,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2007,1]]}},"alternative-id":["561"],"URL":"https:\/\/doi.org\/10.1007\/s10107-004-0561-4","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,6,2]]}}}