{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T12:03:38Z","timestamp":1773144218115,"version":"3.50.1"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2012,11,10]],"date-time":"2012-11-10T00:00:00Z","timestamp":1352505600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2013,7]]},"DOI":"10.1007\/s10957-012-0219-y","type":"journal-article","created":{"date-parts":[[2012,11,9]],"date-time":"2012-11-09T05:18:51Z","timestamp":1352438331000},"page":"188-215","source":"Crossref","is-referenced-by-count":53,"title":["Facial Reduction Algorithms for Conic Optimization Problems"],"prefix":"10.1007","volume":"158","author":[{"given":"Hayato","family":"Waki","sequence":"first","affiliation":[]},{"given":"Masakazu","family":"Muramatsu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,11,10]]},"reference":[{"key":"219_CR1","unstructured":"P\u00f3lik, I., Terlaky, T.: Exact duality for optimization over symmetric cones. Advol-report no. 2007\/10, Advanced Optimization Laboratory, McMaster University (2007)"},{"key":"219_CR2","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1017\/S0962492901000071","volume":"10","author":"J.M. Todd","year":"2001","unstructured":"Todd, J.M.: Semidefinite optimization. Acta Numer. 10, 515\u2013560 (2001)","journal-title":"Acta Numer."},{"key":"219_CR3","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1017\/S1446788700017250","volume":"30","author":"M.J. Borwein","year":"1981","unstructured":"Borwein, M.J., 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":"219_CR4","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1016\/0022-247X(81)90138-4","volume":"83","author":"M.J. Borwein","year":"1981","unstructured":"Borwein, M.J., Wolkowicz, H.: Regularizing the abstract convex program. J. Math. Anal. Appl. 83, 495\u2013530 (1981)","journal-title":"J. Math. Anal. Appl."},{"key":"219_CR5","unstructured":"Pataki, G.: A simple derivation of a facial reduction algorithm and extended dual systems. Technical report, Columbia University (2000)"},{"key":"219_CR6","unstructured":"Luo, Z.-Q., Sturm, F.J., Zhang, S.: Duality results for conic convex programming. Econometric institute report no. 9719\/a, Econometric Institute, Erasmus University Rotterdam (1997)"},{"key":"219_CR7","unstructured":"Sturm, F.J.: Primal\u2013dual interior point approach to semidefinite programming. Ph.D. Thesis, Erasmus University Rotterdam (1997)"},{"key":"219_CR8","first-page":"1","volume-title":"High Performance Optimization","author":"F.J. Sturm","year":"2000","unstructured":"Sturm, F.J.: Theory and algorithms of semidefinite programming. In: Frenk, H., Roos, K., Terlaky, T. (eds.) High Performance Optimization, pp. 1\u2013194. Kluwer Academic, Amsterdam (2000)"},{"key":"219_CR9","first-page":"129","volume":"77","author":"V.M. Ramana","year":"1997","unstructured":"Ramana, V.M.: An exact duality theory for semidefinite programming and its complexity implications. Math. Program. 77, 129\u2013162 (1997)","journal-title":"Math. Program."},{"issue":"3","key":"219_CR10","doi-asserted-by":"crossref","first-page":"641","DOI":"10.1137\/S1052623495288350","volume":"7","author":"V.M. Ramana","year":"1997","unstructured":"Ramana, V.M., Tun\u00e7el, L., Wolkowicz, H.: Strong duality for semidefinite programming. SIAM J. Optim. 7(3), 641\u2013662 (1997)","journal-title":"SIAM J. Optim."},{"key":"219_CR11","doi-asserted-by":"crossref","DOI":"10.1090\/fim\/027","volume-title":"Polyhedral and Semidefinite Programming Methods in Combinatorial Optimization","author":"L. Tun\u00e7el","year":"2010","unstructured":"Tun\u00e7el, L.: Polyhedral and Semidefinite Programming Methods in Combinatorial Optimization. American Mathematical Society, Providence (2010)"},{"issue":"5","key":"219_CR12","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1016\/j.orl.2010.05.011","volume":"38","author":"H. Waki","year":"2001","unstructured":"Waki, H., Muramatsu, M.: Facial reduction algorithms for finding sparse SOS representations. Oper. Res. Lett. 38(5), 361\u2013365 (2001)","journal-title":"Oper. Res. Lett."},{"issue":"4","key":"219_CR13","first-page":"161","volume":"54","author":"H. Waki","year":"2011","unstructured":"Waki, H., Muramatsu, M.: An extension of the elimination method for a sparse SOS polynomial. J.\u00a0Oper. Res. Soc. Jpn. 54(4), 161\u2013190 (2011)","journal-title":"J.\u00a0Oper. Res. Soc. Jpn."},{"key":"219_CR14","series-title":"Princeton Landmarks in Mathematics and Physics","doi-asserted-by":"crossref","DOI":"10.1515\/9781400873173","volume-title":"Convex Analysis","author":"R.T. Rockafellar","year":"1970","unstructured":"Rockafellar, R.T.: In: Convex Analysis. Princeton Landmarks in Mathematics and Physics (1970)"},{"key":"219_CR15","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/978-1-4615-4381-7_3","volume-title":"Handbook of semidefinite programming","author":"G. Pataki","year":"2000","unstructured":"Pataki, G.: The geometry of semidefinite programming. In: Wolkowicz, H., Saigal, R., Vandenberghe,\u00a0L. (eds.) Handbook of semidefinite programming, pp. 29\u201365. Kluwers Academic, Amsterdam (2000)"},{"key":"219_CR16","unstructured":"Pataki, G.: On the connection of facially exposed, and nice cones. Available from arXiv:1202.4043"},{"key":"219_CR17","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/s10107-004-0554-3","volume":"103","author":"M. Kojima","year":"2005","unstructured":"Kojima, M., Kim, S., Waki, H.: Sparsity in sums of squares of polynomials. Math. Program. 103, 45\u201362 (2005)","journal-title":"Math. Program."},{"issue":"2","key":"219_CR18","doi-asserted-by":"crossref","first-page":"15:1","DOI":"10.1145\/1377612.1377619","volume":"35","author":"H. Waki","year":"2008","unstructured":"Waki, H., Kim, S., Kojima, M., Muramatsu, M., Sugimoto, H.: Algorithm 883: SparsePOP: a sparse semidefinite programming relaxation of polynomial optimization problems. ACM Trans. Math. Softw. 35(2), 15:1\u201315:13 (2008)","journal-title":"ACM Trans. Math. Softw."},{"key":"219_CR19","author":"H. Waki","year":"2011","unstructured":"Waki, H., Nakata, M., Muramatsu, M.: Strange behaviors of interior-point methods for solving semidefinite programming problems in polynomial optimization. Comput. Optim. Appl. (2011). doi: 10.1007\/s10589-011-9437-8","journal-title":"Comput. Optim. Appl."},{"key":"219_CR20","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1080\/10556789908805766","volume":"11\u201312","author":"F.J. Sturm","year":"1999","unstructured":"Sturm, F.J.: Using SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones. Optim. Methods Softw. 11\u201312, 625\u2013653 (1999)","journal-title":"Optim. Methods Softw."},{"key":"219_CR21","unstructured":"Fujisawa, K., Fukuda, M., Kobayashi, K., Kojima, M., Nakata, K., Nakata, M., Yamashita, M.: SDPA (SemiDefinite Programming Algorithm) User\u2019s Manual\u2014Version 7.0.5. Department of Mathematical and Computer Sciences B-448 (2008)"},{"key":"219_CR22","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1007\/s10107-002-0355-5","volume":"95","author":"H.D. Mittelmann","year":"2003","unstructured":"Mittelmann, H.D.: An independent benchmarking of sdp and socp solvers. Math. Program. 95, 407\u2013430 (2003)","journal-title":"Math. Program."},{"key":"219_CR23","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1007\/978-1-4757-3216-0_11","volume-title":"High Performance Optimization","author":"K. Fujisawa","year":"2000","unstructured":"Fujisawa, K., Fukuda, M., Kojima, M., Nakata, K.: Numerical evaluation of SDPA (Semidefinite Programming Algorithm). In: Frenk, H., Roos, K., Terlaky, T. (eds.) High Performance Optimization, pp. 267\u2013301. Kluwer Academic, Amsterdam (2000)"},{"key":"219_CR24","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/s10107-002-0342-x","volume":"95","author":"A. Lisser","year":"2003","unstructured":"Lisser, A., Rendl, F.: Graph partitioning using linear and semidefinite programming. Math. Program. 95, 91\u2013101 (2003)","journal-title":"Math. Program."},{"key":"219_CR25","series-title":"Fields Institute Communications","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1090\/fic\/018\/06","volume-title":"Topics in Semidefinite and Interior-Point Methods","author":"E.S. Karisch","year":"1998","unstructured":"Karisch, E.S., Rendl, F.: Semidefinite programming and Graph Equipartition. In: Pardalos, M.P., Wolkowicz, H. (eds.) Topics in Semidefinite and Interior-Point Methods. Fields Institute Communications, pp. 77\u201395 (1998)"},{"key":"219_CR26","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1016\/S0166-218X(99)00102-X","volume":"96\u201397","author":"H. Wolkowicz","year":"1999","unstructured":"Wolkowicz, H., Zhao, Q.: Semidefinite programming relaxations for the graph partitioning problem. Discrete Appl. Math. 96\u201397, 461\u2013479 (1999)","journal-title":"Discrete Appl. Math."},{"key":"219_CR27","unstructured":"SDPLIB 1.2. http:\/\/euler.nmt.edu\/~brian\/sdplib\/sdplib.html"},{"key":"219_CR28","doi-asserted-by":"crossref","first-page":"796","DOI":"10.1137\/S1052623400366802","volume":"11","author":"B.J. Lasserre","year":"2001","unstructured":"Lasserre, B.J.: Global optimization with polynomials and the problems of moments. SIAM J. Optim. 11, 796\u2013817 (2001)","journal-title":"SIAM J. Optim."},{"key":"219_CR29","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/s10107-003-0387-5","volume":"96","author":"A.P. Parrilo","year":"2003","unstructured":"Parrilo, A.P.: Semidefinite programming relaxations for semi-algebraic problems. Math. Program. 96, 293\u2013320 (2003)","journal-title":"Math. Program."}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-012-0219-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10957-012-0219-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-012-0219-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,5]],"date-time":"2019-07-05T08:36:37Z","timestamp":1562315797000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10957-012-0219-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,11,10]]},"references-count":29,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,7]]}},"alternative-id":["219"],"URL":"https:\/\/doi.org\/10.1007\/s10957-012-0219-y","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"value":"0022-3239","type":"print"},{"value":"1573-2878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,11,10]]}}}