{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T00:21:21Z","timestamp":1778113281588,"version":"3.51.4"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,8,16]],"date-time":"2023-08-16T00:00:00Z","timestamp":1692144000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,8,16]],"date-time":"2023-08-16T00:00:00Z","timestamp":1692144000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100020618","name":"Universit\u00e4t Bayreuth","doi-asserted-by":"crossref","id":[{"id":"10.13039\/100020618","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2024,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We consider proximal Newton methods with an inexact computation of update steps. To this end, we introduce two inexactness criteria which characterize sufficient accuracy of these update step and with the aid of these investigate global convergence and local acceleration of our method. The inexactness criteria are designed to be adequate for the Hilbert space framework we find ourselves in while traditional inexactness criteria from smooth Newton or finite dimensional proximal Newton methods appear to be inefficient in this scenario. The performance of the method and its gain in effectiveness in contrast to the exact case are showcased considering a simple model problem in function space.\n<\/jats:p>","DOI":"10.1007\/s10589-023-00515-x","type":"journal-article","created":{"date-parts":[[2023,8,16]],"date-time":"2023-08-16T02:01:41Z","timestamp":1692151301000},"page":"1-37","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Inexact proximal Newton methods in Hilbert spaces"],"prefix":"10.1007","volume":"87","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3578-6424","authenticated-orcid":false,"given":"Bastian","family":"P\u00f6tzl","sequence":"first","affiliation":[]},{"given":"Anton","family":"Schiela","sequence":"additional","affiliation":[]},{"given":"Patrick","family":"Jaap","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,8,16]]},"reference":[{"issue":"1","key":"515_CR1","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/j.cam.2005.12.030","volume":"200","author":"HB An","year":"2007","unstructured":"An, H.B., Mo, Z.Y., Liu, X.P.: A choice of forcing terms in inexact newton method. J. Comput. Appl. Math. 200(1), 47\u201360 (2007). https:\/\/doi.org\/10.1016\/j.cam.2005.12.030","journal-title":"J. Comput. Appl. Math."},{"key":"515_CR2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974997","author":"A Beck","year":"2017","unstructured":"Beck, A.: First-order methods in optimization. Soc. Ind. Appl. Math. (2017). https:\/\/doi.org\/10.1137\/1.9781611974997","journal-title":"Soc. Ind. Appl. Math."},{"issue":"2","key":"515_CR3","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/s10107-015-0941-y","volume":"157","author":"RH Byrd","year":"2015","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 (2015). https:\/\/doi.org\/10.1007\/s10107-015-0941-y","journal-title":"Math. Program."},{"key":"515_CR4","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719857","author":"AR Conn","year":"2000","unstructured":"Conn, A.R., Gould, N.I.M., Toint, P.L.: Trust region methods. Soc. Ind. Appl. Math. (2000). https:\/\/doi.org\/10.1137\/1.9780898719857","journal-title":"Soc. Ind. Appl. Math."},{"issue":"2","key":"515_CR5","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1137\/0719025","volume":"19","author":"RS Dembo","year":"1982","unstructured":"Dembo, R.S., Eisenstat, S.C., Steihaug, T.: Inexact Newton methods. SIAM J. Num. Anal. 19(2), 400\u2013408 (1982). https:\/\/doi.org\/10.1137\/0719025","journal-title":"SIAM J. Num. Anal."},{"key":"515_CR6","unstructured":"Deuflhard, P.: Newton methods for nonlinear problems. Affine invariance and adaptive algorithms, Series Computational Mathematics, vol.\u00a035, $$2^{\\text{nd}}$$ edn. Springer (2006)"},{"issue":"1","key":"515_CR7","doi-asserted-by":"publisher","first-page":"454","DOI":"10.1093\/imanum\/dry073","volume":"39","author":"C Gr\u00e4ser","year":"2018","unstructured":"Gr\u00e4ser, C., Sander, O.: Truncated nonsmooth newton multigrid methods for block-separable minimization problems. IMA J. Num. Anal. 39(1), 454\u2013481 (2018). https:\/\/doi.org\/10.1093\/imanum\/dry073","journal-title":"IMA J. Num. Anal."},{"issue":"3","key":"515_CR8","doi-asserted-by":"publisher","first-page":"865","DOI":"10.1137\/s1052623401383558","volume":"13","author":"M Hinterm\u00fcller","year":"2002","unstructured":"Hinterm\u00fcller, M., Ito, K., Kunisch, K.: The primal-dual active set strategy as a semismooth newton method. SIAM J. Optim. 13(3), 865\u2013888 (2002). https:\/\/doi.org\/10.1137\/s1052623401383558","journal-title":"SIAM J. Optim."},{"key":"515_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-020-00243-6","author":"C Kanzow","year":"2020","unstructured":"Kanzow, C., Lechner, T.: Globalized inexact proximal newton-type methods for nonconvex composite functions. Comput. Optim. Appl. (2020). https:\/\/doi.org\/10.1007\/s10589-020-00243-6","journal-title":"Comput. Optim. Appl."},{"key":"515_CR10","doi-asserted-by":"publisher","unstructured":"pei Lee, C., Wright, S.J.: Inexact successive quadratic approximation for regularized optimization. Comput. Optim. Appl. 72(3), 641\u2013674 (2019). https:\/\/doi.org\/10.1007\/s10589-019-00059-z","DOI":"10.1007\/s10589-019-00059-z"},{"issue":"3","key":"515_CR11","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). https:\/\/doi.org\/10.1137\/130921428","journal-title":"SIAM J. Optim."},{"issue":"1","key":"515_CR12","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/s00186-016-0566-9","volume":"85","author":"J Li","year":"2016","unstructured":"Li, J., Andersen, M.S., Vandenberghe, L.: Inexact proximal newton methods for self-concordant functions. Math. Meth. Oper. Res. 85(1), 19\u201341 (2016). https:\/\/doi.org\/10.1007\/s00186-016-0566-9","journal-title":"Math. Meth. Oper. Res."},{"issue":"6","key":"515_CR13","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1137\/0315061","journal-title":"SIAM J. Control Optim."},{"key":"515_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-022-01797-5","author":"BS Mordukhovich","year":"2022","unstructured":"Mordukhovich, B.S., Yuan, X., Zeng, S., Zhang, J.: A globally convergent proximal newton-type method in nonsmooth convex optimization. Math. Program. (2022). https:\/\/doi.org\/10.1007\/s10107-022-01797-5","journal-title":"Math. Program."},{"issue":"2","key":"515_CR15","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/s10589-022-00369-9","volume":"82","author":"B Pt\u00f6zl","year":"2022","unstructured":"Pt\u00f6zl, B., Schiela, A., Jaap, P.: Second order semi-smooth proximal newton methods in Hilbert spaces. Comput. Optim. Appl. 82(2), 465\u2013498 (2022). https:\/\/doi.org\/10.1007\/s10589-022-00369-9","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"515_CR16","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). https:\/\/doi.org\/10.1287\/moor.18.1.227","journal-title":"Math. Oper. Res."},{"issue":"1\u20133","key":"515_CR17","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(1\u20133), 353\u2013367 (1993). https:\/\/doi.org\/10.1007\/bf01581275","journal-title":"Math. Program."},{"issue":"1\u20132","key":"515_CR18","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(1\u20132), 495\u2013529 (2016). https:\/\/doi.org\/10.1007\/s10107-016-0997-3","journal-title":"Math. Program."},{"issue":"3","key":"515_CR19","doi-asserted-by":"publisher","first-page":"1417","DOI":"10.1137\/060674375","volume":"19","author":"A Schiela","year":"2008","unstructured":"Schiela, A.: A simplified approach to semismooth Newton methods in function space. SIAM J. Optim. 19(3), 1417\u20131432 (2008). https:\/\/doi.org\/10.1137\/060674375","journal-title":"SIAM J. Optim."},{"key":"515_CR20","unstructured":"Ulbrich, M.: Nonsmooth newton-like methods for variational inequalities and constrained optimization problems in function spaces. Habilitation Thesis (2002)"},{"key":"515_CR21","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970692","author":"M Ulbrich","year":"2011","unstructured":"Ulbrich, M.: Semismooth Newton methods for variational inequalities and constrained optimization problems in function spaces. Soc. Ind. Appl. Math. (2011). https:\/\/doi.org\/10.1137\/1.9781611970692","journal-title":"Soc. Ind. Appl. Math."},{"key":"515_CR22","doi-asserted-by":"publisher","unstructured":"Walther, A., Griewank, A.: Getting started with ADOL-c. In: Combinatorial Scientific Computing, pp. 181\u2013202. Chapman and Hall\/CRC (2012). https:\/\/doi.org\/10.1201\/b11644-8","DOI":"10.1201\/b11644-8"},{"issue":"3","key":"515_CR23","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1080\/10556780600605129","volume":"22","author":"M Weiser","year":"2007","unstructured":"Weiser, M., Deuflhard, P., Erdmann, B.: Affine conjugate adaptive newton methods for nonlinear elastomechanics. Optim. Meth. Softw. 22(3), 413\u2013431 (2007). https:\/\/doi.org\/10.1080\/10556780600605129","journal-title":"Optim. Meth. Softw."},{"issue":"1\u20132","key":"515_CR24","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/s10107-018-1280-6","volume":"174","author":"MC Yue","year":"2018","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\u2013tseng error bound property. Mathematical Programming 174(1\u20132), 327\u2013358 (2018). https:\/\/doi.org\/10.1007\/s10107-018-1280-6","journal-title":"Mathematical Programming"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-023-00515-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-023-00515-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-023-00515-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,4]],"date-time":"2024-01-04T12:06:45Z","timestamp":1704370005000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-023-00515-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,16]]},"references-count":24,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,1]]}},"alternative-id":["515"],"URL":"https:\/\/doi.org\/10.1007\/s10589-023-00515-x","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,8,16]]},"assertion":[{"value":"23 September 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 July 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 August 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"All authors certify that they have no affiliations with or involvement in any organization or entity with any financial interest or non-financial interest in the subject matter or materials discussed in this manuscript.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}