{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T17:42:52Z","timestamp":1778089372081,"version":"3.51.4"},"reference-count":70,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2017,4,10]],"date-time":"2017-04-10T00:00:00Z","timestamp":1491782400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100004040","name":"KU Leuven","doi-asserted-by":"publisher","award":["BOF\/STG-15-043"],"award-info":[{"award-number":["BOF\/STG-15-043"]}],"id":[{"id":"10.13039\/501100004040","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":[[2017,7]]},"DOI":"10.1007\/s10589-017-9912-y","type":"journal-article","created":{"date-parts":[[2017,4,10]],"date-time":"2017-04-10T16:27:29Z","timestamp":1491841649000},"page":"443-487","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":101,"title":["Forward\u2013backward quasi-Newton methods for nonsmooth optimization problems"],"prefix":"10.1007","volume":"67","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8304-7327","authenticated-orcid":false,"given":"Lorenzo","family":"Stella","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6044-0169","authenticated-orcid":false,"given":"Andreas","family":"Themelis","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4824-7697","authenticated-orcid":false,"given":"Panagiotis","family":"Patrinos","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,4,10]]},"reference":[{"key":"9912_CR1","doi-asserted-by":"crossref","first-page":"273","DOI":"10.24033\/bsmf.1625","volume":"93","author":"J-J Moreau","year":"1965","unstructured":"Moreau, J.-J.: Proximit\u00e9 et dualit\u00e9 dans un espace Hilbertien. Bulletin de la Soci\u00e9t\u00e9 math\u00e9matique de France 93, 273\u2013299 (1965)","journal-title":"Bulletin de la Soci\u00e9t\u00e9 math\u00e9matique de France"},{"issue":"6","key":"9912_CR2","doi-asserted-by":"crossref","first-page":"964","DOI":"10.1137\/0716071","volume":"16","author":"P-L 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."},{"key":"9912_CR3","doi-asserted-by":"crossref","unstructured":"Combettes, P.L., Pesquet, J.-C.: Proximal splitting methods in signal processing. In: Fixed-Point Algorithms for Inverse Problems in Science and Engineering, pp. 185\u2013212. Springer (2011)","DOI":"10.1007\/978-1-4419-9569-8_10"},{"key":"9912_CR4","unstructured":"\u0141ojasiewicz, S.: Une propri\u00e9t\u00e9 topologique des sous-ensembles analytiques r\u00e9els. Les \u00e9quations aux d\u00e9riv\u00e9es partielles, pp. 87\u201389 (1963)"},{"issue":"5","key":"9912_CR5","doi-asserted-by":"crossref","first-page":"1575","DOI":"10.5802\/aif.1384","volume":"43","author":"S \u0141ojasiewicz","year":"1993","unstructured":"\u0141ojasiewicz, S.: Sur la g\u00e9om\u00e9trie semi- et sous-analytique. Annales de l\u2019institut Fourier 43(5), 1575\u20131595 (1993)","journal-title":"Annales de l\u2019institut Fourier"},{"issue":"3","key":"9912_CR6","doi-asserted-by":"crossref","first-page":"769","DOI":"10.5802\/aif.1638","volume":"48","author":"K Kurdyka","year":"1998","unstructured":"Kurdyka, K.: On gradients of functions definable in o-minimal structures. Annales de l\u2019institut Fourier 48(3), 769\u2013783 (1998)","journal-title":"Annales de l\u2019institut Fourier"},{"issue":"1\u20132","key":"9912_CR7","doi-asserted-by":"crossref","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\u2013Seidel methods. Math. Program. 137(1\u20132), 91\u2013129 (2013)","journal-title":"Math. Program."},{"issue":"1","key":"9912_CR8","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/s10107-007-0133-5","volume":"116","author":"H Attouch","year":"2009","unstructured":"Attouch, H., Bolte, J.: On the convergence of the proximal algorithm for nonsmooth functions involving analytic features. Math. Program. 116(1), 5\u201316 (2009)","journal-title":"Math. Program."},{"issue":"2","key":"9912_CR9","doi-asserted-by":"crossref","first-page":"438","DOI":"10.1287\/moor.1100.0449","volume":"35","author":"H Attouch","year":"2010","unstructured":"Attouch, H., Bolte, J., Redont, P., Soubeyran, A.: Proximal alternating minimization and projection methods for nonconvex problems: an approach based on the Kurdyka\u2013\u0141ojasiewicz inequality. Math. Oper. Res. 35(2), 438\u2013457 (2010)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"9912_CR10","doi-asserted-by":"crossref","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), 459\u2013494 (2014)","journal-title":"Math. Program."},{"issue":"2","key":"9912_CR11","doi-asserted-by":"crossref","first-page":"1388","DOI":"10.1137\/130942954","volume":"7","author":"P Ochs","year":"2014","unstructured":"Ochs, P., Chen, Y., Brox, T., Pock, T.: iPiano: inertial proximal algorithm for nonconvex optimization. SIAM J. Imaging Sci. 7(2), 1388\u20131419 (2014)","journal-title":"SIAM J. Imaging Sci."},{"issue":"3","key":"9912_CR12","first-page":"543","volume":"269","author":"Y Nesterov","year":"1983","unstructured":"Nesterov, Y.: A method for solving the convex programming problem with convergence rate $$O(1\/k^2)$$ O ( 1 \/ k 2 ) . Doklady Akademii Nauk SSSR 269(3), 543\u2013547 (1983)","journal-title":"Doklady Akademii Nauk SSSR"},{"key":"9912_CR13","unstructured":"Tseng, P.: On accelerated proximal gradient methods for convex-concave optimization. Department of Mathematics, University of Washington, Tech. Rep. (2008)"},{"issue":"1","key":"9912_CR14","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1137\/080716542","volume":"2","author":"A Beck","year":"2009","unstructured":"Beck, A., Teboulle, M.: A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM J. Imaging Sci. 2(1), 183\u2013202 (2009)","journal-title":"SIAM J. Imaging Sci."},{"issue":"1","key":"9912_CR15","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/s10107-012-0629-5","volume":"140","author":"Y Nesterov","year":"2013","unstructured":"Nesterov, Y.: Gradient methods for minimizing composite functions. Math. Program. 140(1), 125\u2013161 (2013)","journal-title":"Math. Program."},{"key":"9912_CR16","unstructured":"Becker, S., Fadili, J.: A quasi-Newton proximal splitting method. In: Advances in Neural Information Processing Systems, pp. 2618\u20132626 (2012)"},{"key":"9912_CR17","unstructured":"Lee, J., Sun, Y., Saunders, M.: Proximal Newton-type methods for convex optimization. In: Advances in Neural Information Processing Systems, pp. 836\u2013844 (2012)"},{"issue":"1","key":"9912_CR18","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1007\/s10107-016-0997-3","volume":"160","author":"K Scheinberg","year":"2016","unstructured":"Scheinberg, K., Tang, X.: Practical inexact proximal quasi-Newton method with global complexity analysis. Math. Program. 160(1), 495\u2013529 (2016)","journal-title":"Math. Program."},{"key":"9912_CR19","doi-asserted-by":"crossref","unstructured":"Patrinos, P., Bemporad, A.: Proximal Newton methods for convex composite optimization. In: IEEE Conference on Decision and Control, pp. 2358\u20132363 (2013)","DOI":"10.1109\/CDC.2013.6760233"},{"issue":"1","key":"9912_CR20","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/BF01585696","volume":"53","author":"M Fukushima","year":"1992","unstructured":"Fukushima, M.: Equivalent differentiable optimization problems and descent methods for asymmetric variational inequality problems. Math. Program. 53(1), 99\u2013110 (1992)","journal-title":"Math. Program."},{"issue":"3","key":"9912_CR21","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1023\/A:1022660704427","volume":"92","author":"N Yamashita","year":"1997","unstructured":"Yamashita, N., Taji, K., Fukushima, M.: Unconstrained optimization reformulations of variational inequality problems. J. Optim. Theory Appl. 92(3), 439\u2013456 (1997)","journal-title":"J. Optim. Theory Appl."},{"key":"9912_CR22","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)"},{"key":"9912_CR23","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/s10898-006-9038-8","volume":"37","author":"W Li","year":"2007","unstructured":"Li, W., Peng, J.: Exact penalty functions for constrained minimization problems via regularized gap function for variational inequalities. J. Glob. Optim. 37, 85\u201394 (2007)","journal-title":"J. Glob. Optim."},{"key":"9912_CR24","doi-asserted-by":"crossref","first-page":"2016","DOI":"10.1016\/j.automatica.2011.05.024","volume":"47","author":"P Patrinos","year":"2011","unstructured":"Patrinos, P., Sopasakis, P., Sarimveis, H.: A global piecewise smooth Newton method for fast large-scale model predictive control. Automatica 47, 2016\u20132022 (2011)","journal-title":"Automatica"},{"key":"9912_CR25","doi-asserted-by":"publisher","unstructured":"Liu, T., Pong, T.K.: Further properties of the forward\u2013backward envelope with applications to difference-of-convex programming. Computational Optimization and Applications, pp. 1\u201332, 2017. doi: 10.1007\/s10589-017-9900-2","DOI":"10.1007\/s10589-017-9900-2"},{"issue":"126","key":"9912_CR26","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1090\/S0025-5718-1974-0343581-1","volume":"28","author":"JE Dennis","year":"1974","unstructured":"Dennis, J.E., Mor\u00e9, J.J.: A characterization of superlinear convergence and its application to quasi-Newton methods. Math. Comput. 28(126), 549\u2013560 (1974)","journal-title":"Math. Comput."},{"issue":"3","key":"9912_CR27","doi-asserted-by":"crossref","first-page":"693","DOI":"10.1137\/S1052623401383455","volume":"13","author":"Y-H Dai","year":"2002","unstructured":"Dai, Y.-H.: Convergence properties of the BFGS algorithm. SIAM J. Optim. 13(3), 693\u2013701 (2002)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"9912_CR28","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/s10107-003-0421-7","volume":"99","author":"WF Mascarenhas","year":"2004","unstructured":"Mascarenhas, W.F.: The BFGS method with exact line searches fails for non-convex objective functions. Math. Program. 99(1), 49\u201361 (2004)","journal-title":"Math. Program."},{"key":"9912_CR29","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1590\/S0101-82052007000100006","volume":"26","author":"WF Mascarenhas","year":"2007","unstructured":"Mascarenhas, W.F.: On the divergence of line search methods. Comput. Appl. Math. 26, 129\u2013169 (2007)","journal-title":"Comput. Appl. Math."},{"key":"9912_CR30","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1007\/s10107-012-0522-2","volume":"138","author":"YH Dai","year":"2013","unstructured":"Dai, Y.H.: A perfect example for the BFGS method. Math. Program. 138, 501\u2013530 (2013)","journal-title":"Math. Program."},{"key":"9912_CR31","volume-title":"Variational Analysis","author":"RT Rockafellar","year":"2011","unstructured":"Rockafellar, R.T., Wets, R.J.-B.: Variational Analysis, vol. 317. Springer, Berlin (2011)"},{"key":"9912_CR32","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-9467-7","volume-title":"Convex Analysis and Monotone Operator Theory in Hilbert Spaces","author":"HH Bauschke","year":"2011","unstructured":"Bauschke, H.H., Combettes, P.L.: Convex Analysis and Monotone Operator Theory in Hilbert Spaces. Springer, Berlin (2011)"},{"issue":"4","key":"9912_CR33","doi-asserted-by":"crossref","first-page":"1168","DOI":"10.1137\/050626090","volume":"4","author":"PL Combettes","year":"2005","unstructured":"Combettes, P.L., Wajs, V.R.: Signal recovery by proximal forward\u2013backward splitting. Multiscale Model. Simul. 4(4), 1168\u20131200 (2005)","journal-title":"Multiscale Model. Simul."},{"key":"9912_CR34","doi-asserted-by":"crossref","unstructured":"Dennis, J.E., Schnabel, R.B.: Numerical Methods for Unconstrained Optimization and Nonlinear Equations. Society for Industrial and Applied Mathematics (1996).","DOI":"10.1137\/1.9781611971200"},{"key":"9912_CR35","volume-title":"Nonlinear Programming","author":"D Bertsekas","year":"1999","unstructured":"Bertsekas, D.: Nonlinear Programming. Athena Scientific, Belmont (1999)"},{"issue":"2","key":"9912_CR36","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1137\/S1052623494267127","volume":"7","author":"C Lemar\u00e9chal","year":"1997","unstructured":"Lemar\u00e9chal, C., Sagastiz\u00e1bal, C.: Practical aspects of the Moreau\u2013Yosida regularization: theoretical preliminaries. SIAM J. Optim. 7(2), 367\u2013385 (1997)","journal-title":"SIAM J. Optim."},{"key":"9912_CR37","doi-asserted-by":"crossref","DOI":"10.1515\/9781400833344","volume-title":"Matrix Mathematics: Theory, Facts, and Formulas with Application to Linear Systems Theory","author":"DS Bernstein","year":"2009","unstructured":"Bernstein, D.S.: Matrix Mathematics: Theory, Facts, and Formulas with Application to Linear Systems Theory. Princeton University Press, Woodstock (2009)"},{"key":"9912_CR38","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1090\/S0002-9947-1988-0936806-9","volume":"307","author":"RT Rockafellar","year":"1988","unstructured":"Rockafellar, R.T.: First- and second-order epi-differentiability in nonlinear programming. Trans. Am. Math. Soc. 307, 75\u2013108 (1988)","journal-title":"Trans. Am. Math. Soc."},{"issue":"3","key":"9912_CR39","doi-asserted-by":"crossref","first-page":"462","DOI":"10.1287\/moor.14.3.462","volume":"14","author":"R Rockafellar","year":"1989","unstructured":"Rockafellar, R.: Second-order optimality conditions in nonlinear programming obtained by way of epi-derivatives. Math. Oper. Res. 14(3), 462\u2013484 (1989)","journal-title":"Math. Oper. Res."},{"key":"9912_CR40","unstructured":"Poliquin, R.A., Rockafellar, R.T.: Amenable functions in optimization. In: Giannessi, F. (ed.) Nonsmooth Optimization: Methods and Applications, pp. 338\u2013353. Gordon and Breach (1992)."},{"key":"9912_CR41","doi-asserted-by":"crossref","unstructured":"Poliquin, R.A., Rockafellar, R.T.: Second-order nonsmooth analysis in nonlinear programming. In: Du, D., Qi, L., Womersley, R. (eds.) Recent Advances in Nonsmooth Optimization, pp.\u00a0322\u2013350. World Scientific Publishers (1995)","DOI":"10.1142\/9789812812827_0018"},{"issue":"5","key":"9912_CR42","doi-asserted-by":"crossref","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":"4","key":"9912_CR43","doi-asserted-by":"crossref","first-page":"1106","DOI":"10.1137\/S1052623494278839","volume":"6","author":"M Fukushima","year":"1996","unstructured":"Fukushima, M., Qi, L.: A globally and superlinearly convergent algorithm for nonsmooth convex minimization. SIAM J. Optim. 6(4), 1106\u20131120 (1996)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"9912_CR44","first-page":"15","volume":"68","author":"JF Bonnans","year":"1995","unstructured":"Bonnans, J.F., Gilbert, J.C., Lemar\u00e9chal, C., Sagastiz\u00e1bal, C.A.: A family of variable metric proximal methods. Math. Program. 68(1), 15\u201347 (1995)","journal-title":"Math. Program."},{"issue":"2","key":"9912_CR45","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1137\/S1052623496303329","volume":"8","author":"R Mifflin","year":"1998","unstructured":"Mifflin, R., Sun, D., Qi, L.: Quasi-Newton bundle-type methods for nondifferentiable convex optimization. SIAM J. Optim. 8(2), 583\u2013603 (1998)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"9912_CR46","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1007\/s101070050059","volume":"85","author":"X Chen","year":"1999","unstructured":"Chen, X., Fukushima, M.: Proximal quasi-Newton methods for nondifferentiable convex optimization. Math. Program. 85(2), 313\u2013334 (1999)","journal-title":"Math. Program."},{"issue":"1","key":"9912_CR47","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/PL00011373","volume":"88","author":"JV Burke","year":"2000","unstructured":"Burke, J.V., Qian, M.: On the superlinear convergence of the variable metric proximal point algorithm using Broyden and BFGS matrix secant updating. Math. Program. 88(1), 157\u2013181 (2000)","journal-title":"Math. Program."},{"issue":"2","key":"9912_CR48","doi-asserted-by":"crossref","first-page":"171","DOI":"10.3934\/jimo.2005.1.171","volume":"1","author":"N Sagara","year":"2005","unstructured":"Sagara, N., Fukushima, M.: A trust region method for nonsmooth convex optimization. J. Ind. Manage. Optim. 1(2), 171\u2013180 (2005)","journal-title":"J. Ind. Manage. Optim."},{"issue":"1","key":"9912_CR49","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1137\/S003614459631241X","volume":"40","author":"W Squire","year":"1998","unstructured":"Squire, W., Trapp, G.: Using complex variables to estimate derivatives of real functions. SIAM Rev. 40(1), 110\u2013112 (1998)","journal-title":"SIAM Rev."},{"key":"9912_CR50","volume-title":"Numerical Optimization","author":"J Nocedal","year":"2006","unstructured":"Nocedal, J., Wright, S.: Numerical Optimization. Springer, Berlin (2006)"},{"key":"9912_CR51","doi-asserted-by":"crossref","unstructured":"Noll, D., Rondepierre, A.: Convergence of linesearch and trust-region methods using the Kurdyka\u2013\u0141ojasiewicz inequality. In: Bailey, D.H., Bauschke, H.H., Borwein, P., Garvan, F., Th\u00e9ra, M., Vanderwerff, J.D., Wolkowicz, H. (eds.) Computational and Analytical Mathematics: In Honor of Jonathan Borwein\u2019s 60th birthday, pp.\u00a0593\u2013611. Springer, New York (2013)","DOI":"10.1007\/978-1-4614-7621-4_27"},{"issue":"4","key":"9912_CR52","doi-asserted-by":"crossref","first-page":"1205","DOI":"10.1137\/050644641","volume":"17","author":"J Bolte","year":"2007","unstructured":"Bolte, J., Daniilidis, A., Lewis, A.: The \u0141ojasiewicz inequality for nonsmooth subanalytic functions with applications to subgradient dynamical systems. SIAM J. Optim. 17(4), 1205\u20131223 (2007)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"9912_CR53","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1137\/1019005","volume":"19","author":"JE Dennis","year":"1977","unstructured":"Dennis, J.E., Mor\u00e9, J.J.: Quasi-Newton methods, motivation and theory. SIAM Rev. 19(1), 46\u201389 (1977)","journal-title":"SIAM Rev."},{"key":"9912_CR54","unstructured":"Powell, M.J.D.: Some global convergence properties of a variable metric algorithm for minimization without exact line searches. In: Cottle, R.W., Lemke, C.E. (eds.) Nonlinear Programming. SIAM-AMS Proceedings 9, pp.\u00a053\u201372. American Mathematical Society (1976)"},{"issue":"1","key":"9912_CR55","first-page":"503","volume":"45","author":"DC Liu","year":"1989","unstructured":"Liu, D.C., Nocedal, J.: On the limited memory BFGS method for large scale optimization. Math. Program. 45(1), 503\u2013528 (1989)","journal-title":"Math. Program."},{"issue":"1\u20133","key":"9912_CR56","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/BF01580895","volume":"56","author":"C-M 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."},{"issue":"151","key":"9912_CR57","doi-asserted-by":"crossref","first-page":"773","DOI":"10.1090\/S0025-5718-1980-0572855-7","volume":"35","author":"J Nocedal","year":"1980","unstructured":"Nocedal, J.: Updating quasi-Newton matrices with limited storage. Math. Comput. 35(151), 773\u2013782 (1980)","journal-title":"Math. Comput."},{"issue":"4","key":"9912_CR58","doi-asserted-by":"crossref","first-page":"1054","DOI":"10.1137\/S1052623499354242","volume":"11","author":"D-H Li","year":"2001","unstructured":"Li, D.-H., Fukushima, M.: On the global convergence of the BFGS method for nonconvex unconstrained optimization problems. SIAM J. Optim. 11(4), 1054\u20131064 (2001)","journal-title":"SIAM J. Optim."},{"key":"9912_CR59","volume-title":"Convex Analysis and Minimization Algorithms I: Fundamentals","author":"J-B Hiriart-Urruty","year":"1996","unstructured":"Hiriart-Urruty, J.-B., Lemar\u00e9chal, C.: Convex Analysis and Minimization Algorithms I: Fundamentals, vol. 305. Springer, Berlin (1996)"},{"key":"9912_CR60","volume-title":"Practical Methods of Optimization","author":"R Fletcher","year":"1987","unstructured":"Fletcher, R.: Practical Methods of Optimization. Wiley, Hoboken (1987)"},{"issue":"1","key":"9912_CR61","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1137\/S1052623497318992","volume":"10","author":"Y-H Dai","year":"1999","unstructured":"Dai, Y.-H., Yuan, Y.: A nonlinear conjugate gradient method with a strong global convergence property. SIAM J. Optim. 10(1), 177\u2013182 (1999)","journal-title":"SIAM J. Optim."},{"issue":"7","key":"9912_CR62","doi-asserted-by":"crossref","first-page":"2479","DOI":"10.1109\/TSP.2009.2016892","volume":"57","author":"SJ Wright","year":"2009","unstructured":"Wright, S.J., Nowak, R.D., Figueiredo, M.A.: Sparse reconstruction by separable approximation. IEEE Trans. Signal Process. 57(7), 2479\u20132493 (2009)","journal-title":"IEEE Trans. Signal Process."},{"issue":"4","key":"9912_CR63","doi-asserted-by":"crossref","first-page":"1832","DOI":"10.1137\/090747695","volume":"32","author":"Z Wen","year":"2010","unstructured":"Wen, Z., Yin, W., Goldfarb, D., Zhang, Y.: A fast algorithm for sparse reconstruction based on shrinkage, subspace optimization, and continuation. SIAM J. Sci. Comput. 32(4), 1832\u20131857 (2010)","journal-title":"SIAM J. Sci. Comput."},{"issue":"6","key":"9912_CR64","doi-asserted-by":"crossref","first-page":"717","DOI":"10.1007\/s10208-009-9045-5","volume":"9","author":"EJ Cand\u00e8s","year":"2009","unstructured":"Cand\u00e8s, E.J., Recht, B.: Exact matrix completion via convex optimization. Found. Comput. Math. 9(6), 717\u2013772 (2009)","journal-title":"Found. Comput. Math."},{"issue":"3","key":"9912_CR65","first-page":"615","volume":"6","author":"K-C Toh","year":"2010","unstructured":"Toh, K.-C., Yun, S.: An accelerated proximal gradient algorithm for nuclear norm regularized linear least squares problems. Pac. J. Optim. 6(3), 615\u2013640 (2010)","journal-title":"Pac. J. Optim."},{"issue":"1","key":"9912_CR66","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s13675-015-0045-8","volume":"4","author":"RI Bo\u0163","year":"2016","unstructured":"Bo\u0163, R.I., Csetnek, E.R., L\u00e1szl\u00f3, S.C.: An inertial forward-backward algorithm for the minimization of the sum of two nonconvex functions. EURO J. Comput. Optim. 4(1), 3\u201325 (2016)","journal-title":"EURO J. Comput. Optim."},{"issue":"2","key":"9912_CR67","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1287\/moor.15.2.311","volume":"15","author":"J-S Pang","year":"1990","unstructured":"Pang, J.-S.: Newton\u2019s method for B-differentiable equations. Math. Oper. Res. 15(2), 311\u2013341 (1990)","journal-title":"Math. Oper. Res."},{"issue":"4","key":"9912_CR68","doi-asserted-by":"crossref","first-page":"1121","DOI":"10.1137\/S1052623494279316","volume":"6","author":"R Poliquin","year":"1996","unstructured":"Poliquin, R., Rockafellar, R.: Generalized Hessian properties of regularized nonsmooth functions. SIAM J. Optim. 6(4), 1121\u20131137 (1996)","journal-title":"SIAM J. Optim."},{"key":"9912_CR69","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139020411","volume-title":"Matrix Analysis","author":"RA Horn","year":"2012","unstructured":"Horn, R.A., Johnson, C.R.: Matrix Analysis. Cambridge University Press, Cambridge (2012)"},{"issue":"3","key":"9912_CR70","doi-asserted-by":"crossref","first-page":"727","DOI":"10.1137\/0726042","volume":"26","author":"RH Byrd","year":"1989","unstructured":"Byrd, R.H., Nocedal, J.: A tool for the analysis of quasi-Newton methods with application to unconstrained minimization. SIAM J. Numer. Anal. 26(3), 727\u2013739 (1989)","journal-title":"SIAM J. Numer. Anal."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-017-9912-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-017-9912-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-017-9912-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,23]],"date-time":"2023-08-23T02:36:52Z","timestamp":1692758212000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-017-9912-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,4,10]]},"references-count":70,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017,7]]}},"alternative-id":["9912"],"URL":"https:\/\/doi.org\/10.1007\/s10589-017-9912-y","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,4,10]]}}}