{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,30]],"date-time":"2025-03-30T04:22:15Z","timestamp":1743308535556,"version":"3.37.3"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2023,3,24]],"date-time":"2023-03-24T00:00:00Z","timestamp":1679616000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,3,24]],"date-time":"2023-03-24T00:00:00Z","timestamp":1679616000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2023,5]]},"DOI":"10.1007\/s10957-023-02197-1","type":"journal-article","created":{"date-parts":[[2023,3,24]],"date-time":"2023-03-24T21:13:55Z","timestamp":1679692435000},"page":"387-410","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Conic Relaxations with Stable Exactness Conditions for Parametric Robust Convex Polynomial Problems"],"prefix":"10.1007","volume":"197","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0893-5604","authenticated-orcid":false,"given":"Thai Doan","family":"Chuong","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7064-1239","authenticated-orcid":false,"given":"Jos\u00e9","family":"Vicente-P\u00e9rez","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,3,24]]},"reference":[{"key":"2197_CR1","doi-asserted-by":"publisher","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":"2197_CR2","doi-asserted-by":"publisher","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, USA (2012)"},{"key":"2197_CR3","doi-asserted-by":"publisher","DOI":"10.1515\/9781400831050","volume-title":"Robust Optimization","author":"A Ben-Tal","year":"2009","unstructured":"Ben-Tal, A., El Ghaoui, L., Nemirovski, A.: Robust Optimization. Princeton University Press, Princeton (2009)"},{"key":"2197_CR4","doi-asserted-by":"publisher","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":"2197_CR5","doi-asserted-by":"crossref","unstructured":"Ben-Tal, A., Nemirovski, A.: Lectures on modern convex optimization: Analysis, algorithms, and engineering applications. MPS\/SIAM Series on Optimization (2001)","DOI":"10.1137\/1.9780898718829"},{"key":"2197_CR6","doi-asserted-by":"publisher","first-page":"811","DOI":"10.1137\/S1052623400374756","volume":"12","author":"A Ben-Tal","year":"2002","unstructured":"Ben-Tal, A., Nemirovski, A.: On tractable approximations of uncertain linear matrix inequalities affected by interval uncertainty. SIAM J. Optim. 12, 811\u2013833 (2002)","journal-title":"SIAM J. Optim."},{"key":"2197_CR7","doi-asserted-by":"publisher","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":"2197_CR8","doi-asserted-by":"publisher","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":"2197_CR9","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)"},{"key":"2197_CR10","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/j.orl.2019.01.005","volume":"47","author":"TD Chuong","year":"2019","unstructured":"Chuong, T.D.: Exact relaxations for parametric robust linear optimization problems. Oper. Res. Lett. 47, 105\u2013109 (2019)","journal-title":"Oper. Res. Lett."},{"key":"2197_CR11","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/s11228-017-0456-1","volume":"26","author":"NH Chieu","year":"2018","unstructured":"Chieu, N.H., Feng, J.W., Gao, W., Li, G., Wu, D.: SOS-convex semialgebraic programs and its applications to robust optimization: a tractable class of nonsmooth convex optimization. Set-Valued Var. Anal. 26, 305\u2013326 (2018)","journal-title":"Set-Valued Var. Anal."},{"key":"2197_CR12","doi-asserted-by":"publisher","first-page":"570","DOI":"10.1007\/s10957-022-02040-z","volume":"194","author":"CT Tinh","year":"2022","unstructured":"Tinh, C.T., Chuong, T.D.: Conic linear programming duals for classes of quadratic semi-infinite programs with applications. J. Optim. Theory Appl. 194, 570\u2013596 (2022)","journal-title":"J. Optim. Theory Appl."},{"key":"2197_CR13","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1016\/j.amc.2017.07.076","volume":"315","author":"TD Chuong","year":"2017","unstructured":"Chuong, T.D., Jeyakumar, V.: Convergent hierarchy of SDP relaxations for a class of semi-infinite convex polynomial programs and applications. Appl. Math. Comput. 315, 381\u2013399 (2017)","journal-title":"Appl. Math. Comput."},{"key":"2197_CR14","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1016\/j.laa.2016.11.008","volume":"515","author":"TD Chuong","year":"2017","unstructured":"Chuong, T.D., Jeyakumar, V.: A generalized Farkas lemma with a numerical certificate and linear semi-infinite programs with SDP duals. Linear Algebra Appl. 515, 38\u201352 (2017)","journal-title":"Linear Algebra Appl."},{"key":"2197_CR15","first-page":"1159","volume":"25","author":"TD Chuong","year":"2018","unstructured":"Chuong, T.D., Jeyakumar, V.: Tight SDP relaxations for a class of robust SOS-convex polynomial programs without the Slater condition. J. Convex Anal. 25, 1159\u20131182 (2018)","journal-title":"J. Convex Anal."},{"key":"2197_CR16","doi-asserted-by":"publisher","first-page":"885","DOI":"10.1007\/s10898-019-00831-9","volume":"75","author":"TD Chuong","year":"2019","unstructured":"Chuong, T.D., Jeyakumar, V., Li, G.: A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs. J. Global Optim. 75, 885\u2013919 (2019)","journal-title":"J. Global Optim."},{"key":"2197_CR17","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/s11590-018-1311-5","volume":"13","author":"N Dinh","year":"2019","unstructured":"Dinh, N., Goberna, M.A., L\u00f3pez, M.A., Volle, M.: Convexity and closedness in stable robust duality. Optim. Let. 13, 325\u2013339 (2019)","journal-title":"Optim. Let."},{"key":"2197_CR18","doi-asserted-by":"publisher","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":"2197_CR19","unstructured":"Grant, M., Boyd, S.: CVX, Matlab software for disciplined convex programming, version 2.1. http:\/\/cvxr.com\/cvx, March (2014)"},{"key":"2197_CR20","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.: Semidefinite representation of convex sets. Math. Program. Ser. A 122, 21\u201364 (2010)","journal-title":"Math. Program. Ser. A"},{"key":"2197_CR21","doi-asserted-by":"publisher","first-page":"947","DOI":"10.1137\/S1052623402401944","volume":"13","author":"V Jeyakumar","year":"2003","unstructured":"Jeyakumar, V.: Characterizing set containments involving infinite convex constraints and reverse-convex constraints. SIAM J. Optim. 13, 947\u2013959 (2003)","journal-title":"SIAM J. Optim."},{"key":"2197_CR22","doi-asserted-by":"publisher","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":"2197_CR23","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1016\/j.orl.2012.09.006","volume":"40","author":"V Jeyakumar","year":"2012","unstructured":"Jeyakumar, V., Li, G.: Exact SDP relaxations for classes of nonlinear semidefinite programming problems. Oper. Res. Let. 40, 529\u2013536 (2012)","journal-title":"Oper. Res. Let."},{"key":"2197_CR24","doi-asserted-by":"publisher","first-page":"760","DOI":"10.1137\/16M1058480","volume":"28","author":"V Jeyakumar","year":"2018","unstructured":"Jeyakumar, V., Li, G.: Exact second-order cone programming relaxations for some nonconvex minimax quadratic optimization problems. SIAM J. Optim. 28, 760\u2013787 (2018)","journal-title":"SIAM J. Optim."},{"key":"2197_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11590-014-0732-z","volume":"9","author":"V Jeyakumar","year":"2015","unstructured":"Jeyakumar, V., Li, G., Vicente-P\u00e9rez, J.: Robust SOS-convex polynomial optimization problems: exact SDP relaxations. Optim. Let. 9, 1\u201318 (2015)","journal-title":"Optim. Let."},{"key":"2197_CR26","doi-asserted-by":"publisher","first-page":"735","DOI":"10.1007\/s10957-013-0496-0","volume":"162","author":"V Jeyakumar","year":"2014","unstructured":"Jeyakumar, V., Vicente-P\u00e9rez, J.: Dual semidefinite programs without duality gaps for a class of convex minimax programs. J. Optim. Theory Appl. 162, 735\u2013753 (2014)","journal-title":"J. Optim. Theory Appl."},{"key":"2197_CR27","doi-asserted-by":"publisher","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":"2197_CR28","doi-asserted-by":"publisher","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, UK (2009)"},{"key":"2197_CR29","first-page":"157","volume-title":"Sums of squares, moment matrices and optimization over polynomials. Emerging Applications of algebraic Geometry","author":"M Laurent","year":"2009","unstructured":"Laurent, M.: Sums of squares, moment matrices and optimization over polynomials. Emerging Applications of algebraic Geometry, pp. 157\u2013270. Springer, New York (2009)"},{"key":"2197_CR30","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/s10107-017-1210-z","volume":"169","author":"JH Lee","year":"2018","unstructured":"Lee, J.H., Lee, G.M.: On minimizing difference of a SOS-convex polynomial and a support function over a SOS-concave matrix polynomial constraint. Math. Program. 169, 177\u2013198 (2018)","journal-title":"Math. Program."},{"key":"2197_CR31","doi-asserted-by":"publisher","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":"2197_CR32","unstructured":"Lofberg, J.: YALMIP, A toolbox for modeling and optimization in MATLAB. In: Proceedings of the CACSD Conference, Taipei, Taiwan (2004)"},{"key":"2197_CR33","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/BF01211741","volume":"6","author":"A Nemirovskii","year":"1993","unstructured":"Nemirovskii, A.: Several NP-hard problems arising in robust stability analysis. Math. Control Signals Syst. 6, 99\u2013105 (1993)","journal-title":"Math. Control Signals Syst."},{"key":"2197_CR34","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970791","volume-title":"Interior-point polynomial algorithms in convex programming","author":"Y Nesterov","year":"1994","unstructured":"Nesterov, Y., Nemirovski, A.: Interior-point polynomial algorithms in convex programming. SIAM, Philadelphia (1994)"},{"key":"2197_CR35","doi-asserted-by":"crossref","unstructured":"Parrilo, P.A.: Polynomial optimization, sums of squares, and applications. In: Semidefinite Optimization and Convex Algebraic Geometry. 47-157, MOS-SIAM Ser. Optim., 13, SIAM, Philadelphia, PA (2013)","DOI":"10.1137\/1.9781611972290.ch3"},{"key":"2197_CR36","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/BF01100204","volume":"7","author":"M Ramana","year":"1995","unstructured":"Ramana, M., Goldman, A.J.: Some geometric results in semidefinite programming. J. Global Optim. 7, 33\u201350 (1995)","journal-title":"J. Global Optim."},{"key":"2197_CR37","doi-asserted-by":"publisher","DOI":"10.1515\/9781400873173","volume-title":"Convex analysis","author":"RT Rockafellar","year":"1970","unstructured":"Rockafellar, R.T.: Convex analysis. Princeton University Press, Princeton (1970)"},{"key":"2197_CR38","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1137\/1038003","volume":"38","author":"L Vandenberghe","year":"1996","unstructured":"Vandenberghe, L., Boyd, S.: Semidefinite programming. SIAM Rev. 38, 49\u201395 (1996)","journal-title":"SIAM Rev."},{"key":"2197_CR39","doi-asserted-by":"publisher","first-page":"492","DOI":"10.1090\/noti1116","volume":"61","author":"C Vinzant","year":"2014","unstructured":"Vinzant, C.: What is a spectrahedron? Notices Am. Math. Soc. 61, 492\u2013494 (2014)","journal-title":"Notices Am. Math. Soc."}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-023-02197-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10957-023-02197-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-023-02197-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,9]],"date-time":"2023-12-09T15:55:21Z","timestamp":1702137321000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10957-023-02197-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,24]]},"references-count":39,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,5]]}},"alternative-id":["2197"],"URL":"https:\/\/doi.org\/10.1007\/s10957-023-02197-1","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"type":"print","value":"0022-3239"},{"type":"electronic","value":"1573-2878"}],"subject":[],"published":{"date-parts":[[2023,3,24]]},"assertion":[{"value":"31 October 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 March 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 March 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}