{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T19:24:38Z","timestamp":1776972278961,"version":"3.51.4"},"reference-count":57,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,5,11]],"date-time":"2022-05-11T00:00:00Z","timestamp":1652227200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,5,11]],"date-time":"2022-05-11T00:00:00Z","timestamp":1652227200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003130","name":"Fonds Wetenschappelijk Onderzoek","doi-asserted-by":"publisher","award":["G086518N"],"award-info":[{"award-number":["G086518N"]}],"id":[{"id":"10.13039\/501100003130","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003130","name":"Fonds Wetenschappelijk Onderzoek","doi-asserted-by":"publisher","award":["G086318N"],"award-info":[{"award-number":["G086318N"]}],"id":[{"id":"10.13039\/501100003130","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Research Council KU Leuven","award":["C14\/18\/068"],"award-info":[{"award-number":["C14\/18\/068"]}]},{"DOI":"10.13039\/501100003130","name":"Fonds Wetenschappelijk Onderzoek","doi-asserted-by":"publisher","award":["30468160"],"award-info":[{"award-number":["30468160"]}],"id":[{"id":"10.13039\/501100003130","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001691","name":"KAKENHI","doi-asserted-by":"crossref","award":["JP21K17710"],"award-info":[{"award-number":["JP21K17710"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/100010665","name":"H2020 Marie Sk\u0142odowska-Curie Actions","doi-asserted-by":"publisher","award":["953348"],"award-info":[{"award-number":["953348"]}],"id":[{"id":"10.13039\/100010665","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003130","name":"Fonds Wetenschappelijk Onderzoek","doi-asserted-by":"publisher","award":["G0A0920N"],"award-info":[{"award-number":["G0A0920N"]}],"id":[{"id":"10.13039\/501100003130","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003130","name":"Fonds Wetenschappelijk Onderzoek","doi-asserted-by":"publisher","award":["G081222N"],"award-info":[{"award-number":["G081222N"]}],"id":[{"id":"10.13039\/501100003130","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2022,6]]},"DOI":"10.1007\/s10589-022-00366-y","type":"journal-article","created":{"date-parts":[[2022,5,11]],"date-time":"2022-05-11T13:06:22Z","timestamp":1652274382000},"page":"395-440","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Douglas\u2013Rachford splitting and ADMM for nonconvex optimization: accelerated and Newton-type linesearch algorithms"],"prefix":"10.1007","volume":"82","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6044-0169","authenticated-orcid":false,"given":"Andreas","family":"Themelis","sequence":"first","affiliation":[]},{"given":"Lorenzo","family":"Stella","sequence":"additional","affiliation":[]},{"given":"Panagiotis","family":"Patrinos","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,5,11]]},"reference":[{"issue":"4","key":"366_CR1","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1145\/321296.321305","volume":"12","author":"DG Anderson","year":"1965","unstructured":"Anderson, D.G.: Iterative procedures for nonlinear integral equations. J. ACM 12(4), 547\u2013560 (1965). https:\/\/doi.org\/10.1145\/321296.321305","journal-title":"J. ACM"},{"issue":"1","key":"366_CR2","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s10107-011-0484-9","volume":"137","author":"H Attouch","year":"2013","unstructured":"Attouch, H., Bolte, J., Svaiter, B.F.: Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods. Math. Program. 137(1), 91\u2013129 (2013). https:\/\/doi.org\/10.1007\/s10107-011-0484-9","journal-title":"Math. Program."},{"key":"366_CR3","volume-title":"Asymptotic Cones and Functions in Optimization and Variational Inequalities. Springer Monographs in Mathematics","author":"A Auslender","year":"2002","unstructured":"Auslender, A., Teboulle, M.: Asymptotic Cones and Functions in Optimization and Variational Inequalities. Springer Monographs in Mathematics. Springer, New York (2002)"},{"key":"366_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-48311-5","volume-title":"Convex Analysis and Monotone Operator Theory in Hilbert Spaces. CMS Books in Mathematics","author":"HH Bauschke","year":"2017","unstructured":"Bauschke, H.H., Combettes, P.L.: Convex Analysis and Monotone Operator Theory in Hilbert Spaces. CMS Books in Mathematics. Springer, Berlin (2017). https:\/\/doi.org\/10.1007\/978-3-319-48311-5"},{"issue":"6","key":"366_CR5","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1007\/s00013-014-0652-2","volume":"102","author":"HH Bauschke","year":"2014","unstructured":"Bauschke, H.H., Noll, D.: On the local convergence of the Douglas\u2013Rachford algorithm. Arch. Math. 102(6), 589\u2013600 (2014). https:\/\/doi.org\/10.1007\/s00013-014-0652-2","journal-title":"Arch. Math."},{"issue":"4","key":"366_CR6","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/s10013-013-0049-8","volume":"42","author":"HH Bauschke","year":"2014","unstructured":"Bauschke, H.H., Phan, H.M., Wang, X.: The method of alternating relaxed projections for two nonconvex sets. Vietnam J. Math. 42(4), 421\u2013450 (2014). https:\/\/doi.org\/10.1007\/s10013-013-0049-8","journal-title":"Vietnam J. Math."},{"issue":"3","key":"366_CR7","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1109\/9.557577","volume":"42","author":"A Bemporad","year":"1997","unstructured":"Bemporad, A., Casavola, A., Mosca, E.: Nonlinear control of constrained linear systems via predictive reference management. IEEE Trans. Autom. Control 42(3), 340\u2013349 (1997). https:\/\/doi.org\/10.1109\/9.557577","journal-title":"IEEE Trans. Autom. Control"},{"key":"366_CR8","volume-title":"Nonlinear Programming","author":"DP Bertsekas","year":"1999","unstructured":"Bertsekas, D.P.: Nonlinear Programming, vol. 2, edition Athena Scientific, Belmont (1999)","edition":"edition"},{"issue":"1\u20132","key":"366_CR9","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/s10107-013-0701-9","volume":"146","author":"J Bolte","year":"2014","unstructured":"Bolte, J., Sabach, S., Teboulle, M.: Proximal Alternating Linearized Minimization for nonconvex and nonsmooth problems. Math. Program. 146(1\u20132), 459\u2013494 (2014). https:\/\/doi.org\/10.1007\/s10107-013-0701-9","journal-title":"Math. Program."},{"issue":"92","key":"366_CR10","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1090\/S0025-5718-1965-0198670-6","volume":"19","author":"CG Broyden","year":"1965","unstructured":"Broyden, C.G.: A class of methods for solving nonlinear simultaneous equations. Math. Comput. 19(92), 577\u2013593 (1965)","journal-title":"Math. Comput."},{"issue":"1","key":"366_CR11","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1093\/imamat\/6.1.76","volume":"6","author":"CG Broyden","year":"1970","unstructured":"Broyden, C.G.: The convergence of a class of double-rank minimization algorithms 1. general considerations. IMA J. Appl. Math. 6(1), 76\u201390 (1970). https:\/\/doi.org\/10.1093\/imamat\/6.1.76","journal-title":"IMA J. Appl. Math."},{"key":"366_CR12","doi-asserted-by":"crossref","unstructured":"d\u2019Aspremont, A., Ghaoui, L.E., Jordan, M.I., Lanckriet, G.R.: A direct formulation for sparse PCA using semidefinite programming. In: Advances in Neural Information Processing Systems, pp. 41\u201348 (2005)","DOI":"10.2139\/ssrn.563524"},{"issue":"1","key":"366_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/cpa.20303","volume":"63","author":"I Daubechies","year":"2010","unstructured":"Daubechies, I., DeVore, R., Fornasier, M., G\u00fcnt\u00fcrk, C.S.: Iteratively reweighted least squares minimization for sparse recovery. Commun. Pure Appl. Math. 63(1), 1\u201338 (2010). https:\/\/doi.org\/10.1002\/cpa.20303","journal-title":"Commun. Pure Appl. Math."},{"key":"366_CR14","unstructured":"Dua, D., Graff, C.: UCI machine learning repository (2017). http:\/\/archive.ics.uci.edu\/ml"},{"issue":"1","key":"366_CR15","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/BF01581204","volume":"55","author":"J Eckstein","year":"1992","unstructured":"Eckstein, J., Bertsekas, D.P.: On the Douglas\u2013Rachford splitting method and the proximal point algorithm for maximal monotone operators. Math. Program. 55(1), 293\u2013318 (1992). https:\/\/doi.org\/10.1007\/BF01581204","journal-title":"Math. Program."},{"key":"366_CR16","volume-title":"Finite-Dimensional Variational Inequalities and Complementarity Problems","author":"F Facchinei","year":"2003","unstructured":"Facchinei, F., Pang, J.S.: Finite-Dimensional Variational Inequalities and Complementarity Problems, vol. II. Springer, Berlin (2003)"},{"issue":"3","key":"366_CR17","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1002\/nla.617","volume":"16","author":"Hr Fang","year":"2009","unstructured":"Fang, Hr., Saad, Y.: Two classes of multisecant methods for nonlinear acceleration. Numer. Linear Algebra Appl. 16(3), 197\u2013221 (2009). https:\/\/doi.org\/10.1002\/nla.617","journal-title":"Numer. Linear Algebra Appl."},{"issue":"3","key":"366_CR18","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1093\/comjnl\/13.3.317","volume":"13","author":"R Fletcher","year":"1970","unstructured":"Fletcher, R.: A new approach to variable metric algorithms. Comput. J. 13(3), 317\u2013322 (1970). https:\/\/doi.org\/10.1093\/comjnl\/13.3.317","journal-title":"Comput. J."},{"issue":"3","key":"366_CR19","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/0005-1098(89)90002-2","volume":"25","author":"CE Garc\u00eda","year":"1989","unstructured":"Garc\u00eda, C.E., Prett, D.M., Morari, M.: Model predictive control: theory and practice\u2014a survey. Automatica 25(3), 335\u2013348 (1989). https:\/\/doi.org\/10.1016\/0005-1098(89)90002-2","journal-title":"Automatica"},{"issue":"109","key":"366_CR20","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1090\/S0025-5718-1970-0258249-6","volume":"24","author":"D Goldfarb","year":"1970","unstructured":"Goldfarb, D.: A family of variable-metric methods derived by variational means. Math. Comput. 24(109), 23\u201326 (1970)","journal-title":"Math. Comput."},{"key":"366_CR21","first-page":"378","volume":"15","author":"MLN Goncalves","year":"2019","unstructured":"Goncalves, M.L.N., Melo, J.G., Monteiro, R.D.C.: Convergence rate bounds for a proximal ADMM with over-relaxation stepsize parameter for solving nonconvex linearly constrained problems. Pac. J. Optim. 15, 378\u2013398 (2019)","journal-title":"Pac. J. Optim."},{"issue":"8","key":"366_CR22","doi-asserted-by":"publisher","first-page":"1653","DOI":"10.1080\/00207160.2016.1227432","volume":"94","author":"K Guo","year":"2017","unstructured":"Guo, K., Han, D., Wu, T.T.: Convergence of alternating direction method for minimizing sum of two nonconvex functions with linear constraints. Int. J. Comput. Math. 94(8), 1653\u20131669 (2017). https:\/\/doi.org\/10.1080\/00207160.2016.1227432","journal-title":"Int. J. Comput. Math."},{"issue":"4","key":"366_CR23","doi-asserted-by":"publisher","first-page":"2397","DOI":"10.1137\/120902653","volume":"23","author":"R Hesse","year":"2013","unstructured":"Hesse, R., Luke, R.: Nonconvex notions of regularity and convergence of fundamental algorithms for feasibility problems. SIAM J. Optim. 23(4), 2397\u20132419 (2013). https:\/\/doi.org\/10.1137\/120902653","journal-title":"SIAM J. Optim."},{"issue":"18","key":"366_CR24","doi-asserted-by":"publisher","first-page":"4868","DOI":"10.1109\/TSP.2014.2339801","volume":"62","author":"R Hesse","year":"2014","unstructured":"Hesse, R., Luke, R., Neumann, P.: Alternating projections and Douglas\u2013Rachford for sparse affine feasibility. IEEE Trans. Signal Process. 62(18), 4868\u20134881 (2014). https:\/\/doi.org\/10.1109\/TSP.2014.2339801","journal-title":"IEEE Trans. Signal Process."},{"issue":"1","key":"366_CR25","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1137\/140990309","volume":"26","author":"M Hong","year":"2016","unstructured":"Hong, M., Luo, Z.Q., Razaviyayn, M.: Convergence analysis of alternating direction method of multipliers for a family of nonconvex problems. SIAM J. Optim. 26(1), 337\u2013364 (2016). https:\/\/doi.org\/10.1137\/140990309","journal-title":"SIAM J. Optim."},{"issue":"1\u20133","key":"366_CR26","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/BF01580895","volume":"56","author":"CM Ip","year":"1992","unstructured":"Ip, C.M., Kyparisis, J.: Local convergence of quasi-Newton methods for B-differentiable equations. Math. Program. 56(1\u20133), 71\u201389 (1992)","journal-title":"Math. Program."},{"key":"366_CR27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-04247-3","volume-title":"Newton-Type Methods for Optimization and Variational Problems","author":"AF Izmailov","year":"2014","unstructured":"Izmailov, A.F., Solodov, M.V.: Newton-Type Methods for Optimization and Variational Problems. Springer, Berlin (2014)"},{"issue":"1","key":"366_CR28","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/s10589-018-0034-y","volume":"72","author":"B Jiang","year":"2019","unstructured":"Jiang, B., Lin, T., Ma, S., Zhang, S.: Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis. Comput. Optim. Appl. 72(1), 115\u2013157 (2019)","journal-title":"Comput. Optim. Appl."},{"key":"366_CR29","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-017-9915-8","author":"G Li","year":"2017","unstructured":"Li, G., Liu, T., Pong, T.K.: Peaceman\u2013Rachford splitting for a class of nonconvex optimization problems. Comput. Optim. Appl. (2017). https:\/\/doi.org\/10.1007\/s10589-017-9915-8","journal-title":"Comput. Optim. Appl."},{"issue":"4","key":"366_CR30","doi-asserted-by":"publisher","first-page":"2434","DOI":"10.1137\/140998135","volume":"25","author":"G Li","year":"2015","unstructured":"Li, G., Pong, T.K.: Global convergence of splitting methods for nonconvex composite optimization. SIAM J. Optim. 25(4), 2434\u20132460 (2015). https:\/\/doi.org\/10.1137\/140998135","journal-title":"SIAM J. Optim."},{"issue":"1","key":"366_CR31","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/s10107-015-0963-5","volume":"159","author":"G Li","year":"2016","unstructured":"Li, G., Pong, T.K.: Douglas\u2013Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems. Math. Program. 159(1), 371\u2013401 (2016). https:\/\/doi.org\/10.1007\/s10107-015-0963-5","journal-title":"Math. Program."},{"key":"366_CR32","first-page":"379","volume-title":"Advances in Neural Information Processing Systems 28","author":"H Li","year":"2015","unstructured":"Li, H., Lin, Z.: Accelerated proximal gradient methods for nonconvex programming. In: Cortes, C., Lawrence, N.D., Lee, D.D., Sugiyama, M., Garnett, R. (eds.) Advances in Neural Information Processing Systems 28, pp. 379\u2013387. Curran Associates Inc, New York (2015)"},{"key":"366_CR33","unstructured":"Maratos, N.: Exact penalty function algorithms for finite dimensional and control optimization problems. Ph.D. thesis. Imperial College London (University of London) (1978)"},{"key":"366_CR34","first-page":"372","volume":"27","author":"Y Nesterov","year":"1983","unstructured":"Nesterov, Y.: A method of solving a convex programming problem with convergence rate $$o(1\/k^2)$$. Soviet Math. Doklady 27, 372\u2013376 (1983)","journal-title":"Soviet Math. Doklady"},{"key":"366_CR35","volume-title":"Numerical Optimization","author":"J Nocedal","year":"2006","unstructured":"Nocedal, J., Wright, S.: Numerical Optimization, vol. 2, edition Springer, New York (2006)","edition":"edition"},{"key":"366_CR36","doi-asserted-by":"publisher","unstructured":"Patrinos, P., Bemporad, A.: Proximal Newton methods for convex composite optimization. In: 52nd IEEE Conference on Decision and Control, pp. 2358\u20132363 (2013). https:\/\/doi.org\/10.1109\/CDC.2013.6760233","DOI":"10.1109\/CDC.2013.6760233"},{"key":"366_CR37","doi-asserted-by":"publisher","unstructured":"Patrinos, P., Stella, L., Bemporad, A.: Douglas\u2013Rachford splitting: complexity estimates and accelerated variants. In: 53rd IEEE Conference on Decision and Control, pp. 4234\u20134239 (2014). https:\/\/doi.org\/10.1109\/CDC.2014.7040049","DOI":"10.1109\/CDC.2014.7040049"},{"key":"366_CR38","doi-asserted-by":"publisher","unstructured":"Pejcic, I., Jones, C.: Accelerated ADMM based on accelerated Douglas\u2013Rachford splitting. In: 2016 European Control Conference (ECC), pp. 1952\u20131957 (2016). https:\/\/doi.org\/10.1109\/ECC.2016.7810577","DOI":"10.1109\/ECC.2016.7810577"},{"issue":"1","key":"366_CR39","first-page":"4626","volume":"18","author":"V Perrone","year":"2017","unstructured":"Perrone, V., Jenkins, P.A., Spano, D., Teh, Y.W.: Poisson random fields for dynamic feature models. J. Mach. Learn. Res. 18(1), 4626\u20134670 (2017)","journal-title":"J. Mach. Learn. Res."},{"issue":"4","key":"366_CR40","doi-asserted-by":"publisher","first-page":"1121","DOI":"10.1137\/S1052623494279316","volume":"6","author":"RA Poliquin","year":"1996","unstructured":"Poliquin, R.A., Rockafellar, R.T.: Generalized Hessian properties of regularized nonsmooth functions. SIAM J. Optim. 6(4), 1121\u20131137 (1996)","journal-title":"SIAM J. Optim."},{"key":"366_CR41","unstructured":"Powell, M.J.D.: A hybrid method for nonlinear equations. In: Numerical Methods for Nonlinear Algebraic Equations, pp. 87\u2013144. Gordon and Breach (1970)"},{"key":"366_CR42","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/BFb0067703","volume-title":"Numerical Analysis","author":"MJ Powell","year":"1978","unstructured":"Powell, M.J.: A fast algorithm for nonlinearly constrained optimization calculations. In: Watson, G.A. (ed.) Numerical Analysis, pp. 144\u2013157. Springer, Berlin (1978)"},{"key":"366_CR43","doi-asserted-by":"publisher","unstructured":"Rey, F., Frick, D., Domahidi, A., Jerez, J., Morari, M., Lygeros, J.: ADMM prescaling for model predictive control. In: 2016 IEEE 55th Conference on Decision and Control (CDC), pp. 3662\u20133667. IEEE, Las Vegas, NV, USA (2016). https:\/\/doi.org\/10.1109\/CDC.2016.7798820","DOI":"10.1109\/CDC.2016.7798820"},{"key":"366_CR44","doi-asserted-by":"publisher","DOI":"10.1515\/9781400873173","volume-title":"Convex Analysis","author":"RT Rockafellar","year":"1970","unstructured":"Rockafellar, R.T.: Convex Analysis, vol. 28. Princeton University Press, Princeton (1970)"},{"key":"366_CR45","volume-title":"Variational Analysis","author":"RT Rockafellar","year":"2011","unstructured":"Rockafellar, R.T., Wets, R.J.: Variational Analysis, vol. 317. Springer, Berlin (2011)"},{"issue":"111","key":"366_CR46","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1090\/S0025-5718-1970-0274029-X","volume":"24","author":"DF Shanno","year":"1970","unstructured":"Shanno, D.F.: Conditioning of quasi-Newton methods for function minimization. Math. Comput. 24(111), 647\u2013656 (1970)","journal-title":"Math. Comput."},{"issue":"3","key":"366_CR47","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/s10589-017-9912-y","volume":"67","author":"L Stella","year":"2017","unstructured":"Stella, L., Themelis, A., Patrinos, P.: Forward-backward quasi-Newton methods for nonsmooth optimization problems. Comput. Optim. Appl. 67(3), 443\u2013487 (2017). https:\/\/doi.org\/10.1007\/s10589-017-9912-y","journal-title":"Comput. Optim. Appl."},{"issue":"2","key":"366_CR48","doi-asserted-by":"publisher","first-page":"697","DOI":"10.1109\/TAC.2018.2872203","volume":"64","author":"L Stella","year":"2019","unstructured":"Stella, L., Themelis, A., Patrinos, P.: Newton-type alternating minimization algorithm for convex optimization. IEEE Trans. Autom. Control 64(2), 697\u2013711 (2019). https:\/\/doi.org\/10.1109\/TAC.2018.2872203","journal-title":"IEEE Trans. Autom. Control"},{"key":"366_CR49","doi-asserted-by":"publisher","unstructured":"Stella, L., Themelis, A., Sopasakis, P., Patrinos, P.: A simple and efficient algorithm for nonlinear model predictive control. In: 2017 IEEE 56th Annual Conference on Decision and Control (CDC), pp. 1939\u20131944 (2017). https:\/\/doi.org\/10.1109\/CDC.2017.8263933","DOI":"10.1109\/CDC.2017.8263933"},{"key":"366_CR50","unstructured":"Themelis, A.: Proximal algorithms for structured nonconvex optimization. Ph.D. thesis, KU Leuven (2018)"},{"key":"366_CR51","doi-asserted-by":"publisher","unstructured":"Themelis, A., Ahookhosh, M., Patrinos, P.: On the acceleration of forward-backward splitting via an inexact Newton method. In: Bauschke, H.H., Burachik, R.S., Luke, D.R. (eds) Splitting Algorithms, Modern Operator Theory, and Applications, pp. 363\u2013412. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-25939-6_15","DOI":"10.1007\/978-3-030-25939-6_15"},{"issue":"12","key":"366_CR52","doi-asserted-by":"publisher","first-page":"4875","DOI":"10.1109\/TAC.2019.2906393","volume":"64","author":"A Themelis","year":"2019","unstructured":"Themelis, A., Patrinos, P.: SuperMann: a superlinearly convergent algorithm for finding fixed points of nonexpansive operators. IEEE Trans. Autom. Control 64(12), 4875\u20134890 (2019). https:\/\/doi.org\/10.1109\/TAC.2019.2906393","journal-title":"IEEE Trans. Autom. Control"},{"issue":"1","key":"366_CR53","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1137\/18M1163993","volume":"30","author":"A Themelis","year":"2020","unstructured":"Themelis, A., Patrinos, P.: Douglas\u2013Rachford splitting and ADMM for nonconvex optimization: tight convergence results. SIAM J. Optim. 30(1), 149\u2013181 (2020). https:\/\/doi.org\/10.1137\/18M1163993","journal-title":"SIAM J. Optim."},{"issue":"3","key":"366_CR54","doi-asserted-by":"publisher","first-page":"2274","DOI":"10.1137\/16M1080240","volume":"28","author":"A Themelis","year":"2018","unstructured":"Themelis, A., Stella, L., Patrinos, P.: Forward-backward envelope for the sum of two nonconvex functions: Further properties and nonmonotone linesearch algorithms. SIAM J. Optim. 28(3), 2274\u20132303 (2018). https:\/\/doi.org\/10.1137\/16M1080240","journal-title":"SIAM J. Optim."},{"issue":"1","key":"366_CR55","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/s10915-018-0757-z","volume":"78","author":"Y Wang","year":"2019","unstructured":"Wang, Y., Yin, W., Zeng, J.: Global convergence of ADMM in nonconvex nonsmooth optimization. J. Sci. Comput. 78(1), 29\u201363 (2019)","journal-title":"J. Sci. Comput."},{"issue":"7","key":"366_CR56","doi-asserted-by":"publisher","first-page":"1013","DOI":"10.1109\/TNNLS.2012.2197412","volume":"23","author":"Z Xu","year":"2012","unstructured":"Xu, Z., Chang, X., Xu, F., Zhang, H.: $$L_{1\/2}$$ regularization: a thresholding representation theory and a fast solver. IEEE Trans. Neural Netw. Learn. Syst. 23(7), 1013\u20131027 (2012). https:\/\/doi.org\/10.1109\/TNNLS.2012.2197412","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"key":"366_CR57","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/978-3-319-41589-5_5","volume-title":"Self Equivalence of the Alternating Direction Method of Multipliers","author":"M Yan","year":"2016","unstructured":"Yan, M., Yin, W.: Self Equivalence of the Alternating Direction Method of Multipliers, pp. 165\u2013194. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-41589-5_5"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-022-00366-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-022-00366-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-022-00366-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,19]],"date-time":"2022-05-19T12:19:49Z","timestamp":1652962789000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-022-00366-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,11]]},"references-count":57,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,6]]}},"alternative-id":["366"],"URL":"https:\/\/doi.org\/10.1007\/s10589-022-00366-y","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,5,11]]},"assertion":[{"value":"20 May 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 March 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 May 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}