{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T12:09:39Z","timestamp":1759838979346,"version":"3.37.3"},"reference-count":71,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,11,24]],"date-time":"2021-11-24T00:00:00Z","timestamp":1637712000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,11,24]],"date-time":"2021-11-24T00:00:00Z","timestamp":1637712000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003593","name":"CNPq","doi-asserted-by":"crossref","award":["302473\/2017-3","408151\/2016-1"],"award-info":[{"award-number":["302473\/2017-3","408151\/2016-1"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100005285","name":"FAPEG","doi-asserted-by":"crossref","award":["PPP03\/15- 201810267001725"],"award-info":[{"award-number":["PPP03\/15- 201810267001725"]}],"id":[{"id":"10.13039\/501100005285","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100003593","name":"CNPq","doi-asserted-by":"crossref","award":["424860\/2018-0","309628\/2020-2"],"award-info":[{"award-number":["424860\/2018-0","309628\/2020-2"]}],"id":[{"id":"10.13039\/501100003593","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":[[2022,1]]},"DOI":"10.1007\/s10589-021-00331-1","type":"journal-article","created":{"date-parts":[[2021,11,24]],"date-time":"2021-11-24T11:02:59Z","timestamp":1637751779000},"page":"91-125","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["On the inexact scaled gradient projection method"],"prefix":"10.1007","volume":"81","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5758-0320","authenticated-orcid":false,"given":"O. P.","family":"Ferreira","sequence":"first","affiliation":[]},{"given":"M.","family":"Lemes","sequence":"additional","affiliation":[]},{"given":"L. F.","family":"Prudente","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,11,24]]},"reference":[{"key":"331_CR1","doi-asserted-by":"crossref","unstructured":"Aguiar, A.A., Ferreira, O.P., Prudente, L.F.: Inexact gradient projection method with relative error tolerance. arXiv preprint arXiv:2101.11146 (2021)","DOI":"10.1007\/s10589-021-00331-1"},{"key":"331_CR2","doi-asserted-by":"publisher","DOI":"10.1080\/02331934.2021.1902520","author":"AA Aguiar","year":"2021","unstructured":"Aguiar, A.A., Ferreira, O.P., Prudente, L.F.: Subgradient method with feasible inexact projections for constrained convex optimization problems. Optimization (2021). https:\/\/doi.org\/10.1080\/02331934.2021.1902520","journal-title":"Optimization"},{"issue":"4","key":"331_CR3","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1080\/02331934.2011.641126","volume":"61","author":"M Ahookhosh","year":"2012","unstructured":"Ahookhosh, M., Amini, K., Bahrami, S.: A class of nonmonotone Armijo-type line search method for unconstrained optimization. Optimization 61(4), 387\u2013404 (2012)","journal-title":"Optimization"},{"key":"331_CR4","unstructured":"Allen-Zhu, Z., Hazan, E., Hu, W., Li, Y.: Linear convergence of a Frank\u2013Wolfe type algorithm over trace-norm balls. In: Proceedings of the 31st International Conference on Neural Information Processing Systems, NIPS\u201917, pp 6192\u20136201, Red Hook, NY, USA, 2017. Curran Associates Inc"},{"issue":"2","key":"331_CR5","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1093\/imanum\/drh020","volume":"25","author":"R Andreani","year":"2005","unstructured":"Andreani, R., Birgin, E.G., Mart\u00ednez, J.M., Yuan, J.: Spectral projected gradient and variable metric methods for optimization with linear inequalities. IMA J. Numer. Anal. 25(2), 221\u2013252 (2005)","journal-title":"IMA J. Numer. Anal."},{"issue":"3","key":"331_CR6","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1007\/s10589-007-9025-0","volume":"38","author":"A Auslender","year":"2007","unstructured":"Auslender, A., Silva, P.J.S., Teboulle, M.: Nonmonotone projected gradient methods based on barrier and Euclidean distances. Comput. Optim. Appl. 38(3), 305\u2013327 (2007)","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"331_CR7","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."},{"key":"331_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-9467-7","volume-title":"Convex Analysis and Monotone Operator Theory in Hilbert Spaces","author":"HH Bauschke","year":"2011","unstructured":"Bauschke, H.H., Combettes, P.L.: Convex Analysis and Monotone Operator Theory in Hilbert Spaces, 1st edn. Springer Publishing Company, Incorporated, Berlin (2011)","edition":"1"},{"issue":"2","key":"331_CR9","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/s001860300327","volume":"59","author":"A Beck","year":"2004","unstructured":"Beck, A., Teboulle, M.: A conditional gradient method with linear rate of convergence for solving convex linear systems. Math. Methods Oper. Res. 59(2), 235\u2013247 (2004)","journal-title":"Math. Methods Oper. Res."},{"key":"331_CR10","doi-asserted-by":"crossref","unstructured":"Bello Cruz, J.Y., Lucambio P\u00e9rez, L.R.: Convergence of a projected gradient method variant for quasiconvex objectives. Nonlinear Anal. 73(9), 2917\u20132922 (2010)","DOI":"10.1016\/j.na.2010.06.051"},{"issue":"2","key":"331_CR11","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1109\/TAC.1976.1101194","volume":"21","author":"DP Bertsekas","year":"1976","unstructured":"Bertsekas, D.P.: On the Goldstein\u2013Levitin\u2013Polyak gradient projection method. IEEE Trans. Autom. Control 21(2), 174\u2013184 (1976)","journal-title":"IEEE Trans. Autom. Control"},{"key":"331_CR12","series-title":"Athena Scientific Optimization and Computation Series","volume-title":"Nonlinear Programming","author":"DP Bertsekas","year":"1999","unstructured":"Bertsekas, D.P.: Nonlinear Programming. Athena Scientific Optimization and Computation Series, 2nd edn. Athena Scientific, Belmont, MA (1999)","edition":"2"},{"issue":"4","key":"331_CR13","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., Mart\u00ednez, 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":"331_CR14","doi-asserted-by":"publisher","first-page":"1196","DOI":"10.1137\/S1052623497330963","volume":"10","author":"EG Birgin","year":"2000","unstructured":"Birgin, E.G., Mart\u00ednez, J.M., Raydan, M.: Nonmonotone spectral projected gradient methods on convex sets. SIAM J. Optim. 10(4), 1196\u20131211 (2000). https:\/\/doi.org\/10.1137\/S1052623497330963","journal-title":"SIAM J. Optim."},{"issue":"3","key":"331_CR15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.18637\/jss.v060.i03","volume":"60","author":"EG Birgin","year":"2014","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)","journal-title":"J. Stat. Softw."},{"issue":"4","key":"331_CR16","doi-asserted-by":"crossref","first-page":"1405","DOI":"10.1137\/03060062X","volume":"26","author":"EG Birgin","year":"2005","unstructured":"Birgin, E.G., Raydan, M.: Robust stopping criteria for Dykstra\u2019s algorithm. SIAM J. Sci. Comput. 26(4), 1405\u20131414 (2005)","journal-title":"SIAM J. Sci. Comput."},{"issue":"2","key":"331_CR17","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."},{"key":"331_CR18","doi-asserted-by":"crossref","unstructured":"Bonettini, S., Porta, F., Prato, M., Rebegoldi, S., Ruggiero, V., Zanni, L.: Recent advances in variable metric first-order methods. In: Computational Methods for Inverse Problems in Imaging, pp. 1\u201331. Springer (2019)","DOI":"10.1007\/978-3-030-32882-5_1"},{"key":"331_CR19","doi-asserted-by":"crossref","unstructured":"Bonettini, S., Prato, M.: New convergence results for the scaled gradient projection method. Inverse Problems 20, 31(9):095008, (2015)","DOI":"10.1088\/0266-5611\/31\/9\/095008"},{"key":"331_CR20","doi-asserted-by":"crossref","unstructured":"Bonettini, S., Zanella, R., Zanni, L.: A scaled gradient projection method for constrained image deblurring. Inverse Problems 23, 25(1):015002, (2009)","DOI":"10.1088\/0266-5611\/25\/1\/015002"},{"issue":"2","key":"331_CR21","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1137\/16M1080173","volume":"60","author":"L Bottou","year":"2018","unstructured":"Bottou, L., Curtis, F.E., Nocedal, J.: Optimization methods for large-scale machine learning. SIAM Rev. 60(2), 223\u2013311 (2018)","journal-title":"SIAM Rev."},{"key":"331_CR22","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970777","author":"S Boyd","year":"1994","unstructured":"Boyd, S., El Ghaoui, L., Feron, E., Balakrishnan, V.: Linear matrix inequalities in system and control theory. Soc. Ind. Appl. Math. (1994). https:\/\/doi.org\/10.1137\/1.9781611970777","journal-title":"Soc. Ind. Appl. Math."},{"key":"331_CR23","doi-asserted-by":"crossref","unstructured":"Boyle, J.P., Dykstra, R.L.: A method for finding projections onto the intersection of convex sets in Hilbert spaces. In: Advances in Order Restricted Statistical Inference (Iowa City, Iowa, 1985), volume\u00a037 of Lect. Notes Stat., pages 28\u201347. Springer, Berlin (1986)","DOI":"10.1007\/978-1-4613-9940-7_3"},{"key":"331_CR24","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/j.na.2012.09.008","volume":"78","author":"PL Combettes","year":"2013","unstructured":"Combettes, P.L., V\u0169, B.C.: Variable metric quasi-Fej\u00e9r monotonicity. Nonlinear Anal. 78, 17\u201331 (2013)","journal-title":"Nonlinear Anal."},{"issue":"2","key":"331_CR25","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1023\/A:1013653923062","volume":"112","author":"YH Dai","year":"2002","unstructured":"Dai, Y.H.: On the nonmonotone line search. J. Optim. Theory Appl. 112(2), 315\u2013330 (2002)","journal-title":"J. Optim. Theory Appl."},{"issue":"1","key":"331_CR26","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/s00211-004-0569-y","volume":"100","author":"Y-H Dai","year":"2005","unstructured":"Dai, Y.-H., Fletcher, R.: Projected Barzilai\u2013Borwein methods for large-scale box-constrained quadratic programming. Numer. Math. 100(1), 21\u201347 (2005)","journal-title":"Numer. Math."},{"issue":"3 Ser. A","key":"331_CR27","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1007\/s10107-005-0595-2","volume":"106","author":"Y-H Dai","year":"2006","unstructured":"Dai, Y.-H., Fletcher, R.: New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds. Math. Program. 106(3 Ser. A), 403\u2013421 (2006)","journal-title":"Math. Program."},{"issue":"3","key":"331_CR28","doi-asserted-by":"crossref","first-page":"604","DOI":"10.1093\/imanum\/drl006","volume":"26","author":"Y-H Dai","year":"2006","unstructured":"Dai, Y.-H., Hager, W.W., Schittkowski, K., Zhang, H.: The cyclic Barzilai\u2013Borwein method for unconstrained optimization. IMA J. Numer. Anal. 26(3), 604\u2013627 (2006)","journal-title":"IMA J. Numer. Anal."},{"issue":"1","key":"331_CR29","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/s10589-018-0040-0","volume":"72","author":"FR de Oliveira","year":"2019","unstructured":"de Oliveira, F.R., Ferreira, O.P., Silva, G.N.: Newton\u2019s method with feasible inexact projections for solving constrained generalized equations. Comput. Optim. Appl. 72(1), 159\u2013177 (2019)","journal-title":"Comput. Optim. Appl."},{"key":"331_CR30","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":"331_CR31","unstructured":"D\u00edaz Mill\u00e1n, R., Ferreira, O.P., Prudente, L.F.: Alternating conditional gradient method for convex feasibility problems. arXiv e-prints, page arXiv:1912.04247, Dec 2019, 1912.04247"},{"issue":"2","key":"331_CR32","doi-asserted-by":"crossref","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":"384","key":"331_CR33","doi-asserted-by":"crossref","first-page":"837","DOI":"10.1080\/01621459.1983.10477029","volume":"78","author":"RL Dykstra","year":"1983","unstructured":"Dykstra, R.L.: An algorithm for restricted least squares regression. J. Am. Stat. Assoc. 78(384), 837\u2013842 (1983)","journal-title":"J. Am. Stat. Assoc."},{"key":"331_CR34","doi-asserted-by":"crossref","unstructured":"Fan, J., Wang, L., Yan, A.: An inexact projected gradient method for sparsity-constrained quadratic measurements regression. Asia-Pac. J. Oper. Res. 21, 36(2):1940008, (2019)","DOI":"10.1142\/S0217595919400086"},{"issue":"6","key":"331_CR35","doi-asserted-by":"crossref","first-page":"1365","DOI":"10.1007\/s11590-018-1353-8","volume":"13","author":"NS Fazzio","year":"2019","unstructured":"Fazzio, N.S., Schuverdt, M.L.: Convergence analysis of a nonmonotone projected gradient method for multiobjective optimization problems. Optim. Lett. 13(6), 1365\u20131379 (2019)","journal-title":"Optim. Lett."},{"issue":"4","key":"331_CR36","doi-asserted-by":"crossref","first-page":"586","DOI":"10.1109\/JSTSP.2007.910281","volume":"1","author":"MAT Figueiredo","year":"2007","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 (2007)","journal-title":"IEEE J. Sel. Top. Signal Process."},{"issue":"1","key":"331_CR37","doi-asserted-by":"crossref","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(1), 275\u2013289 (1999)","journal-title":"SIAM J. Numer. Anal."},{"key":"331_CR38","unstructured":"Garber, D., Hazan, E.: Faster rates for the Frank\u2013Wolfe method over strongly-convex sets. Proceedings of the 32nd International Conference on International Conference on Machine Learning - Volume 37, pages 541\u2013549, (2015)"},{"issue":"10","key":"331_CR39","doi-asserted-by":"crossref","first-page":"6707","DOI":"10.1109\/TIT.2018.2841379","volume":"64","author":"M Golbabaee","year":"2018","unstructured":"Golbabaee, M., Davies, M.E.: Inexact gradient projection and fast data driven compressed sensing. IEEE Trans. Inf. Theory 64(10), 6707\u20136721 (2018)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"331_CR40","doi-asserted-by":"crossref","first-page":"709","DOI":"10.1090\/S0002-9904-1964-11178-2","volume":"70","author":"AA Goldstein","year":"1964","unstructured":"Goldstein, A.A.: Convex programming in Hilbert space. Bull. Am. Math. Soc. 70, 709\u2013710 (1964)","journal-title":"Bull. Am. Math. Soc."},{"issue":"17","key":"331_CR41","doi-asserted-by":"crossref","first-page":"2754","DOI":"10.1016\/j.neucom.2011.02.019","volume":"74","author":"P Gong","year":"2011","unstructured":"Gong, P., Gai, K., Zhang, C.: Efficient Euclidean projections via piecewise root finding and its application in gradient projection. Neurocomputing 74(17), 2754\u20132766 (2011)","journal-title":"Neurocomputing"},{"issue":"2","key":"331_CR42","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1080\/10556788.2015.1082105","volume":"31","author":"DS Gon\u00e7alves","year":"2016","unstructured":"Gon\u00e7alves, D.S., Gomes-Ruggiero, M.A., Lavor, C.: A projected gradient method for optimization over density matrices. Optim. Methods Softw. 31(2), 328\u2013341 (2016). https:\/\/doi.org\/10.1080\/10556788.2015.1082105","journal-title":"Optim. Methods Softw."},{"key":"331_CR43","doi-asserted-by":"publisher","DOI":"10.1080\/02331934.2021.1887181","author":"DS Gon\u00e7alves","year":"2021","unstructured":"Gon\u00e7alves, D.S., Gon\u00e7alves, M.L.N., Menezes, T.C.: Inexact variable metric method for convex-constrained optimization problems. Optimization (2021). https:\/\/doi.org\/10.1080\/02331934.2021.1887181","journal-title":"Optimization"},{"issue":"3","key":"331_CR44","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1007\/s10589-017-9928-3","volume":"68","author":"GN Grapiglia","year":"2017","unstructured":"Grapiglia, G.N., Sachs, E.W.: On the worst-case evaluation complexity of non-monotone line search algorithms. Comput. Optim. Appl. 68(3), 555\u2013577 (2017)","journal-title":"Comput. Optim. Appl."},{"issue":"2","key":"331_CR45","doi-asserted-by":"crossref","first-page":"779","DOI":"10.1007\/s11075-020-00987-6","volume":"87","author":"GN Grapiglia","year":"2021","unstructured":"Grapiglia, G.N., Sachs, E.W.: A generalized worst-case complexity analysis for non-monotone line searches. Numer. Algorithms 87(2), 779\u2013796 (2021)","journal-title":"Numer. Algorithms"},{"key":"331_CR46","doi-asserted-by":"crossref","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)","DOI":"10.1137\/0723046"},{"issue":"3","key":"331_CR47","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1093\/imanum\/22.3.329","volume":"22","author":"NJ Higham","year":"2002","unstructured":"Higham, N.J.: Computing the nearest correlation matrix\u2014a problem from finance. IMA J. Numer. Anal. 22(3), 329\u2013343 (2002)","journal-title":"IMA J. Numer. Anal."},{"issue":"1","key":"331_CR48","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":"331_CR49","unstructured":"Jaggi, M.: Revisiting Frank-Wolfe: Projection-free sparse convex optimization. In: S.\u00a0Dasgupta and D.\u00a0McAllester (eds.), Proceedings of the 30th International Conference on Machine Learning, volume\u00a028 of Proceedings of Machine Learning Research, pp 427\u2013435, Atlanta, Georgia, USA, 17\u201319 Jun 2013. PMLR"},{"issue":"5","key":"331_CR50","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0041-5553(66)90114-5","volume":"6","author":"E Levitin","year":"1966","unstructured":"Levitin, E., Polyak, B.: Constrained minimization methods. USSR Comput. Math. Math. Phys. 6(5), 1\u201350 (1966)","journal-title":"USSR Comput. Math. Math. Phys."},{"key":"331_CR51","doi-asserted-by":"crossref","unstructured":"Ma, G., Hu, Y., Gao, H.: An accelerated momentum based gradient projection method for image deblurring. In: 2015 IEEE International Conference on Signal Processing, Communications and Computing (ICSPCC), pp 1\u20134 (2015)","DOI":"10.1109\/ICSPCC.2015.7338964"},{"issue":"1","key":"331_CR52","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/j.cam.2006.10.070","volume":"209","author":"J Mo","year":"2007","unstructured":"Mo, J., Liu, C., Yan, S.: A nonmonotone trust region method based on nonincreasing technique of weighted average of the successive function values. J. Comput. Appl. Math. 209(1), 97\u2013108 (2007)","journal-title":"J. Comput. Appl. Math."},{"key":"331_CR53","unstructured":"Mor\u00e9, J.J.: On the performance of algorithms for large-scale bound constrained problems. In: Large-Scale Numerical Optimization (Ithaca. NY, 1989), pp. 32\u201345. SIAM, Philadelphia, PA (1990)"},{"key":"331_CR54","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1017\/S096249291300007X","volume":"22","author":"Y Nesterov","year":"2013","unstructured":"Nesterov, Y., Nemirovski, A.: On first-order algorithms for $$\\ell _1$$\/nuclear norm minimization. Acta Numer. 22, 509\u2013575 (2013)","journal-title":"Acta Numer."},{"key":"331_CR55","volume-title":"Numerical Optimization","author":"J Nocedal","year":"2006","unstructured":"Nocedal, J., Wright, S.: Numerical Optimization. Springer Science & Business Media, Berlin (2006)"},{"issue":"4","key":"331_CR56","doi-asserted-by":"crossref","first-page":"1183","DOI":"10.1137\/0728063","volume":"28","author":"ER Panier","year":"1991","unstructured":"Panier, E.R., Tits, A.L.: Avoiding the Maratos effect by means of a nonmonotone line search. I. General constrained problems. SIAM J. Numer. Anal. 28(4), 1183\u20131195 (1991)","journal-title":"SIAM J. Numer. Anal."},{"issue":"10","key":"331_CR57","doi-asserted-by":"crossref","first-page":"3317","DOI":"10.1109\/TAC.2018.2805727","volume":"63","author":"A Patrascu","year":"2018","unstructured":"Patrascu, A., Necoara, I.: On the convergence of inexact projection primal first-order methods for convex minimization. IEEE Trans. Autom. Control 63(10), 3317\u20133329 (2018)","journal-title":"IEEE Trans. Autom. Control"},{"key":"331_CR58","unstructured":"Polyak, B.T.: Introduction to optimization. Translations Series in Mathematics and Engineering. Optimization Software Inc, Publications Division, New York,: Translated from the Russian. With a foreword by Dimitri P, Bertsekas (1987)"},{"issue":"2","key":"331_CR59","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1007\/s10589-020-00186-y","volume":"76","author":"J Rasch","year":"2020","unstructured":"Rasch, J., Chambolle, A.: Inexact first-order primal-dual algorithms. Comput. Optim. Appl. 76(2), 381\u2013430 (2020)","journal-title":"Comput. Optim. Appl."},{"issue":"5","key":"331_CR60","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1002\/nla.277","volume":"9","author":"M Raydan","year":"2002","unstructured":"Raydan, M., Tarazaga, P.: Primal and polar approach for computing the symmetric diagonally dominant projection. Numer. Linear Algebra Appl. 9(5), 333\u2013345 (2002)","journal-title":"Numer. Linear Algebra Appl."},{"issue":"4","key":"331_CR61","first-page":"1059","volume":"40","author":"EW Sachs","year":"2011","unstructured":"Sachs, E.W., Sachs, S.M.: Nonmonotone line searches for optimization algorithms. Control Cybern. 40(4), 1059\u20131075 (2011)","journal-title":"Control Cybern."},{"issue":"4","key":"331_CR62","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."},{"key":"331_CR63","doi-asserted-by":"crossref","unstructured":"Sra, S., Nowozin, S., Wright, S.: Optimization for Machine Learning. Neural Information Processing Series. MIT Press (2012)","DOI":"10.7551\/mitpress\/8996.001.0001"},{"key":"331_CR64","unstructured":"Tang, J., Golbabaee, M., Davies, M.E.: Gradient projection iterative sketch for large-scale constrained least-squares. In: D.\u00a0Precup and Y.\u00a0W. Teh (eds.) Proceedings of the 34th International Conference on Machine Learning, volume\u00a070 of Proceedings of Machine Learning Research, pages 3377\u20133386, International Convention Centre, Sydney, Australia, 06\u201311 Aug 2017. PMLR"},{"issue":"3","key":"331_CR65","doi-asserted-by":"crossref","first-page":"725","DOI":"10.1137\/S106482759427021X","volume":"17","author":"PL Toint","year":"1996","unstructured":"Toint, P.L.: An assessment of nonmonotone line search techniques for unconstrained optimization. SIAM J. Sci. Comput. 17(3), 725\u2013739 (1996)","journal-title":"SIAM J. Sci. Comput."},{"issue":"3","key":"331_CR66","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."},{"issue":"1","key":"331_CR67","doi-asserted-by":"crossref","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(1), 51\u201366 (2005)","journal-title":"J. Comput. Appl. Math."},{"issue":"9","key":"331_CR68","doi-asserted-by":"crossref","first-page":"1365","DOI":"10.1080\/02331934.2018.1455833","volume":"67","author":"X Yan","year":"2018","unstructured":"Yan, X., Wang, K., He, H.: On the convergence rate of scaled gradient projection method. Optimization 67(9), 1365\u20131376 (2018)","journal-title":"Optimization"},{"issue":"10","key":"331_CR69","doi-asserted-by":"publisher","first-page":"2339","DOI":"10.1080\/02331934.2019.1696338","volume":"69","author":"F Zhang","year":"2020","unstructured":"Zhang, F., Wang, H., Wang, J., Yang, K.: Inexact primal-dual gradient projection methods for nonlinear optimization on convex set. Optimization 69(10), 2339\u20132365 (2020). https:\/\/doi.org\/10.1080\/02331934.2019.1696338","journal-title":"Optimization"},{"issue":"4","key":"331_CR70","doi-asserted-by":"crossref","first-page":"1043","DOI":"10.1137\/S1052623403428208","volume":"14","author":"H Zhang","year":"2004","unstructured":"Zhang, H., Hager, W.W.: A nonmonotone line search technique and its application to unconstrained optimization. SIAM J. Optim. 14(4), 1043\u20131056 (2004)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"331_CR71","doi-asserted-by":"crossref","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."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-021-00331-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-021-00331-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-021-00331-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,13]],"date-time":"2023-11-13T02:00:59Z","timestamp":1699840859000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-021-00331-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11,24]]},"references-count":71,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,1]]}},"alternative-id":["331"],"URL":"https:\/\/doi.org\/10.1007\/s10589-021-00331-1","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[2021,11,24]]},"assertion":[{"value":"4 June 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 November 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 November 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}