{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,11]],"date-time":"2026-02-11T16:20:20Z","timestamp":1770826820374,"version":"3.50.1"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2021,7,5]],"date-time":"2021-07-05T00:00:00Z","timestamp":1625443200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,7,5]],"date-time":"2021-07-05T00:00:00Z","timestamp":1625443200000},"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 Glob Optim"],"published-print":{"date-parts":[[2021,12]]},"DOI":"10.1007\/s10898-021-01050-x","type":"journal-article","created":{"date-parts":[[2021,7,5]],"date-time":"2021-07-05T05:02:41Z","timestamp":1625461361000},"page":"1095-1117","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Exact SDP reformulations of adjustable robust linear programs with box uncertainties under separable quadratic decision rules via SOS representations of non-negativity"],"prefix":"10.1007","volume":"81","author":[{"given":"T. D.","family":"Chuong","sequence":"first","affiliation":[]},{"given":"V.","family":"Jeyakumar","sequence":"additional","affiliation":[]},{"given":"G.","family":"Li","sequence":"additional","affiliation":[]},{"given":"D.","family":"Woolnough","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,7,5]]},"reference":[{"key":"1050_CR1","doi-asserted-by":"publisher","first-page":"474","DOI":"10.1287\/opre.2016.1483","volume":"64","author":"A Ardestani-Jaafari","year":"2016","unstructured":"Ardestani-Jaafari, A., Delick, E.: Robust optimization of sums of piecewise linear functions with application to inventory production problems. Oper. Res. 64, 474\u2013494 (2016)","journal-title":"Oper. Res."},{"key":"1050_CR2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972290","volume-title":"Semidefinite Optimization and Convex Algebraic Geometry","author":"G Blekherman","year":"2012","unstructured":"Blekherman, G., Parrilo, P., Thomas, R.: Semidefinite Optimization and Convex Algebraic Geometry. SIAM, Philadelphia (2012)"},{"key":"1050_CR3","volume-title":"Robust Optimization. Princeton Series Applied Mathematics","author":"A Ben-Tal","year":"2009","unstructured":"Ben-Tal, A., El Ghaoui, L., Nemirovski, A.: Robust Optimization. Princeton Series Applied Mathematics. Princeton University Press, Princeton (2009)"},{"issue":"2","key":"1050_CR4","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/s10107-003-0454-y","volume":"99","author":"A Ben-Tal","year":"2004","unstructured":"Ben-Tal, A., Goryashko, A., Guslitzer, E., Nemirovski, A.: Adjustable robust solutions of uncertain linear programs. Math. Program. Ser. A 99(2), 351\u2013376 (2004)","journal-title":"Math. Program. Ser. A"},{"key":"1050_CR5","first-page":"1","volume":"25","author":"A Ben-Tal","year":"1999","unstructured":"Ben-Tal, A., Nemirovski, A.: Robust solutions of uncertain linear programs. Oper. Res. 25, 1\u201313 (1999)","journal-title":"Oper. Res."},{"key":"1050_CR6","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1137\/080734510","volume":"53","author":"D Bertsimas","year":"2011","unstructured":"Bertsimas, D., Brown, D.B., Caramanis, C.: Theory and applications of robust optimization. SIAM Rev. 53, 464\u2013501 (2011)","journal-title":"SIAM Rev."},{"issue":"4","key":"1050_CR7","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/j.orl.2017.04.005","volume":"45","author":"NH Chieu","year":"2017","unstructured":"Chieu, N.H., Jeyakumar, V., Li, G.: A convergent hierarchy of SDP relaxations for a class of hard robust global polynomial optimization problems. Oper. Res. Lett. 45(4), 325\u2013333 (2017)","journal-title":"Oper. Res. Lett."},{"key":"1050_CR8","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. Glob. Optim. 75, 885\u2013919 (2019)","journal-title":"J. Glob. Optim."},{"key":"1050_CR9","doi-asserted-by":"publisher","first-page":"488","DOI":"10.1007\/s10957-020-01753-3","volume":"187","author":"TD Chuong","year":"2020","unstructured":"Chuong, T.D., Jeyakumar, V.: Generalized Farkas\u2019 lemma with adjustable variables and two-stage robust linear programs. J. Optim. Theor. Appl. 187, 488\u2013519 (2020)","journal-title":"J. Optim. Theor. Appl."},{"key":"1050_CR10","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/s10287-016-0253-6","volume":"14","author":"F de Ruiter","year":"2017","unstructured":"de Ruiter, F., Ben-Tal, A., Brekelmans, R., den Hertog, D.: Robust optimization of uncertain multistage inventory systems with inexact data in decision rules. Comput. Manag. Sci. 14, 45\u201366 (2017)","journal-title":"Comput. Manag. Sci."},{"key":"1050_CR11","doi-asserted-by":"crossref","unstructured":"Delage, E., Iancu, D.A.: Robust multistage decision making. In: INFORMS tutorials in operations research, chapter 2, pp. 20\u201346 (2015)","DOI":"10.1287\/educ.2015.0139"},{"key":"1050_CR12","unstructured":"Grant, M., Boyd, S.: CVX: Matlab software for disciplined convex programming, version 2.1. http:\/\/cvxr.com\/cvx (2014)"},{"key":"1050_CR13","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-0015-5","volume-title":"Introduction to Global Optimization","author":"R Horst","year":"2000","unstructured":"Horst, R., Pardalos, P.M., Thoai, N.V.: Introduction to Global Optimization, 2nd edn. Kluwer, Dortrecht (2000)","edition":"2"},{"key":"1050_CR14","doi-asserted-by":"publisher","first-page":"3384","DOI":"10.1137\/100791841","volume":"6","author":"V Jeyakumar","year":"2010","unstructured":"Jeyakumar, V., Li, G.: Strong duality in robust convex programming: complete characterizations. SIAM J. Optim. 6, 3384\u20133407 (2010)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"1050_CR15","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), 1\u201318 (2015)","journal-title":"Optim. Lett."},{"key":"1050_CR16","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":"1050_CR17","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, London (2009)"},{"key":"1050_CR18","unstructured":"Lofberg, J.: YALMIP: a toolbox for modeling and optimization in MATLAB. In: Proceedings of the CACSD conference, Taipei, Taiwan (2004)"},{"issue":"2","key":"1050_CR19","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1007\/s10107-017-1166-z","volume":"170","author":"A Marandi","year":"2018","unstructured":"Marandi, A., den Hertog, D.: When are static and adjustable robust optimization problems with constraint-wise uncertainty equivalent? Math. Program. 170(2), 555\u2013568 (2018)","journal-title":"Math. Program."},{"key":"1050_CR20","unstructured":"MOSEK ApS, The MOSEK optimization toolbox for MATLAB manual. Version 9.0. http:\/\/docs.mosek.com\/9.0\/toolbox\/index.html (2019)"},{"key":"1050_CR21","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1137\/S003614450444614X","volume":"49","author":"I Polik","year":"2007","unstructured":"Polik, I., Terlaky, T.: A survey of S-lemma. SIAM Rev. 49, 317\u2013418 (2007)","journal-title":"SIAM Rev."},{"key":"1050_CR22","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s11590-020-01595-y","volume":"15","author":"D Woolnough","year":"2021","unstructured":"Woolnough, D., Jeyakumar, V., Li, G.: Exact conic programming reformulations of two-stage adjustable robust linear programs with new quadratic decision rules. Optim. Lett. 15, 25\u201344 (2021)","journal-title":"Optim. Lett."},{"issue":"3","key":"1050_CR23","doi-asserted-by":"publisher","first-page":"799","DOI":"10.1016\/j.ejor.2018.08.031","volume":"277","author":"I Yanikoglu","year":"2019","unstructured":"Yanikoglu, I., Gorissen, B.L., den Hertog, D.: A survey of adjustable robust optimization. Eur. J. Oper. Res. 277(3), 799\u2013813 (2019)","journal-title":"Eur. J. Oper. Res."},{"key":"1050_CR24","volume-title":"Adjustable Robust Optimization: Theory, Algorithm and Applications","author":"J Zhen","year":"2018","unstructured":"Zhen, J.: Adjustable Robust Optimization: Theory, Algorithm and Applications. CentER, Center for Economic Research, Tilburg (2018)"},{"issue":"4","key":"1050_CR25","doi-asserted-by":"publisher","first-page":"1086","DOI":"10.1287\/opre.2017.1714","volume":"66","author":"J Zhen","year":"2018","unstructured":"Zhen, J., den Hertog, D., Sim, M.: Adjustable robust optimization via Fourier\u2013Motzkin elimination. Oper. Res. 66(4), 1086\u20131100 (2018)","journal-title":"Oper. Res."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-021-01050-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10898-021-01050-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-021-01050-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,10]],"date-time":"2021-11-10T05:05:59Z","timestamp":1636520759000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10898-021-01050-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,5]]},"references-count":25,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2021,12]]}},"alternative-id":["1050"],"URL":"https:\/\/doi.org\/10.1007\/s10898-021-01050-x","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,7,5]]},"assertion":[{"value":"6 May 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 June 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 July 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}