{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T13:48:07Z","timestamp":1772891287018,"version":"3.50.1"},"reference-count":36,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"funder":[{"DOI":"10.13039\/100000147","name":"Division of Civil, Mechanical and Manufacturing Innovation","doi-asserted-by":"publisher","award":["1300193"],"award-info":[{"award-number":["1300193"]}],"id":[{"id":"10.13039\/100000147","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["EURO Journal on Computational Optimization"],"published-print":{"date-parts":[[2019,6]]},"DOI":"10.1007\/s13675-018-0101-2","type":"journal-article","created":{"date-parts":[[2018,8,13]],"date-time":"2018-08-13T05:28:32Z","timestamp":1534138112000},"page":"153-175","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":7,"title":["Alternative SDP and SOCP approximations for polynomial optimization"],"prefix":"10.1016","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5476-4466","authenticated-orcid":false,"given":"Xiaolong","family":"Kuang","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4695-200X","authenticated-orcid":false,"given":"Bissan","family":"Ghaddar","sequence":"additional","affiliation":[]},{"given":"Joe","family":"Naoum-Sawaya","sequence":"additional","affiliation":[]},{"given":"LuisF.","family":"Zuluaga","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1007\/s13675-018-0101-2_CR1","doi-asserted-by":"crossref","unstructured":"Ahmadi AA, Majumdar A (2014) DSOS and SDSOS optimization: LP and SOCP-based alternatives to sum of squares optimization. In: 2014 48th Annual conference on information sciences and systems (CISS). IEEE, pp 1\u20135","DOI":"10.1109\/CISS.2014.6814141"},{"key":"10.1007\/s13675-018-0101-2_CR2","doi-asserted-by":"crossref","unstructured":"Anjos MF, Lasserre JB (eds) (2012a) Handbook on semidefinite, conic and polynomial optimization handbook on semidefinite, conic and polynomial optimization, volume 166 of international series in operations research & management science. Springer","DOI":"10.1007\/978-1-4614-0769-0"},{"key":"10.1007\/s13675-018-0101-2_CR3","doi-asserted-by":"crossref","unstructured":"Anjos MF, Lasserre JB (2012b) Introduction to semidefinite, conic and polynomial optimization. In: Handbook on semidefinite, conic and polynomial optimization. Springer, pp 1\u201322","DOI":"10.1007\/978-1-4614-0769-0_1"},{"key":"10.1007\/s13675-018-0101-2_CR4","doi-asserted-by":"crossref","unstructured":"Blekherman G, Parrilo PA, Thomas RR (2012) Semidefinite optimization and convex algebraic geometry. In: SIAM","DOI":"10.1137\/1.9781611972290"},{"key":"10.1007\/s13675-018-0101-2_CR5","series-title":"Convex optimization","author":"Boyd","year":"2009"},{"issue":"4","key":"10.1007\/s13675-018-0101-2_CR6","doi-asserted-by":"crossref","first-page":"875","DOI":"10.1137\/S1052623401383248","article-title":"Approximation of the stability number of a graph via copositive programming","volume":"12","author":"de Klerk","year":"2002","journal-title":"SIAM J Optimim"},{"issue":"2","key":"10.1007\/s13675-018-0101-2_CR7","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/s10107-008-0246-5","article-title":"Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem","volume":"122","author":"de Klerk","year":"2010","journal-title":"Math Program"},{"key":"10.1007\/s13675-018-0101-2_CR8","unstructured":"Dickinson PJ, Povh J (2013) New linear and positive semidefinite programming based approximation hierarchies for polynomial optimisation. Preprint (submitted).http:\/\/www.optimization-online.org\/DB_HTML\/2013\/06\/3925.html"},{"issue":"4","key":"10.1007\/s13675-018-0101-2_CR9","doi-asserted-by":"crossref","first-page":"615","DOI":"10.1007\/s10898-014-0196-9","article-title":"On an extension of P\u00f3lyas positivstellensatz","volume":"61","author":"Dickinson","year":"2015","journal-title":"J Glob Optim"},{"issue":"1-3","key":"10.1007\/s13675-018-0101-2_CR10","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/j.jpaa.2003.12.011","article-title":"Symmetry groups, semidefinite programs, and sums of squares","volume":"192","author":"Gatermann","year":"2004","journal-title":"J Pure Appl Algebra"},{"key":"10.1007\/s13675-018-0101-2_CR11","unstructured":"Ghaddar B (2011) New conic optimization techniques for solving binary polynomial programming problem. Ph.D. thesis"},{"issue":"1","key":"10.1007\/s13675-018-0101-2_CR12","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1109\/TPWRS.2015.2390037","article-title":"Optimal power flow as a polynomial optimization problem","volume":"31","author":"Ghaddar","year":"2016","journal-title":"IEEE Trans Power Syst"},{"issue":"1","key":"10.1007\/s13675-018-0101-2_CR13","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1137\/100802190","article-title":"Second-order cone relaxations for binary quadratic polynomial programs","volume":"21","author":"Ghaddar","year":"2011","journal-title":"SIAM J Optim"},{"issue":"1-2","key":"10.1007\/s13675-018-0101-2_CR14","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/s10107-015-0870-9","article-title":"A dynamic inequality generation scheme for polynomial programming","volume":"156","author":"Ghaddar","year":"2016","journal-title":"Math Program"},{"key":"10.1007\/s13675-018-0101-2_CR15","series-title":"Inequalities","author":"Hardy","year":"1988"},{"key":"10.1007\/s13675-018-0101-2_CR16","unstructured":"Josz C, Molzahn DK (2015) Moment\/sum-of-squares hierarchy for complex polynomial optimization. arXiv preprint. arXiv:1508.02068"},{"issue":"4","key":"10.1007\/s13675-018-0101-2_CR17","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1007\/s10898-010-9529-5","article-title":"Partitioning procedure for polynomial optimization","volume":"48","author":"Kleniati","year":"2010","journal-title":"J Glob Optim"},{"issue":"1","key":"10.1007\/s13675-018-0101-2_CR18","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/s10107-004-0554-3","article-title":"Sparsity in sums of squares of polynomials","volume":"103","author":"Kojima","year":"2003","journal-title":"Math Program"},{"issue":"4","key":"10.1007\/s13675-018-0101-2_CR19","doi-asserted-by":"crossref","first-page":"2828","DOI":"10.1109\/TPWRS.2016.2615688","article-title":"Alternative LP and SOCP hierarchies for ACOPF problems","volume":"32","author":"Kuang","year":"2017","journal-title":"IEEE Trans Power Syst"},{"issue":"3","key":"10.1007\/s13675-018-0101-2_CR20","doi-asserted-by":"crossref","first-page":"796","DOI":"10.1137\/S1052623400366802","article-title":"Global optimization with polynomials and the problem of moments","volume":"11","author":"Lasserre","year":"2001","journal-title":"SIAM J Optim"},{"issue":"2","key":"10.1007\/s13675-018-0101-2_CR21","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1287\/moor.27.2.347.322","article-title":"Semidefinite programming versus LP relaxations for polynomial programming","volume":"27","author":"Lasserre","year":"2002","journal-title":"Math Oper Res"},{"issue":"1","key":"10.1007\/s13675-018-0101-2_CR22","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/s10898-008-9394-7","article-title":"Moments and sums of squares for polynomial optimization and related problems","volume":"45","author":"Lasserre","year":"2009","journal-title":"J Glob Optim"},{"issue":"1-2","key":"10.1007\/s13675-018-0101-2_CR23","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/s13675-015-0050-y","article-title":"A bounded degree SOS hierarchy for polynomial optimization","volume":"5","author":"Lasserre","year":"2017","journal-title":"EURO J Comput Optim"},{"key":"10.1007\/s13675-018-0101-2_CR24","unstructured":"MOSEK A (2015) The MOSEK optimization toolbox for MATLAB manual. Version 7.1 (Revision 28)"},{"issue":"2","key":"10.1007\/s13675-018-0101-2_CR25","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/BF02592948","article-title":"Some NP-complete problems in quadratic and nonlinear programming","volume":"39","author":"Murty","year":"1987","journal-title":"Math Program"},{"issue":"2","key":"10.1007\/s13675-018-0101-2_CR26","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/s10107-003-0387-5","article-title":"Semidefinite programming relaxations for semialgebraic problems","volume":"96","author":"Parrilo","year":"2003","journal-title":"Math Program"},{"key":"10.1007\/s13675-018-0101-2_CR27","unstructured":"Pe\u00f1a J, Vera JC, Zuluaga LF (2017) Positive polynomials on unbounded domains. arXiv preprint. arXiv:1709.03435"},{"key":"10.1007\/s13675-018-0101-2_CR28","doi-asserted-by":"crossref","first-page":"969","DOI":"10.1512\/iumj.1993.42.42045","article-title":"Positive polynomials on compact semi-algebraic sets","volume":"42","author":"Putinar","year":"1993","journal-title":"Indiana Univ Math J"},{"key":"10.1007\/s13675-018-0101-2_CR29","unstructured":"Sahinidis NV, Tawarmalani M (2005) Baron 7.2.5: global optimization of mixed-integer nonlinear programs. Users manual"},{"key":"10.1007\/s13675-018-0101-2_CR30","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/BF01446568","article-title":"The K-moment problem for compact semi-algebraic sets","volume":"289","author":"Schm\u00fcdgen","year":"1991","journal-title":"Math. Ann."},{"issue":"1-4","key":"10.1007\/s13675-018-0101-2_CR31","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1080\/10556789908805766","article-title":"Using SeDuMi 1.02, a matlab toolbox for optimization over symmetric cones","volume":"11","author":"Sturm","year":"1999","journal-title":"Optim Methods Softw"},{"key":"10.1007\/s13675-018-0101-2_CR32","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1017\/S0962492901000071","article-title":"Semidefinite optimization","volume":"10","author":"Todd","year":"2001","journal-title":"Acta Numer"},{"issue":"1","key":"10.1007\/s13675-018-0101-2_CR33","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1137\/050623802","article-title":"Sums of squares and semidefinite program relaxations for polynomial optimization problems with structured sparsity","volume":"17","author":"Waki","year":"2006","journal-title":"SIAM J Optim"},{"issue":"2","key":"10.1007\/s13675-018-0101-2_CR34","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1145\/1377612.1377619","article-title":"Algorithm 883: SparsePOP\u2014a sparse semidefinite programming relaxation of polynomial optimization problems","volume":"35","author":"Waki","year":"2008","journal-title":"ACM Trans Math Softw"},{"key":"10.1007\/s13675-018-0101-2_CR35","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1007\/s10107-017-1157-0","article-title":"Quadratic programs with hollows.","volume":"170","author":"Yang","year":"2018","journal-title":"Math Program"},{"key":"10.1007\/s13675-018-0101-2_CR36","doi-asserted-by":"crossref","first-page":"1076","DOI":"10.1137\/03060151X","article-title":"LMI approximations for cones of positive semidefinite forms","volume":"16","author":"Zuluaga","year":"2006","journal-title":"SIAM J Optim"}],"container-title":["EURO Journal on Computational Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13675-018-0101-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13675-018-0101-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2192440621001143?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2192440621001143?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13675-018-0101-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T03:47:46Z","timestamp":1761882466000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S2192440621001143"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6]]},"references-count":36,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,6]]}},"alternative-id":["S2192440621001143"],"URL":"https:\/\/doi.org\/10.1007\/s13675-018-0101-2","relation":{},"ISSN":["2192-4406"],"issn-type":[{"value":"2192-4406","type":"print"}],"subject":[],"published":{"date-parts":[[2019,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Alternative SDP and SOCP approximations for polynomial optimization","name":"articletitle","label":"Article Title"},{"value":"EURO Journal on Computational Optimization","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1007\/s13675-018-0101-2","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2019 The author(s). Published by Elsevier B.V. on behalf of Association of European Operational Research Societies (EURO). Published by Elsevier Ltd All rights reserved.","name":"copyright","label":"Copyright"}]}}