{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:46:46Z","timestamp":1740124006248,"version":"3.37.3"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,5,19]],"date-time":"2022-05-19T00:00:00Z","timestamp":1652918400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,5,19]],"date-time":"2022-05-19T00:00:00Z","timestamp":1652918400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2022,8]]},"DOI":"10.1007\/s10957-022-02040-z","type":"journal-article","created":{"date-parts":[[2022,5,19]],"date-time":"2022-05-19T16:04:53Z","timestamp":1652976293000},"page":"570-596","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Conic Linear Programming Duals for Classes of Quadratic Semi-Infinite Programs with Applications"],"prefix":"10.1007","volume":"194","author":[{"given":"Cao Thanh","family":"Tinh","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0893-5604","authenticated-orcid":false,"given":"Thai Doan","family":"Chuong","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,5,19]]},"reference":[{"key":"2040_CR1","doi-asserted-by":"crossref","unstructured":"Ben-Tal, A., El Ghaoui, L., Nemirovski, A.: Robust Optimization. Princeton Ser. Appl. Math. Princeton University Press, Princeton, NJ (2009)","DOI":"10.1515\/9781400831050"},{"key":"2040_CR2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718829","volume-title":"Lectures on Modern Convex Optimization: Analysis, Algorithms, and Engineering Applications","author":"A Ben-Tal","year":"2001","unstructured":"Ben-Tal, A., Nemirovski, A.: Lectures on Modern Convex Optimization: Analysis, Algorithms, and Engineering Applications. SIAM, Philadelphia (2001)"},{"key":"2040_CR3","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1137\/080734510","volume":"53","author":"D Bertsimas","year":"2011","unstructured":"Bertsimas, D., Brown, B.D., Caramanis, C.: Theory and applications of robust optimization. SIAM Rev. 53, 464\u2013501 (2011)","journal-title":"SIAM Rev."},{"key":"2040_CR4","volume-title":"Semidefinite Optimization and Convex Algebraic Geometry","author":"G Blekherman","year":"2013","unstructured":"Blekherman, G., Parrilo, P.A., Thomas, R.: Semidefinite Optimization and Convex Algebraic Geometry. SIAM Publications, Philadelphia (2013)"},{"key":"2040_CR5","first-page":"279","volume":"12","author":"RS Burachik","year":"2005","unstructured":"Burachik, R.S., Jeyakumar, V.: A dual condition for the convex subdifferential sum formula with applications. J. Convex Anal. 12, 279\u2013290 (2005)","journal-title":"J. Convex Anal."},{"key":"2040_CR6","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/s10957-020-01646-5","volume":"185","author":"TD Chuong","year":"2020","unstructured":"Chuong, T.D.: Semidefinite program duals for separable polynomial programs involving box constraints. J. Optim. Theory Appl. 185, 289\u2013299 (2020)","journal-title":"J. Optim. Theory Appl."},{"issue":"3","key":"2040_CR7","doi-asserted-by":"publisher","first-page":"2466","DOI":"10.1137\/17M1143484","volume":"28","author":"TD Chuong","year":"2018","unstructured":"Chuong, T.D.: Linear matrix inequality conditions and duality for a class of robust multiobjective convex polynomial programs. SIAM J. Optim. 28(3), 2466\u20132488 (2018)","journal-title":"SIAM J. Optim."},{"key":"2040_CR8","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":"2040_CR9","first-page":"381","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":"2040_CR10","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":"2040_CR11","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, 220\u2013226 (2017)","journal-title":"Oper. Res. Lett."},{"key":"2040_CR12","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":"2040_CR13","doi-asserted-by":"publisher","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., L\u00f3pez, M.A.: Robust linear semi-infinite programming duality under uncertainty. Math. Program. 139, 185\u2013203 (2013)","journal-title":"Math. Program."},{"key":"2040_CR14","volume-title":"Linear Semi-Infinite Optimization","author":"MA Goberna","year":"1998","unstructured":"Goberna, M.A., L\u00f3pez, M.A.: Linear Semi-Infinite Optimization. John Wiley & Sons, Chichester (1998)"},{"key":"2040_CR15","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4899-8044-1","volume-title":"Post-Optimal Analysis in Linear Semi-Infinite Optimization","author":"MA Goberna","year":"2014","unstructured":"Goberna, M.A., L\u00f3pez, M.A.: Post-Optimal Analysis in Linear Semi-Infinite Optimization. Springer-Verlag, NY, Springer Briefs (2014)"},{"key":"2040_CR16","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/s10479-018-2987-8","volume":"271","author":"MA Goberna","year":"2018","unstructured":"Goberna, M.A., L\u00f3pez, M.A.: Recent contributions to linear semi-innite optimization: An update. Ann. Oper. Res. 271, 237\u2013278 (2018)","journal-title":"Ann. Oper. Res."},{"key":"2040_CR17","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":"2040_CR18","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":"2040_CR19","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-Perez, J.: Robust SOS-convex polynomial programs: Exact SDP relaxations. Optim. Lett. 9, 1\u201318 (2015)","journal-title":"Optim. Lett."},{"issue":"6","key":"2040_CR20","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(6), 3384\u20133407 (2010)","journal-title":"SIAM J. Optim."},{"key":"2040_CR21","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":"2040_CR22","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-Perez, J.: Dual semidenite 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":"2040_CR23","doi-asserted-by":"publisher","first-page":"638","DOI":"10.1016\/j.jmaa.2015.08.013","volume":"434","author":"N Kanzi","year":"2016","unstructured":"Kanzi, N., Soleimani-damaneh, M.: Slater CQ, optimality and duality for quasiconvex semi-infinite optimization problems. J. Math. Anal. Appl. 434, 638\u2013651 (2016)","journal-title":"J. Math. Anal. Appl."},{"key":"2040_CR24","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":"2040_CR25","unstructured":"Lofberg, J.: YALMIP: A toolbox for modeling and optimization in MATLAB. In: Proceedings of the CACSD Conference, Taipei, Taiwan, 4 September 2004, pp. 284\u2013289"},{"key":"2040_CR26","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1016\/j.ejor.2006.08.045","volume":"180","author":"MA L\u00f3pez","year":"2007","unstructured":"L\u00f3pez, M.A., Still, G.: Semi-infinite programming. Eur. J. Oper. Res. 180, 491\u2013518 (2007)","journal-title":"Eur. J. Oper. Res."},{"key":"2040_CR27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-71333-3","volume-title":"Nonsmooth Analysis","author":"W Schirotzek","year":"2007","unstructured":"Schirotzek, W.: Nonsmooth Analysis. Universitext, Springer, Berlin (2007)"},{"key":"2040_CR28","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1016\/j.ejor.2012.06.009","volume":"223","author":"O Stein","year":"2012","unstructured":"Stein, O.: How to solve a semi-infinite optimization problem. Eur. J. Oper. Res. 223, 312\u2013320 (2012)","journal-title":"Eur. J. Oper. Res."},{"key":"2040_CR29","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/s10589-013-9612-1","volume":"58","author":"L Wang","year":"2014","unstructured":"Wang, L., Guo, F.: Semidefinite relaxations for semi-infinite polynomial programming. Comput. Optim. Appl. 58, 133\u2013159 (2014)","journal-title":"Comput. Optim. Appl."},{"key":"2040_CR30","unstructured":"Xu, Y., Sun, W., Qi. L.: On solving a class of linear semi-infinite programming by SDP method. Optimization 64, 603\u2013616 (2015)"},{"key":"2040_CR31","doi-asserted-by":"publisher","DOI":"10.1142\/5021","volume-title":"Convex Analysis in General Vector Spaces","author":"C Zalinescu","year":"2002","unstructured":"Zalinescu, C.: Convex Analysis in General Vector Spaces. World Scientific, Singapore (2002)"}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-022-02040-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10957-022-02040-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-022-02040-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,7]],"date-time":"2022-07-07T20:12:41Z","timestamp":1657224761000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10957-022-02040-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,19]]},"references-count":31,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,8]]}},"alternative-id":["2040"],"URL":"https:\/\/doi.org\/10.1007\/s10957-022-02040-z","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"type":"print","value":"0022-3239"},{"type":"electronic","value":"1573-2878"}],"subject":[],"published":{"date-parts":[[2022,5,19]]},"assertion":[{"value":"17 August 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 April 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 May 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}