{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T07:44:24Z","timestamp":1776843864676,"version":"3.51.2"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2010,2,13]],"date-time":"2010-02-13T00:00:00Z","timestamp":1266019200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2010,12]]},"DOI":"10.1007\/s10898-010-9529-5","type":"journal-article","created":{"date-parts":[[2010,2,12]],"date-time":"2010-02-12T03:39:31Z","timestamp":1265945971000},"page":"549-567","source":"Crossref","is-referenced-by-count":6,"title":["Partitioning procedure for polynomial optimization"],"prefix":"10.1007","volume":"48","author":[{"given":"Polyxeni-Margarita","family":"Kleniati","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Panos","family":"Parpas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ber\u00e7","family":"Rustem","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,2,13]]},"reference":[{"key":"9529_CR1","unstructured":"GLOBAL Library. http:\/\/www.gamsworld.org\/global\/globallib\/globalstat.htm (2008)"},{"key":"9529_CR2","doi-asserted-by":"crossref","unstructured":"Ben-Tal, A., Nemirovski, A.: Lectures on modern convex optimization. MPS\/SIAM Series on Optimization, SIAM, Philadelphia, PA (2001)","DOI":"10.1137\/1.9780898718829"},{"issue":"1","key":"9529_CR3","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s10287-004-0020-y","volume":"2","author":"J.F. Benders","year":"2005","unstructured":"Benders J.F.: Partitioning procedures for solving mixed-variables programming problems. Comput. Manag. Sci. 2(1), 3\u201319 (2005) reprinted from Numer. Math. 4(1962), pp. 238\u2013252","journal-title":"Comput. Manag. Sci."},{"key":"9529_CR4","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex Optimization","author":"S. Boyd","year":"2004","unstructured":"Boyd S., Vandenberghe L.: Convex Optimization. Cambridge University Press, Cambridge (2004)"},{"key":"9529_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2181-2","volume-title":"Ideals, Varieties, and Algorithms. Undergraduate Texts in Mathematics","author":"D. Cox","year":"1992","unstructured":"Cox D., Little J., O\u2019Shea D.: Ideals, Varieties, and Algorithms. Undergraduate Texts in Mathematics. Springer, New York (1992)"},{"key":"9529_CR6","doi-asserted-by":"crossref","unstructured":"Floudas, C.A.: Deterministic global optimization, Nonconvex Optimization and its Applications, vol 37. Kluwer, Dordrecht, Theory, methods and applications (2000)","DOI":"10.1007\/978-1-4757-4949-6"},{"key":"9529_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-53032-0","volume-title":"A Collection of Test Problems for Constrained Global Optimization Algorithms, Lecture Notes in Computer Science, vol 455","author":"C.A. Floudas","year":"1990","unstructured":"Floudas C.A., Pardalos P.M.: A Collection of Test Problems for Constrained Global Optimization Algorithms, Lecture Notes in Computer Science, vol 455. Springer, Berlin (1990)"},{"issue":"12","key":"9529_CR8","doi-asserted-by":"crossref","first-page":"1397","DOI":"10.1016\/0098-1354(90)80020-C","volume":"14","author":"C.A. Floudas","year":"1990","unstructured":"Floudas C.A., Visweswaran V.: A global optimization algorithm (GOP) for certain classes of nonconvex NLPs: I. Theory Comput. Chem. Eng. 14(12), 1397\u20131417 (1990)","journal-title":"Theory Comput. Chem. Eng."},{"key":"9529_CR9","doi-asserted-by":"crossref","first-page":"652","DOI":"10.1287\/mnsc.16.11.652","volume":"16","author":"A.M. Geoffrion","year":"1970","unstructured":"Geoffrion A.M.: Elements of large-scale mathematical programming. I. Concepts. Manag. Sci. 16, 652\u2013675 (1970)","journal-title":"Manag. Sci."},{"key":"9529_CR10","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/BF00934810","volume":"10","author":"A.M. Geoffrion","year":"1972","unstructured":"Geoffrion A.M.: Generalized benders decomposition. J. Optim. Theory Appl. 10, 237\u2013260 (1972)","journal-title":"J. Optim. Theory Appl."},{"issue":"2","key":"9529_CR11","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1145\/779359.779363","volume":"29","author":"D. Henrion","year":"2003","unstructured":"Henrion D., Lasserre J.B.: GloptiPoly: global optimization over polynomials with Matlab and SeDuMi. ACM Trans. Math. Softw. 29(2), 165\u2013194 (2003)","journal-title":"ACM Trans. Math. Softw."},{"key":"9529_CR12","doi-asserted-by":"crossref","first-page":"591","DOI":"10.1137\/1015073","volume":"15","author":"W.W. Hogan","year":"1973","unstructured":"Hogan W.W.: Point-to-set maps in mathematical programming. SIAM Rev. 15, 591\u2013603 (1973)","journal-title":"SIAM Rev."},{"key":"9529_CR13","doi-asserted-by":"crossref","unstructured":"Kleniati, P.M., Parpas, P., Rustem, B.: Decomposition-based method for sparse semidefinite relaxations of polynomial optimization problems. J. Optim. Theory Appl. doi: 10.1007\/s10957-009-9624-2 (2009)","DOI":"10.1007\/s10957-009-9624-2"},{"issue":"3","key":"9529_CR14","doi-asserted-by":"crossref","first-page":"796","DOI":"10.1137\/S1052623400366802","volume":"11","author":"J.B. Lasserre","year":"2000\/2001","unstructured":"Lasserre J.B.: Global optimization with polynomials and the problem of moments. SIAM J. Optim. 11(3), 796\u2013817 (2000\/2001)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"9529_CR15","doi-asserted-by":"crossref","first-page":"822","DOI":"10.1137\/05064504X","volume":"17","author":"J.B. Lasserre","year":"2006","unstructured":"Lasserre J.B.: Convergent SDP-relaxations in polynomial optimization with sparsity. SIAM J. Optim. 17(3), 822\u2013843 (2006)","journal-title":"SIAM J. Optim."},{"key":"9529_CR16","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/978-0-387-09686-5_7","volume-title":"Emerging applications of algebraic geometry, IMA Vol. in Math. and its Appl., vol 149","author":"M. Laurent","year":"2009","unstructured":"Laurent M.: Sums of squares, moment matrices and optimization over polynomials. In: Putinar, M., Sullivant, S. (eds) Emerging applications of algebraic geometry, IMA Vol. in Math. and its Appl., vol 149., pp. 157\u2013270. Springer, New York (2009)"},{"key":"9529_CR17","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1137\/0308003","volume":"8","author":"R. Meyer","year":"1970","unstructured":"Meyer R.: The validity of a family of optimization methods. SIAM J. Control 8, 41\u201354 (1970)","journal-title":"SIAM J. Control"},{"issue":"1","key":"9529_CR18","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/j.jco.2006.07.002","volume":"23","author":"J. Nie","year":"2007","unstructured":"Nie J., Schweighofer M.: On the complexity of Putinar\u2019s Positivstellensatz. J. Complex. 23(1), 135\u2013150 (2007)","journal-title":"J. Complex."},{"key":"9529_CR19","unstructured":"Parrilo, P.A.: Structured semidefinite programs and semialgebraic geometry methods in robustness and optimization. Ph.D. thesis, California Institute of Technology (2000)"},{"issue":"2, Ser. B","key":"9529_CR20","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/s10107-003-0387-5","volume":"96","author":"P.A. Parrilo","year":"2003","unstructured":"Parrilo P.A.: Semidefinite programming relaxations for semialgebraic problems. Math. Program. 96(2, Ser. B), 293\u2013320 (2003)","journal-title":"Math. Program."},{"key":"9529_CR21","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04648-7","volume-title":"Positive Polynomials. Springer Monographs in Mathematics","author":"A. Prestel","year":"2001","unstructured":"Prestel A., Delzell C.N.: Positive Polynomials. Springer Monographs in Mathematics. Springer, Berlin (2001)"},{"issue":"3","key":"9529_CR22","doi-asserted-by":"crossref","first-page":"969","DOI":"10.1512\/iumj.1993.42.42045","volume":"42","author":"M. Putinar","year":"1993","unstructured":"Putinar M.: Positive polynomials on compact semi-algebraic sets. Indiana Univ. Math. J. 42(3), 969\u2013984 (1993)","journal-title":"Indiana Univ. Math. J."},{"issue":"2","key":"9529_CR23","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/BF01446568","volume":"289","author":"K. Schm\u00fcdgen","year":"1991","unstructured":"Schm\u00fcdgen K.: The K-moment problem for compact semi-algebraic sets. Math. Ann. 289(2), 203\u2013206 (1991)","journal-title":"Math. Ann."},{"issue":"3","key":"9529_CR24","doi-asserted-by":"crossref","first-page":"805","DOI":"10.1137\/S1052623403431779","volume":"15","author":"M. Schweighofer","year":"2005","unstructured":"Schweighofer M.: Optimization of polynomials on compact semialgebraic sets. SIAM J. Optim. 15(3), 805\u2013825 (2005)","journal-title":"SIAM J. Optim."},{"key":"9529_CR25","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/BF01362149","volume":"207","author":"G. Stengle","year":"1974","unstructured":"Stengle G.: A nullstellensatz and a positivstellensatz in semialgebraic geometry. Math. Ann. 207, 87\u201397 (1974)","journal-title":"Math. Ann."},{"issue":"1\u20134","key":"9529_CR26","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1080\/10556789908805766","volume":"11\/12","author":"J.F. Sturm","year":"1999","unstructured":"Sturm J.F.: Using SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones. Optim. Methods Softw. 11\/12(1\u20134), 625\u2013653 (1999)","journal-title":"Optim. Methods Softw."},{"issue":"3","key":"9529_CR27","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/BF01584248","volume":"21","author":"J. Tind","year":"1981","unstructured":"Tind J., Wolsey L.A.: An elementary survey of general duality theory in mathematical programming. Math. Program. 21(3), 241\u2013261 (1981)","journal-title":"Math. Program."},{"key":"9529_CR28","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2809-5","volume-title":"Convex Analysis and Global Optimization, Nonconvex Optimization and its Applications, vol 22","author":"H. Tuy","year":"1998","unstructured":"Tuy H.: Convex Analysis and Global Optimization, Nonconvex Optimization and its Applications, vol 22. Kluwer, Dordrecht (1998)"},{"issue":"12","key":"9529_CR29","doi-asserted-by":"crossref","first-page":"1419","DOI":"10.1016\/0098-1354(90)80021-3","volume":"14","author":"V. Visweswaran","year":"1990","unstructured":"Visweswaran V., Floudas C.A.: A global optimization algorithm (GOP) for certain classes of nonconvex NLPs: II. Application of theory and test problems. Comput. Chem. Eng. 14(12), 1419\u20131434 (1990)","journal-title":"Comput. Chem. Eng."},{"issue":"1","key":"9529_CR30","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/BF00121303","volume":"2","author":"V. Visweswaran","year":"1992","unstructured":"Visweswaran V., Floudas C.A.: Unconstrained and constrained global optimization of polynomial functions in one variable. J. Global Optim. 2(1), 73\u201399 (1992)","journal-title":"J. Global Optim."},{"issue":"1","key":"9529_CR31","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1137\/050623802","volume":"17","author":"H. Waki","year":"2006","unstructured":"Waki H., Kim S., Kojima M., Muramatsu M.: Sums of squares and semidefinite program relaxations for polynomial optimization problems with structured sparsity. SIAM J. Optim. 17(1), 218\u2013242 (2006)","journal-title":"SIAM J. Optim."},{"key":"9529_CR32","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1007\/BFb0120932","volume":"14","author":"L.A. Wolsey","year":"1981","unstructured":"Wolsey L.A.: A resource decomposition algorithm for general mathematical programs. Math. Program. Stud. 14, 244\u2013257 (1981)","journal-title":"Math. Program. Stud."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-010-9529-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-010-9529-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-010-9529-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T00:58:55Z","timestamp":1559264335000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-010-9529-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,2,13]]},"references-count":32,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2010,12]]}},"alternative-id":["9529"],"URL":"https:\/\/doi.org\/10.1007\/s10898-010-9529-5","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,2,13]]}}}