{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T16:18:45Z","timestamp":1777997925525,"version":"3.51.4"},"reference-count":89,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T00:00:00Z","timestamp":1770940800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T00:00:00Z","timestamp":1770940800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12150410304"],"award-info":[{"award-number":["12150410304"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100017610","name":"Shenzhen Science and Technology Innovation Program","doi-asserted-by":"publisher","award":["RCYX20221008093033010"],"award-info":[{"award-number":["RCYX20221008093033010"]}],"id":[{"id":"10.13039\/501100017610","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Shenzhen Stability Science Program","award":["Shenzhen Key Lab of Multi-Modal Cognitive Computing"],"award-info":[{"award-number":["Shenzhen Key Lab of Multi-Modal Cognitive Computing"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2026,5]]},"DOI":"10.1007\/s10589-025-00754-0","type":"journal-article","created":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T05:17:45Z","timestamp":1770959865000},"page":"73-110","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A linesearch-type normal map-based semismooth Newton method for nonsmooth nonconvex composite optimization"],"prefix":"10.1007","volume":"94","author":[{"given":"Hanfeng","family":"Zeng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenqing","family":"Ouyang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6784-5417","authenticated-orcid":false,"given":"Andre","family":"Milzarek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,2,13]]},"reference":[{"issue":"1","key":"754_CR1","doi-asserted-by":"publisher","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 58(1), 267\u2013288 (1996)","journal-title":"J. R. Stat. Soc. Ser. B"},{"issue":"17","key":"754_CR2","doi-asserted-by":"publisher","first-page":"2246","DOI":"10.1093\/bioinformatics\/btg308","volume":"19","author":"SK Shevade","year":"2003","unstructured":"Shevade, S.K., Keerthi, S.S.: A simple and efficient algorithm for gene selection using sparse logistic regression. Bioinformatics 19(17), 2246\u20132253 (2003)","journal-title":"Bioinformatics"},{"issue":"4","key":"754_CR3","doi-asserted-by":"publisher","first-page":"1289","DOI":"10.1109\/TIT.2006.871582","volume":"52","author":"DL Donoho","year":"2006","unstructured":"Donoho, D.L.: Compressed sensing. IEEE Trans. Inf. Theory 52(4), 1289\u20131306 (2006)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"7","key":"754_CR4","doi-asserted-by":"publisher","first-page":"2477","DOI":"10.1109\/TSP.2005.849172","volume":"53","author":"SF Cotter","year":"2005","unstructured":"Cotter, S.F., Rao, B.D., Engan, K., Kreutz-Delgado, K.: Sparse solutions to linear inverse problems with multiple measurement vectors. IEEE Trans. Signal Process. 53(7), 2477\u20132488 (2005)","journal-title":"IEEE Trans. Signal Process."},{"issue":"1","key":"754_CR5","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 68(1), 49\u201367 (2006)","journal-title":"J. R. Stat. Soc. Ser. B"},{"issue":"1","key":"754_CR6","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 70(1), 53\u201371 (2008)","journal-title":"J. R. Stat. Soc. Ser. B"},{"key":"754_CR7","doi-asserted-by":"crossref","unstructured":"Mairal, J., Bach, F., Ponce, J., Sapiro, G.: Online dictionary learning for sparse coding. In: Proceedings of the 26th International Conference on Machine Learning, pp. 689\u2013696. Association for Computing Machinery, New York, NY, USA (2009)","DOI":"10.1145\/1553374.1553463"},{"issue":"1","key":"754_CR8","first-page":"1","volume":"4","author":"F Bach","year":"2011","unstructured":"Bach, F., Jenatton, R., Mairal, J., Obozinski, G.: Optimization with sparsity-inducing penalties. Found. Trends Mach. Learn. 4(1), 1\u2013106 (2011)","journal-title":"Found. Trends Mach. Learn."},{"issue":"6","key":"754_CR9","doi-asserted-by":"publisher","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 (2009)","journal-title":"Found. Comput. Math."},{"issue":"4","key":"754_CR10","doi-asserted-by":"publisher","first-page":"1956","DOI":"10.1137\/080738970","volume":"20","author":"J-F Cai","year":"2010","unstructured":"Cai, J.-F., Cand\u00e8s, E.J., Shen, Z.: A singular value thresholding algorithm for matrix completion. SIAM J. Optim. 20(4), 1956\u20131982 (2010)","journal-title":"SIAM J. Optim."},{"key":"754_CR11","first-page":"738","volume-title":"Pattern Recognition and Machine Learning. Information Science and Statistics","author":"CM Bishop","year":"2006","unstructured":"Bishop, C.M.: Pattern Recognition and Machine Learning. Information Science and Statistics, p. 738. Springer, New York (2006)"},{"key":"754_CR12","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107298019","volume-title":"Understanding Machine Learning: From Theory to Algorithms","author":"S Shalev-Shwartz","year":"2014","unstructured":"Shalev-Shwartz, S., Ben-David, S.: Understanding Machine Learning: From Theory to Algorithms. Cambridge University Press, Cambridge (2014)"},{"issue":"2","key":"754_CR13","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1137\/16M1080173","volume":"60","author":"L Bottou","year":"2018","unstructured":"Bottou, L., Curtis, F.E., Nocedal, J.: Optimization methods for large-scale machine learning. SIAM Rev. 60(2), 223\u2013311 (2018)","journal-title":"SIAM Rev."},{"issue":"8","key":"754_CR14","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 nonconvex minimization problems. Int. J. Syst. Sci. 12(8), 989\u20131000 (1981)","journal-title":"Int. J. Syst. Sci."},{"issue":"2","key":"754_CR15","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1137\/S1052623495290179","volume":"7","author":"GH Chen","year":"1997","unstructured":"Chen, G.H., Rockafellar, R.T.: Convergence rates in forward\u2013backward splitting. SIAM J. Optim. 7(2), 421\u2013444 (1997)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"754_CR16","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\u2013backward splitting. Multiscale Model. Simul. 4(4), 1168\u20131200 (2005)","journal-title":"Multiscale Model. Simul."},{"issue":"3","key":"754_CR17","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1561\/2400000003","volume":"1","author":"N Parikh","year":"2014","unstructured":"Parikh, N., Boyd, S.: Proximal algorithms. Found. Trends Optim. 1(3), 127\u2013239 (2014)","journal-title":"Found. Trends Optim."},{"key":"754_CR18","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. Bull. Soc. Math. FR. 93, 273\u2013299 (1965)","journal-title":"Bull. Soc. Math. FR."},{"issue":"3","key":"754_CR19","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1287\/moor.17.3.691","volume":"17","author":"SM Robinson","year":"1992","unstructured":"Robinson, S.M.: Normal maps induced by linear transformations. Math. Oper. Res. 17(3), 691\u2013714 (1992)","journal-title":"Math. Oper. Res."},{"key":"754_CR20","series-title":"Springer Series in Operations Research","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. Springer Series in Operations Research, Springer, New York (2003)"},{"issue":"3, Ser. A","key":"754_CR21","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/BF01581275","volume":"58","author":"L Qi","year":"1993","unstructured":"Qi, L., Sun, J.: A nonsmooth version of Newton\u2019s method. Math. Program. 58(3, Ser. A), 353\u2013367 (1993)","journal-title":"Math. Program."},{"issue":"1","key":"754_CR22","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1287\/moor.18.1.227","volume":"18","author":"L Qi","year":"1993","unstructured":"Qi, L.: Convergence analysis of some algorithms for solving nonsmooth equations. Math. Oper. Res. 18(1), 227\u2013244 (1993)","journal-title":"Math. Oper. Res."},{"key":"754_CR23","doi-asserted-by":"crossref","unstructured":"Qi, L., Sun, D.: A survey of some nonsmooth equations and smoothing Newton methods. In: Progress in Optimization. Appl. Optim., vol. 30, pp. 121\u2013146. Kluwer Acad. Publ., Dordrecht, NL (1999)","DOI":"10.1007\/978-1-4613-3285-5_7"},{"issue":"3","key":"754_CR24","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1287\/moor.17.3.586","volume":"17","author":"S-P Han","year":"1992","unstructured":"Han, S.-P., Pang, J.-S., Rangaraj, N.: Globally convergent Newton methods for nonsmooth equations. Math. Oper. Res. 17(3), 586\u2013607 (1992)","journal-title":"Math. Oper. Res."},{"issue":"1\u20132","key":"754_CR25","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/0377-0427(94)00088-I","volume":"60","author":"JM Mart\u00ednez","year":"1995","unstructured":"Mart\u00ednez, J.M., Qi, L.Q.: Inexact Newton methods for solving nonsmooth equations. J. Comput. Appl. Math. 60(1\u20132), 127\u2013145 (1995). (Linear\/nonlinear iterative methods and verification of solution (Matsuyama, 1993))","journal-title":"J. Comput. Appl. Math."},{"issue":"3, Ser. A","key":"754_CR26","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/BF02592192","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(3, Ser. A), 407\u2013439 (1996)","journal-title":"Math. Program."},{"issue":"1, Ser.A","key":"754_CR27","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/s101070050047","volume":"85","author":"C Kanzow","year":"1999","unstructured":"Kanzow, C., Qi, H.-D.: A QP-free constrained Newton-type method for variational inequality problems. Math. Program. 85(1, Ser. A), 81\u2013106 (1999)","journal-title":"Math. Program."},{"issue":"4","key":"754_CR28","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1287\/ijoc.13.4.294.9734","volume":"13","author":"TS Munson","year":"2001","unstructured":"Munson, T.S., Facchinei, F., Ferris, M.C., Fischer, A., Kanzow, C.: The semismooth algorithm for large scale complementarity problems. INFORMS J. Comput. 13(4), 294\u2013311 (2001)","journal-title":"INFORMS J. Comput."},{"issue":"7\u20138","key":"754_CR29","doi-asserted-by":"publisher","first-page":"1013","DOI":"10.1081\/NFA-100108320","volume":"22","author":"MV Solodov","year":"2001","unstructured":"Solodov, M.V., Svaiter, B.F.: A unified framework for some inexact proximal point algorithms. Numer. Funct. Anal. Optim. 22(7\u20138), 1013\u20131035 (2001)","journal-title":"Numer. Funct. Anal. Optim."},{"issue":"1","key":"754_CR30","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/s10915-017-0624-3","volume":"76","author":"X Xiao","year":"2018","unstructured":"Xiao, X., Li, Y., Wen, Z., Zhang, L.: A regularized semi-smooth Newton method with projection steps for composite convex programs. J. Sci. Comput. 76(1), 364\u2013389 (2018)","journal-title":"J. Sci. Comput."},{"issue":"4","key":"754_CR31","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1137\/S1052623499356344","volume":"11","author":"M Ulbrich","year":"2001","unstructured":"Ulbrich, M.: Nonmonotone trust-region methods for bound-constrained semismooth equations with applications to nonlinear mixed complementarity problems. SIAM J. Optim. 11(4), 889\u2013917 (2001)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"754_CR32","doi-asserted-by":"publisher","first-page":"035007","DOI":"10.1088\/0266-5611\/24\/3\/035007","volume":"24","author":"R Griesse","year":"2008","unstructured":"Griesse, R., Lorenz, D.A.: A semismooth Newton method for Tikhonov functionals with sparsity constraints. Inverse Prob. 24(3), 035007\u201319 (2008)","journal-title":"Inverse Prob."},{"issue":"1","key":"754_CR33","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(1), 298\u2013333 (2014)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"754_CR34","doi-asserted-by":"publisher","first-page":"025005","DOI":"10.1088\/0266-5611\/31\/2\/025005","volume":"31","author":"E Hans","year":"2015","unstructured":"Hans, E., Raasch, T.: Global convergence of damped semismooth Newton methods for $$\\ell _1$$ Tikhonov regularization. Inverse Prob. 31(2), 025005\u201331 (2015)","journal-title":"Inverse Prob."},{"issue":"1\u20132, Ser. A","key":"754_CR35","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1007\/s10107-015-0965-3","volume":"159","author":"RH Byrd","year":"2016","unstructured":"Byrd, R.H., Chin, G.M., Nocedal, J., Oztoprak, F.: A family of second-order methods for convex $$\\ell _1$$-regularized optimization. Math. Program. 159(1\u20132, Ser. A), 435\u2013467 (2016)","journal-title":"Math. Program."},{"key":"754_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, pp. 2358\u20132363 (2013)","DOI":"10.1109\/CDC.2013.6760233"},{"issue":"3","key":"754_CR37","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\u2013backward quasi-Newton methods for nonsmooth optimization problems. Comput. Optim. Appl. 67(3), 443\u2013487 (2017)","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"754_CR38","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/s10589-025-00658-z","volume":"91","author":"H Gfrerer","year":"2025","unstructured":"Gfrerer, H.: On a globally convergent semismooth* Newton method in nonsmooth nonconvex optimization. Comput. Optim. Appl. 91(1), 67\u2013124 (2025)","journal-title":"Comput. Optim. Appl."},{"key":"754_CR39","unstructured":"Milzarek, A.: Numerical methods and second order theory for nonsmooth problems. PhD thesis, Technische Universit\u00e4t M\u00fcnchen (2016)"},{"issue":"3","key":"754_CR40","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(3), 1420\u20131443 (2014)","journal-title":"SIAM J.Optim."},{"issue":"2","key":"754_CR41","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(2), 375\u2013396 (2016)","journal-title":"Math. Program."},{"issue":"1","key":"754_CR42","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(1), 327\u2013358 (2019)","journal-title":"Math. Program."},{"key":"754_CR43","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."},{"issue":"2","key":"754_CR44","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/s10589-020-00243-6","volume":"78","author":"C Kanzow","year":"2021","unstructured":"Kanzow, C., Lechner, T.: Globalized inexact proximal Newton-type methods for nonconvex composite functions. Comput. Optim. Appl. 78(2), 377\u2013410 (2021)","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"754_CR45","doi-asserted-by":"publisher","first-page":"899","DOI":"10.1007\/s10107-022-01797-5","volume":"198","author":"BS Mordukhovich","year":"2023","unstructured":"Mordukhovich, B.S., Yuan, X., Zeng, S., Zhang, J.: A globally convergent proximal Newton-type method in nonsmooth convex optimization. Math. Program. 198(1), 899\u2013936 (2023)","journal-title":"Math. Program."},{"key":"754_CR46","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10589-024-00560-0","volume":"88","author":"R Liu","year":"2024","unstructured":"Liu, R., Pan, S., Wu, Y., Yang, X.: An inexact regularized proximal Newton method for nonconvex and nonsmooth optimization. Comput. Optim. Appl. 88, 1\u201339 (2024)","journal-title":"Comput. Optim. Appl."},{"issue":"3","key":"754_CR47","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1007\/s10589-024-00600-9","volume":"89","author":"S vom Dahl","year":"2024","unstructured":"vom Dahl, S., Kanzow, C.: An inexact regularized proximal Newton method without line search. Comput. Optim. Appl. 89(3), 585\u2013624 (2024)","journal-title":"Comput. Optim. Appl."},{"key":"754_CR48","unstructured":"Pieper, K.: Finite element discretization and efficient numerical solution of elliptic and parabolic sparse control problems. PhD thesis, Technische Universit\u00e4t M\u00fcnchen (2015)"},{"issue":"2","key":"754_CR49","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1051\/m2an\/2015048","volume":"50","author":"K Kunisch","year":"2016","unstructured":"Kunisch, K., Pieper, K., Rund, A.: Time optimal control for a reaction diffusion system arising in cardiac electrophysiology-a monolithic approach. ESAIM Math. Model. Numer. Anal. 50(2), 381\u2013414 (2016)","journal-title":"ESAIM Math. Model. Numer. Anal."},{"issue":"6","key":"754_CR50","doi-asserted-by":"publisher","first-page":"3673","DOI":"10.1137\/15M1020745","volume":"55","author":"A-C Boulanger","year":"2017","unstructured":"Boulanger, A.-C., Trautmann, P.: Sparse optimal control of the KdV-Burgers equation on a bounded domain. SIAM J. Control. Optim. 55(6), 3673\u20133706 (2017)","journal-title":"SIAM J. Control. Optim."},{"issue":"2","key":"754_CR51","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1109\/TMI.2017.2758391","volume":"37","author":"A Rund","year":"2018","unstructured":"Rund, A., Aigner, C.S., Kunisch, K., Stollberger, R.: Magnetic resonance RF pulse design by optimal control with physical constraints. IEEE Trans. Med. Imaging 37(2), 461\u2013472 (2018)","journal-title":"IEEE Trans. Med. Imaging"},{"issue":"4","key":"754_CR52","doi-asserted-by":"publisher","first-page":"2087","DOI":"10.1007\/s11081-020-09523-w","volume":"22","author":"F Mannel","year":"2020","unstructured":"Mannel, F., Rund, A.: A hybrid semismooth quasi-Newton method for nonsmooth optimal control with PDEs. Opt. Eng. 22(4), 2087\u20132125 (2020)","journal-title":"Opt. Eng."},{"key":"754_CR53","unstructured":"Mannel, F., Rund, A.: A hybrid semismooth quasi-Newton method for structured nonsmooth operator equations in Banach spaces. https:\/\/imsc.uni-graz.at\/mannel\/sqn1.pdf (2021)"},{"issue":"1\u20132","key":"754_CR54","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/s10107-024-02110-2","volume":"212","author":"W Ouyang","year":"2025","unstructured":"Ouyang, W., Milzarek, A.: A trust region-type normal map-based semismooth Newton method for nonsmooth nonconvex composite optimization. Math. Program. 212(1\u20132), 389\u2013435 (2025)","journal-title":"Math. Program."},{"key":"754_CR55","unstructured":"Milzarek, A., Qiu, J.: Convergence of a normal map-based prox-SGD method under the KL inequality. arXiv:2305.05828 (2023)"},{"key":"754_CR56","unstructured":"Qiu, J., Li, X., Milzarek, A.: A new random reshuffling method for nonsmooth nonconvex finite-sum optimization. arXiv:2312.01047 (2023)"},{"issue":"1","key":"754_CR57","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/s10107-014-0790-0","volume":"152","author":"Y Nesterov","year":"2015","unstructured":"Nesterov, Y.: Universal gradient methods for convex optimization problems. Math. Program. 152(1), 381\u2013404 (2015)","journal-title":"Math. Program."},{"issue":"2","key":"754_CR58","doi-asserted-by":"publisher","first-page":"2093","DOI":"10.1137\/22M1540934","volume":"34","author":"N Marumo","year":"2024","unstructured":"Marumo, N., Takeda, A.: Parameter-free accelerated gradient descent for nonconvex minimization. SIAM J. Optim. 34(2), 2093\u20132120 (2024)","journal-title":"SIAM J. Optim."},{"key":"754_CR59","first-page":"1","volume":"212","author":"N Marumo","year":"2024","unstructured":"Marumo, N., Takeda, A.: Universal heavy-ball method for nonconvex optimization under H\u00f6lder continuous Hessians. Math. Program. 212, 1\u201329 (2024)","journal-title":"Math. Program."},{"key":"754_CR60","unstructured":"Rockafellar, R.T., Wets, R.J.-B.: Variational Analysis. Grundlehren der Mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences], vol. 317. Springer, Berlin, DE (2009)"},{"key":"754_CR61","unstructured":"Clarke, F.H.: Optimization and Nonsmooth Analysis, 2nd edn. Classics in Applied Mathematics, vol. 5, p. 308. Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA, USA (1990)"},{"key":"754_CR62","doi-asserted-by":"crossref","unstructured":"Ulbrich, M.: Semismooth Newton Methods for Variational Inequalities and Constrained Optimization Problems in Function Spaces. MOS-SIAM Series on Optimization, vol. 11, p. 308. Society for Industrial and Applied Mathematics (SIAM); Mathematical Optimization Society, Philadelphia, PA, USA (2011)","DOI":"10.1137\/1.9781611970692"},{"issue":"2","key":"754_CR63","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/BF02592055","volume":"26","author":"RS Dembo","year":"1983","unstructured":"Dembo, R.S., Steihaug, T.: Truncated-Newton algorithms for large-scale unconstrained optimization. Math. Program. 26(2), 190\u2013212 (1983)","journal-title":"Math. Program."},{"key":"754_CR64","series-title":"Springer Series in Operations Research and Financial Engineering","first-page":"664","volume-title":"Numerical Optimization","author":"J Nocedal","year":"2006","unstructured":"Nocedal, J., Wright, S.J.: Numerical Optimization. Springer Series in Operations Research and Financial Engineering, 2nd edn., p. 664. Springer, New York (2006)","edition":"2"},{"issue":"3","key":"754_CR65","doi-asserted-by":"publisher","first-page":"626","DOI":"10.1137\/0720042","volume":"20","author":"T Steihaug","year":"1983","unstructured":"Steihaug, T.: The conjugate gradient method and trust regions in large scale optimization. SIAM J. Numer. Anal. 20(3), 626\u2013637 (1983)","journal-title":"SIAM J. Numer. Anal."},{"key":"754_CR66","unstructured":"Ouyang, W., Milzarek, A.: A trust region-type normal map-based semismooth Newton method for nonsmooth nonconvex compositie optimization. arXiv.org:2106.09340 (2021)"},{"issue":"2","key":"754_CR67","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1137\/040605266","volume":"16","author":"P-A Absil","year":"2005","unstructured":"Absil, P.-A., Mahony, R., Andrews, B.: Convergence of the iterates of descent methods for analytic cost functions. SIAM J. Optim. 16(2), 531\u2013547 (2005)","journal-title":"SIAM J. Optim."},{"issue":"1\u20132, Ser. B","key":"754_CR68","doi-asserted-by":"publisher","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\u20132, Ser. B), 5\u201316 (2009)","journal-title":"Math. Program."},{"issue":"1\u20132, Ser. A","key":"754_CR69","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\u2013backward splitting, and regularized Gauss\u2013Seidel methods. Math. Program. 137(1\u20132, Ser. A), 91\u2013129 (2013)","journal-title":"Math. Program."},{"issue":"1\u20132, Ser. A","key":"754_CR70","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, Ser. A), 459\u2013494 (2014)","journal-title":"Math. Program."},{"issue":"3","key":"754_CR71","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\u2013backward envelope for the sum of two nonconvex functions: further properties and nonmonotone linesearch algorithms. SIAM J. Optim. 28(3), 2274\u20132303 (2018)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"754_CR72","doi-asserted-by":"publisher","first-page":"3038","DOI":"10.1137\/23M1548293","volume":"33","author":"X Jia","year":"2023","unstructured":"Jia, X., Kanzow, C., Mehlitz, P.: Convergence analysis of the proximal gradient method in the presence of the Kurdyka\u2013\u0141ojasiewicz property without global Lipschitz assumptions. SIAM J. Optim. 33(4), 3038\u20133056 (2023)","journal-title":"SIAM J. Optim."},{"key":"754_CR73","first-page":"87","volume":"117","author":"S \u0141ojasiewicz","year":"1963","unstructured":"\u0141ojasiewicz, S.: Une propri\u00e9t\u00e9 topologique des sous-ensembles analytiques r\u00e9els. Les \u00e9quations aux d\u00e9riv\u00e9es partielles 117, 87\u201389 (1963)","journal-title":"Les \u00e9quations aux d\u00e9riv\u00e9es partielles"},{"key":"754_CR74","doi-asserted-by":"publisher","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 (Grenoble) 43, 1575\u20131595 (1993)","journal-title":"Annales de l\u2019institut Fourier (Grenoble)"},{"key":"754_CR75","doi-asserted-by":"publisher","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, 769\u2013783 (1998)","journal-title":"Annales de L\u2019institut Fourier"},{"issue":"4","key":"754_CR76","doi-asserted-by":"publisher","first-page":"1205","DOI":"10.1137\/050644641","volume":"17","author":"J Bolte","year":"2006","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 (2006)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"754_CR77","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1287\/moor.22.2.301","volume":"22","author":"L Qi","year":"1997","unstructured":"Qi, L., Jiang, H.: Semismooth Karush\u2013Kuhn\u2013Tucker equations and convergence analysis of Newton and quasi-Newton methods for solving these equations. Math. Oper. Res. 22(2), 301\u2013325 (1997)","journal-title":"Math. Oper. Res."},{"key":"754_CR78","unstructured":"Ouyang, W., Milzarek, A.: Variational properties of decomposable functions part II: strong second-order theory. arXiv:2311.07276 (2023)"},{"issue":"1\u20133","key":"754_CR79","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(1\u20133), 129\u2013156 (1994)","journal-title":"Math. Program."},{"issue":"1","key":"754_CR80","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. Imaging Sci. 2(1), 183\u2013202 (2009)","journal-title":"SIAM J. Imaging Sci."},{"issue":"2\u20133","key":"754_CR81","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/s10851-008-0087-0","volume":"31","author":"I Gali\u0107","year":"2008","unstructured":"Gali\u0107, I., Weickert, J., Welk, M., Bruhn, A., Belyaev, A., Seidel, H.-P.: Image compression with anisotropic diffusion. J. Math. Imaging Vis. 31(2\u20133), 255\u2013269 (2008)","journal-title":"J. Math. Imaging Vis."},{"key":"754_CR82","doi-asserted-by":"crossref","unstructured":"Schmaltz, C., Weickert, J., Bruhn, A.: Beating the quality of JPEG 2000 with anisotropic diffusion. In: Joint Pattern Recognition Symposium, pp. 452\u2013461. Springer, Berlin (2009)","DOI":"10.1007\/978-3-642-03798-6_46"},{"key":"754_CR83","unstructured":"Yu, Y.-L.: On decomposing the proximal map. In: Advances in Neural Information Processing Systems, pp. 91\u201399 (2013)"},{"issue":"2","key":"754_CR84","doi-asserted-by":"publisher","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. ImagingSci."},{"issue":"7","key":"754_CR85","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.T.: Sparse reconstruction by separable approximation. IEEE Trans. Signal Process. 57(7), 2479\u20132493 (2009)","journal-title":"IEEE Trans. Signal Process."},{"key":"754_CR86","doi-asserted-by":"crossref","unstructured":"Xu, P., Roosta, F., Mahoney, M.W.: Second-order optimization for non-convex machine learning: An empirical study. In: Proceedings of the 2020 SIAM International Conference on Data Mining, pp. 199\u2013207. SIAM (2020)","DOI":"10.1137\/1.9781611976236.23"},{"issue":"2","key":"754_CR87","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1007\/s10208-021-09516-w","volume":"22","author":"D Davis","year":"2022","unstructured":"Davis, D., Drusvyatskiy, D.: Proximal methods avoid active strict saddles of weakly convex functions. Found. Comput. Math. 22(2), 561\u2013606 (2022)","journal-title":"Found. Comput. Math."},{"key":"754_CR88","unstructured":"Jiang, L.: Saddle avoidance, asymptotic normality, and exponential acceleration in nonsmooth optimization. PhD thesis, Cornell University (2024)"},{"key":"754_CR89","doi-asserted-by":"publisher","first-page":"409","DOI":"10.6028\/jres.049.044","volume":"49","author":"MR Hestenes","year":"1952","unstructured":"Hestenes, M.R., Stiefel, E.: Methods of conjugate gradients for solving linear systems. J. Res. Nat. Bur. Stand. 49, 409\u2013436 (1952)","journal-title":"J. Res. Nat. Bur. Stand."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-025-00754-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-025-00754-0","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-025-00754-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T16:02:31Z","timestamp":1777996951000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-025-00754-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2,13]]},"references-count":89,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,5]]}},"alternative-id":["754"],"URL":"https:\/\/doi.org\/10.1007\/s10589-025-00754-0","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,2,13]]},"assertion":[{"value":"28 December 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 December 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 February 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}