{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T19:08:47Z","timestamp":1775070527231,"version":"3.50.1"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2024,10,7]],"date-time":"2024-10-07T00:00:00Z","timestamp":1728259200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,10,7]],"date-time":"2024-10-07T00:00:00Z","timestamp":1728259200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100000038","name":"NSERC","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100000038","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":[[2025,6]]},"DOI":"10.1007\/s10589-024-00604-5","type":"journal-article","created":{"date-parts":[[2024,10,7]],"date-time":"2024-10-07T12:07:29Z","timestamp":1728302849000},"page":"861-903","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["The indefinite proximal gradient method"],"prefix":"10.1007","volume":"91","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1825-1639","authenticated-orcid":false,"given":"Geoffroy","family":"Leconte","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dominique","family":"Orban","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,10,7]]},"reference":[{"key":"604_CR1","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1007\/s11075-018-0562-7","volume":"81","author":"N Andrei","year":"2019","unstructured":"Andrei, N.: A diagonal quasi-Newton updating method for unconstrained optimization. Numer. Algor. 81, 575\u2013590 (2019). https:\/\/doi.org\/10.1007\/s11075-018-0562-7","journal-title":"Numer. Algor."},{"key":"604_CR2","doi-asserted-by":"publisher","unstructured":"Aravkin, A., Baraldi, R., Orban, D.: A Levenberg-Marquardt method for nonsmooth regularized least squares. Cahier du GERAD G-2023-58, GERAD, Montr\u00e9al, QC, Canada, (2022) https:\/\/doi.org\/10.13140\/RG.2.2.28438.01604","DOI":"10.13140\/RG.2.2.28438.01604"},{"key":"604_CR3","doi-asserted-by":"publisher","unstructured":"Aravkin, A., Baraldi, R., Leconte, G., Orban, D.: Corrigendum: a proximal quasi-Newton trust-region method for nonsmooth regularized optimization. Cahier du GERAD G-2021-12SM, GERAD, Montr\u00e9al, QC, Canada, (2024) https:\/\/doi.org\/10.13140\/RG.2.2.36250.45768","DOI":"10.13140\/RG.2.2.36250.45768"},{"issue":"2","key":"604_CR4","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). https:\/\/doi.org\/10.1137\/21M1409536","journal-title":"SIAM J. Optim."},{"key":"604_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-022-01915-3","author":"R Baraldi","year":"2022","unstructured":"Baraldi, R., Kouri, D.P.: A proximal trust-region method for nonsmooth optimization with inexact function and gradient evaluations. Math. Program. (2022). https:\/\/doi.org\/10.1007\/s10107-022-01915-3","journal-title":"Math. Program."},{"key":"604_CR6","doi-asserted-by":"publisher","unstructured":"Baraldi, R., Orban, D.: RegularizedOptimization.jl: algorithms for regularized optimization. https:\/\/doi.org\/10.5281\/zenodo.6940313https:\/\/github.com\/JuliaSmoothOptimizers\/RegularizedOptimization.jl, (February 2022)","DOI":"10.5281\/zenodo.6940313"},{"key":"604_CR7","doi-asserted-by":"publisher","unstructured":"Baraldi, R., Orban, D.: RegularizedProblems.jl: test cases for regularized optimization. https:\/\/doi.org\/10.5281\/zenodo.6940315https:\/\/github.com\/JuliaSmoothOptimizers\/RegularizedProblems.jl, (February 2022)","DOI":"10.5281\/zenodo.6940315"},{"key":"604_CR8","doi-asserted-by":"publisher","unstructured":"Baraldi, R., Orban, D.: ShiftedProximalOperators.jl: proximal operators for regularized optimization. https:\/\/doi.org\/10.5281\/zenodo.6940317https:\/\/github.com\/JuliaSmoothOptimizers\/ShiftedProximalOperators.jl, (February 2022)","DOI":"10.5281\/zenodo.6940317"},{"key":"604_CR9","doi-asserted-by":"publisher","unstructured":"Beck, A.: First-Order Methods in Optimization. Number\u00a025 in MOS-SIAM Series on Optimization. SIAM, Philadelphia, USA, (2017) https:\/\/doi.org\/10.1137\/1.9781611974997","DOI":"10.1137\/1.9781611974997"},{"key":"604_CR10","unstructured":"Becker, S., Fadili, J.: A quasi-Newton proximal splitting method. In Pereira F., Burges C., Bottou L., and Weinberger K., editors, Advances in Neural Information Processing Systems, 25. Curran Associates, Inc., (2012) https:\/\/proceedings.neurips.cc\/paper\/2012\/file\/e034fb6b66aacc1d48f445ddfb08da98-Paper.pdf"},{"issue":"4","key":"604_CR11","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). https:\/\/doi.org\/10.1137\/18M1167152","journal-title":"SIAM J. Optim."},{"key":"604_CR12","doi-asserted-by":"publisher","unstructured":"Birgin, E.G., Mart\u00ednez, J.M., Raydan, M.: Spectral projected gradient methods: review and perspectives. J. Stat. Softw 60(3), 1\u201321 (2014). https:\/\/doi.org\/10.18635\/jss.v060.i03","DOI":"10.18635\/jss.v060.i03"},{"issue":"5","key":"604_CR13","doi-asserted-by":"publisher","first-page":"1349","DOI":"10.1080\/02331934.2013.869809","volume":"64","author":"PSC Cartis","year":"2015","unstructured":"Cartis, P.S.C., Toint, P.: Worst-case evaluation complexity of non-monotone gradient-related algorithms for unconstrained optimization. Optimization 64(5), 1349\u20131361 (2015). https:\/\/doi.org\/10.1080\/02331934.2013.869809","journal-title":"Optimization"},{"issue":"1","key":"604_CR14","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/j.jvcir.2012.10.006","volume":"24","author":"W Cao","year":"2013","unstructured":"Cao, W., Sun, J., Xu, Z.: Fast image deconvolution using closed-form thresholding formulas of $${L}_q$$ ($$q = \\tfrac{1}{2}$$, $$\\tfrac{2}{3}$$) regularization. J. Vis. Commun. Image R. 24(1), 31\u201341 (2013). https:\/\/doi.org\/10.1016\/j.jvcir.2012.10.006","journal-title":"J. Vis. Commun. Image R."},{"key":"604_CR15","doi-asserted-by":"crossref","unstructured":"Cartis, C., Gould, N.I.M., Toint P.L.: Evaluation Complexity of Algorithms for Nonconvex Optimization. Number\u00a030 in MOS-SIAM Series on Optimization. SIAM, Philadelphia, USA, (2022)","DOI":"10.1137\/1.9781611976991"},{"key":"604_CR16","doi-asserted-by":"publisher","unstructured":"Conn, A.R., Gould, N.I.M., Toint, P.L.: Trust-Region Methods. Number\u00a01 in MOS-SIAM Series on Optimization. SIAM, Philadelphia, USA, (2000) https:\/\/doi.org\/10.1137\/1.9780898719857","DOI":"10.1137\/1.9780898719857"},{"issue":"3","key":"604_CR17","doi-asserted-by":"publisher","first-page":"771","DOI":"10.1007\/s10957-022-02048-5","volume":"194","author":"A De Marchi","year":"2022","unstructured":"De Marchi, A., Themelis, A.: Proximal gradient algorithms under local Lipschitz gradient continuity. J. Optim. Theory Appls. 194(3), 771\u2013794 (2022). https:\/\/doi.org\/10.1007\/s10957-022-02048-5","journal-title":"J. Optim. Theory Appls."},{"issue":"5","key":"604_CR18","doi-asserted-by":"publisher","first-page":"1291","DOI":"10.1137\/0730067","volume":"30","author":"JE Dennis Jr","year":"1993","unstructured":"Dennis, J.E., Jr., Wolkowicz, H.: Sizing and least-change secant methods. SIAM J. Numer. Anal. 30(5), 1291\u20131314 (1993). https:\/\/doi.org\/10.1137\/0730067","journal-title":"SIAM J. Numer. Anal."},{"issue":"4","key":"604_CR19","doi-asserted-by":"publisher","first-page":"1289","DOI":"10.1109\/TIT.2006.871582","volume":"52","author":"D Donoho","year":"2006","unstructured":"Donoho, D.: Compressed sensing. IEEE T. Inform. Theory 52(4), 1289\u20131306 (2006). https:\/\/doi.org\/10.1109\/TIT.2006.871582","journal-title":"IEEE T. Inform. Theory"},{"key":"604_CR20","doi-asserted-by":"publisher","first-page":"2121","DOI":"10.5555\/1953048.2021068","volume":"12","author":"J Duchi","year":"2011","unstructured":"Duchi, J., Hazan, E., Singer, Y.: Adaptive subgradient methods for online learning and stochastic optimization. J. Mach. Learn. Res. 12, 2121\u20132159 (2011). https:\/\/doi.org\/10.5555\/1953048.2021068","journal-title":"J. Mach. Learn. Res."},{"issue":"4","key":"604_CR21","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/BF02477753","volume":"17","author":"R FitzHugh","year":"1955","unstructured":"FitzHugh, R.: Mathematical models of threshold phenomena in the nerve membrane. B. Math. Biophys. 17(4), 257\u2013278 (1955). https:\/\/doi.org\/10.1007\/BF02477753","journal-title":"B. Math. Biophys."},{"key":"604_CR22","doi-asserted-by":"publisher","unstructured":"Fukushima, M., Mine, H.: A generalized proximal point algorithm for certain non-convex minimization problems. 12(8): 989\u20131000, (1981) https:\/\/doi.org\/10.1080\/00207728108963798","DOI":"10.1080\/00207728108963798"},{"key":"604_CR23","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/BF01589113","volume":"45","author":"J-C Gilbert","year":"1989","unstructured":"Gilbert, J.-C., Lemar\u00e9chal, C.: Some numerical experiments with variable-storage quasi-Newton algorithms. Math. Program. 45, 407\u2013435 (1989). https:\/\/doi.org\/10.1007\/BF01589113","journal-title":"Math. Program."},{"issue":"2","key":"604_CR24","doi-asserted-by":"publisher","first-page":"624","DOI":"10.1007\/s10957-022-02101-3","volume":"195","author":"C Kanzow","year":"2022","unstructured":"Kanzow, C., Mehlitz, P.: Convergence properties of monotone and nonmonotone proximal gradient methods revisited. J. Optim. Theory Appl. 195(2), 624\u2013646 (2022). https:\/\/doi.org\/10.1007\/s10957-022-02101-3","journal-title":"J. Optim. Theory Appl."},{"key":"604_CR25","unstructured":"Kim, J., Park, H.: Sparse nonnegative matrix factorization for clustering. Technical Report GT-CSE-08-01, Georgia Inst. of Technology, (2008) http:\/\/hdl.handle.net\/1853\/20058"},{"issue":"6","key":"604_CR26","doi-asserted-by":"publisher","first-page":"964","DOI":"10.1137\/0716071","volume":"16","author":"P-L Lions","year":"1979","unstructured":"Lions, P.-L., Mercier, B.: Splitting algorithms for the sum of two nonlinear operators. SIAM J. Numer. Anal. 16(6), 964\u2013979 (1979). https:\/\/doi.org\/10.1137\/0716071","journal-title":"SIAM J. Numer. Anal."},{"key":"604_CR27","doi-asserted-by":"publisher","unstructured":"Lotfi, S., Bonniot de Ruisselet, T., Orban, D., Lodi A.: Stochastic damped L-BFGS with controlled norm of the Hessian approximation. 2020. OPT2020 Conference on Optimization for Machine Learning. https:\/\/doi.org\/10.13140\/RG.2.2.27851.41765\/1","DOI":"10.13140\/RG.2.2.27851.41765\/1"},{"issue":"10","key":"604_CR28","doi-asserted-by":"publisher","first-page":"2061","DOI":"10.1109\/JRPROC.1962.288235","volume":"50","author":"J Nagumo","year":"1962","unstructured":"Nagumo, J., Arimoto, S., Yoshizawa, S.: An active pulse transmission line simulating nerve axon. Proc. IRE 50(10), 2061\u20132070 (1962). https:\/\/doi.org\/10.1109\/JRPROC.1962.288235","journal-title":"Proc. IRE"},{"key":"604_CR29","first-page":"11","volume":"6","author":"JL Nazareth","year":"1995","unstructured":"Nazareth, J.L.: If quasi-Newton then why not quasi-Cauchy? SIAG\/OPT Views News 6, 11\u201314 (1995)","journal-title":"SIAG\/OPT Views News"},{"key":"604_CR30","doi-asserted-by":"publisher","unstructured":"Orban, D., Siqueira, A.\u00a0S., and contributors: LinearOperators.jl., September 2020. https:\/\/doi.org\/10.5281\/zenodo.2559295https:\/\/github.com\/JuliaSmoothOptimizers\/LinearOperators.jl","DOI":"10.5281\/zenodo.2559295"},{"key":"604_CR31","doi-asserted-by":"publisher","unstructured":"Rockafellar, R., Wets, R.: Variational Analysis, volume 317. Springer Verlag (1998). https:\/\/doi.org\/10.1007\/978-3-642-02431-3","DOI":"10.1007\/978-3-642-02431-3"},{"key":"604_CR32","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1007\/s10107-016-0997-3","volume":"160","author":"K Scheinberg","year":"2016","unstructured":"Scheinberg, K., Tang, X.: Practical inexact proximal quasi-Newton method with global complexity analysis. Math. Program. 160, 495\u2013529 (2016). https:\/\/doi.org\/10.1007\/s10107-016-0997-3","journal-title":"Math. Program."},{"key":"604_CR33","doi-asserted-by":"publisher","unstructured":"Stella, L., Themelis, A., Sopasakis, P., Patrinos, P.: A simple and efficient algorithm for nonlinear model predictive control. In 2017 IEEE 56th Annual Conference on Decision and Control (CDC), pages 1939\u20131944, (2017) https:\/\/doi.org\/10.1109\/CDC.2017.8263933","DOI":"10.1109\/CDC.2017.8263933"},{"issue":"3","key":"604_CR34","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-backward envelope for the sum of two nonconvex functions: further properties and nonmonotone linesearch algorithms. SIAM J. Optim. 28(3), 2274\u20132303 (2018). https:\/\/doi.org\/10.1137\/16M1080240","journal-title":"SIAM J. Optim."},{"issue":"1","key":"604_CR35","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. Roy. Statist. Soc. Ser. B 58(1), 267\u2013288 (1996). https:\/\/doi.org\/10.1111\/j.2517-6161.1996.tb02080.x","journal-title":"J. Roy. Statist. Soc. Ser. B"},{"key":"604_CR36","doi-asserted-by":"publisher","unstructured":"van\u00a0der Pol, B.: LXXXVIII. On \u201crelaxation-oscillations\u201d. The London, Edinburgh, and Dublin Philosophical Magazine and Journal of Science, 2(11):978\u2013992, (1926) https:\/\/doi.org\/10.1080\/14786442608564127","DOI":"10.1080\/14786442608564127"},{"key":"604_CR37","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1449\/jsiaml.16.5","volume":"16","author":"S Yagishita","year":"2024","unstructured":"Yagishita, S., Nakayama, S.: An acceleration of proximal diagonal newton method. JSIAM Lett. 16, 5\u20138 (2024). https:\/\/doi.org\/10.1449\/jsiaml.16.5","journal-title":"JSIAM Lett."},{"issue":"4","key":"604_CR38","doi-asserted-by":"publisher","first-page":"1192","DOI":"10.1137\/S1052623498331793","volume":"9","author":"M Zhu","year":"1999","unstructured":"Zhu, M., Nazareth, J.L., Wolkowicz, H.: The quasi-Cauchy relation and diagonal updating. SIAM J. Optim. 9(4), 1192\u20131204 (1999). https:\/\/doi.org\/10.1137\/S1052623498331793","journal-title":"SIAM J. Optim."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-024-00604-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-024-00604-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-024-00604-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,17]],"date-time":"2025-05-17T12:32:14Z","timestamp":1747485134000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-024-00604-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,7]]},"references-count":38,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,6]]}},"alternative-id":["604"],"URL":"https:\/\/doi.org\/10.1007\/s10589-024-00604-5","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,10,7]]},"assertion":[{"value":"20 September 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 August 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 October 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"We certify that the research submitted here is original, is our own, and is not being evaluated elsewhere for publication. This work was supported by an NSERC Discovery grant.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}