{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T11:30:04Z","timestamp":1777462204623,"version":"3.51.4"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2018,4,2]],"date-time":"2018-04-02T00:00:00Z","timestamp":1522627200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,4,2]],"date-time":"2018-04-02T00:00:00Z","timestamp":1522627200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000086","name":"Directorate for Mathematical and Physical Sciences","doi-asserted-by":"publisher","award":["1720237"],"award-info":[{"award-number":["1720237"]}],"id":[{"id":"10.13039\/100000086","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["N000141712162"],"award-info":[{"award-number":["N000141712162"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2019,9]]},"DOI":"10.1007\/s10107-018-1265-5","type":"journal-article","created":{"date-parts":[[2018,4,2]],"date-time":"2018-04-02T11:44:51Z","timestamp":1522669491000},"page":"225-253","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["A new use of Douglas\u2013Rachford splitting for identifying infeasible, unbounded, and pathological conic programs"],"prefix":"10.1007","volume":"177","author":[{"given":"Yanli","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6820-9095","authenticated-orcid":false,"given":"Ernest K.","family":"Ryu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6697-9731","authenticated-orcid":false,"given":"Wotao","family":"Yin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,4,2]]},"reference":[{"issue":"1","key":"1265_CR1","first-page":"1","volume":"4","author":"JB Baillon","year":"1978","unstructured":"Baillon, J.B., Bruck, R.E., Reich, S.: On the asymptotic behavior of nonexpansive mappings and semigroups in Banach spaces. Houst. J. Math. 4(1), 1\u20139 (1978)","journal-title":"Houst. J. Math."},{"issue":"8","key":"1265_CR2","doi-asserted-by":"publisher","first-page":"1065","DOI":"10.1016\/j.jat.2012.05.008","volume":"164","author":"HH Bauschke","year":"2012","unstructured":"Bauschke, H.H., Bo\u0163, R.I., Hare, W.L., Moursi, W.M.: Attouch\u2013Th\u00e9ra duality revisited: paramonotonicity and operator splitting. J. Approx. Theory 164(8), 1065\u20131084 (2012)","journal-title":"J. Approx. Theory"},{"key":"1265_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-9467-7","volume-title":"Convex Analysis and Monotone Operator Theory in Hilbert Spaces. CMS Books in Mathematics","author":"HH Bauschke","year":"2011","unstructured":"Bauschke, H.H., Combettes, P.L.: Convex Analysis and Monotone Operator Theory in Hilbert Spaces. CMS Books in Mathematics. Springer, New York (2011)"},{"issue":"2","key":"1265_CR4","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1016\/j.jat.2004.02.006","volume":"127","author":"HH Bauschke","year":"2004","unstructured":"Bauschke, H.H., Combettes, P.L., Luke, D.: Finding best approximation pairs relative to two closed convex sets in Hilbert spaces. J. Approx. Theory 127(2), 178\u2013192 (2004)","journal-title":"J. Approx. Theory"},{"issue":"2","key":"1265_CR5","doi-asserted-by":"publisher","first-page":"1034","DOI":"10.1137\/130924214","volume":"52","author":"HH Bauschke","year":"2014","unstructured":"Bauschke, H.H., Hare, W.L., Moursi, W.M.: Generalized solutions for the sum of two maximally monotone operators. SIAM J. Control Optim. 52(2), 1034\u20131047 (2014)","journal-title":"SIAM J. Control Optim."},{"issue":"3","key":"1265_CR6","doi-asserted-by":"publisher","first-page":"884","DOI":"10.1287\/moor.2015.0759","volume":"41","author":"HH Bauschke","year":"2016","unstructured":"Bauschke, H.H., Hare, W.L., Moursi, W.M.: On the range of the Douglas\u2013Rachford operator. Math. Oper. Res. 41(3), 884\u2013897 (2016)","journal-title":"Math. Oper. Res."},{"issue":"2","key":"1265_CR7","doi-asserted-by":"publisher","first-page":"968","DOI":"10.1137\/15M1016989","volume":"26","author":"HH Bauschke","year":"2016","unstructured":"Bauschke, H.H., Moursi, W.M.: The Douglas\u2013Rachford algorithm for two (not necessarily intersecting) affine subspaces. SIAM J. Optim. 26(2), 968\u2013985 (2016)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"1265_CR8","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/s10107-016-1086-3","volume":"164","author":"HH Bauschke","year":"2017","unstructured":"Bauschke, H.H., Moursi, W.M.: On the Douglas\u2013Rachford algorithm. Math. Program. 164(1), 263\u2013284 (2017)","journal-title":"Math. Program."},{"issue":"2","key":"1265_CR9","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1016\/0022-247X(81)90138-4","volume":"83","author":"J Borwein","year":"1981","unstructured":"Borwein, J., Wolkowicz, H.: Regularizing the abstract convex program. J. Math. Anal. Appl. 83(2), 495\u2013530 (1981)","journal-title":"J. Math. Anal. Appl."},{"issue":"3","key":"1265_CR10","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(3), 369\u2013380 (1981)","journal-title":"J. Aust. Math. Soc."},{"key":"1265_CR11","volume-title":"Splitting Methods in Communication, Imaging, Science and Engineering","author":"D Davis","year":"2016","unstructured":"Davis, D., Yin, W.: Convergence rate analysis of several splitting schemes. In: Glowinski, R., Osher, S., Yin, W. (eds.) Splitting Methods in Communication, Imaging, Science and Engineering, vol. 4. Springer, Berlin (2016)"},{"issue":"2","key":"1265_CR12","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1561\/2400000011","volume":"3","author":"D Drusvyatskiy","year":"2017","unstructured":"Drusvyatskiy, D., Wolkowicz, H.: The many faces of degeneracy in conic optimization. Found. Trends Optim. 3(2), 77\u2013170 (2017)","journal-title":"Found. Trends Optim."},{"key":"1265_CR13","unstructured":"Eckstein, J.: Splitting methods for monotone operators with applications to parallel optimization. Ph.D. thesis, MIT (1989)"},{"key":"1265_CR14","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/978-1-4615-4381-7_5","volume-title":"Handbook of Semidefinite Programming: Theory, Algorithms, and Applications","author":"E de Klerk","year":"2000","unstructured":"de Klerk, E., Terlaky, T., Roos, K.: Self-dual embeddings. In: Wolkowicz, H., Saigal, R., Vandenberghe, L. (eds.) Handbook of Semidefinite Programming: Theory, Algorithms, and Applications, pp. 111\u2013138. Springer, New York (2000)"},{"issue":"6","key":"1265_CR15","doi-asserted-by":"publisher","first-page":"964","DOI":"10.1137\/0716071","volume":"16","author":"PL Lions","year":"1979","unstructured":"Lions, P.L., Mercier, B.: Splitting algorithms for the sum of two nonlinear operators. SIAM J. Numer. Anal. 16(6), 964\u2013979 (1979)","journal-title":"SIAM J. Numer. Anal."},{"issue":"2","key":"1265_CR16","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1007\/s10107-017-1136-5","volume":"167","author":"M Liu","year":"2017","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 (2017)","journal-title":"Math. Program."},{"key":"1265_CR17","doi-asserted-by":"crossref","unstructured":"Loera, J.A.D., Malkin, P.N., Parrilo, P.A.: Computation with polynomial equations and inequalities arising in combinatorial optimization. In: Lee, J., Leyffer, S. (eds.) Mixed Integer Nonlinear Programming, pp. 447\u2013481. Springer, New York (2012)","DOI":"10.1007\/978-1-4614-1927-3_16"},{"issue":"5","key":"1265_CR18","doi-asserted-by":"publisher","first-page":"1007","DOI":"10.1109\/TAC.2009.2017144","volume":"54","author":"J Lofberg","year":"2009","unstructured":"Lofberg, J.: Pre- and post-processing sum-of-squares programs in practice. IEEE Trans. Autom. Control 54(5), 1007\u20131011 (2009)","journal-title":"IEEE Trans. Autom. Control"},{"key":"1265_CR19","unstructured":"Louren\u00e7o, B.F., Muramatsu, M., Tsuchiya, T.: Solving SDP completely with an interior point oracle. \n                              arXiv:1507.08065\n                              \n                            [math] (2015)"},{"key":"1265_CR20","doi-asserted-by":"crossref","unstructured":"Luenberger, D.G., Ye, Y.: Linear and Nonlinear Programming, 4th edn. Springer (2016)","DOI":"10.1007\/978-3-319-18842-3"},{"key":"1265_CR21","unstructured":"Luo, Z.Q., Sturm, J.F., Zhang, S.: Duality results for conic convex programming. Econometric Institute, Erasmus University Rotterdam, The Netherlands, Technical Report 9719\/A (1997)"},{"issue":"3","key":"1265_CR22","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1080\/10556780008805800","volume":"14","author":"ZQ Luo","year":"2000","unstructured":"Luo, Z.Q., Sturm, J.F., Zhang, S.: Conic convex programming and self-dual embedding. Optim. Methods Softw. 14(3), 169\u2013218 (2000)","journal-title":"Optim. Methods Softw."},{"key":"1265_CR23","unstructured":"Mosek, A.: The MOSEK optimization toolbox for matlab manual. Version 7.1 (Revision 28) (2015)"},{"key":"1265_CR24","unstructured":"Moursi, W.M.: The Douglas\u2013Rachford operator in the possibly inconsistent case: static properties and dynamic behaviour. Ph.D. thesis, University of British Columbia (2017)"},{"issue":"2","key":"1265_CR25","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/s10107980009a","volume":"84","author":"Y Nesterov","year":"1999","unstructured":"Nesterov, Y., Todd, M.J., Ye, Y.: Infeasible-start primal-dual methods and infeasibility detectors for nonlinear programming problems. Math. Program. 84(2), 227\u2013267 (1999)","journal-title":"Math. Program."},{"key":"1265_CR26","unstructured":"Pataki, G.: A simple derivation of a facial reduction algorithm and extended dual systems. Columbia University, Technical report (2000)"},{"issue":"2","key":"1265_CR27","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/BF02771588","volume":"9","author":"A Pazy","year":"1971","unstructured":"Pazy, A.: Asymptotic behavior of contractions in Hilbert space. Israel J. Math. 9(2), 235\u2013240 (1971)","journal-title":"Israel J. Math."},{"issue":"3","key":"1265_CR28","doi-asserted-by":"publisher","first-page":"1257","DOI":"10.1137\/15M1049415","volume":"27","author":"F Permenter","year":"2017","unstructured":"Permenter, F., Friberg, H.A., Andersen, E.D.: Solving conic optimization problems via self-dual embedding and facial reduction: a unified approach. SIAM J. Optim. 27(3), 1257\u20131282 (2017)","journal-title":"SIAM J. Optim."},{"key":"1265_CR29","unstructured":"Permenter, F., Parrilo, P.: Partial facial reduction: simplified, equivalent SDPs via approximations of the PSD cone. \n                              arXiv:1408.4685\n                              \n                            (2014)"},{"key":"1265_CR30","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":"1265_CR31","doi-asserted-by":"crossref","unstructured":"Rockafellar, R.T.: Conjugate Duality and Optimization. Society for Industrial and Applied Mathematics, Philadelphia (1974)","DOI":"10.1137\/1.9781611970524"},{"issue":"5","key":"1265_CR32","doi-asserted-by":"publisher","first-page":"877","DOI":"10.1137\/0314056","volume":"14","author":"RT Rockafellar","year":"1976","unstructured":"Rockafellar, R.T.: Monotone operators and the proximal point algorithm. SIAM J. Control Optim. 14(5), 877\u2013898 (1976)","journal-title":"SIAM J. Control Optim."},{"issue":"1\u20134","key":"1265_CR33","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1080\/10556789908805766","volume":"11","author":"JF Sturm","year":"1999","unstructured":"Sturm, J.F.: Using SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones. Optim. Methods Softw. 11(1\u20134), 625\u2013653 (1999)","journal-title":"Optim. Methods Softw."},{"issue":"1","key":"1265_CR34","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1137\/100788100","volume":"49","author":"BF Svaiter","year":"2011","unstructured":"Svaiter, B.F.: On weak convergence of the Douglas\u2013Rachford method. SIAM J. Control Optim. 49(1), 280\u2013287 (2011)","journal-title":"SIAM J. Control Optim."},{"issue":"2","key":"1265_CR35","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/s10107-002-0347-5","volume":"95","author":"RH T\u00fct\u00fcnc\u00fc","year":"2003","unstructured":"T\u00fct\u00fcnc\u00fc, R.H., Toh, K.C., Todd, M.J.: Solving semidefinite-quadratic-linear programs using SDPT3. Math. Program. 95(2), 189\u2013217 (2003)","journal-title":"Math. Program."},{"issue":"8","key":"1265_CR36","doi-asserted-by":"publisher","first-page":"1883","DOI":"10.1007\/s11590-011-0384-1","volume":"6","author":"H Waki","year":"2012","unstructured":"Waki, H.: How to generate weakly infeasible semidefinite programs via Lasserre\u2019s relaxations for polynomial optimization. Optim. Lett. 6(8), 1883\u20131896 (2012)","journal-title":"Optim. Lett."},{"issue":"1","key":"1265_CR37","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":"1265_CR38","doi-asserted-by":"publisher","first-page":"823","DOI":"10.1007\/s10589-011-9437-8","volume":"53","author":"H Waki","year":"2012","unstructured":"Waki, H., Nakata, M., Muramatsu, M.: Strange behaviors of interior-point methods for solving semidefinite programming problems in polynomial optimization. Comput. Optim. Appl. 53(3), 823\u2013844 (2012)","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"1265_CR39","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1287\/moor.19.1.53","volume":"19","author":"Y Ye","year":"1994","unstructured":"Ye, Y., Todd, M.J., Mizuno, S.: An $$O(\\sqrt{n}L)$$-iteration homogeneous and self-dual linear programming algorithm. Math. Oper. Res. 19(1), 53\u201367 (1994)","journal-title":"Math. Oper. Res."},{"key":"1265_CR40","first-page":"339","volume-title":"Handbook on Semidefinite, Conic and Polynomial Optimization, no. 166 in International Series in Operations Research and Management Science","author":"A Yoshise","year":"2012","unstructured":"Yoshise, A.: Complementarity problems over symmetric cones: a survey of recent developments in several aspects. In: Anjos, M.F., Lasserre, J.B. (eds.) Handbook on Semidefinite, Conic and Polynomial Optimization, no. 166 in International Series in Operations Research and Management Science, pp. 339\u2013375. Springer, New York (2012)"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-018-1265-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-018-1265-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-018-1265-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,16]],"date-time":"2020-05-16T16:25:19Z","timestamp":1589646319000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-018-1265-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,4,2]]},"references-count":40,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2019,9]]}},"alternative-id":["1265"],"URL":"https:\/\/doi.org\/10.1007\/s10107-018-1265-5","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,4,2]]},"assertion":[{"value":"15 June 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 March 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 April 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}