{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:20:22Z","timestamp":1740122422238,"version":"3.37.3"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2019,9,27]],"date-time":"2019-09-27T00:00:00Z","timestamp":1569542400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,9,27]],"date-time":"2019-09-27T00:00:00Z","timestamp":1569542400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"crossref","award":["DP180100745"],"award-info":[{"award-number":["DP180100745"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2019,12]]},"DOI":"10.1007\/s10898-019-00831-9","type":"journal-article","created":{"date-parts":[[2019,9,27]],"date-time":"2019-09-27T07:03:28Z","timestamp":1569567808000},"page":"885-919","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs"],"prefix":"10.1007","volume":"75","author":[{"given":"T. D.","family":"Chuong","sequence":"first","affiliation":[]},{"given":"V.","family":"Jeyakumar","sequence":"additional","affiliation":[]},{"given":"G.","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,9,27]]},"reference":[{"key":"831_CR1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2018.0962","author":"AA Ahmadi","year":"2019","unstructured":"Ahmadi, A.A., Hall, G.: On the construction of converging hierarchies for polynomial optimization based on certificates of global positivity. Math. Oper. Res. (2019). \nhttps:\/\/doi.org\/10.1287\/moor.2018.0962","journal-title":"Math. Oper. Res."},{"key":"831_CR2","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1137\/18M118935X","volume":"3","author":"AA Ahmadi","year":"2019","unstructured":"Ahmadi, A.A., Majumdar, A.: DSOS and SDSOS optimization: more tractable alternatives to sum of squares and semidefinite optimization. SIAM J. Appl. Algebra Geom. 3, 193\u2013230 (2019)","journal-title":"SIAM J. Appl. Algebra Geom."},{"issue":"2","key":"831_CR3","doi-asserted-by":"publisher","first-page":"811","DOI":"10.1137\/110856010","volume":"23","author":"AA Ahmadi","year":"2013","unstructured":"Ahmadi, A.A., Parrilo, P.A.: A complete characterization of the gap between convexity and SOS-convexity. SIAM J. Optim. 23(2), 811\u2013833 (2013)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"831_CR4","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1023\/A:1014813701864","volume":"22","author":"EG Belousov","year":"2002","unstructured":"Belousov, E.G., Klatte, D.: A Frank\u2013Wolfe type theorem for convex polynomial programs. Comput. Optim. Appl. 22(1), 37\u201348 (2002)","journal-title":"Comput. Optim. Appl."},{"key":"831_CR5","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1080\/10556788.2012.656114","volume":"28","author":"D Bertsimas","year":"2013","unstructured":"Bertsimas, D., Freund, R.M., Sun, X.A.: An accelerated first-order method for solving SOS relaxations of unconstrained polynomial optimization problems. Optim. Methods Softw. 28, 424\u2013441 (2013)","journal-title":"Optim. Methods Softw."},{"key":"831_CR6","doi-asserted-by":"publisher","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)"},{"issue":"3","key":"831_CR7","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1016\/j.orl.2017.03.003","volume":"45","author":"TD Chuong","year":"2017","unstructured":"Chuong, T.D., Jeyakumar, V.: Convergent conic linear programming relaxations for cone convex polynomial programs. Oper. Res. Lett. 45(3), 220\u2013226 (2017)","journal-title":"Oper. Res. Lett."},{"issue":"4","key":"831_CR8","doi-asserted-by":"publisher","first-page":"655","DOI":"10.1007\/s10898-018-0665-7","volume":"72","author":"TD Chuong","year":"2018","unstructured":"Chuong, T.D., Jeyakumar, V.: Generalized Lagrangian duality for nonconvex polynomial programs with polynomial multipliers. J. Global Optim. 72(4), 655\u2013678 (2018)","journal-title":"J. Global Optim."},{"key":"831_CR9","volume-title":"Polynomial Optimization on Odd-Dimensional Spheres, in Emerging Applications of Algebraic Geometry","author":"P D\u2019Angelo","year":"2008","unstructured":"D\u2019Angelo, P., Putinar, M.: Polynomial Optimization on Odd-Dimensional Spheres, in Emerging Applications of Algebraic Geometry. Springer, New York (2008)"},{"key":"831_CR10","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1007\/s00209-010-0753-y","volume":"269","author":"C Fidalgo","year":"2011","unstructured":"Fidalgo, C., Kovacec, A.: Positive semidefinite diagonal minus tail forms are sums of squares. Math. Z. 269, 629\u2013645 (2011)","journal-title":"Math. Z."},{"key":"831_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-3040-1","volume-title":"Handbook of Test Problems in Local and Global Optimization","author":"CA Floudas","year":"1999","unstructured":"Floudas, C.A., Pardalos, P.M., Adjiman, C.S., Esposito, W.R., Gumus, Z.H., Harding, S.T., Klepeis, J.L., Meyer, C.A., Schweiger, C.A.: Handbook of Test Problems in Local and Global Optimization. Kluwer Academic Publishers, Dordrecht (1999)"},{"key":"831_CR12","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s10107-015-0870-9","volume":"156","author":"B Ghaddar","year":"2016","unstructured":"Ghaddar, B., Vera, J.C., Anjos, M.F.: A dynamic inequality generation scheme for polynomial programming. Math. Program. 156, 21\u201357 (2016)","journal-title":"Math. Program."},{"issue":"2","key":"831_CR13","doi-asserted-by":"publisher","first-page":"460","DOI":"10.1137\/110836869","volume":"22","author":"M Ghasemi","year":"2012","unstructured":"Ghasemi, M., Marshall, M.: Lower bounds for polynomials using geometric programming. SIAM J. Optim. 22(2), 460\u2013473 (2012)","journal-title":"SIAM J. Optim."},{"key":"831_CR14","doi-asserted-by":"publisher","first-page":"761","DOI":"10.1080\/10556780802699201","volume":"24","author":"D Henrion","year":"2009","unstructured":"Henrion, D., Lasserre, J.B., Loefberg, J.: GloptiPoly 3: moments, optimization and semidefinite programming. Optim. Methods Softw. 24, 761\u2013779 (2009)","journal-title":"Optim. Methods Softw."},{"key":"831_CR15","first-page":"xviii+643","volume-title":"Matrix Analysis","author":"R Horn","year":"2013","unstructured":"Horn, R., Johnson, C.R.: Matrix Analysis, 2nd edn, p. xviii+643. Cambridge University Press, Cambridge (2013)","edition":"2"},{"issue":"2","key":"831_CR16","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1007\/s10957-014-0652-1","volume":"168","author":"S Hu","year":"2016","unstructured":"Hu, S., Li, G., Qi, L.: A tensor analogy of Yuan\u2019s theorem of the alternative and polynomial optimization with sign structure. J. Optim. Theory Appl. 168(2), 446\u2013474 (2016)","journal-title":"J. Optim. Theory Appl."},{"key":"831_CR17","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s10107-008-0240-y","volume":"122","author":"JW Helton","year":"2010","unstructured":"Helton, J.W., Nie, J.W.: Semidefinite representation of convex sets. Math. Program. 122, 21\u201364 (2010)","journal-title":"Math. Program."},{"issue":"1","key":"831_CR18","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/s10957-007-9294-x","volume":"136","author":"V Jeyakumar","year":"2008","unstructured":"Jeyakumar, V.: Constraint qualifications characterizing Lagrangian duality in convex optimization. J. Optim. Theory Appl. 136(1), 31\u201341 (2008)","journal-title":"J. Optim. Theory Appl."},{"key":"831_CR19","first-page":"667","volume":"2","author":"V Jeyakumar","year":"2009","unstructured":"Jeyakumar, V., Lee, G.M., Li, G.: Alternative theorems for quadratic inequality systems and global quadratic optimization. SIAM J. Optim. 2, 667\u2013690 (2009)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"831_CR20","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/s10957-016-1023-x","volume":"172","author":"V Jeyakumar","year":"2017","unstructured":"Jeyakumar, V., Li, G.: Exact conic programming relaxations for a class of convex polynomial cone programs. J. Optim. Theory Appl. 172(1), 156\u2013178 (2017)","journal-title":"J. Optim. Theory Appl."},{"key":"831_CR21","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/s10898-015-0356-6","volume":"65","author":"V Jeyakumar","year":"2016","unstructured":"Jeyakumar, V., Kim, S., Lee, G.M., Li, G.: Solving global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets. J. Global Optim. 65, 175\u2013190 (2016)","journal-title":"J. Global Optim."},{"key":"831_CR22","doi-asserted-by":"publisher","first-page":"1017","DOI":"10.1137\/15M1034386","volume":"28","author":"C Josa","year":"2018","unstructured":"Josa, C., Molzahn, D.: Lasserre hierarchy for large scale polynomial optimization in real and complex variables. SIAM J. Optim. 28, 1017\u20131048 (2018)","journal-title":"SIAM J. Optim."},{"key":"831_CR23","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/BF02807438","volume":"12","author":"JL Krivine","year":"1964","unstructured":"Krivine, J.L.: Anneaux pr\u00e9ordonn\u00e9s. J. Anal. Math. 12, 307\u2013326 (1964)","journal-title":"J. Anal. Math."},{"issue":"2","key":"831_CR24","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1023\/A:1025794313696","volume":"26","author":"S Kim","year":"2003","unstructured":"Kim, S., Kojima, M.: Exact solutions of some nonconvex quadratic optimization problems via SDP and SOCP relaxations. Comput. Optim. Appl. 26(2), 143\u2013154 (2003)","journal-title":"Comput. Optim. Appl."},{"key":"831_CR25","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/s13675-018-0101-2","volume":"7","author":"X Kuang","year":"2019","unstructured":"Kuang, X., Ghaddar, B., Naoum-Sawaya, J., Zuluaga, L.F.: Alternative SDP and SOCP approximations for polynomial optimization. Eur. J. Comp. Optim. 7, 153\u2013175 (2019)","journal-title":"Eur. J. Comp. Optim."},{"issue":"3","key":"831_CR26","doi-asserted-by":"publisher","first-page":"1742","DOI":"10.1137\/130908841","volume":"23","author":"JB Lasserre","year":"2013","unstructured":"Lasserre, J.B.: A Lagrangian relaxation view of linear and semidefinite hierarchies. SIAM J. Optim 23(3), 1742\u20131756 (2013)","journal-title":"SIAM J. Optim"},{"key":"831_CR27","volume-title":"Moments, Positive Polynomials and Their Applications","author":"JB Lasserre","year":"2010","unstructured":"Lasserre, J.B.: Moments, Positive Polynomials and Their Applications. World Scientific, Singapore (2010)"},{"key":"831_CR28","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/s00013-008-2687-8","volume":"91","author":"JB Lasserre","year":"2008","unstructured":"Lasserre, J.B.: Representation of nonnegative convex polynomial. Arch. Math. 91, 126\u2013130 (2008)","journal-title":"Arch. Math."},{"key":"831_CR29","first-page":"157","volume-title":"Emerging Applications of Algebraic Geometry, Vol. 149 of IMA Volumes in Mathematics and its Applications","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, Vol. 149 of IMA Volumes in Mathematics and its Applications, vol. 149, pp. 157\u2013270. Springer, Berlin (2009)"},{"key":"831_CR30","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/s13675-015-0050-y","volume":"5","author":"JB Lasserre","year":"2017","unstructured":"Lasserre, J.B., Toh, K.C., Yang, S.: A bounded degree SOS hierarchy for polynomial optimization. Eur. J. Comput. Optim. 5, 87\u2013117 (2017)","journal-title":"Eur. J. Comput. Optim."},{"key":"831_CR31","volume-title":"An Easy Path to Convex Analysis and Applications, Synthesis Lectures on Mathematics and Statistics, 14","author":"BS Mordukhovich","year":"2014","unstructured":"Mordukhovich, B.S., Nam, N.M.: An Easy Path to Convex Analysis and Applications, Synthesis Lectures on Mathematics and Statistics, 14. Morgan & Claypool Publishers, Williston (2014)"},{"key":"831_CR32","unstructured":"Megretski, A.: SPOT (Systems polynomial optimization tools) Manual, 2010, \nhttp:\/\/web.mit.edu\/ameg\/www\/images\/spot_manual.pdf"},{"key":"831_CR33","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1287\/moor.1110.0498","volume":"36","author":"JW Nie","year":"2011","unstructured":"Nie, J.W.: Polynomial matrix inequality and semidefinite representation. Math. Oper. Res. 36, 398\u2013415 (2011)","journal-title":"Math. Oper. Res."},{"key":"831_CR34","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1137\/110825844","volume":"22","author":"JW Nie","year":"2012","unstructured":"Nie, J.W., Wang, L.: Regularization methods for SDP relaxations in large-scale polynomial optimization. SIAM J. Optim. 22, 408\u2013428 (2012)","journal-title":"SIAM J. Optim."},{"key":"831_CR35","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/s10107-003-0387-5","volume":"96","author":"PA Parrilo","year":"2003","unstructured":"Parrilo, P.A.: Semidefinite programming relaxations for semialgebraic problems. Math. Program. 96, 293\u2013320 (2003)","journal-title":"Math. Program."},{"key":"831_CR36","first-page":"301","volume":"77","author":"A Shapiro","year":"1997","unstructured":"Shapiro, A.: First and second order analysis of nonlinear semidefinite programs. Math. Program. 77, 301\u2013320 (1997)","journal-title":"Math. Program."},{"key":"831_CR37","doi-asserted-by":"publisher","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 programming relaxations for polynomial optimization problems with structured sparsity. SIAM J. Optim. 17, 218\u2013242 (2006)","journal-title":"SIAM J. Optim."},{"key":"831_CR38","first-page":"1","volume":"5","author":"T Weisser","year":"2017","unstructured":"Weisser, T., Lasserre, J., Toh, K.: Sparse-BSOS: a bounded degree SOS hierarchy for large scale polynomial optimization with sparsity. Math. Program. Comput. 5, 1\u201332 (2017)","journal-title":"Math. Program. Comput."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-019-00831-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-019-00831-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-019-00831-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,25]],"date-time":"2020-09-25T23:09:04Z","timestamp":1601075344000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-019-00831-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9,27]]},"references-count":38,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2019,12]]}},"alternative-id":["831"],"URL":"https:\/\/doi.org\/10.1007\/s10898-019-00831-9","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"type":"print","value":"0925-5001"},{"type":"electronic","value":"1573-2916"}],"subject":[],"published":{"date-parts":[[2019,9,27]]},"assertion":[{"value":"13 September 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 September 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 September 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}