{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T02:57:39Z","timestamp":1768273059117,"version":"3.49.0"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2019,1,11]],"date-time":"2019-01-11T00:00:00Z","timestamp":1547164800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003968","name":"Iran National Science Foundation","doi-asserted-by":"crossref","award":["96013024"],"award-info":[{"award-number":["96013024"]}],"id":[{"id":"10.13039\/501100003968","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2019,12]]},"DOI":"10.1007\/s11075-019-00658-1","type":"journal-article","created":{"date-parts":[[2019,1,11]],"date-time":"2019-01-11T03:43:23Z","timestamp":1547178203000},"page":"1345-1357","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["Two\u2013parameter scaled memoryless BFGS methods with a nonmonotone choice for the initial step length"],"prefix":"10.1007","volume":"82","author":[{"given":"Saman","family":"Babaie\u2013Kafaki","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zohre","family":"Aminifard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,1,11]]},"reference":[{"issue":"6","key":"658_CR1","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1016\/j.aml.2006.06.015","volume":"20","author":"N Andrei","year":"2007","unstructured":"Andrei, N.: A scaled BFGS preconditioned conjugate gradient algorithm for unconstrained optimization. Appl. Math. Lett. 20(6), 645\u2013650 (2007)","journal-title":"Appl. Math. Lett."},{"issue":"4","key":"658_CR2","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1080\/10556780600822260","volume":"22","author":"N Andrei","year":"2007","unstructured":"Andrei, N.: Scaled memoryless BFGS preconditioned conjugate gradient algorithm for unconstrained optimization. Optim. Methods Softw. 22(4), 561\u2013571 (2007)","journal-title":"Optim. Methods Softw."},{"issue":"2","key":"658_CR3","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s11075-007-9152-9","volume":"47","author":"N Andrei","year":"2008","unstructured":"Andrei, N.: Another hybrid conjugate gradient algorithm for unconstrained optimization. Numer. Algorithms 47(2), 143\u2013156 (2008)","journal-title":"Numer. Algorithms"},{"issue":"3","key":"658_CR4","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1016\/j.ejor.2009.11.030","volume":"204","author":"N Andrei","year":"2010","unstructured":"Andrei, N.: Accelerated scaled memoryless BFGS preconditioned conjugate gradient algorithm for unconstrained optimization. Eur. J. Oper. Res. 204(3), 410\u2013420 (2010)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"658_CR5","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/s11075-017-0321-1","volume":"77","author":"N Andrei","year":"2018","unstructured":"Andrei, N.: An adaptive scaled BFGS method for unconstrained optimization. Numer. Algorithms 77(2), 413\u2013432 (2018)","journal-title":"Numer. Algorithms"},{"key":"658_CR6","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1016\/j.cam.2017.10.009","volume":"332","author":"N Andrei","year":"2018","unstructured":"Andrei, N.: A double parameter scaled BFGS method for unconstrained optimization. J. Comput. Appl. Math. 332, 26\u201344 (2018)","journal-title":"J. Comput. Appl. Math."},{"issue":"4","key":"658_CR7","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/s10288-013-0233-4","volume":"11","author":"S Babaie\u2013Kafaki","year":"2013","unstructured":"Babaie\u2013Kafaki, S.: A modified scaled memoryless BFGS preconditioned conjugate gradient method for unconstrained optimization. 4OR 11(4), 361\u2013374 (2013)","journal-title":"4OR"},{"issue":"5","key":"658_CR8","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1016\/j.cam.2013.11.001","volume":"261","author":"S Babaie\u2013Kafaki","year":"2014","unstructured":"Babaie\u2013Kafaki, S.: Two modified scaled nonlinear conjugate gradient methods. J. Comput. Appl. Math. 261(5), 172\u2013182 (2014)","journal-title":"J. Comput. Appl. Math."},{"issue":"1","key":"658_CR9","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s10957-015-0724-x","volume":"167","author":"S Babaie\u2013Kafaki","year":"2015","unstructured":"Babaie\u2013Kafaki, S.: On optimality of the parameters of self\u2013scaling memoryless quasi\u2013Newton updating formulae. J. Optim. Theory Appl. 167(1), 91\u2013101 (2015)","journal-title":"J. Optim. Theory Appl."},{"issue":"2","key":"658_CR10","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/s11075-015-0053-z","volume":"72","author":"S Babaie\u2013Kafaki","year":"2016","unstructured":"Babaie\u2013Kafaki, S.: A modified scaling parameter for the memoryless BFGS updating formula. Numer. Algorithms 72(2), 425\u2013433 (2016)","journal-title":"Numer. Algorithms"},{"issue":"3","key":"658_CR11","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/s11075-011-9457-6","volume":"58","author":"S Babaie\u2013Kafaki","year":"2011","unstructured":"Babaie\u2013Kafaki, S., Fatemi, M., Mahdavi\u2013Amiri, N.: Two effective hybrid conjugate gradient algorithms based on modified BFGS updates. Numer. Algorithms 58(3), 315\u2013331 (2011)","journal-title":"Numer. Algorithms"},{"issue":"3","key":"658_CR12","doi-asserted-by":"crossref","first-page":"465","DOI":"10.36045\/bbms\/1407765884","volume":"21","author":"S Babaie\u2013Kafaki","year":"2014","unstructured":"Babaie\u2013Kafaki, S., Ghanbari, R.: A modified scaled conjugate gradient method with global convergence for nonconvex functions. Bull. Belg. Math. Soc. Simon Stevin 21(3), 465\u2013477 (2014)","journal-title":"Bull. Belg. Math. Soc. Simon Stevin"},{"issue":"2","key":"658_CR13","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/s00245-001-0003-0","volume":"43","author":"E Birgin","year":"2001","unstructured":"Birgin, E., Mart\u00ednez, J.M.: A spectral conjugate gradient method for unconstrained optimization. Appl. Math. Optim. 43(2), 117\u2013128 (2001)","journal-title":"Appl. Math. Optim."},{"issue":"2, Ser. A","key":"658_CR14","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, Ser. A), 201\u2013213 (2002)","journal-title":"Math. Program."},{"issue":"1","key":"658_CR15","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1137\/0802003","volume":"2","author":"JC Gilbert","year":"1992","unstructured":"Gilbert, J.C., Nocedal, J.: Global convergence properties of conjugate gradient methods for optimization. SIAM J. Optim. 2(1), 21\u201342 (1992)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"658_CR16","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, revisited. ACM Trans. Math. Softw. 29(4), 373\u2013394 (2003)","journal-title":"ACM Trans. Math. Softw."},{"issue":"2","key":"658_CR17","doi-asserted-by":"publisher","first-page":"Art. 15, 5","DOI":"10.1145\/2950048","volume":"43","author":"NIM Gould","year":"2016","unstructured":"Gould, N.I.M., Scott, J.: A note on performance profiles for benchmarking software. ACM Trans. Math. Softw. 43(2), Art. 15, 5 (2016)","journal-title":"ACM Trans. Math. Softw."},{"issue":"4","key":"658_CR18","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":"658_CR19","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1145\/1132973.1132979","volume":"32","author":"WW Hager","year":"2006","unstructured":"Hager, W.W., Zhang, H.: Algorithm 851: CG_Descent, a conjugate gradient method with guaranteed descent. ACM Trans. Math. Softw. 32(1), 113\u2013137 (2006)","journal-title":"ACM Trans. Math. Softw."},{"issue":"1\u20132","key":"658_CR20","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(1\u20132), 15\u201335 (2001)","journal-title":"J. Comput. Appl. Math."},{"issue":"4","key":"658_CR21","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/S0167-6377(96)00050-8","volume":"20","author":"A Liao","year":"1997","unstructured":"Liao, A.: Modifying the BFGS method. Oper. Res. Lett. 20(4), 171\u2013177 (1997)","journal-title":"Oper. Res. Lett."},{"key":"658_CR22","volume-title":"Numerical Optimization","author":"J Nocedal","year":"2006","unstructured":"Nocedal, J., Wright, S.J.: Numerical Optimization. Springer, New York (2006)"},{"issue":"1","key":"658_CR23","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1007\/BF01580654","volume":"10","author":"SS Oren","year":"1976","unstructured":"Oren, S.S., Spedicato, E.: Optimal conditioning of self\u2013scaling variable metric algorithms. Math. Program. 10(1), 70\u201390 (1976)","journal-title":"Math. Program."},{"key":"658_CR24","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/j.cam.2017.10.024","volume":"332","author":"Y Ou","year":"2018","unstructured":"Ou, Y.: A note on the global convergence theorem of accelerated adaptive Perry conjugate gradient methods. J. Comput. Appl. Math. 332, 101\u2013106 (2018)","journal-title":"J. Comput. Appl. Math."},{"issue":"3","key":"658_CR25","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1007\/s10957-011-9960-x","volume":"153","author":"K Sugiki","year":"2012","unstructured":"Sugiki, K., Narushima, Y., Yabe, H.: Globally convergent three\u2013term conjugate gradient methods that use secant conditions and generate descent search directions for unconstrained optimization. J. Optim. Theory Appl. 153(3), 733\u2013757 (2012)","journal-title":"J. Optim. Theory Appl."},{"key":"658_CR26","volume-title":"Optimization Theory and Methods: Nonlinear Programming","author":"W Sun","year":"2006","unstructured":"Sun, W., Yuan, Y.X.: Optimization Theory and Methods: Nonlinear Programming. Springer, New York (2006)"},{"key":"658_CR27","doi-asserted-by":"publisher","DOI":"10.1002\/0471249718","volume-title":"Fundamentals of Matrix Computations","author":"DS Watkins","year":"2002","unstructured":"Watkins, D.S.: Fundamentals of Matrix Computations. Wiley, New York (2002)"},{"issue":"5","key":"658_CR28","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1080\/10556780500137041","volume":"21","author":"W Zhou","year":"2006","unstructured":"Zhou, W., Zhang, L.: A nonlinear conjugate gradient method based on the MBFGS secant condition. Optim. Methods Softw. 21(5), 707\u2013714 (2006)","journal-title":"Optim. Methods Softw."}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-019-00658-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11075-019-00658-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-019-00658-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,22]],"date-time":"2020-11-22T07:38:32Z","timestamp":1606030712000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11075-019-00658-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1,11]]},"references-count":28,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2019,12]]}},"alternative-id":["658"],"URL":"https:\/\/doi.org\/10.1007\/s11075-019-00658-1","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,1,11]]},"assertion":[{"value":"30 May 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 January 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 January 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}