{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T16:38:51Z","timestamp":1777567131123,"version":"3.51.4"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,8,30]],"date-time":"2022-08-30T00:00:00Z","timestamp":1661817600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,8,30]],"date-time":"2022-08-30T00:00:00Z","timestamp":1661817600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"ANR","award":["ANR-19-CE23-0008"],"award-info":[{"award-number":["ANR-19-CE23-0008"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2023,6]]},"DOI":"10.1007\/s10107-022-01873-w","type":"journal-article","created":{"date-parts":[[2022,8,30]],"date-time":"2022-08-30T19:03:41Z","timestamp":1661886221000},"page":"37-70","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Newton acceleration on manifolds identified by proximal gradient methods"],"prefix":"10.1007","volume":"200","author":[{"given":"Gilles","family":"Bareilles","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2537-380X","authenticated-orcid":false,"given":"Franck","family":"Iutzeler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00e9r\u00f4me","family":"Malick","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,8,30]]},"reference":[{"issue":"3","key":"1873_CR1","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/s10208-005-0179-9","volume":"7","author":"PA Absil","year":"2007","unstructured":"Absil, P.A., Baker, C.G., Gallivan, K.A.: Trust-region methods on riemannian manifolds. Found. Comput. Math. 7(3), 303\u2013330 (2007)","journal-title":"Found. Comput. Math."},{"key":"1873_CR2","volume-title":"Optimization algorithms on matrix manifolds","author":"PA Absil","year":"2009","unstructured":"Absil, P.A., Mahony, R., Sepulchre, R.: Optimization algorithms on matrix manifolds. Princeton University Press, NJ (2009)"},{"key":"1873_CR3","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1137\/100802529","volume":"22","author":"PA Absil","year":"2012","unstructured":"Absil, P.A., Malick, J.: Projection-like retractions on matrix manifolds. SIAM J. Optim. 22, 135\u2013158 (2012)","journal-title":"SIAM J. Optim."},{"key":"1873_CR4","doi-asserted-by":"crossref","unstructured":"Agarwal, N., Boumal, N., Bullins, B., Cartis, C.: Adaptive regularization with cubics on manifolds. Mathematical Programming (2020)","DOI":"10.1007\/s10107-020-01505-1"},{"issue":"2","key":"1873_CR5","doi-asserted-by":"publisher","first-page":"900","DOI":"10.1137\/21M1409536","volume":"32","author":"AY Aravkin","year":"2022","unstructured":"Aravkin, A.Y., Baraldi, R., Orban, D.: A proximal quasi-newton trust-region method for nonsmooth regularized optimization. SIAM J. Optim. 32(2), 900\u2013929 (2022)","journal-title":"SIAM J. Optim."},{"key":"1873_CR6","doi-asserted-by":"crossref","unstructured":"Bach, F., Jenatton, R., Mairal, J., Obozinski, G.: Optimization with sparsity-inducing penalties. Foundations and Trends\u00ae in Machine Learning 4(1), 1\u2013106 (2012)","DOI":"10.1561\/2200000015"},{"key":"1873_CR7","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/s10589-020-00218-7","volume":"77","author":"G Bareilles","year":"2020","unstructured":"Bareilles, G., Iutzeler, F.: On the interplay between acceleration and identification for the proximal gradient algorithm. Comput. Optim. Appl. 77, 351\u2013378 (2020)","journal-title":"Comput. Optim. Appl."},{"key":"1873_CR8","doi-asserted-by":"crossref","unstructured":"Beck, A.: First-order methods in optimization, vol.\u00a025. SIAM (2017)","DOI":"10.1137\/1.9781611974997"},{"issue":"1","key":"1873_CR9","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(1), 183\u2013202 (2009)","journal-title":"SIAM J. Imag. Sci."},{"issue":"4","key":"1873_CR10","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(4), 2445\u20132481 (2019)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"1873_CR11","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1137\/141000671","volume":"59","author":"J Bezanson","year":"2017","unstructured":"Bezanson, J., Edelman, A., Karpinski, S., Shah, V.B.: Julia: A fresh approach to numerical computing. SIAM Rev. 59(1), 65\u201398 (2017)","journal-title":"SIAM Rev."},{"key":"1873_CR12","doi-asserted-by":"crossref","unstructured":"Bolte, J., Nguyen, T.P., Peypouquet, J., Suter, B.W.: From error bounds to the complexity of first-order descent methods for convex functions. Mathematical Programming (2015)","DOI":"10.1007\/s10107-016-1091-6"},{"key":"1873_CR13","volume-title":"Numerical optimization: theoretical and practical aspects","author":"JF Bonnans","year":"2006","unstructured":"Bonnans, J.F., Gilbert, J.C., Lemar\u00e9chal, C., Sagastiz\u00e1bal, C.A.: Numerical optimization: theoretical and practical aspects. Springer Science & Business Media, Berlin (2006)"},{"key":"1873_CR14","doi-asserted-by":"crossref","unstructured":"Boumal, N.: An introduction to optimization on smooth manifolds. To appear with Cambridge University Press (2022). URL http:\/\/www.nicolasboumal.net\/book","DOI":"10.1017\/9781009166164"},{"issue":"2","key":"1873_CR15","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/s10107-006-0079-z","volume":"113","author":"O Briant","year":"2008","unstructured":"Briant, O., Lemar\u00e9chal, C., Meurdesoif, P., Michel, S., Perrot, N., Vanderbeck, F.: Comparison of bundle and classical column generation. Math. Program. 113(2), 299\u2013344 (2008)","journal-title":"Math. Program."},{"issue":"5","key":"1873_CR16","doi-asserted-by":"publisher","first-page":"1197","DOI":"10.1137\/0725068","volume":"25","author":"JV Burke","year":"1988","unstructured":"Burke, J.V., Mor\u00e9, J.J.: On the identification of active constraints. SIAM J. Numer. Anal. 25(5), 1197\u20131211 (1988)","journal-title":"SIAM J. Numer. Anal."},{"issue":"5\u20136","key":"1873_CR17","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1080\/02331930600815884","volume":"55","author":"A Daniilidis","year":"2006","unstructured":"Daniilidis, A., Hare, W., Malick, J.: Geometrical interpretation of the predictor-corrector type algorithms in structured optimization problems. Optimization 55(5\u20136), 481\u2013503 (2006)","journal-title":"Optimization"},{"issue":"2","key":"1873_CR18","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-newtono algorithms for large-scale unconstrained optimization. Math. Program. 26(2), 190\u2013212 (1983)","journal-title":"Math. Program."},{"key":"1873_CR19","doi-asserted-by":"crossref","unstructured":"Dennis\u00a0Jr, J.E., Schnabel, R.B.: Numerical methods for unconstrained optimization and nonlinear equations. SIAM (1996)","DOI":"10.1137\/1.9781611971200"},{"issue":"2","key":"1873_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(2), 201\u2013213 (2002)","journal-title":"Math. Program."},{"issue":"1\u20132","key":"1873_CR21","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/s10107-013-0730-4","volume":"147","author":"D Drusvyatskiy","year":"2014","unstructured":"Drusvyatskiy, D., Lewis, A.S.: Optimality, identifiability, and sensitivity. Math. Program. 147(1\u20132), 467\u2013498 (2014)","journal-title":"Math. Program."},{"issue":"1\u20132","key":"1873_CR22","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/s10107-007-0124-6","volume":"116","author":"W Hare","year":"2009","unstructured":"Hare, W., Sagastiz\u00e1bal, C.: Computing proximal points of nonconvex functions. Math. Program. 116(1\u20132), 221\u2013258 (2009)","journal-title":"Math. Program."},{"issue":"4","key":"1873_CR23","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1007\/s11228-020-00561-1","volume":"28","author":"F Iutzeler","year":"2020","unstructured":"Iutzeler, F., Malick, J.: Nonsmoothness in machine learning: specific structure, proximal identification, and applications. Set-Valued and Variational Analysis 28(4), 661\u2013678 (2020)","journal-title":"Set-Valued and Variational Analysis"},{"key":"1873_CR24","unstructured":"Lee, C.p.: Accelerating inexact successive quadratic approximation for regularized optimization through manifold identification. arXiv preprint arXiv:2012.02522 (2020)"},{"issue":"3","key":"1873_CR25","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":"1873_CR26","doi-asserted-by":"publisher","first-page":"711","DOI":"10.1090\/S0002-9947-99-02243-6","volume":"352","author":"C Lemar\u00e9chal","year":"2000","unstructured":"Lemar\u00e9chal, C., Oustry, F., Sagastiz\u00e1bal, C.: The u-lagrangian of a convex function. Trans. Am. Math. Soc. 352(2), 711\u2013729 (2000)","journal-title":"Trans. Am. Math. Soc."},{"key":"1873_CR27","unstructured":"Lewis, A., Wylie, C.: A simple newton method for local nonsmooth optimization. arXiv preprint arXiv:1907.11742 (2019)"},{"issue":"3","key":"1873_CR28","doi-asserted-by":"publisher","first-page":"702","DOI":"10.1137\/S1052623401387623","volume":"13","author":"AS Lewis","year":"2002","unstructured":"Lewis, A.S.: Active sets, nonsmoothness, and sensitivity. SIAM J. Optim. 13(3), 702\u2013725 (2002)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"1873_CR29","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1137\/19M1237909","volume":"32","author":"AS Lewis","year":"2022","unstructured":"Lewis, A.S., Liang, J., Tian, T.: Partial smoothness and constant rank. SIAM J. Optim. 32(1), 276\u2013291 (2022)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"1873_CR30","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/s10107-015-0943-9","volume":"158","author":"AS Lewis","year":"2016","unstructured":"Lewis, A.S., Wright, S.J.: A proximal method for composite minimization. Math. Program. 158(1), 501\u2013546 (2016). https:\/\/doi.org\/10.1007\/s10107-015-0943-9","journal-title":"Math. Program."},{"issue":"1","key":"1873_CR31","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1137\/16M106340X","volume":"27","author":"J Liang","year":"2017","unstructured":"Liang, J., Fadili, J., Peyr\u00e9, G.: Activity identification and local linear convergence of forward-backward-type methods. SIAM J. Optim. 27(1), 408\u2013437 (2017)","journal-title":"SIAM J. Optim."},{"issue":"2\u20133","key":"1873_CR32","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1007\/s10107-005-0630-3","volume":"104","author":"R Mifflin","year":"2005","unstructured":"Mifflin, R., Sagastiz\u00e1bal, C.: A VU-algorithm for convex minimization. Math. Program. 104(2\u20133), 583\u2013608 (2005)","journal-title":"Math. Program."},{"issue":"2\u20133","key":"1873_CR33","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1007\/s10107-005-0631-2","volume":"104","author":"SA Miller","year":"2005","unstructured":"Miller, S.A., Malick, J.: Newton methods for nonsmooth convex minimization: connections among U-lagrangian, riemannian newton and sqp methods. Math. Program. 104(2\u20133), 609\u2013633 (2005)","journal-title":"Math. Program."},{"issue":"2","key":"1873_CR34","first-page":"372","volume":"27","author":"Y Nesterov","year":"1983","unstructured":"Nesterov, Y.: A method of solving a convex programming problem with convergence rate O$$(1\/k^2)$$. Soviet Mathematics Doklady 27(2), 372\u2013376 (1983)","journal-title":"Soviet Mathematics Doklady"},{"issue":"5","key":"1873_CR35","doi-asserted-by":"publisher","first-page":"1805","DOI":"10.1090\/S0002-9947-96-01544-9","volume":"348","author":"R Poliquin","year":"1996","unstructured":"Poliquin, R., Rockafellar, R.: Prox-regular functions in variational analysis. Trans. Am. Math. Soc. 348(5), 1805\u20131838 (1996)","journal-title":"Trans. Am. Math. Soc."},{"key":"1873_CR36","unstructured":"Rockafellar, R.T., Wets, R.J.B.: Variational analysis, vol. 317. Springer, Berlin (2009)"},{"issue":"4","key":"1873_CR37","doi-asserted-by":"publisher","first-page":"1063","DOI":"10.1137\/0331048","volume":"31","author":"SJ Wright","year":"1993","unstructured":"Wright, S.J.: Identifiable surfaces in constrained optimization. SIAM J. Control. Optim. 31(4), 1063\u20131079 (1993)","journal-title":"SIAM J. Control. Optim."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-022-01873-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-022-01873-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-022-01873-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,18]],"date-time":"2023-05-18T23:06:46Z","timestamp":1684451206000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-022-01873-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,30]]},"references-count":37,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,6]]}},"alternative-id":["1873"],"URL":"https:\/\/doi.org\/10.1007\/s10107-022-01873-w","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,8,30]]},"assertion":[{"value":"15 January 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 July 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 August 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}