{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,10]],"date-time":"2026-07-10T03:05:18Z","timestamp":1783652718726,"version":"3.55.0"},"reference-count":49,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2020,11,16]],"date-time":"2020-11-16T00:00:00Z","timestamp":1605484800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2020,11,16]],"date-time":"2020-11-16T00:00:00Z","timestamp":1605484800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2021,3]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Optimization problems with composite functions consist of an objective function which is the sum of a smooth and a (convex) nonsmooth term. This particular structure is exploited by the class of proximal gradient methods and some of their generalizations like proximal Newton and quasi-Newton methods. The current literature on these classes of methods almost exclusively considers the case where also the smooth term is convex. Here we present a globalized proximal Newton-type method which allows the smooth term to be nonconvex. The method is shown to have nice global and local convergence properties, and some numerical results indicate that this method is very promising also from a practical point of view.<\/jats:p>","DOI":"10.1007\/s10589-020-00243-6","type":"journal-article","created":{"date-parts":[[2020,11,16]],"date-time":"2020-11-16T08:05:48Z","timestamp":1605513948000},"page":"377-410","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":31,"title":["Globalized inexact proximal Newton-type methods for nonconvex composite functions"],"prefix":"10.1007","volume":"78","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2897-2509","authenticated-orcid":false,"given":"Christian","family":"Kanzow","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Theresa","family":"Lechner","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,11,16]]},"reference":[{"key":"243_CR1","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/s10107-012-0571-6","volume":"134","author":"A Aravkin","year":"2012","unstructured":"Aravkin, A., Friedlander, M.P., Herrmann, F.J., Van Leeuwen, T.: Robust inversion, dimensionality reduction, and randomized sampling. Math. Program 134, 101\u2013125 (2012)","journal-title":"Math. Program"},{"key":"243_CR2","unstructured":"Argyriou, A., Micchelli, C.A., Pontil, M., Shen, L., Xu, Y.: Efficient first order methods for linear composite regularizers, arXiv preprint arXiv:1104.1436, (2011)"},{"key":"243_CR3","doi-asserted-by":"crossref","unstructured":"Banerjee, O., Ghaoui, L.E., d\u2019Aspremont, A., Natsoulis, G.: Convex optimization techniques for fitting sparse gaussian graphical models. In: Proceedings of the 23rd international conference on Machine learning, pp.\u00a089\u201396 (2006)","DOI":"10.1145\/1143844.1143856"},{"key":"243_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":"H Bauschke","year":"2017","unstructured":"Bauschke, H., Combettes, P.: Convex Analysis and Monotone Operator Theory in Hilbert Spaces. CMS Books in Mathematics, 2nd edn. Springer, Berlin (2017)","edition":"2"},{"key":"243_CR5","series-title":"MOS-SIAM Series on Optimization","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974997","volume-title":"First-Order Methods in Optimization","author":"A Beck","year":"2017","unstructured":"Beck, A.: First-Order Methods in Optimization. MOS-SIAM Series on Optimization. Society for Industrial and Applied Mathematics, Philadelphia (2017)"},{"key":"243_CR6","doi-asserted-by":"publisher","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. Imag. Sci. 2, 183\u2013202 (2009)","journal-title":"SIAM J. Imag. Sci."},{"key":"243_CR7","doi-asserted-by":"publisher","first-page":"2445","DOI":"10.1137\/18M1167152","volume":"29","author":"S Becker","year":"2019","unstructured":"Becker, S., Fadili, J., Ochs, P.: On quasi-newton forward-backward splitting: Proximal calculus and convergence. SIAM J. Optim. 29, 2445\u20132481 (2019)","journal-title":"SIAM J. Optim."},{"key":"243_CR8","doi-asserted-by":"publisher","first-page":"891","DOI":"10.1137\/15M1019325","volume":"26","author":"S Bonettini","year":"2016","unstructured":"Bonettini, S., Loris, I., Porta, F., Prato, M.: Variable metric inexact line-search-based methods for nonsmooth optimization. SIAM J. Optim. 26, 891\u2013921 (2016)","journal-title":"SIAM J. Optim."},{"key":"243_CR9","doi-asserted-by":"publisher","first-page":"055005","DOI":"10.1088\/1361-6420\/aa5bfd","volume":"33","author":"S Bonettini","year":"2017","unstructured":"Bonettini, S., Loris, I., Porta, F., Prato, M., Rebegoldi, S.: On the convergence of a linesearch based proximal-gradient method for nonconvex optimization. Inv. Prob. 33, 055005 (2017)","journal-title":"Inv. Prob."},{"key":"243_CR10","doi-asserted-by":"publisher","first-page":"095008","DOI":"10.1088\/0266-5611\/31\/9\/095008","volume":"31","author":"S Bonettini","year":"2015","unstructured":"Bonettini, S., Prato, M.: New convergence results for the scaled gradient projection method. Inv. Prob. 31, 095008 (2015)","journal-title":"Inv. Prob."},{"key":"243_CR11","doi-asserted-by":"publisher","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, 3\u201325 (2016)","journal-title":"EURO J. Comput. Optim."},{"key":"243_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1561\/2200000016","volume":"3","author":"S Boyd","year":"2011","unstructured":"Boyd, S., Parikh, N., Chu, E., Peleato, B., Eckstein, J., et al.: Distributed optimization and statistical learning via the alternating direction method of multipliers. Found. Trends Mach. Learn. 3, 1\u2013122 (2011)","journal-title":"Found. Trends Mach. Learn."},{"key":"243_CR13","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/s10107-015-0941-y","volume":"157","author":"RH Byrd","year":"2016","unstructured":"Byrd, R.H., Nocedal, J., Oztoprak, F.: An inexact successive quadratic approximation method for l-1 regularized optimization. Math. Program. 157, 375\u2013396 (2016)","journal-title":"Math. Program."},{"key":"243_CR14","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/BF01582063","volume":"63","author":"RH Byrd","year":"1994","unstructured":"Byrd, R.H., Nocedal, J., Schnabel, R.B.: Representations of quasi-Newton matrices and their use in limited memory methods. Math. Program. 63, 129\u2013156 (1994)","journal-title":"Math. Program."},{"key":"243_CR15","doi-asserted-by":"publisher","first-page":"1287","DOI":"10.1007\/s10444-016-9462-3","volume":"42","author":"D-Q Chen","year":"2016","unstructured":"Chen, D.-Q., Zhou, Y., Song, L.-J.: Fixed point algorithm based on adapted metric method for convex minimization problem with application to image deblurring. Adv. Comput. Math. 42, 1287\u20131310 (2016)","journal-title":"Adv. Comput. Math."},{"key":"243_CR16","doi-asserted-by":"publisher","first-page":"025011","DOI":"10.1088\/0266-5611\/29\/2\/025011","volume":"29","author":"P Chen","year":"2013","unstructured":"Chen, P., Huang, J., Zhang, X.: A primal-dual fixed point algorithm for convex separable minimization with applications to image restoration. Inv. Prob. 29, 025011 (2013)","journal-title":"Inv. Prob."},{"key":"243_CR17","doi-asserted-by":"publisher","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-backward splitting. Multiscale Model. Simul. 4, 1168\u20131200 (2005)","journal-title":"Multiscale Model. Simul."},{"key":"243_CR18","first-page":"407","volume":"75","author":"T De Luca","year":"1996","unstructured":"De Luca, T., Facchinei, F., Kanzow, C.: A semismooth equation approach to the solution of nonlinear complementarity problems. Math. Program. 75, 407\u2013439 (1996)","journal-title":"Math. Program."},{"key":"243_CR19","doi-asserted-by":"publisher","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, 549\u2013560 (1974)","journal-title":"Math. Comput."},{"key":"243_CR20","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"ED Dolan","year":"2002","unstructured":"Dolan, E.D., Mor\u00e9, J.J.: Benchmarking optimization software with performance profiles. Math. program. 91, 201\u2013213 (2002)","journal-title":"Math. program."},{"key":"243_CR21","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/s10589-018-9984-3","volume":"70","author":"K Fountoulakis","year":"2018","unstructured":"Fountoulakis, K., Tappenden, R.: A flexible coordinate descent method. Comput. Optim. Appl. 70, 351\u2013394 (2018)","journal-title":"Comput. Optim. Appl."},{"key":"243_CR22","doi-asserted-by":"publisher","first-page":"989","DOI":"10.1080\/00207728108963798","volume":"12","author":"M Fukushima","year":"1981","unstructured":"Fukushima, M., Mine, H.: A generalized proximal point algorithm for certain non-convex minimization problems. Int. J. Syst. Sci. 12, 989\u20131000 (1981)","journal-title":"Int. J. Syst. Sci."},{"key":"243_CR23","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1007\/s10589-017-9964-z","volume":"69","author":"H Ghanbari","year":"2018","unstructured":"Ghanbari, H., Scheinberg, K.: Proximal quasi-Newton methods for regularized convex optimization with linear and accelerated sublinear convergence rates. Comput. Optim. Appl. 69, 597\u2013627 (2018)","journal-title":"Comput. Optim. Appl."},{"key":"243_CR24","unstructured":"Gu, B., Huo, Z., Huang, H.: Inexact proximal gradient methods for non-convex and non-smooth optimization, arXiv preprint arXiv:1612.06003, (2016)"},{"key":"243_CR25","first-page":"1519","volume":"8","author":"K Koh","year":"2007","unstructured":"Koh, K., Kim, S.-J., Boyd, S.: An interior-point method for large-scale l1-regularized logistic regression. J. Mach. Learn. Res. 8, 1519\u20131555 (2007)","journal-title":"J. Mach. Learn. Res."},{"key":"243_CR26","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1007\/s10589-019-00059-z","volume":"72","author":"C-P Lee","year":"2019","unstructured":"Lee, C.-P., Wright, S.J.: Inexact successive quadratic approximation for regularized optimization. Comput. Optim. Appl. 72, 641\u2013674 (2019)","journal-title":"Comput. Optim. Appl."},{"key":"243_CR27","doi-asserted-by":"publisher","first-page":"1420","DOI":"10.1137\/130921428","volume":"24","author":"JD Lee","year":"2014","unstructured":"Lee, J.D., Sun, Y., Saunders, M.A.: Proximal Newton-type methods for minimizing composite functions. SIAM J. Optim. 24, 1420\u20131443 (2014)","journal-title":"SIAM J. Optim."},{"key":"243_CR28","first-page":"1","volume":"85","author":"J Li","year":"2016","unstructured":"Li, J., Andersen, M.S., Vandenberghe, L.: Inexact proximal Newton methods for self-concordant functions. Math. Methods Oper. Res. 85, 1\u201323 (2016)","journal-title":"Math. Methods Oper. Res."},{"key":"243_CR29","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/s10444-014-9363-2","volume":"41","author":"Q Li","year":"2015","unstructured":"Li, Q., Shen, L., Xu, Y., Zhang, N.: Multi-step fixed-point proximity algorithms for solving a class of optimization problems arising from image processing. Adv. Comput. Math. 41, 387\u2013422 (2015)","journal-title":"Adv. Comput. Math."},{"key":"243_CR30","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1111\/j.1467-9868.2007.00627.x","volume":"70","author":"L Meier","year":"2008","unstructured":"Meier, L., Van De Geer, S., B\u00fchlmann, P.: The group lasso for logistic regression. J. R. Stat. Soc. Ser. B (Stat. Methodol.) 70, 53\u201371 (2008)","journal-title":"J. R. Stat. Soc. Ser. B (Stat. Methodol.)"},{"key":"243_CR31","unstructured":"Milzarek, A.: Numerical methods and second order theory for nonsmooth problems. PhD thesis, Technische Universit\u00e4t M\u00fcnchen (2016)"},{"key":"243_CR32","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1137\/120892167","volume":"24","author":"A Milzarek","year":"2014","unstructured":"Milzarek, A., Ulbrich, M.: A semismooth Newton method with multidimensional filter globalization for $$l_1$$-optimization. SIAM J. Optim. 24, 298\u2013333 (2014)","journal-title":"SIAM J. Optim."},{"key":"243_CR33","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1137\/0904038","volume":"4","author":"JJ Mor\u00e9","year":"1983","unstructured":"Mor\u00e9, J.J., Sorensen, D.C.: Computing a trust region step. SIAM J. Sci. Stat. Comput. 4, 553\u2013572 (1983)","journal-title":"SIAM J. Sci. Stat. Comput."},{"key":"243_CR34","doi-asserted-by":"publisher","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"},{"key":"243_CR35","doi-asserted-by":"publisher","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, 125\u2013161 (2013)","journal-title":"Math. Program."},{"key":"243_CR36","doi-asserted-by":"crossref","unstructured":"Patrinos, P., Bemporad, A.: Proximal Newton methods for convex composite optimization. In: 52nd IEEE Conference on Decision and Control, IEEE, pp.\u00a02358\u20132363 (2013)","DOI":"10.1109\/CDC.2013.6760233"},{"key":"243_CR37","doi-asserted-by":"crossref","unstructured":"Patrinos, P., Stella, L., Bemporad, A.: Forward-backward truncated Newton methods for convex composite optimization, arXiv preprint arXiv:1402.6655, (2014)","DOI":"10.1109\/CDC.2013.6760233"},{"key":"243_CR38","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, 877\u2013898 (1976)","journal-title":"SIAM J. Control Optim."},{"key":"243_CR39","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/s10208-014-9189-9","volume":"14","author":"K Scheinberg","year":"2014","unstructured":"Scheinberg, K., Goldfarb, D., Bai, X.: Fast first-order methods for composite convex optimization with backtracking. Found. Comput. Math. 14, 389\u2013417 (2014)","journal-title":"Found. Comput. Math."},{"key":"243_CR40","doi-asserted-by":"publisher","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, 495\u2013529 (2016)","journal-title":"Math. Program."},{"key":"243_CR41","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, 443\u2013487 (2017)","journal-title":"Comput. Optim. Appl."},{"key":"243_CR42","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1111\/j.2517-6161.1996.tb02080.x","volume":"58","author":"R Tibshirani","year":"1996","unstructured":"Tibshirani, R.: Regression shrinkage and selection via the lasso. J. R. Stat. Soc. Ser. B (Methodol.) 58, 267\u2013288 (1996)","journal-title":"J. R. Stat. Soc. Ser. B (Methodol.)"},{"key":"243_CR43","unstructured":"Tran-Dinh, Q., Kyrillidis, A., Cevher, V.: A proximal Newton framework for composite minimization: Graph learning without Cholesky decompositions and matrix inversions. In: International Conference on Machine Learning, pp.\u00a0271\u2013279 (2013)"},{"key":"243_CR44","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/s10107-007-0170-0","volume":"117","author":"P Tseng","year":"2009","unstructured":"Tseng, P., Yun, S.: A coordinate gradient descent method for nonsmooth separable minimization. Math. Program. 117, 387\u2013423 (2009)","journal-title":"Math. Program."},{"key":"243_CR45","doi-asserted-by":"publisher","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. Sig. Process. 57, 2479\u20132493 (2009)","journal-title":"IEEE Trans. Sig. Process."},{"key":"243_CR46","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1111\/j.1467-9868.2005.00532.x","volume":"68","author":"M Yuan","year":"2006","unstructured":"Yuan, M., Lin, Y.: Model selection and estimation in regression with grouped variables. J. R. Stat. Soc. Ser. B (Stat. Methodol.) 68, 49\u201367 (2006)","journal-title":"J. R. Stat. Soc. Ser. B (Stat. Methodol.)"},{"key":"243_CR47","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/s10107-018-1280-6","volume":"174","author":"M-C Yue","year":"2019","unstructured":"Yue, M.-C., Zhou, Z., So, A.M.-C.: A family of inexact SQA methods for non-smooth convex minimization with provable convergence guarantees based on the Luo-Tseng error bound property. Math. Program. 174, 327\u2013358 (2019)","journal-title":"Math. Program."},{"key":"243_CR48","doi-asserted-by":"crossref","unstructured":"Zhang, S., Qian, H., Gong, X.: An alternating proximal splitting method with global convergence for nonconvex structured sparsity optimization. In: 30. AAAI Conference on Artificial Intelligence, pp.\u00a02330\u20132336 (2016)","DOI":"10.1609\/aaai.v30i1.10253"},{"key":"243_CR49","unstructured":"Zhong, K., Yen, I.E.-H., Dhillon, I.S., Ravikumar, P.K.: Proximal quasi-Newton for computationally intensive l1-regularized M-estimators. In: Advances in Neural Information Processing Systems 27, pp. 2375\u20132383 (2014)"}],"updated-by":[{"DOI":"10.1007\/s10589-021-00302-6","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2021,7,21]],"date-time":"2021-07-21T00:00:00Z","timestamp":1626825600000}}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-020-00243-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-020-00243-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-020-00243-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,17]],"date-time":"2024-08-17T12:46:20Z","timestamp":1723898780000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-020-00243-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,11,16]]},"references-count":49,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,3]]}},"alternative-id":["243"],"URL":"https:\/\/doi.org\/10.1007\/s10589-020-00243-6","relation":{"correction":[{"id-type":"doi","id":"10.1007\/s10589-021-00302-6","asserted-by":"object"}]},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,11,16]]},"assertion":[{"value":"27 February 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 October 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 November 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 July 2021","order":4,"name":"change_date","label":"Change Date","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Correction","order":5,"name":"change_type","label":"Change Type","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"A Correction to this paper has been published:","order":6,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"https:\/\/doi.org\/10.1007\/s10589-021-00302-6","URL":"https:\/\/doi.org\/10.1007\/s10589-021-00302-6","order":7,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}}]}}