{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T13:38:58Z","timestamp":1740145138314,"version":"3.37.3"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,10,26]],"date-time":"2022-10-26T00:00:00Z","timestamp":1666742400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,10,26]],"date-time":"2022-10-26T00:00:00Z","timestamp":1666742400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001691","name":"japan society for the promotion of science","doi-asserted-by":"publisher","award":["JP15H02968 and JP19K20217."],"award-info":[{"award-number":["JP15H02968 and JP19K20217."]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"national science foundation","doi-asserted-by":"publisher","award":["DMS-1817272"],"award-info":[{"award-number":["DMS-1817272"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2023,3]]},"DOI":"10.1007\/s11590-022-01898-2","type":"journal-article","created":{"date-parts":[[2022,10,26]],"date-time":"2022-10-26T14:02:44Z","timestamp":1666792964000},"page":"219-243","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A simplified treatment of Ramana\u2019s exact dual for semidefinite programming"],"prefix":"10.1007","volume":"17","author":[{"given":"Bruno F.","family":"Louren\u00e7o","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6377-9806","authenticated-orcid":false,"given":"G\u00e1bor","family":"Pataki","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,10,26]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Ben-Tal, A., Nemirovskii, A.: Lectures on Modern Convex Optimization. MPS\/SIAM Series on Optimization. SIAM, Philadelphia (2001)","key":"1898_CR1","DOI":"10.1137\/1.9780898718829"},{"key":"1898_CR2","series-title":"CMS Books in Mathematics","volume-title":"Convex Analysis and Nonlinear Optimization: Theory and Examples","author":"JM Borwein","year":"2005","unstructured":"Borwein, J.M., Lewis, A.S.: Convex Analysis and Nonlinear Optimization: Theory and Examples. CMS Books in Mathematics, 2nd edn. Springer, Berlin (2005)","edition":"2"},{"key":"1898_CR3","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1017\/S1446788700017250","volume":"30","author":"JM Borwein","year":"1981","unstructured":"Borwein, J.M., Wolkowicz, H.: Facial reduction for a cone-convex programming problem. J. Aust. Math. Soc. 30, 369\u2013380 (1981)","journal-title":"J. Aust. Math. Soc."},{"key":"1898_CR4","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1016\/0022-247X(81)90138-4","volume":"83","author":"JM Borwein","year":"1981","unstructured":"Borwein, J.M., Wolkowicz, H.: Regularizing the abstract convex program. J. Math. Anal. Appl. 83, 495\u2013530 (1981)","journal-title":"J. Math. Anal. Appl."},{"key":"1898_CR5","volume-title":"Aspects of Semidefinite Programming: Interior Point Algorithms and Selected Applications","author":"E De Klerk","year":"2006","unstructured":"De Klerk, E.: Aspects of Semidefinite Programming: Interior Point Algorithms and Selected Applications. Springer, Cham (2006)"},{"doi-asserted-by":"crossref","unstructured":"De Klerk, E., Terlaky, T., Roos, K.: Self-dual embeddings. In: Handbook of Semidefinite Programming, pp 111\u2013138. Springer (2000)","key":"1898_CR6","DOI":"10.1007\/978-1-4615-4381-7_5"},{"issue":"2","key":"1898_CR7","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1561\/2400000011","volume":"3","author":"D Drusvyatskiy","year":"2017","unstructured":"Drusvyatskiy, D., Wolkowicz, H., et al.: The many faces of degeneracy in conic optimization. Found. Trends\u00ae Opt. 3(2), 77\u2013170 (2017)","journal-title":"Found. Trends\u00ae Opt."},{"issue":"3","key":"1898_CR8","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1287\/moor.1120.0584","volume":"38","author":"I Klep","year":"2013","unstructured":"Klep, I., Schweighofer, M.: An exact duality theory for semidefinite programming based on sums of squares. Math. Oper. Res. 38(3), 569\u2013590 (2013)","journal-title":"Math. Oper. Res."},{"key":"1898_CR9","first-page":"393","volume":"12","author":"M Laurent","year":"2005","unstructured":"Laurent, M., Rendl, F.: Semidefinite programming and integer programming. Handb. Oper. Res. Manag. Sci. 12, 393\u2013514 (2005)","journal-title":"Handb. Oper. Res. Manag. Sci."},{"issue":"2","key":"1898_CR10","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1007\/s10107-017-1136-5","volume":"167","author":"M Liu","year":"2018","unstructured":"Liu, M., Pataki, G.: Exact duals and short certificates of infeasibility and weak infeasibility in conic linear programming. Math. Program. 167(2), 435\u2013480 (2018)","journal-title":"Math. Program."},{"issue":"3","key":"1898_CR11","first-page":"241","volume":"59","author":"BF Louren\u00e7o","year":"2016","unstructured":"Louren\u00e7o, B.F., Muramatsu, M., Tsuchiya, T.: A structural geometrical analysis of weakly infeasible SDPs. J. Oper. Res. Soc. Jpn. 59(3), 241\u2013257 (2016)","journal-title":"J. Oper. Res. Soc. Jpn."},{"key":"1898_CR12","doi-asserted-by":"crossref","DOI":"10.1090\/coll\/065","volume-title":"Graphs and Geometry","author":"L Lov\u00e1sz","year":"2019","unstructured":"Lov\u00e1sz, L.: Graphs and Geometry, vol. 65. American Mathematical Society, Providence (2019)"},{"unstructured":"Luo, Z.-Q., Sturm, J., Zhang, S.: Duality Results for Conic Convex Programming. Technical Report Report 9719\/A, Erasmus University Rotterdam, Econometric Institute, The Netherlands (1997)","key":"1898_CR13"},{"key":"1898_CR14","first-page":"413","volume":"1","author":"A Nemirovski","year":"2007","unstructured":"Nemirovski, A.: Advances in convex optimization: conic programming. Int. Congr. Math. 1, 413\u2013444 (2007)","journal-title":"Int. Congr. Math."},{"unstructured":"O\u2019Donnell, R.: SOS is not obviously automatizable, even approximately. In: 8th Innovations in Theoretical Computer Science Conference (ITCS 2017). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2017)","key":"1898_CR15"},{"unstructured":"Pataki, G.: Strong duality in conic linear programming: facial reduction and extended duals. In: Bailey, D., Bauschke, H.H., Garvan, F., Th\u00e9ra, M., Vanderwerff, J.D., Wolkowicz, H. (eds.) Proceedings of Jonfest: A Conference in Honour of the 60th Birthday of Jon Borwein. Springer (2013). Also available from http:\/\/arxiv.org\/abs\/1301.7717","key":"1898_CR16"},{"issue":"4","key":"1898_CR17","doi-asserted-by":"publisher","first-page":"839","DOI":"10.1137\/17M1140844","volume":"61","author":"G Pataki","year":"2019","unstructured":"Pataki, G.: Characterizing bad semidefinite programs: normal forms and short proofs. SIAM Rev. 61(4), 839\u2013859 (2019)","journal-title":"SIAM Rev."},{"issue":"1","key":"1898_CR18","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1137\/15M1041924","volume":"27","author":"G Pataki","year":"2017","unstructured":"Pataki, G.: Bad semidefinite programs: they all look the same. SIAM J. Opt. 27(1), 146\u2013172 (2017)","journal-title":"SIAM J. Opt."},{"key":"1898_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10107-017-1169-9","volume":"171","author":"F Permenter","year":"2014","unstructured":"Permenter, F., Parrilo, P.: Partial facial reduction: simplified, equivalent SDPs via approximations of the PSD cone. Math. Program. 171, 1\u201354 (2014)","journal-title":"Math. Program."},{"key":"1898_CR20","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/BF02614433","volume":"77","author":"MV Ramana","year":"1997","unstructured":"Ramana, M.V.: An exact duality theory for semidefinite programming and its complexity implications. Math. Program. Ser. B 77, 129\u2013162 (1997)","journal-title":"Math. Program. Ser. B"},{"unstructured":"Ramana, M.V., Freund, R.: On the ELSD Duality Theory for SDP. Technical Report, MIT (1996)","key":"1898_CR21"},{"issue":"3","key":"1898_CR22","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1137\/S1052623495288350","volume":"7","author":"MV Ramana","year":"1997","unstructured":"Ramana, M.V., Tun\u00e7el, L., Wolkowicz, H.: Strong duality for semidefinite programming. SIAM J. Opt. 7(3), 641\u2013662 (1997)","journal-title":"SIAM J. Opt."},{"key":"1898_CR23","series-title":"MPS-SIAM Series on Optimization","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718812","volume-title":"A Mathematical View of Interior-Point Methods in Convex Optimization","author":"J Renegar","year":"2001","unstructured":"Renegar, J.: A Mathematical View of Interior-Point Methods in Convex Optimization. MPS-SIAM Series on Optimization, SIAM, Philadelphia (2001)"},{"key":"1898_CR24","doi-asserted-by":"publisher","DOI":"10.1515\/9781400873173","volume-title":"Convex Analysis","author":"TR Rockafellar","year":"1970","unstructured":"Rockafellar, T.R.: Convex Analysis. Princeton University Press, Princeton (1970)"},{"issue":"1","key":"1898_CR25","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(1), 49\u201395 (1996)","journal-title":"SIAM Rev."},{"issue":"1","key":"1898_CR26","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1007\/s10957-012-0219-y","volume":"158","author":"H Waki","year":"2013","unstructured":"Waki, H., Muramatsu, M.: Facial reduction algorithms for conic optimization problems. J. Optim. Theory Appl. 158(1), 188\u2013215 (2013)","journal-title":"J. Optim. Theory Appl."},{"issue":"3","key":"1898_CR27","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1007\/s12532-019-00164-4","volume":"11","author":"Y Zhu","year":"2019","unstructured":"Zhu, Y., Pataki, G., Tran-Dinh, Q.: Sieve-SDP: a simple facial reduction algorithm to preprocess semidefinite programs. Math. Program. Comput. 11(3), 503\u2013586 (2019)","journal-title":"Math. Program. Comput."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-022-01898-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-022-01898-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-022-01898-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,9]],"date-time":"2023-02-09T23:07:15Z","timestamp":1675984035000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-022-01898-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,26]]},"references-count":27,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,3]]}},"alternative-id":["1898"],"URL":"https:\/\/doi.org\/10.1007\/s11590-022-01898-2","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"type":"print","value":"1862-4472"},{"type":"electronic","value":"1862-4480"}],"subject":[],"published":{"date-parts":[[2022,10,26]]},"assertion":[{"value":"9 July 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 May 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 October 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}