{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,14]],"date-time":"2026-02-14T00:12:31Z","timestamp":1771027951345,"version":"3.50.1"},"reference-count":106,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2024,7,22]],"date-time":"2024-07-22T00:00:00Z","timestamp":1721606400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,7,22]],"date-time":"2024-07-22T00:00:00Z","timestamp":1721606400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Fundamental Research Fund - Shenzhen Research Institute of Big Data","award":["Startup Fund JCYJ-AM20190601"],"award-info":[{"award-number":["Startup Fund JCYJ-AM20190601"]}]},{"name":"Shenzhen Institute of Artificial Intelligence and Robotics for Society","award":["Internal project INT002"],"award-info":[{"award-number":["Internal project INT002"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2025,7]]},"DOI":"10.1007\/s10107-024-02110-2","type":"journal-article","created":{"date-parts":[[2024,7,22]],"date-time":"2024-07-22T09:01:54Z","timestamp":1721638914000},"page":"389-435","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A trust region-type normal map-based semismooth Newton method for nonsmooth nonconvex composite optimization"],"prefix":"10.1007","volume":"212","author":[{"given":"Wenqing","family":"Ouyang","sequence":"first","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":[[2024,7,22]]},"reference":[{"issue":"1","key":"2110_CR1","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-Stat. Methodol. 58(1), 267\u2013288 (1996)","journal-title":"J. R. Stat. Soc. Ser. B-Stat. Methodol."},{"issue":"17","key":"2110_CR2","doi-asserted-by":"crossref","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":"2110_CR3","doi-asserted-by":"crossref","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":"2110_CR4","doi-asserted-by":"crossref","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":"2110_CR5","doi-asserted-by":"crossref","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(1), 49\u201367 (2006)","journal-title":"J. R. Stat. Soc. Ser. B-Stat. Methodol."},{"issue":"1","key":"2110_CR6","doi-asserted-by":"crossref","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(1), 53\u201371 (2008)","journal-title":"J. R. Stat. Soc. Ser. B-Stat. Methodol."},{"key":"2110_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, New York, NY, USA, pp. 689\u2013696 (2009)","DOI":"10.1145\/1553374.1553463"},{"key":"2110_CR8","doi-asserted-by":"crossref","unstructured":"Bach, F., Jenatton, R., Mairal, J., Obozinski, G.: Optimization with sparsity-inducing penalties. Found. Trends\u00ae Mach. Learn. 4(1), 1\u2013106 (2011)","DOI":"10.1561\/2200000015"},{"issue":"6","key":"2110_CR9","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 (2009)","journal-title":"Found. Comput. Math."},{"issue":"4","key":"2110_CR10","doi-asserted-by":"crossref","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":"2110_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":"2110_CR12","doi-asserted-by":"crossref","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":"2110_CR13","doi-asserted-by":"crossref","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":"2110_CR14","doi-asserted-by":"crossref","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":"2110_CR15","doi-asserted-by":"crossref","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":"2110_CR16","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":"2110_CR17","doi-asserted-by":"crossref","unstructured":"Parikh, N., Boyd, S.: Proximal algorithms. Found. Trends\u00ae Optim. 1(3), 127\u2013239 (2014)","DOI":"10.1561\/2400000003"},{"key":"2110_CR18","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. Bull. Soc. Math. FR. 93, 273\u2013299 (1965)","journal-title":"Bull. Soc. Math. FR."},{"issue":"3","key":"2110_CR19","doi-asserted-by":"crossref","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":"2110_CR20","volume-title":"Finite-dimensional Variational Inequalities and Complementarity Problems. Springer Series in Operations Research","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)"},{"key":"2110_CR21","unstructured":"Rockafellar, R.T.: Convex Analysis. Princeton Mathematical Series, No. 28, p. 451. Princeton University Press, Princeton, NJ, USA (1970)"},{"issue":"3, Ser. A","key":"2110_CR22","doi-asserted-by":"crossref","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":"2110_CR23","doi-asserted-by":"crossref","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":"2110_CR24","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":"2110_CR25","doi-asserted-by":"crossref","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\u2014a monolithic approach. ESAIM Math. Model. Numer. Anal. 50(2), 381\u2013414 (2016)","journal-title":"ESAIM Math. Model. Numer. Anal."},{"issue":"6","key":"2110_CR26","doi-asserted-by":"crossref","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\u2013Burgers equation on a bounded domain. SIAM J. Control Optim. 55(6), 3673\u20133706 (2017)","journal-title":"SIAM J. Control Optim."},{"issue":"2","key":"2110_CR27","doi-asserted-by":"crossref","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":"2110_CR28","doi-asserted-by":"crossref","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":"2110_CR29","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":"6","key":"2110_CR30","doi-asserted-by":"crossref","first-page":"959","DOI":"10.1137\/0315061","volume":"15","author":"R Mifflin","year":"1977","unstructured":"Mifflin, R.: Semismooth and semiconvex functions in constrained optimization. SIAM J. Control Optim. 15(6), 959\u2013972 (1977)","journal-title":"SIAM J. Control Optim."},{"key":"2110_CR31","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 Academic Publishers, Dordrecht, NL (1999)","DOI":"10.1007\/978-1-4613-3285-5_7"},{"issue":"3","key":"2110_CR32","doi-asserted-by":"crossref","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."},{"key":"2110_CR33","doi-asserted-by":"crossref","unstructured":"Mart\u00ednez, J.M., Qi, L.Q.: Inexact Newton methods for solving nonsmooth equations. vol. 60(1-2), pp. 127\u2013145 (1995). Linear\/nonlinear iterative methods and verification of solution (Matsuyama, 1993)","DOI":"10.1016\/0377-0427(94)00088-I"},{"issue":"3, Ser. A","key":"2110_CR34","doi-asserted-by":"crossref","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":"3, Ser. A","key":"2110_CR35","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1007\/s101070050101","volume":"86","author":"M Ferris","year":"1999","unstructured":"Ferris, M., Kanzow, C., Munson, T.S.: Feasible descent algorithms for mixed complementarity problems. Math. Program. 86(3, Ser. A), 475\u2013497 (1999)","journal-title":"Math. Program."},{"issue":"1, Ser. A","key":"2110_CR36","doi-asserted-by":"crossref","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":"2110_CR37","doi-asserted-by":"crossref","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":"2110_CR38","doi-asserted-by":"crossref","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":"2110_CR39","doi-asserted-by":"crossref","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":"2110_CR40","doi-asserted-by":"crossref","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":"2110_CR41","doi-asserted-by":"crossref","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 Probl. 24(3), 035007\u201319 (2008)","journal-title":"Inverse Probl."},{"issue":"1","key":"2110_CR42","doi-asserted-by":"crossref","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":"2110_CR43","doi-asserted-by":"crossref","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 Probl. 31(2), 025005\u201331 (2015)","journal-title":"Inverse Probl."},{"issue":"1\u20132, Ser. A","key":"2110_CR44","doi-asserted-by":"crossref","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":"2110_CR45","unstructured":"Milzarek, A.: Numerical methods and second order theory for nonsmooth problems. PhD thesis, Technische Universit\u00e4t M\u00fcnchen (2016)"},{"key":"2110_CR46","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"},{"key":"2110_CR47","doi-asserted-by":"crossref","unstructured":"Patrinos, P., Stella, L., Bemporad, A.: Forward\u2013backward truncated Newton methods for convex composite optimization. arXiv:1402.6655 (2014)","DOI":"10.1109\/CDC.2013.6760233"},{"issue":"3","key":"2110_CR48","doi-asserted-by":"crossref","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)","journal-title":"Comput. Optim. Appl."},{"issue":"2","key":"2110_CR49","doi-asserted-by":"crossref","first-page":"352","DOI":"10.1287\/moor.19.2.352","volume":"19","author":"D Ralph","year":"1994","unstructured":"Ralph, D.: Global convergence of damped Newton\u2019s method for nonsmooth equations via the path search. Math. Oper. Res. 19(2), 352\u2013389 (1994)","journal-title":"Math. Oper. Res."},{"issue":"2","key":"2110_CR50","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1080\/10556789508805606","volume":"5","author":"SP Dirkse","year":"1995","unstructured":"Dirkse, S.P., Ferris, M.C.: The path solver: a nonmonotone stabilization scheme for mixed complementarity problems. Optim. Method Softw. 5(2), 123\u2013156 (1995)","journal-title":"Optim. Method Softw."},{"key":"2110_CR51","doi-asserted-by":"crossref","unstructured":"Ferris, M.C., Ralph, D.: Projected gradient methods for nonlinear complementarity problems via normal maps. In: Recent Advances in Nonsmooth Optimization, pp. 57\u201387. World Sci. Publ., River Edge, NJ, USA (1995)","DOI":"10.1142\/9789812812827_0005"},{"issue":"3","key":"2110_CR52","doi-asserted-by":"crossref","first-page":"659","DOI":"10.1023\/A:1022653001160","volume":"94","author":"J Han","year":"1997","unstructured":"Han, J., Sun, D.: Newton and quasi-Newton methods for normal maps with polyhedral sets. J. Optim. Theory Appl. 94(3), 659\u2013676 (1997)","journal-title":"J. Optim. Theory Appl."},{"issue":"2","key":"2110_CR53","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1023\/B:JOTA.0000005450.58251.6d","volume":"119","author":"G Zhou","year":"2003","unstructured":"Zhou, G., Toh, K.C., Sun, D.: Globally and quadratically convergent algorithm for minimizing the sum of Euclidean norms. J. Optim. Theory Appl. 119(2), 357\u2013377 (2003)","journal-title":"J. Optim. Theory Appl."},{"issue":"4","key":"2110_CR54","doi-asserted-by":"crossref","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(4), 2445\u20132481 (2019)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"2110_CR55","doi-asserted-by":"crossref","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":"4","key":"2110_CR56","doi-asserted-by":"crossref","first-page":"1737","DOI":"10.1137\/080718206","volume":"20","author":"X-Y Zhao","year":"2010","unstructured":"Zhao, X.-Y., Sun, D., Toh, K.-C.: A Newton-CG augmented Lagrangian method for semidefinite programming. SIAM J. Optim. 20(4), 1737\u20131765 (2010)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"2110_CR57","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/s12532-014-0069-8","volume":"6","author":"K Jiang","year":"2014","unstructured":"Jiang, K., Sun, D., Toh, K.-C.: A partial proximal point algorithm for nuclear norm regularized matrix least squares problems. Math. Program. Comput. 6(3), 281\u2013325 (2014)","journal-title":"Math. Program. Comput."},{"issue":"3","key":"2110_CR58","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/s12532-015-0082-6","volume":"7","author":"L Yang","year":"2015","unstructured":"Yang, L., Sun, D., Toh, K.-C.: $${\\rm SDPNAL}+$$: a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints. Math. Program. Comput. 7(3), 331\u2013366 (2015)","journal-title":"Math. Program. Comput."},{"issue":"1\u20132, Ser. A","key":"2110_CR59","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1007\/s10107-014-0853-2","volume":"155","author":"C Chen","year":"2016","unstructured":"Chen, C., Liu, Y.-J., Sun, D., Toh, K.-C.: A semismooth Newton-CG based dual PPA for matrix spectral norm approximation problems. Math. Program. 155(1\u20132, Ser. A), 435\u2013470 (2016)","journal-title":"Math. Program."},{"issue":"1","key":"2110_CR60","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1137\/16M1097572","volume":"28","author":"X Li","year":"2018","unstructured":"Li, X., Sun, D., Toh, K.-C.: A highly efficient semismooth Newton augmented Lagrangian method for solving lasso problems. SIAM J. Optim. 28(1), 433\u2013458 (2018)","journal-title":"SIAM J. Optim."},{"issue":"3, Ser. A","key":"2110_CR61","first-page":"319","volume":"68","author":"JE Dennis Jr","year":"1995","unstructured":"Dennis, J.E., Jr., Li, S.-B.B., Tapia, R.A.: A unified approach to global convergence of trust region methods for nonsmooth optimization. Math. Program. 68(3, Ser. A), 319\u2013346 (1995)","journal-title":"Math. Program."},{"issue":"1, Ser. A","key":"2110_CR62","first-page":"25","volume":"66","author":"LQ Qi","year":"1994","unstructured":"Qi, L.Q., Sun, J.: A trust region algorithm for minimization of locally Lipschitzian functions. Math. Program. 66(1, Ser. A), 25\u201343 (1994)","journal-title":"Math. Program."},{"issue":"3\u20134","key":"2110_CR63","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1007\/s11228-010-0159-3","volume":"18","author":"D Noll","year":"2010","unstructured":"Noll, D.: Cutting plane oracles to minimize non-smooth non-convex functions. Set-Valued Var. Anal. 18(3\u20134), 531\u2013568 (2010)","journal-title":"Set-Valued Var. Anal."},{"issue":"3","key":"2110_CR64","doi-asserted-by":"crossref","first-page":"2163","DOI":"10.1137\/18M1164925","volume":"30","author":"C Christof","year":"2020","unstructured":"Christof, C., De los Reyes, J.C., Meyer, C.: A nonsmooth trust-region method for locally Lipschitz functions with application to optimization problems constrained by variational inequalities. SIAM J. Optim. 30(3), 2163\u20132196 (2020)","journal-title":"SIAM J. Optim."},{"key":"2110_CR65","unstructured":"Chen, Z., Milzarek, A., Wen, Z.: A trust-region method for nonsmooth nonconvex optimization. arXiv:2002.08513 (2020)"},{"key":"2110_CR66","volume-title":"Variational Analysis. Grundlehren der Mathematischen Wissenschaften","author":"RT Rockafellar","year":"2009","unstructured":"Rockafellar, R.T., Wets, R.J.-B.: Variational Analysis. Grundlehren der Mathematischen Wissenschaften, vol. 317. Springer, Berlin (2009)"},{"key":"2110_CR67","first-page":"308","volume-title":"Optimization and Nonsmooth Analysis. Classics in Applied Mathematics. Society for Industrial and Applied Mathematics","author":"FH Clarke","year":"1990","unstructured":"Clarke, F.H.: Optimization and Nonsmooth Analysis. Classics in Applied Mathematics. Society for Industrial and Applied Mathematics, vol. 5, 2nd edn., p. 308. SIAM, Philadelphia (1990)","edition":"2"},{"key":"2110_CR68","first-page":"468","volume-title":"Convex Analysis and Monotone Operator Theory in Hilbert Spaces. CMS Books in Mathematics\/Ouvrages de Math\u00e9matiques de la SMC","author":"HH Bauschke","year":"2011","unstructured":"Bauschke, H.H., Combettes, P.L.: Convex Analysis and Monotone Operator Theory in Hilbert Spaces. CMS Books in Mathematics\/Ouvrages de Math\u00e9matiques de la SMC, p. 468. Springer, New York (2011)"},{"key":"2110_CR69","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\u20133, Ser. B","key":"2110_CR70","doi-asserted-by":"crossref","first-page":"561","DOI":"10.1007\/s10107-005-0629-9","volume":"104","author":"F Meng","year":"2005","unstructured":"Meng, F., Sun, D., Zhao, G.: Semismoothness of solutions to generalized equations and the Moreau-Yosida regularization. Math. Program. 104(2\u20133, Ser. B), 561\u2013581 (2005)","journal-title":"Math. Program."},{"issue":"3","key":"2110_CR71","doi-asserted-by":"crossref","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":"2110_CR72","first-page":"664","volume-title":"Numerical Optimization. Springer Series in Operations Research and Financial Engineering","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":"2110_CR73","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/BF02591998","volume":"29","author":"MJD Powell","year":"1984","unstructured":"Powell, M.J.D.: On the global convergence of trust region algorithms for unconstrained minimization. Math. Program. 29(3), 297\u2013303 (1984)","journal-title":"Math. Program."},{"issue":"2","key":"2110_CR74","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1007\/BF02591750","volume":"31","author":"Y Yuan","year":"1985","unstructured":"Yuan, Y.: Conditions for convergence of trust region algorithms for nonsmooth optimization. Math. Program. 31(2), 220\u2013228 (1985)","journal-title":"Math. Program."},{"issue":"1","key":"2110_CR75","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1093\/imanum\/drp021","volume":"30","author":"MJD Powell","year":"2010","unstructured":"Powell, M.J.D.: On the convergence of a wide range of trust region methods for unconstrained optimization. IMA J. Numer. Anal. 30(1), 289\u2013301 (2010)","journal-title":"IMA J. Numer. Anal."},{"issue":"1\u20132, Ser. A","key":"2110_CR76","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1007\/s10107-014-0794-9","volume":"152","author":"GN Grapiglia","year":"2015","unstructured":"Grapiglia, G.N., Yuan, J., Yuan, Y.-x: On the convergence and worst-case complexity of trust-region and regularization methods for unconstrained optimization. Math. Program. 152(1\u20132, Ser. A), 491\u2013520 (2015)","journal-title":"Math. Program."},{"key":"2110_CR77","doi-asserted-by":"crossref","unstructured":"Conn, A.R., Gould, N.I.M., Toint, P.L.: Trust-region Methods. MPS\/SIAM Series on Optimization, p. 959. Society for Industrial and Applied Mathematics (SIAM); Mathematical Programming Society (MPS), Philadelphia, PA, USA (2000)","DOI":"10.1137\/1.9780898719857"},{"issue":"1\u20132, Ser. B","key":"2110_CR78","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\u20132, Ser. B), 5\u201316 (2009)","journal-title":"Math. Program."},{"issue":"1\u20132, Ser. A","key":"2110_CR79","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-Seidel methods. Math. Program. 137(1\u20132, Ser. A), 91\u2013129 (2013)","journal-title":"Math. Program."},{"issue":"1\u20132, Ser. A","key":"2110_CR80","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\u20132, Ser. A), 459\u2013494 (2014)","journal-title":"Math. Program."},{"issue":"3","key":"2110_CR81","doi-asserted-by":"crossref","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)","journal-title":"SIAM J. Optim."},{"key":"2110_CR82","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":"2110_CR83","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 (Grenoble) 43, 1575\u20131595 (1993)","journal-title":"Annales de l\u2019institut Fourier (Grenoble)"},{"key":"2110_CR84","doi-asserted-by":"crossref","unstructured":"Kurdyka, K.: On gradients of functions definable in o-minimal structures. In: Annales de L\u2019institut Fourier, vol. 48, pp. 769\u2013783 (1998)","DOI":"10.5802\/aif.1638"},{"issue":"4","key":"2110_CR85","doi-asserted-by":"crossref","first-page":"1205","DOI":"10.1137\/050644641","volume":"17","author":"J Bolte","year":"2006","unstructured":"Bolte, J., Daniilidis, A., Lewis, A.: The \u0142ojasiewicz 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":"2110_CR86","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-\u0141ojasiewicz inequality. Math. Oper. Res. 35(2), 438\u2013457 (2010)","journal-title":"Math. Oper. Res."},{"issue":"4","key":"2110_CR87","doi-asserted-by":"crossref","first-page":"1171","DOI":"10.1007\/s10208-021-09528-6","volume":"22","author":"P Yu","year":"2021","unstructured":"Yu, P., Li, G., Pong, T.K.: Kurdyka\u2013\u0141ojasiewicz exponent via inf-projection. Found. Comput. Math. 22(4), 1171\u20131217 (2021)","journal-title":"Found. Comput. Math."},{"issue":"2","key":"2110_CR88","doi-asserted-by":"crossref","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."},{"key":"2110_CR89","doi-asserted-by":"crossref","unstructured":"Noll, D., Rondepierre, A.: Convergence of linesearch and trust-region methods using the Kurdyka\u2013\u0141ojasiewicz inequality. In: Computational and Analytical Mathematics. Springer Proc. Math. Stat., vol. 50, pp. 593\u2013611. Springer, New York, NY, USA (2013)","DOI":"10.1007\/978-1-4614-7621-4_27"},{"key":"2110_CR90","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":"1\u20133","key":"2110_CR91","doi-asserted-by":"crossref","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":"3","key":"2110_CR92","doi-asserted-by":"crossref","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":"1","key":"2110_CR93","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":"2\u20133","key":"2110_CR94","doi-asserted-by":"crossref","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":"2110_CR95","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, DE (2009)","DOI":"10.1007\/978-3-642-03798-6_46"},{"issue":"9","key":"2110_CR96","doi-asserted-by":"crossref","first-page":"1859","DOI":"10.1016\/j.patcog.2010.08.004","volume":"44","author":"M Mainberger","year":"2011","unstructured":"Mainberger, M., Bruhn, A., Weickert, J., Forchhammer, S.: Edge-based compression of cartoon-like images with homogeneous diffusion. Pattern Recognit. 44(9), 1859\u20131873 (2011)","journal-title":"Pattern Recognit."},{"issue":"2","key":"2110_CR97","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."},{"key":"2110_CR98","unstructured":"Yu, Y.-L.: On decomposing the proximal map. In: Advances in Neural Information Processing Systems, pp. 91\u201399 (2013)"},{"issue":"7","key":"2110_CR99","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.T.: Sparse reconstruction by separable approximation. IEEE Trans. Signal Process. 57(7), 2479\u20132493 (2009)","journal-title":"IEEE Trans. Signal Process."},{"issue":"4","key":"2110_CR100","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":"4","key":"2110_CR101","doi-asserted-by":"crossref","first-page":"1043","DOI":"10.1137\/S1052623403428208","volume":"14","author":"H Zhang","year":"2004","unstructured":"Zhang, H., Hager, W.W.: A nonmonotone line search technique and its application to unconstrained optimization. SIAM J. Optim. 14(4), 1043\u20131056 (2004)","journal-title":"SIAM J. Optim."},{"key":"2110_CR102","doi-asserted-by":"crossref","unstructured":"Lau, C.W.K., Nair, C., Yao, C.: Uniqueness of local maximizers for some non-convex log-determinant optimization problems using information theory. In: 2022 IEEE Int. Symposium on Inf. Theory (ISIT), pp. 432\u2013437 (2022)","DOI":"10.1109\/ISIT50566.2022.9834787"},{"issue":"4","key":"2110_CR103","doi-asserted-by":"crossref","first-page":"2087","DOI":"10.1109\/TIT.2014.2304457","volume":"60","author":"Y Geng","year":"2014","unstructured":"Geng, Y., Nair, C.: The capacity region of the two-receiver gaussian vector broadcast channel with private and common messages. IEEE Trans. Inf. Theory 60(4), 2087\u20132104 (2014)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"2110_CR104","unstructured":"Han, I., Malioutov, D., Shin, J.: Large-scale log-determinant computation through stochastic chebyshev expansions. In: International Conference on Machine Learning, pp. 908\u2013917 (2015). PMLR"},{"issue":"1","key":"2110_CR105","doi-asserted-by":"crossref","first-page":"630","DOI":"10.1137\/18M1222235","volume":"30","author":"C Ding","year":"2020","unstructured":"Ding, C., Sun, D., Sun, J., Toh, K.-C.: Spectral operators of matrices: semismoothness and characterizations of the generalized Jacobian. SIAM J. Optim. 30(1), 630\u2013659 (2020)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"2110_CR106","doi-asserted-by":"crossref","first-page":"761","DOI":"10.1287\/moor.1060.0195","volume":"31","author":"D Sun","year":"2006","unstructured":"Sun, D.: The strong second-order sufficient condition and constraint nondegeneracy in nonlinear semidefinite programming and their implications. Math. Oper. Res. 31(4), 761\u2013776 (2006)","journal-title":"Math. Oper. Res."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-024-02110-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-024-02110-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-024-02110-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:03:11Z","timestamp":1750176191000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-024-02110-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,22]]},"references-count":106,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2025,7]]}},"alternative-id":["2110"],"URL":"https:\/\/doi.org\/10.1007\/s10107-024-02110-2","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,7,22]]},"assertion":[{"value":"5 December 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 June 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 July 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}