{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,25]],"date-time":"2025-12-25T04:21:41Z","timestamp":1766636501084,"version":"3.37.3"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,9,4]],"date-time":"2022-09-04T00:00:00Z","timestamp":1662249600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,9,4]],"date-time":"2022-09-04T00:00:00Z","timestamp":1662249600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100009448","name":"Universit\u00e0 degli Studi della Campania Luigi Vanvitelli","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100009448","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":[[2023,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Gradient projection methods represent effective tools for solving large-scale constrained optimization problems thanks to their simple implementation and low computational cost per iteration. Despite these good properties, a slow convergence rate can affect gradient projection schemes, especially when high accurate solutions are needed. A strategy to mitigate this drawback consists in properly selecting the values for the steplength along the negative gradient. In this paper, we consider the class of gradient projection methods with line search along the projected arc for box-constrained minimization problems and we analyse different strategies to define the steplength. It is well known in the literature that steplength selection rules able to approximate, at each iteration, the eigenvalues of the inverse of a suitable submatrix of the Hessian of the objective function can improve the performance of gradient projection methods. In this perspective, we propose an automatic hybrid steplength selection technique that employs a proper alternation of standard Barzilai\u2013Borwein rules, when the final active set is not well approximated, and a generalized limited memory strategy based on the Ritz-like values of the Hessian matrix restricted to the inactive constraints, when the final active set is reached. Numerical experiments on quadratic and non-quadratic test problems show the effectiveness of the proposed steplength scheme.<\/jats:p>","DOI":"10.1007\/s10589-022-00409-4","type":"journal-article","created":{"date-parts":[[2022,9,4]],"date-time":"2022-09-04T18:02:32Z","timestamp":1662314552000},"page":"151-189","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Hybrid limited memory gradient projection methods for box-constrained optimization problems"],"prefix":"10.1007","volume":"84","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9130-8163","authenticated-orcid":false,"given":"Serena","family":"Crisci","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Federica","family":"Porta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Valeria","family":"Ruggiero","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luca","family":"Zanni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,9,4]]},"reference":[{"key":"409_CR1","doi-asserted-by":"publisher","DOI":"10.1887\/0750304359","volume-title":"Introduction to Inverse Problems in Imaging","author":"M Bertero","year":"1998","unstructured":"Bertero, M., Boccacci, P.: Introduction to Inverse Problems in Imaging. Institute of Physics Pub, Philadelphia, PA (1998)"},{"key":"409_CR2","doi-asserted-by":"crossref","unstructured":"Bertero, M., Boccacci, P., Ruggiero, V.: Inverse imaging with Poisson data. IOP Publishing (2018)","DOI":"10.1088\/2053-2563\/aae109"},{"key":"409_CR3","doi-asserted-by":"crossref","unstructured":"Dost\u00e1l, Z., Kozubek, T., Sadowsk\u00e1, M., Vondr\u00e1k, V.: Scalable Algorithms for Contact Problems. Advances in Mechanics and Mathematics. Springer, New York (2017)","DOI":"10.1007\/978-1-4939-6834-3"},{"issue":"4","key":"409_CR4","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1109\/JSTSP.2007.910281","volume":"1","author":"MAT Figueiredo","year":"2008","unstructured":"Figueiredo, M.A.T., Nowak, R.D., Wright, S.J.: Gradient projection for sparse reconstruction: application to compressed sensing and other inverse problems. IEEE J. Sel. Top. Signal Process. 1(4), 586\u2013597 (2008)","journal-title":"IEEE J. Sel. Top. Signal Process."},{"key":"409_CR5","doi-asserted-by":"crossref","unstructured":"Pardalos, P.M., B., R.J.: Constrained Global Optimization: Algorithms and Applications. Springer, New York, NY, USA (1987)","DOI":"10.1007\/BFb0000035"},{"key":"409_CR6","series-title":"Neural information processing series","volume-title":"Optimization for Machine Learning","author":"S Sra","year":"2012","unstructured":"Sra, S., Nowozin, S., Wright, S.J.: Optimization for Machine Learning. Neural information processing series, MIT Press, Cambridge (2012)"},{"key":"409_CR7","volume-title":"Nonlinear Programming","author":"DP Bertsekas","year":"1999","unstructured":"Bertsekas, D.P.: Nonlinear Programming, 2nd edn. Athena Scientific, Belmont, Massachusetts (1999)","edition":"2"},{"issue":"4","key":"409_CR8","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1137\/0723046","volume":"23","author":"L Grippo","year":"1986","unstructured":"Grippo, L., Lampariello, F., Lucidi, S.: A nonmonotone line-search technique for Newton\u2019s method. SIAM J. Numer. Anal. 23(4), 707\u2013716 (1986)","journal-title":"SIAM J. Numer. Anal."},{"issue":"1","key":"409_CR9","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1590\/S0101-82052003000100003","volume":"22","author":"AN Iusem","year":"2003","unstructured":"Iusem, A.N.: On the convergence properties of the projected gradient method for convex optimization. Comput. Appl. Math. 22(1), 37\u201352 (2003)","journal-title":"Comput. Appl. Math."},{"key":"409_CR10","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.cam.2004.10.018","volume":"182","author":"C Wang","year":"2005","unstructured":"Wang, C., Liu, Q., Yang, X.: Convergence properties of nonmonotone spectral projected gradient methods. J. Comput. Appl. Math. 182, 51\u201366 (2005)","journal-title":"J. Comput. Appl. Math."},{"key":"409_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/s11565-022-00437-2","author":"S Crisci","year":"2022","unstructured":"Crisci, S., Porta, F., Ruggiero, V., Zanni, L.: On the convergence properties of scaled gradient projection methods with non-monotone Armijo\u2013like line searches. Ann. Univ. Ferrara. (2022). https:\/\/doi.org\/10.1007\/s11565-022-00437-2","journal-title":"Ann. Univ. Ferrara."},{"key":"409_CR12","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/BF02592073","volume":"39","author":"PH Calamai","year":"1987","unstructured":"Calamai, P.H., Mor\u00e9, J.J.: Projected gradient methods for linearly constrained problems. Math. Program. 39, 93\u2013116 (1987)","journal-title":"Math. Program."},{"key":"409_CR13","doi-asserted-by":"publisher","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, 141\u2013148 (1988)","journal-title":"IMA J. Numer. Anal."},{"key":"409_CR14","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1093\/imanum\/drv034","volume":"36","author":"F Curtis","year":"2016","unstructured":"Curtis, F., Guo, W.: Handling nonpositive curvature in a limited memory steepest descent method. IMA J. Numer. Anal. 36, 717\u2013742 (2016)","journal-title":"IMA J. Numer. Anal."},{"key":"409_CR15","doi-asserted-by":"publisher","first-page":"604","DOI":"10.1093\/imanum\/drl006","volume":"26","author":"YH Dai","year":"2006","unstructured":"Dai, Y.H., Hager, W.H., Schittkowski, K., Zhang, H.: The cyclic Barzilai-Borwein method for unconstrained optimization. IMA J. Numer. Anal. 26, 604\u2013627 (2006)","journal-title":"IMA J. Numer. Anal."},{"issue":"3","key":"409_CR16","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1007\/s10589-014-9669-5","volume":"59","author":"R De Asmundis","year":"2014","unstructured":"De Asmundis, R., di Serafino, D., Hager, H., Toraldo, G., Zhang, H.: An efficient gradient method using the Yuan steplength. Comput. Optim. Appl. 59(3), 541\u2013563 (2014)","journal-title":"Comput. Optim. Appl."},{"key":"409_CR17","first-page":"176","volume":"318","author":"D di Serafino","year":"2018","unstructured":"di Serafino, D., Ruggiero, V., Toraldo, G., Zanni, L.: On the steplength selection in gradient methods for unconstrained optimization. Appl. Math. Comput. 318, 176\u2013195 (2018)","journal-title":"Appl. Math. Comput."},{"key":"409_CR18","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/s10107-011-0479-6","volume":"135","author":"R Fletcher","year":"2012","unstructured":"Fletcher, R.: A limited memory steepest descent method. Math. Program., Ser A 135, 413\u2013436 (2012)","journal-title":"Math. Program., Ser A"},{"issue":"2","key":"409_CR19","doi-asserted-by":"publisher","first-page":"299","DOI":"10.3934\/jimo.2008.4.299","volume":"4","author":"G Frassoldati","year":"2008","unstructured":"Frassoldati, G., Zanghirati, G., Zanni, L.: New adaptive stepsize selections in gradient methods. J. Ind. Manag. Optim. 4(2), 299\u2013312 (2008)","journal-title":"J. Ind. Manag. Optim."},{"key":"409_CR20","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1137\/S003614299427315X","volume":"36","author":"A Friedlander","year":"1999","unstructured":"Friedlander, A., Mart\u00ednez, J.M., Molina, B., Raydan, M.: Gradient method with retards and generalizations. SIAM J. Numer. Anal. 36, 275\u2013289 (1999)","journal-title":"SIAM J. Numer. Anal."},{"key":"409_CR21","first-page":"1","volume":"00","author":"R Gu","year":"2020","unstructured":"Gu, R., Du, Q.: A modified limited memory steepest descent method motivated by an inexact super-linear convergence rate analysis. IMA J. Numer. Anal. 00, 1\u201324 (2020)","journal-title":"IMA J. Numer. Anal."},{"issue":"1","key":"409_CR22","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/s10589-006-6446-0","volume":"35","author":"B Zhou","year":"2006","unstructured":"Zhou, B., Gao, L., Dai, Y.H.: Gradient methods with adaptive step-sizes. Comput. Optim. Appl. 35(1), 69\u201386 (2006)","journal-title":"Comput. Optim. Appl."},{"key":"409_CR23","doi-asserted-by":"publisher","unstructured":"Bonettini, S., Porta, F., Prato, M., Rebegoldi, S., Ruggiero, V., Zanni, L.: Recent advances in variable metric first-order methods. In: Donatelli, M., Serra-Capizzano, S. (Eds.) Computational Methods for Inverse Problems in Imaging. Springer INdAM Series, vol. 36. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-32882-5_1","DOI":"10.1007\/978-3-030-32882-5_1"},{"issue":"2","key":"409_CR24","doi-asserted-by":"publisher","first-page":"1300","DOI":"10.1137\/19M1268641","volume":"30","author":"S Crisci","year":"2020","unstructured":"Crisci, S., Porta, F., Ruggiero, V., Zanni, L.: Spectral properties of Barzilai\u2013Borwein rules in solving singly linearly constrained optimization problems subject to lower and upper bounds. SIAM J. Optim. 30(2), 1300\u20131326 (2020)","journal-title":"SIAM J. Optim."},{"key":"409_CR25","first-page":"312","volume":"356","author":"S Crisci","year":"2018","unstructured":"Crisci, S., Ruggiero, V., Zanni, L.: Steplength selection in gradient projection methods for box-constrained quadratic programs. Appl. Math. Comput. 356, 312\u2013327 (2018)","journal-title":"Appl. Math. Comput."},{"key":"409_CR26","doi-asserted-by":"crossref","unstructured":"Huang, Y., Dai, Y.H., Liu, X.W.: Equipping Barzilai\u2013Borwein method with two dimensional quadratic termination property. arXiv:2010.12130 (2020)","DOI":"10.1137\/21M1390785"},{"key":"409_CR27","unstructured":"Huang, Y., Dai, Y.H., Liu, X.W., Zhang, H.: On the acceleration of the Barzilai-Borwein method. arXiv:2001.02335 (2020)"},{"key":"409_CR28","doi-asserted-by":"publisher","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. Comp. 65, 895\u2013919 (2015)","journal-title":"J. Sci. Comp."},{"key":"409_CR29","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1016\/j.cnsns.2014.08.035","volume":"21","author":"F Porta","year":"2015","unstructured":"Porta, F., Zanella, R., Zanghirati, G., Zanni, L.: Limited-memory scaled gradient projection methods for real-time image deconvolution in microscopy. Commun. Nonlinear Sci. Numer. Simul. 21, 112\u2013127 (2015)","journal-title":"Commun. Nonlinear Sci. Numer. Simul."},{"key":"409_CR30","doi-asserted-by":"crossref","unstructured":"Crisci, S., Porta, F., Ruggiero, V., Zanni, L.: A limited memory gradient projection method for box-constrained quadratic optimization problems. In: LNCS Proceedings, vol. 11973, pp. 161\u2013176 (2020)","DOI":"10.1007\/978-3-030-39081-5_15"},{"issue":"4","key":"409_CR31","doi-asserted-by":"publisher","first-page":"2809","DOI":"10.1137\/17M1128538","volume":"28","author":"D di Serafino","year":"2018","unstructured":"di Serafino, D., Toraldo, G., Viola, M., Barlow, J.L.: A two-phase gradient method for quadratic programming problems with a single linear constraint and bounds on the variables. SIAM J. Optim. 28(4), 2809\u20132838 (2018)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"409_CR32","doi-asserted-by":"publisher","first-page":"526","DOI":"10.1137\/050635225","volume":"17","author":"WW Hager","year":"2006","unstructured":"Hager, W.W., Zhang, H.: A new active set algorithm for box constrained optimization. SIAM J. Optim. 17(2), 526\u2013557 (2006)","journal-title":"SIAM J. Optim."},{"key":"409_CR33","doi-asserted-by":"publisher","first-page":"102895","DOI":"10.1016\/j.advengsoft.2020.102895","volume":"149","author":"J Kru\u017e\u00edk","year":"2020","unstructured":"Kru\u017e\u00edk, J., Hor\u00e1k, D., \u010cerm\u00e1k, M., Posp\u00ed\u0161il, L., Pecha, M.: Active set expansion strategies in MPRGP algorithm. Adv. Eng. Softw. 149, 102895 (2020). https:\/\/doi.org\/10.1016\/j.advengsoft.2020.102895","journal-title":"Adv. Eng. Softw."},{"key":"409_CR34","first-page":"165","volume":"26","author":"R Fletcher","year":"1990","unstructured":"Fletcher, R.: Low storage methods for unconstrained optimization. Lect. Appl. Math. 26, 165\u2013179 (1990)","journal-title":"Lect. Appl. Math."},{"key":"409_CR35","doi-asserted-by":"publisher","first-page":"1416","DOI":"10.1093\/imanum\/drs056","volume":"33","author":"A De Asmundis","year":"2013","unstructured":"De Asmundis, A., di Serafino, D., Riccio, F., Toraldo, G.: On spectral properties of steepest descent methods. IMA J. Numer. Anal. 33, 1416\u20131435 (2013)","journal-title":"IMA J. Numer. Anal."},{"key":"409_CR36","series-title":"Applied optimization","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/0-387-24255-4_10","volume-title":"Optimization and Control with Applications","author":"R Fletcher","year":"2005","unstructured":"Fletcher, R.: On the Barzilai\u2013Borwein method. In: Qi, L., Teo, K., Yang, X., Pardalos, P.M., Hearn, D. (eds.) Optimization and Control with Applications. Applied optimization, vol. 96, pp. 235\u2013256. Springer, Boston, MA (2005)"},{"key":"409_CR37","volume-title":"Matrix Computations","author":"GH Golub","year":"1996","unstructured":"Golub, G.H., van Loan, C.F.: Matrix Computations. John Hopkins University Press, Baltimore (1996)"},{"issue":"1","key":"409_CR38","doi-asserted-by":"publisher","first-page":"015002","DOI":"10.1088\/0266-5611\/25\/1\/015002","volume":"25","author":"S Bonettini","year":"2009","unstructured":"Bonettini, S., Zanella, R., Zanni, L.: A scaled gradient projection method for constrained image deblurring. Inverse Probl. 25(1), 015002\u201323 (2009)","journal-title":"Inverse Probl."},{"issue":"4","key":"409_CR39","doi-asserted-by":"publisher","first-page":"1196","DOI":"10.1137\/S1052623497330963","volume":"10","author":"EG Birgin","year":"2000","unstructured":"Birgin, E.G., Martinez, J.M., Raydan, M.: Non-monotone spectral projected gradient methods on convex sets. SIAM J. Optim. 10(4), 1196\u20131211 (2000)","journal-title":"SIAM J. Optim."},{"issue":"23","key":"409_CR40","doi-asserted-by":"publisher","first-page":"17761","DOI":"10.1007\/s00500-020-05304-w","volume":"24","author":"S Crisci","year":"2020","unstructured":"Crisci, S., Kru\u017e\u00edk, J., Pecha, M., Hor\u00e1k, D.: Comparison of active-set and gradient projection-based algorithms for box-constrained quadratic programming. Soft Comput. 24(23), 17761\u201317770 (2020). https:\/\/doi.org\/10.1007\/s00500-020-05304-w","journal-title":"Soft Comput."},{"issue":"3","key":"409_CR41","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1145\/275323.275331","volume":"23","author":"F Facchinei","year":"1997","unstructured":"Facchinei, F., Judice, J., Soares, J.: Generating box-constrained optimization problems. ACM Trans. Math. Softw. 23(3), 443\u2013447 (1997)","journal-title":"ACM Trans. Math. Softw."},{"key":"409_CR42","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1093\/comjnl\/6.2.163","volume":"6","author":"R Fletcher","year":"1963","unstructured":"Fletcher, R., Powell, M.J.D.: A rapidly convergent descent method for minimization. Comput. J. 6, 163\u2013168 (1963)","journal-title":"Comput. J."},{"issue":"2","key":"409_CR43","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."},{"key":"409_CR44","volume-title":"Circulant Matrices","author":"PJ Davis","year":"1979","unstructured":"Davis, P.J.: Circulant Matrices. John Wiley & Sons, New York (1979)"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-022-00409-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-022-00409-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-022-00409-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,26]],"date-time":"2023-11-26T15:12:08Z","timestamp":1701011528000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-022-00409-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,4]]},"references-count":44,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,1]]}},"alternative-id":["409"],"URL":"https:\/\/doi.org\/10.1007\/s10589-022-00409-4","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[2022,9,4]]},"assertion":[{"value":"12 October 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 August 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 September 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}