{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,30]],"date-time":"2025-12-30T08:46:37Z","timestamp":1767084397364},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,12,10]],"date-time":"2022-12-10T00:00:00Z","timestamp":1670630400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,12,10]],"date-time":"2022-12-10T00:00:00Z","timestamp":1670630400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J. Appl. Math. Comput."],"published-print":{"date-parts":[[2023,4]]},"DOI":"10.1007\/s12190-022-01826-8","type":"journal-article","created":{"date-parts":[[2022,12,10]],"date-time":"2022-12-10T09:02:38Z","timestamp":1670662958000},"page":"2105-2133","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A hybrid BB-type method for solving large scale unconstrained optimization"],"prefix":"10.1007","volume":"69","author":[{"given":"Jian","family":"Gao","sequence":"first","affiliation":[]},{"given":"Yigui","family":"Ou","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,12,10]]},"reference":[{"key":"1826_CR1","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1137\/16M1080173","volume":"62","author":"L Bottou","year":"2018","unstructured":"Bottou, L., Curtis, F.E., Nocedal, J.: Optimization methods for large-scale machine learning. SIAM Rev. 62, 223\u2013311 (2018)","journal-title":"SIAM Rev."},{"key":"1826_CR2","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/s11075-022-01258-2","volume":"91","author":"XZ Jiang","year":"2022","unstructured":"Jiang, X.Z., Liao, W., Yin, J.H., Jian, J.B.: A new family of hybrid three-term conjugate gradient methods with applications in image restoration. Numer. Algorithms 91, 161\u2013191 (2022)","journal-title":"Numer. Algorithms"},{"key":"1826_CR3","doi-asserted-by":"publisher","first-page":"1787","DOI":"10.1007\/s12190-021-01589-8","volume":"68","author":"YF Liu","year":"2022","unstructured":"Liu, Y.F., Zhu, Z.B., Zhang, B.X.: Two sufficient descent three-term conjugate gradient methods for unconstrained optimization problems with applications in compressive sensing. J. Appl. Math. Comput. 68, 1787\u20131816 (2022)","journal-title":"J. Appl. Math. Comput."},{"key":"1826_CR4","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 method. IMA J. Numer. Anal. 8, 141\u2013148 (1988)","journal-title":"IMA J. Numer. Anal."},{"key":"1826_CR5","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1137\/S1052623494266365","volume":"7","author":"M Raydan","year":"1997","unstructured":"Raydan, M.: The Barzilai and Borwein gradient method for the large scale unconstrained minimization problem. SIAM J. Optim. 7, 26\u201333 (1997)","journal-title":"SIAM J. Optim."},{"key":"1826_CR6","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, 707\u2013716 (1986)","journal-title":"SIAM J. Numer. Anal."},{"key":"1826_CR7","doi-asserted-by":"publisher","first-page":"2986","DOI":"10.1016\/j.cam.2010.04.012","volume":"234","author":"YH Xiao","year":"2010","unstructured":"Xiao, Y.H., Wang, Q.Y., Wang, D.: Notes on the Dai-Yuan-Yuan modified spectral gradient method. J. Comput. Appl. Math. 234, 2986\u20132992 (2010)","journal-title":"J. Comput. Appl. Math."},{"key":"1826_CR8","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/s10898-008-9318-6","volume":"44","author":"W Cruz","year":"2009","unstructured":"Cruz, W., Noguera, G.: Hybrid spectral gradient method for the unconstrained minimization problem. J. Glob. Optim. 44, 193\u2013212 (2009)","journal-title":"J. Glob. Optim."},{"key":"1826_CR9","doi-asserted-by":"publisher","first-page":"626","DOI":"10.1007\/s10957-012-0265-5","volume":"158","author":"F Biglari","year":"2013","unstructured":"Biglari, F., Solimanpur, M.: Scaling on the spectral gradient method. J. Optim. Theory Appl. 158, 626\u2013635 (2013)","journal-title":"J. Optim. Theory Appl."},{"key":"1826_CR10","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1080\/00207160.2015.1009903","volume":"93","author":"F Arzani","year":"2016","unstructured":"Arzani, F., Reza Peyghami, M.: A new nonmonotone filter Barzilai\u2013Borwein method for solving unconstrained optimization problems. Int. J. Comput. Math. 93, 596\u2013608 (2016)","journal-title":"Int. J. Comput. Math."},{"key":"1826_CR11","doi-asserted-by":"publisher","first-page":"1421","DOI":"10.1007\/s40314-016-0308-x","volume":"36","author":"H Lakhbab","year":"2017","unstructured":"Lakhbab, H., Bernoussi, S.E.: Hybrid nonmonotone spectral gradient method for the unconstrained minimization problem. Comput. Appl. Math. 36, 1421\u20131430 (2017)","journal-title":"Comput. Appl. Math."},{"key":"1826_CR12","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/s10589-019-00107-8","volume":"74","author":"YH Dai","year":"2019","unstructured":"Dai, Y.H., Huang, Y.K., Liu, X.W.: A family of spectral gradient methods for optimization. Comput. Optim. Appl. 74, 43\u201365 (2019)","journal-title":"Comput. Optim. Appl."},{"key":"1826_CR13","doi-asserted-by":"publisher","unstructured":"Sim, H.S., Chen, C.Y., Leong, W.J., Li, J.: Nonmonotone spectral gradient method based on memoryless symmetric rank-one update for large-scale unconstrained optimization. J. Ind. Manag. Optim. (2021), Published online, https:\/\/doi.org\/10.3934\/jimo.2021143","DOI":"10.3934\/jimo.2021143"},{"key":"1826_CR14","first-page":"176","volume":"318","author":"D Serafino","year":"2018","unstructured":"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":"1826_CR15","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s11075-017-0365-2","volume":"78","author":"ZX Liu","year":"2018","unstructured":"Liu, Z.X., Liu, H.W.: An efficient gradient method with approximate optimal stepsize for large-scale unconstrained optimization. Numer. Algorithms 78, 21\u201339 (2018)","journal-title":"Numer. Algorithms"},{"key":"1826_CR16","doi-asserted-by":"publisher","first-page":"2403","DOI":"10.1051\/ro\/2022107","volume":"56","author":"ZX Liu","year":"2022","unstructured":"Liu, Z.X., Chu, W.L., Liu, H.W., Liu, Z.: An efficient gradient method with approximately optimal stepsizes based on regularization models for unconstrained optimization. RAIRO Oper. Res. 56, 2403\u20132424 (2022)","journal-title":"RAIRO Oper. Res."},{"key":"1826_CR17","doi-asserted-by":"publisher","first-page":"1511","DOI":"10.1007\/s11425-016-0279-2","volume":"59","author":"YH Dai","year":"2016","unstructured":"Dai, Y.H., Kou, C.X.: A Barzilai\u2013Borwein conjugate gradient method. Sci. China Math. 59, 1511\u20131524 (2016)","journal-title":"Sci. China Math."},{"key":"1826_CR18","first-page":"119","volume":"25","author":"C Sun","year":"2021","unstructured":"Sun, C., Zhang, Y.: A brief review on gradient method. Oper. Res. Trans. 25, 119\u2013132 (2021)","journal-title":"Oper. Res. Trans."},{"key":"1826_CR19","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/BF00941054","volume":"62","author":"AA Brown","year":"1989","unstructured":"Brown, A.A., Biggs, M.C.: Some effective methods for unconstrained optimization based on the solution of system of ordinary differentiable equations. J. Optim. Theory Appl. 62, 211\u2013224 (1989)","journal-title":"J. Optim. Theory Appl."},{"key":"1826_CR20","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1023\/B:JOGO.0000015310.27011.02","volume":"28","author":"LZ Liao","year":"2004","unstructured":"Liao, L.Z., Qi, H.D., Qi, L.Q.: Neurodynamical optimization. J. Glob. Optim. 28, 175\u2013195 (2004)","journal-title":"J. Glob. Optim."},{"key":"1826_CR21","first-page":"449","volume":"15","author":"LX Han","year":"1993","unstructured":"Han, L.X.: On the convergence properties of an ODE algorithm for unconstrained optimization. Math. Numer. Sin. 15, 449\u2013455 (1993)","journal-title":"Math. Numer. Sin."},{"key":"1826_CR22","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1137\/S0036142998335972","volume":"37","author":"DJ Higham","year":"1999","unstructured":"Higham, D.J.: Trust region algorithms and timestep selection. SIAM J. Numer. Anal. 37, 194\u2013210 (1999)","journal-title":"SIAM J. Numer. Anal."},{"key":"1826_CR23","first-page":"257","volume":"4","author":"LH Zhang","year":"2008","unstructured":"Zhang, L.H., Kelley, C.T., Liao, L.Z.: A continuous Newton-type method for unconstrained optimization. Pac. J. Optim. 4, 257\u2013277 (2008)","journal-title":"Pac. J. Optim."},{"key":"1826_CR24","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/s10957-008-9469-0","volume":"140","author":"XL Luo","year":"2009","unstructured":"Luo, X.L., Kelley, C.T., Liao, L.Z., Tam, H.W.: Combining trust-region techniques and Rosenbrock methods to compute stationary points. J. Optim. Theory Appl. 140, 265\u2013286 (2009)","journal-title":"J. Optim. Theory Appl."},{"key":"1826_CR25","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/s12190-012-0635-z","volume":"42","author":"YG Ou","year":"2013","unstructured":"Ou, Y.G., Liu, Y.Y.: An ODE-based nonmonotone method for unconstrained optimization problems. J. Appl. Math. Comput. 42, 351\u2013369 (2013)","journal-title":"J. Appl. Math. Comput."},{"key":"1826_CR26","doi-asserted-by":"publisher","first-page":"900","DOI":"10.1016\/j.apnum.2011.03.002","volume":"61","author":"YG Ou","year":"2011","unstructured":"Ou, Y.G.: A hybrid trust region algorithm for unconstrained optimization. Appl. Numer. Math. 61, 900\u2013909 (2011)","journal-title":"Appl. Numer. Math."},{"key":"1826_CR27","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/s10957-010-9719-9","volume":"147","author":"J Chen","year":"2010","unstructured":"Chen, J., Qi, L.Q.: Pseudotransient continuation for solving systems of nonsmooth equations with inequality constraints. J. Optim. Theory Appl. 147, 223\u2013242 (2010)","journal-title":"J. Optim. Theory Appl."},{"key":"1826_CR28","doi-asserted-by":"publisher","first-page":"183","DOI":"10.3934\/jimo.2011.7.183","volume":"7","author":"L Wang","year":"2011","unstructured":"Wang, L., Li, Y., Zhang, L.W.: A differential equation method for solving box constrained variational inequality problems. J. Ind. Manag. Optim. 7, 183\u2013198 (2011)","journal-title":"J. Ind. Manag. Optim."},{"key":"1826_CR29","first-page":"77","volume":"9","author":"CT Kelley","year":"2013","unstructured":"Kelley, C.T., Liao, L.Z.: Explicit pseudo-transient continuation. Pac. J. Optim. 9, 77\u201391 (2013)","journal-title":"Pac. J. Optim."},{"key":"1826_CR30","doi-asserted-by":"publisher","unstructured":"Luo, X.L., Xiao, H., Lv, J.H.: Continuation Newton methods with the residual trust-region time-stepping scheme for nonlinear equations. Numer. Algorithms (2021), Published online https:\/\/doi.org\/10.1007\/s11075-021-01112-x","DOI":"10.1007\/s11075-021-01112-x"},{"key":"1826_CR31","doi-asserted-by":"publisher","first-page":"1705","DOI":"10.1007\/s11075-020-00950-5","volume":"86","author":"ZZ Tan","year":"2021","unstructured":"Tan, Z.Z., Hu, R., Fang, Y.P.: A new method for solving split equality problems via projection dynamical systems. Numer. Algorithms 86, 1705\u20131719 (2021)","journal-title":"Numer. Algorithms"},{"key":"1826_CR32","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1016\/j.apnum.2021.02.019","volume":"165","author":"XL Luo","year":"2021","unstructured":"Luo, X.L., Xiao, H., Lv, J.H., Zhang, S.: Explicit pseudo-transient continuation and the trust-region updating strategy for unconstrained optimization. Appl. Numer. Math. 165, 290\u2013302 (2021)","journal-title":"Appl. Numer. Math."},{"key":"1826_CR33","unstructured":"Sun, W.Y., Yuan, Y.X.: Optimization Theory and Methods: Nonlinear Programming. Springer Optimization and its Applications, vol. 1. Springer, New York, (2006)"},{"key":"1826_CR34","first-page":"1156","volume":"175","author":"ZX Wei","year":"2006","unstructured":"Wei, Z.X., Li, G.Y., Qi, L.Q.: New quasi-Newton methods for unconstrained optimization problems. Appl. Math. Comput. 175, 1156\u20131188 (2006)","journal-title":"Appl. Math. Comput."},{"key":"1826_CR35","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1023\/A:1021898630001","volume":"102","author":"JZ Zhang","year":"1999","unstructured":"Zhang, J.Z., Deng, N.Y., Chen, L.H.: New quasi-Newton equation and related methods for unconstrained optimization. J. Optim. Theory Appl. 102, 147\u2013167 (1999)","journal-title":"J. Optim. Theory Appl."},{"key":"1826_CR36","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/S0377-0427(00)00540-9","volume":"129","author":"DH Li","year":"2001","unstructured":"Li, D.H., Fukushima, M.: A modified BFGS method and its global convergence in nonconvex minimization. J. Comput. Appl. Math. 129, 15\u201335 (2001)","journal-title":"J. Comput. Appl. Math."},{"key":"1826_CR37","doi-asserted-by":"publisher","first-page":"2019","DOI":"10.1007\/s11425-011-4232-7","volume":"54","author":"S Babaie-Kafaki","year":"2011","unstructured":"Babaie-Kafaki, S.: A modified BFGS algorithm based on a hybrid secant equation. Sci. China Math. 54, 2019\u20132036 (2011)","journal-title":"Sci. China Math."},{"key":"1826_CR38","doi-asserted-by":"publisher","first-page":"2158","DOI":"10.1016\/j.camwa.2007.08.038","volume":"55","author":"NZ Gu","year":"2008","unstructured":"Gu, N.Z., Mo, J.T.: Incorporating nonmonotone strategies into the trust region method for unconstrained optimization. Comput. Math. Appl. 55, 2158\u20132172 (2008)","journal-title":"Comput. Math. Appl."},{"key":"1826_CR39","doi-asserted-by":"publisher","first-page":"1043","DOI":"10.1137\/S1052623403428208","volume":"14","author":"HC Zhang","year":"2004","unstructured":"Zhang, H.C., Hager, W.W.: A nonmonotone line search technique and its applications to unconstrained optimization. SIAM J. Optim. 14, 1043\u20131056 (2004)","journal-title":"SIAM J. Optim."},{"key":"1826_CR40","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1137\/030601880","volume":"16","author":"WW Hager","year":"2005","unstructured":"Hager, W.W., Zhang, H.C.: A new conjugate gradient method with guaranteed descent and an efficient line search. SIAM J. Optim. 16, 170\u2013192 (2005)","journal-title":"SIAM J. Optim."},{"key":"1826_CR41","first-page":"147","volume":"10","author":"N Andrei","year":"2008","unstructured":"Andrei, N.: An unconstrained optimization test functions collection. Adv. Model. Optim. 10, 147\u2013161 (2008)","journal-title":"Adv. Model. Optim."},{"key":"1826_CR42","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1145\/962437.962439","volume":"29","author":"NIM Gould","year":"2003","unstructured":"Gould, N.I.M., Orban, D., Toint, P.L.: CUTEr: A constrained and unconstrained testing environment, revised. Trans. Math. Softw. 29, 373\u2013394 (2003)","journal-title":"Trans. Math. Softw."},{"key":"1826_CR43","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"ED Dolan","year":"2002","unstructured":"Dolan, E.D., More, J.J.: Benchmarking optimization software with performance profiles. Math. Program. Ser. A 91, 201\u2013213 (2002)","journal-title":"Math. Program. Ser. A"}],"container-title":["Journal of Applied Mathematics and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-022-01826-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12190-022-01826-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-022-01826-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,20]],"date-time":"2023-03-20T23:02:41Z","timestamp":1679353361000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12190-022-01826-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12,10]]},"references-count":43,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,4]]}},"alternative-id":["1826"],"URL":"https:\/\/doi.org\/10.1007\/s12190-022-01826-8","relation":{},"ISSN":["1598-5865","1865-2085"],"issn-type":[{"value":"1598-5865","type":"print"},{"value":"1865-2085","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,12,10]]},"assertion":[{"value":"14 August 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 November 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 December 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 December 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}