{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T19:23:09Z","timestamp":1774034589944,"version":"3.50.1"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2014,2,26]],"date-time":"2014-02-26T00:00:00Z","timestamp":1393372800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2015,1]]},"DOI":"10.1007\/s11590-014-0732-z","type":"journal-article","created":{"date-parts":[[2014,2,25]],"date-time":"2014-02-25T02:21:02Z","timestamp":1393294862000},"page":"1-18","source":"Crossref","is-referenced-by-count":38,"title":["Robust SOS-convex polynomial optimization problems: exact SDP relaxations"],"prefix":"10.1007","volume":"9","author":[{"given":"V.","family":"Jeyakumar","sequence":"first","affiliation":[]},{"given":"G.","family":"Li","sequence":"additional","affiliation":[]},{"given":"J.","family":"Vicente-P\u00e9rez","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,2,26]]},"reference":[{"key":"732_CR1","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1007\/s10107-011-0457-z","volume":"135","author":"AA Ahmadi","year":"2012","unstructured":"Ahmadi, A.A., Parrilo, P.A.: A convex polynomial that is not SOS-convex. Math. Program. 135, 275\u2013292 (2012)","journal-title":"Math. Program."},{"key":"732_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4614-0769-0","volume-title":"Handbook of Semidefinite, Conic and Polynomial Optimization","author":"M Anjos","year":"2012","unstructured":"Anjos, M., Lasserre, J.B.: Handbook of Semidefinite, Conic and Polynomial Optimization. Springer, Berlin (2012)"},{"key":"732_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.orl.2008.09.010","volume":"37","author":"A Beck","year":"2009","unstructured":"Beck, A., Ben-Tal, A.: Duality in robust optimization. Oper. Res. Lett. 37, 1\u20136 (2009)","journal-title":"Oper. Res. Lett."},{"key":"732_CR4","doi-asserted-by":"crossref","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 optimization problems. Comp. Optim. Appl. 22, 37\u201348 (2002)","journal-title":"Comp. Optim. Appl."},{"key":"732_CR5","doi-asserted-by":"crossref","unstructured":"Blekherman, G., Parrilo, P.A., Thomas, R.: Semidefinite Optimization and Convex Algebraic Geometry. SIAM Publications, Philadelphia (2012)","DOI":"10.1137\/1.9781611972290"},{"key":"732_CR6","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1007\/PL00011380","volume":"88","author":"A Ben-Tal","year":"2000","unstructured":"Ben-Tal, A., Nemirovski, A.: Robust solutions of linear programming problems contaminated with uncertain data. Math. Program. 88, 411\u2013424 (2000)","journal-title":"Math. Program."},{"key":"732_CR7","doi-asserted-by":"crossref","unstructured":"Ben-Tal, A., El Ghaoui, L., Nemirovski, A.: Robust optimization. Princet. Ser. Appl. Math. xxii+542 (2009)","DOI":"10.1515\/9781400831050"},{"key":"732_CR8","doi-asserted-by":"crossref","first-page":"769","DOI":"10.1287\/moor.23.4.769","volume":"23","author":"A Ben-Tal","year":"1998","unstructured":"Ben-Tal, A., Nemirovski, A.: Robust convex optimization. Math. Oper. Res. 23, 769\u2013805 (1998)","journal-title":"Math. Oper. Res."},{"key":"732_CR9","doi-asserted-by":"crossref","first-page":"464","DOI":"10.1137\/080734510","volume":"53","author":"D Bertsimas","year":"2011","unstructured":"Bertsimas, D., Brown, D., Caramanis, C.: Theory and applications of robust optimization. SIAM Rev. 53, 464\u2013501 (2011)","journal-title":"SIAM Rev."},{"key":"732_CR10","doi-asserted-by":"crossref","first-page":"510","DOI":"10.1016\/j.orl.2003.12.007","volume":"32","author":"D Bertsimas","year":"2004","unstructured":"Bertsimas, D., Pachamanova, D., Sim, M.: Robust linear optimization under general norms. Oper. Res. Lett. 32, 510\u2013516 (2004)","journal-title":"Oper. Res. Lett."},{"key":"732_CR11","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":"732_CR12","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1007\/s10107-013-0668-6","volume":"139","author":"MA Goberna","year":"2013","unstructured":"Goberna, M.A., Jeyakumar, V., Li, G., Lopez, M.: Robust linear semi-infinite programming duality. Math. Program. 139, 185\u2013203 (2013)","journal-title":"Math. Program."},{"key":"732_CR13","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., David, Johnson, S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1979)"},{"key":"732_CR14","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1007\/s10107-003-0425-3","volume":"97","author":"D Goldfarb","year":"2003","unstructured":"Goldfarb, D., Iyengar, G.: Robust convex quadratically constrained programs. Math. Program. 97, 495\u2013515 (2003)","journal-title":"Math. Program."},{"key":"732_CR15","doi-asserted-by":"crossref","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."},{"key":"732_CR16","doi-asserted-by":"crossref","first-page":"3384","DOI":"10.1137\/100791841","volume":"20","author":"V Jeyakumar","year":"2010","unstructured":"Jeyakumar, V., Li, G.: Strong duality in robust convex programming: complete characterizations. SIAM J. Optim. 20, 3384\u20133407 (2010)","journal-title":"SIAM J. Optim."},{"key":"732_CR17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.na.2012.12.009","volume":"81","author":"V Jeyakumar","year":"2013","unstructured":"Jeyakumar, V., Li, G.Y., Morduckhovich, B.S., Wang, J.H.: Robust best approximation with interpolation constraints under ellipsoidal uncertainty: strong duality and nonsmooth Newton\u2019s method. Nonlinear Anal. T, M&A 81, 1\u201311 (2013)","journal-title":"Nonlinear Anal. T, M&A"},{"key":"732_CR18","unstructured":"Jeyakumar, V., Li, G., Wang, J. H.: Some robust convex programs without a duality gap. J. Convex Anal. 20(2), 377\u2013394 (2013)"},{"key":"732_CR19","doi-asserted-by":"crossref","first-page":"824","DOI":"10.1137\/100814147","volume":"21","author":"E Klerk de","year":"2011","unstructured":"de Klerk, E., Laurent, M.: On the Lasserre hierarchy of semidefinite programming relaxations of convex polynomial optimization problems. SIAM J. Optim. 21, 824\u2013832 (2011)","journal-title":"SIAM J. Optim."},{"key":"732_CR20","doi-asserted-by":"crossref","DOI":"10.1142\/p665","volume-title":"Moments, Positive Polynomials and Their Applications","author":"JB Lasserre","year":"2009","unstructured":"Lasserre, J.B.: Moments, Positive Polynomials and Their Applications. Imperial College Press, London (2009)"},{"key":"732_CR21","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1007\/s10107-005-0687-z","volume":"107","author":"JB Lasserre","year":"2006","unstructured":"Lasserre, J.B.: Robust global optimization with polynomials. Math. Program. 107, 275\u2013293 (2006)","journal-title":"Math. Program."},{"key":"732_CR22","doi-asserted-by":"crossref","first-page":"1995","DOI":"10.1137\/080728214","volume":"19","author":"JB Lasserre","year":"2009","unstructured":"Lasserre, J.B.: Convexity in semialgebraic geometry and polynomial optimization. SIAM J. Optim. 19, 1995\u20132014 (2009)","journal-title":"SIAM J. Optim."},{"key":"732_CR23","doi-asserted-by":"crossref","unstructured":"Laurent, M.: Sums of squares, moment matrices and optimization over polynomials. Emerging applications of algebraic geometry. IMA Vol. Math. Appl., vol. 149, pp 157\u2013270. Springer, New York (2009)","DOI":"10.1007\/978-0-387-09686-5_7"},{"key":"732_CR24","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/S0024-3795(98)10032-0","volume":"284","author":"MS Lobo","year":"1998","unstructured":"Lobo, M.S., Vandenberghe, L., Boyd, S., Lebret, H.: Applications of second-order cone programming. Linear Algebra Appl. 284, 193\u2013228 (1998)","journal-title":"Linear Algebra Appl."},{"key":"732_CR25","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970791","volume-title":"Interior-Point Polynomial Algorithms in Convex Programming","author":"Y Nesterov","year":"1994","unstructured":"Nesterov, Y., Nemirovskii, A.: Interior-Point Polynomial Algorithms in Convex Programming. SIAM, Philadelphia (1994)"},{"key":"732_CR26","doi-asserted-by":"crossref","unstructured":"Nie, J.: Optimality conditions and finite convergence of Lasserre\u2019s hierarchy. Math. Program. (2013). doi: 10.1007\/s10107-013-0680-x","DOI":"10.1007\/s10107-013-0680-x"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-014-0732-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-014-0732-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-014-0732-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T23:07:18Z","timestamp":1565219238000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-014-0732-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,2,26]]},"references-count":26,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,1]]}},"alternative-id":["732"],"URL":"https:\/\/doi.org\/10.1007\/s11590-014-0732-z","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,2,26]]}}}