乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:24:21Z","timestamp":1740122661732,"version":"3.37.3"},"reference-count":58,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2024,3,10]],"date-time":"2024-03-10T00:00:00Z","timestamp":1710028800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,3,10]],"date-time":"2024-03-10T00:00:00Z","timestamp":1710028800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100009104","name":"Universit\u00e0 degli Studi di Modena e Reggio Emilia","doi-asserted-by":"crossref","id":[{"id":"10.13039\/100009104","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,6]]},"abstract":"Abstract<\/jats:title>We study a novel inertial proximal-gradient method for composite optimization. The proposed method alternates between a variable metric proximal-gradient iteration with momentum and an Armijo-like linesearch based on the sufficient decrease of a suitable merit function. The linesearch procedure allows for a major flexibility on the choice of the algorithm parameters. We prove the convergence of the iterates sequence towards a stationary point of the problem, in a Kurdyka\u2013\u0141ojasiewicz framework. Numerical experiments on a variety of convex and nonconvex problems highlight the superiority of our proposal with respect to several standard methods, especially when the inertial parameter is selected by mimicking the Conjugate Gradient updating rule.<\/jats:p>","DOI":"10.1007\/s10589-024-00565-9","type":"journal-article","created":{"date-parts":[[2024,3,11]],"date-time":"2024-03-11T09:01:32Z","timestamp":1710147692000},"page":"525-565","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A new proximal heavy ball inexact line-search algorithm"],"prefix":"10.1007","volume":"88","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2936-365X","authenticated-orcid":false,"given":"S.","family":"Bonettini","sequence":"first","affiliation":[]},{"given":"M.","family":"Prato","sequence":"additional","affiliation":[]},{"given":"S.","family":"Rebegoldi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,3,10]]},"reference":[{"issue":"10","key":"565_CR1","doi-asserted-by":"crossref","first-page":"2223","DOI":"10.1080\/02331934.2014.971412","volume":"64","author":"B Abbas","year":"2015","unstructured":"Abbas, B., Attouch, H.: Dynamical systems and forward-backward algorithms associated with the sum of a convex subdifferential and a monotone cocoercive operator. Optimization 64(10), 2223\u20132252 (2015)","journal-title":"Optimization"},{"issue":"2","key":"565_CR2","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":"1\u20132","key":"565_CR3","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), 91\u2013129 (2013)","journal-title":"Math. Program."},{"issue":"3","key":"565_CR4","doi-asserted-by":"crossref","first-page":"1824","DOI":"10.1137\/15M1046095","volume":"26","author":"H Attouch","year":"2016","unstructured":"Attouch, H., Peypouquet, J.: The rate of convergence of Nesterov\u2019s accelerated forward-backward method is actually faster than $$1\/k^2$$. SIAM J. Optim. 26(3), 1824\u20131834 (2016)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"565_CR5","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1137\/130910294","volume":"24","author":"H Attouch","year":"2014","unstructured":"Attouch, H., Peypouquet, J., Redont, P.: A dynamical approach to an inertial forward-backward algorithm for convex minimization. SIAM J. Optim. 24(1), 232\u2013256 (2014)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"565_CR6","doi-asserted-by":"crossref","first-page":"1817","DOI":"10.1137\/21M1403990","volume":"32","author":"J-F Aujol","year":"2022","unstructured":"Aujol, J.-F., Dossal, Ch., Rondepierre, A.: Convergence rates of the Heavy Ball method for quasi-strongly convex optimization. SIAM J. Optim. 32(3), 1817\u20131842 (2022)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"565_CR7","first-page":"307","volume":"34","author":"J-F Aujol","year":"2023","unstructured":"Aujol, J.-F., Dossal, Ch., Rondepierre, A.: FISTA is an automatic geometrically optimized algorithm for strongly convex functions. Math. Program. 34(3), 307\u2013327 (2023)","journal-title":"Math. Program."},{"issue":"1","key":"565_CR8","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1093\/imanum\/8.1.141","volume":"8","author":"J Barzilai","year":"1988","unstructured":"Barzilai, J., Borwein, J.M.: Two-point step size gradient methods. IMA J. Numer. Anal. 8(1), 141\u2013148 (1988)","journal-title":"IMA J. Numer. Anal."},{"issue":"11","key":"565_CR9","doi-asserted-by":"crossref","first-page":"2419","DOI":"10.1109\/TIP.2009.2028250","volume":"18","author":"A Beck","year":"2009","unstructured":"Beck, A., Teboulle, M.: Fast gradient-based algorithms for constrained total variation image denoising and deblurring problems. IEEE Trans. Image Process. 18(11), 2419\u20132434 (2009)","journal-title":"IEEE Trans. Image Process."},{"issue":"1","key":"565_CR10","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."},{"key":"565_CR11","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/s00245-001-0003-0","volume":"43","author":"EG Birgin","year":"2001","unstructured":"Birgin, E.G., Martinez, J.M.: A spectral conjugate gradient method for unconstrained optimization. Appl. Math. Optim. 43, 117\u2013128 (2001)","journal-title":"Appl. Math. Optim."},{"issue":"4","key":"565_CR12","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1093\/imanum\/23.4.539","volume":"23","author":"EG Birgin","year":"2003","unstructured":"Birgin, E.G., Martinez, J.M., Raydan, M.: Inexact spectral projected gradient methods on convex sets. IMA J. Numer. Anal. 23(4), 539\u2013559 (2003)","journal-title":"IMA J. Numer. Anal."},{"issue":"4","key":"565_CR13","doi-asserted-by":"crossref","first-page":"1205","DOI":"10.1137\/050644641","volume":"17","author":"J Bolte","year":"2007","unstructured":"Bolte, J., Danilidis, A., Lewis, A.: The \u0141ojasiewicz inequality for nonsmooth subanalytic functions with applications to subgradient dynamical systems. SIAM J. Optim. 17(4), 1205\u20131223 (2007)","journal-title":"SIAM J. Optim."},{"issue":"1\u20132","key":"565_CR14","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), 459\u2013494 (2014)","journal-title":"Math. Program."},{"key":"565_CR15","doi-asserted-by":"crossref","first-page":"925","DOI":"10.3934\/ipi.2022055","volume":"17","author":"S Bonettini","year":"2023","unstructured":"Bonettini, S., Franchini, G., Pezzi, D., Prato, M.: Explainable bilevel optimization: An application to the Helsinki deblur challenge. Inverse Probl. Imaging 17, 925\u2013950 (2023)","journal-title":"Inverse Probl. Imaging"},{"issue":"2","key":"565_CR16","doi-asserted-by":"crossref","first-page":"891","DOI":"10.1137\/15M1019325","volume":"26","author":"S Bonettini","year":"2016","unstructured":"Bonettini, S., Loris, I., Porta, F., Prato, M.: Variable metric inexact line-search based methods for nonsmooth optimization. SIAM J. Optim. 26(2), 891\u2013921 (2016)","journal-title":"SIAM J. Optim."},{"issue":"5","key":"565_CR17","doi-asserted-by":"crossref","DOI":"10.1088\/1361-6420\/aa5bfd","volume":"33","author":"S Bonettini","year":"2017","unstructured":"Bonettini, S., Loris, I., Porta, F., Prato, M., Rebegoldi, S.: On the convergence of a linesearch based proximal-gradient method for nonconvex optimization. Inverse Probl. 33(5), 055005 (2017)","journal-title":"Inverse Probl."},{"key":"565_CR18","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/s10589-022-00441-4","volume":"84","author":"S Bonettini","year":"2023","unstructured":"Bonettini, S., Ochs, P., Prato, M., Rebegoldi, S.: An abstract convergence framework with application to inertial inexact forward-backward methods. Comput. Optim. Appl. 84, 319\u2013362 (2023)","journal-title":"Comput. Optim. Appl."},{"key":"565_CR19","volume":"392","author":"S Bonettini","year":"2021","unstructured":"Bonettini, S., Prato, M., Rebegoldi, S.: New convergence results for the inexact variable metric forward-backward method. Appl. Math. Comput. 392, 125719 (2021)","journal-title":"Appl. Math. Comput."},{"issue":"5","key":"565_CR20","doi-asserted-by":"crossref","first-page":"A3180","DOI":"10.1137\/17M116001X","volume":"40","author":"S Bonettini","year":"2018","unstructured":"Bonettini, S., Rebegoldi, S., Ruggiero, V.: Inertial variable metric techniques for the inexact forward-backward algorithm. SIAM J. Sci. Comput. 40(5), A3180\u2013A3210 (2018)","journal-title":"SIAM J. Sci. Comput."},{"issue":"1\u20132","key":"565_CR21","first-page":"89","volume":"20","author":"A Chambolle","year":"2004","unstructured":"Chambolle, A.: An algorithm for Total Variation minimization and applications. J. Math. Imaging Vis. 20(1\u20132), 89\u201397 (2004)","journal-title":"J. Math. Imaging Vis."},{"key":"565_CR22","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1515\/9783110226157.263","volume-title":"Theoretical Foundations and Numerical Methods for Sparse Recovery","author":"A Chambolle","year":"2010","unstructured":"Chambolle, A., Caselles, V., Cremers, D., Novaga, M., Pock, T.: An Introduction to Total Variation for Image Analysis. In: Fornasier, M. (ed.) Theoretical Foundations and Numerical Methods for Sparse Recovery, pp. 263\u2013340. De Gruyter, Berlin, New York (2010)"},{"issue":"3","key":"565_CR23","doi-asserted-by":"crossref","first-page":"968","DOI":"10.1007\/s10957-015-0746-4","volume":"166","author":"A Chambolle","year":"2015","unstructured":"Chambolle, A., Dossal, Ch.: On the convergence of the iterates of the \u201cFast Iterative Shrinkage\/Thresholding Algorithm\u2019\u2019. J. Optim. Theory Appl. 166(3), 968\u2013982 (2015)","journal-title":"J. Optim. Theory Appl."},{"issue":"18","key":"565_CR24","doi-asserted-by":"crossref","first-page":"4770","DOI":"10.1109\/TSP.2017.2709265","volume":"65","author":"E Chouzenoux","year":"2017","unstructured":"Chouzenoux, E., Pesquet, J.-C.: A stochastic majorize-minimize subspace algorithm for online penalized least squares estimation. IEEE Trans. Signal Process. 65(18), 4770\u20134783 (2017)","journal-title":"IEEE Trans. Signal Process."},{"issue":"1","key":"565_CR25","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/s10957-013-0465-7","volume":"162","author":"E Chouzenoux","year":"2014","unstructured":"Chouzenoux, E., Pesquet, J.-C., Repetti, A.: Variable metric forward-backward algorithm for minimizing the sum of a differentiable function and a convex function. J. Optim. Theory Appl. 162(1), 107\u2013132 (2014)","journal-title":"J. Optim. Theory Appl."},{"key":"565_CR26","series-title":"Springer Optimization and Its Applications","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1007\/978-1-4419-9569-8_10","volume-title":"Fixed-Point Algorithms for Inverse Problems in Science and Engineering","author":"PL Combettes","year":"2011","unstructured":"Combettes, P.L., Pesquet, J.-C.: Proximal splitting methods in signal processing. In: Bauschke, H.H., Burachik, R.S., Combettes, P.L., Elser, V., Luke, D.R., Wolkowicz, H. (eds.) Fixed-Point Algorithms for Inverse Problems in Science and Engineering. Springer Optimization and Its Applications, pp. 185\u2013212. Springer, New York, NY (2011)"},{"issue":"9","key":"565_CR27","doi-asserted-by":"crossref","first-page":"1289","DOI":"10.1080\/02331934.2012.733883","volume":"63","author":"PL Combettes","year":"2014","unstructured":"Combettes, P.L., V\u0169, B.C.: Variable metric forward-backward splitting with applications to monotone inclusions in duality. Optimization 63(9), 1289\u20131318 (2014)","journal-title":"Optimization"},{"issue":"4","key":"565_CR28","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-backward splitting. Multiscale Model. Simul. 4(4), 1168\u20131200 (2005)","journal-title":"Multiscale Model. Simul."},{"key":"565_CR29","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/s10589-022-00409-4","volume":"84","author":"S Crisci","year":"2023","unstructured":"Crisci, S., Porta, F., Ruggiero, V., Zanni, L.: Hybrid limited memory gradient projection methods for box-constrained optimization problems. Comput. Optim. Appl. 84, 151\u2013189 (2023)","journal-title":"Comput. Optim. Appl."},{"key":"565_CR30","doi-asserted-by":"publisher","unstructured":"Crisci, S., Rebegoldi, S., Toraldo, G., Viola, M.: Barzilai\u2013Borwein-like rules in proximal gradient schemes for $$\\ell _1$$ regularized problems. Optim. Method Soft., in press. https:\/\/doi.org\/10.1080\/10556788.2023.2285489","DOI":"10.1080\/10556788.2023.2285489"},{"key":"565_CR31","doi-asserted-by":"crossref","unstructured":"Ghadimi, E., Feyzmahdavian, H.\u00a0R., Johansson, M.: Global convergence of the Heavy-ball method for convex optimization. In: 2015 European Control Conference (ECC), pp. 310\u2013315 (2015)","DOI":"10.1109\/ECC.2015.7330562"},{"issue":"1","key":"565_CR32","first-page":"35","volume":"2","author":"WW Hager","year":"2006","unstructured":"Hager, W.W., Zhang, H.: A survey of nonlinear conjugate gradient methods. Pac. J. Optim. 2(1), 35\u201358 (2006)","journal-title":"Pac. J. Optim."},{"issue":"3","key":"565_CR33","doi-asserted-by":"crossref","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(3), 641\u2013674 (2019)","journal-title":"Comput. Optim. Appl."},{"key":"565_CR34","unstructured":"Li, H., Lin, Z.: Accelerated proximal gradient methods for nonconvex programming. In: Cortes, C., Lawrence, N., Lee, D., Sugiyama, M., Garnett, R. (eds.) Advances in Neural Information Processing Systems, vol. 28. Curran Associates Inc. (2015)"},{"key":"565_CR35","unstructured":"Liang, J., Fadili, J., Peyr\u00e9, G.: A multi-step inertial forward-backward splitting method for non-convex optimization. In: Lee, D., Sugiyama, M., Luxburg, U., Guyon, I., Garnett, R. (eds.) Advances in Neural Information Processing Systems, vol. 29. Curran Associates Inc. (2016)"},{"issue":"1\u20132","key":"565_CR36","doi-asserted-by":"crossref","first-page":"735","DOI":"10.1007\/s10107-021-01713-3","volume":"195","author":"H Luo","year":"2022","unstructured":"Luo, H., Chen, L.: From differential equation solvers to accelerated first-order methods for convex optimization. Math. Program. 195(1\u20132), 735\u2013781 (2022)","journal-title":"Math. Program."},{"issue":"1","key":"565_CR37","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/s10107-004-0552-5","volume":"103","author":"Y Nesterov","year":"2005","unstructured":"Nesterov, Y.: Smooth minimization of non-smooth functions. Math. Program. 103(1), 127\u2013152 (2005)","journal-title":"Math. Program."},{"issue":"1","key":"565_CR38","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1137\/17M1124085","volume":"29","author":"P Ochs","year":"2019","unstructured":"Ochs, P.: Unifying abstract inexact convergence theorems and block coordinate variable metric iPiano. SIAM J. Optim. 29(1), 541\u2013570 (2019)","journal-title":"SIAM J. Optim."},{"key":"565_CR39","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/s10851-015-0565-0","volume":"53","author":"P Ochs","year":"2015","unstructured":"Ochs, P., Brox, T., Pock, T.: iPiasco: inertial proximal algorithm for strongly convex optimization. J. Math. Imaging Vis. 53, 171\u2013181 (2015)","journal-title":"J. Math. Imaging Vis."},{"issue":"2","key":"565_CR40","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 non-convex optimization. SIAM J. Imaging Sci. 7(2), 1388\u20131419 (2014)","journal-title":"SIAM J. Imaging Sci."},{"issue":"4","key":"565_CR41","doi-asserted-by":"crossref","first-page":"1756","DOI":"10.1137\/16M1064064","volume":"9","author":"T Pock","year":"2016","unstructured":"Pock, T., Sabach, S.: Inertial proximal alternating linearized minimization (iPALM) for nonconvex and nonsmooth problems. SIAM J. Imaging Sci. 9(4), 1756\u20131787 (2016)","journal-title":"SIAM J. Imaging Sci."},{"key":"565_CR42","volume-title":"Introduction to Optimization","author":"B Polyak","year":"1987","unstructured":"Polyak, B.: Introduction to Optimization. Optimization Software - Inc., Publication Division, New York (1987)"},{"key":"565_CR43","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0041-5553(64)90137-5","volume":"4","author":"BT Polyak","year":"1964","unstructured":"Polyak, B.T.: Some methods of speeding up the convergence of iteration methods. USSR Comput. Math. Math. Phys. 4, 1\u201317 (1964)","journal-title":"USSR Comput. Math. Math. Phys."},{"key":"565_CR44","doi-asserted-by":"crossref","first-page":"895","DOI":"10.1007\/s10915-015-9991-9","volume":"65","author":"F Porta","year":"2015","unstructured":"Porta, F., Prato, M., Zanni, L.: A new steplength selection for scaled gradient methods with application to image deblurring. J. Sci. Comput. 65, 895\u2013919 (2015)","journal-title":"J. Sci. Comput."},{"issue":"3","key":"565_CR45","doi-asserted-by":"crossref","first-page":"2428","DOI":"10.1137\/21M1391699","volume":"32","author":"S Rebegoldi","year":"2022","unstructured":"Rebegoldi, S., Calatroni, L.: Scaled, inexact and adaptive generalized FISTA for strongly convex optimization. SIAM J. Optim. 32(3), 2428\u20132459 (2022)","journal-title":"SIAM J. Optim."},{"key":"565_CR46","unstructured":"Repetti, A., Chouzenoux, E.: RestoVMFB Lab: Matlab Toolbox for image restoration with the variable metric forward-backward algorithm. http:\/\/www-syscom.univ-mlv.fr\/~chouzeno\/Logiciel.html (2013)"},{"key":"565_CR47","doi-asserted-by":"crossref","DOI":"10.1515\/9781400873173","volume-title":"Convex Analysis","author":"RT Rockafellar","year":"1970","unstructured":"Rockafellar, R.T.: Convex Analysis. Princeton University Press, Princeton, NJ (1970)"},{"key":"565_CR48","volume-title":"Variational Analysis, Grundlehren der Mathematischen Wissenschaften","author":"RT Rockafellar","year":"1998","unstructured":"Rockafellar, R.T., Wets, R.J.-B., Wets, M.: Variational Analysis, Grundlehren der Mathematischen Wissenschaften, vol. 317. Springer, Berlin (1998)"},{"issue":"4","key":"565_CR49","doi-asserted-by":"crossref","first-page":"2153","DOI":"10.1137\/16M1073741","volume":"27","author":"S Salzo","year":"2017","unstructured":"Salzo, S.: The variable metric forward-backward splitting algorithm under mild differentiability assumptions. SIAM J. Optim. 27(4), 2153\u20132181 (2017)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"565_CR50","first-page":"1167","volume":"19","author":"S Salzo","year":"2012","unstructured":"Salzo, S., Villa, S.: Inexact and accelerated proximal point algorithms. J. Convex Anal. 19(4), 1167\u20131192 (2012)","journal-title":"J. Convex Anal."},{"issue":"1\u20132","key":"565_CR51","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1007\/s10107-007-0170-0","volume":"117","author":"P Tseng","year":"2009","unstructured":"Tseng, P., Yun, S.: A coordinate gradient descent method for nonsmooth separable minimization. Math. Program. 117(1\u20132), 387\u2013423 (2009)","journal-title":"Math. Program."},{"issue":"3","key":"565_CR52","doi-asserted-by":"crossref","first-page":"1607","DOI":"10.1137\/110844805","volume":"23","author":"S Villa","year":"2013","unstructured":"Villa, S., Salzo, S., Baldassarre, L., Verri, A.: Accelerated and inexact forward\u2013backward algorithms. SIAM J. Optim. 23(3), 1607\u20131633 (2013)","journal-title":"SIAM J. Optim."},{"key":"565_CR53","doi-asserted-by":"crossref","first-page":"931","DOI":"10.1007\/s10957-013-0499-x","volume":"162","author":"EAH Vollebregt","year":"2014","unstructured":"Vollebregt, E.A.H.: The bound-constrained conjugate gradient method for non-negative matrices. J. Optim. Theory Appl. 162, 931\u2013953 (2014)","journal-title":"J. Optim. Theory Appl."},{"key":"565_CR54","doi-asserted-by":"crossref","first-page":"617","DOI":"10.1007\/s10898-020-00943-7","volume":"79","author":"Z Wu","year":"2021","unstructured":"Wu, Z., Li, C., Li, M., Lim, A.: Inertial proximal gradient methods with Bregman regularization for a class of nonconvex optimization problems. J. Glob. Optim. 79, 617\u2013644 (2021)","journal-title":"J. Glob. Optim."},{"key":"565_CR55","unstructured":"Yang, L.: Proximal gradient method with extrapolation and line search for a class of nonconvex and nonsmooth problems. arXiv:1711.06831 (2021)"},{"key":"565_CR56","unstructured":"Yang, L., Toh, K.-C.: An inexact Bregman proximal gradient method and its inertial variants. arXiv:2109.05690 (2022)"},{"key":"565_CR57","doi-asserted-by":"crossref","unstructured":"Zalinescu, A.: Convex Analysis in General Vector Spaces. World Scientific Publishing, Singapore (2002)","DOI":"10.1142\/9789812777096"},{"issue":"4","key":"565_CR58","doi-asserted-by":"crossref","DOI":"10.1088\/0266-5611\/25\/4\/045010","volume":"25","author":"R Zanella","year":"2009","unstructured":"Zanella, R., Boccacci, P., Zanni, L., Bertero, M.: Efficient gradient projection methods for edge-preserving removal of Poisson noise. Inverse Probl. 25(4), 045010 (2009)","journal-title":"Inverse Probl."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-024-00565-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-024-00565-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-024-00565-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,13]],"date-time":"2024-05-13T16:10:32Z","timestamp":1715616632000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-024-00565-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,3,10]]},"references-count":58,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,6]]}},"alternative-id":["565"],"URL":"https:\/\/doi.org\/10.1007\/s10589-024-00565-9","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[2024,3,10]]},"assertion":[{"value":"5 June 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 February 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 March 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":"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. The authors have no competing interests to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"The authors declare that research ethics approval was not required for this study.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval"}},{"value":"The authors declare that informed consents were not required for this study.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Informed consent"}}]}}