{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T11:00:35Z","timestamp":1777719635442,"version":"3.51.4"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2009,12,10]],"date-time":"2009-12-10T00:00:00Z","timestamp":1260403200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2010,8]]},"DOI":"10.1007\/s11075-009-9350-8","type":"journal-article","created":{"date-parts":[[2009,12,9]],"date-time":"2009-12-09T01:25:31Z","timestamp":1260321931000},"page":"503-520","source":"Crossref","is-referenced-by-count":50,"title":["Accelerated gradient descent methods with line search"],"prefix":"10.1007","volume":"54","author":[{"given":"Predrag S.","family":"Stanimirovi\u0107","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marko B.","family":"Miladinovi\u0107","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,12,10]]},"reference":[{"key":"9350_CR1","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/s11075-006-9023-9","volume":"42","author":"N Andrei","year":"2006","unstructured":"Andrei, N.: An acceleration of gradient descent algorithm with backtracking for unconstrained optimization. Numer. Algor. 42, 63\u201373 (2006)","journal-title":"Numer. Algor."},{"key":"9350_CR2","unstructured":"Andrei, N.: An unconstrained optimization test functions collection. http:\/\/www.ici.ro\/camo\/journal\/vol10\/v10a10.pdf"},{"key":"9350_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.2140\/pjm.1966.16.1","volume":"6","author":"L Armijo","year":"1966","unstructured":"Armijo, L.: Minimization of functions having Lipschitz first partial derivatives. Pac. J. Math 6, 1\u20133 (1966)","journal-title":"Pac. J. Math"},{"key":"9350_CR4","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 method. IMA J. Numer. Anal. 8, 141\u2013148 (1988)","journal-title":"IMA J. Numer. Anal."},{"key":"9350_CR5","unstructured":"Dai, Y.H.: Alternate step gradient method. Report AMSS\u20132001\u2013041, Academy of Mathematics and Systems Sciences, Chinese Academy of Sciences (2001)"},{"key":"9350_CR6","unstructured":"Dai, Y.H., Fletcher, R.: On the asymptotic behaviour of some new gradient methods. Numerical Analysis Report, NA\/212, Dept. of Math. University of Dundee, Scotland, UK (2003)"},{"key":"9350_CR7","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1023\/A:1014838419611","volume":"22","author":"YH Dai","year":"2002","unstructured":"Dai, Y.H., Yuan, J.Y., Yuan, Y.: Modified two-point step-size gradient methods for unconstrained optimization. Comput. Optim. Appl. 22, 103\u2013109 (2002)","journal-title":"Comput. Optim. Appl."},{"key":"9350_CR8","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1093\/imanum\/23.3.377","volume":"23","author":"YH Dai","year":"2003","unstructured":"Dai, Y.H., Yuan, Y.: Alternate minimization gradient method. IMA J. Numer. Anal. 23, 377\u2013393 (2003)","journal-title":"IMA J. Numer. Anal."},{"key":"9350_CR9","doi-asserted-by":"crossref","first-page":"181","DOI":"10.3934\/jimo.2005.1.181","volume":"1","author":"YH Dai","year":"2005","unstructured":"Dai, Y.H., Yuan, Y.: Analysis of monotone gradient methods. J. Ind. Manage. Optim. 1, 181\u2013192 (2005)","journal-title":"J. Ind. Manage. Optim."},{"key":"9350_CR10","unstructured":"Dai, Y.H., Zhang, H.: An adaptive two-point step-size gradient method. Research report, Institute of Computational Mathematics and Scientific\/Engineering Computing, Chinese Academy of Sciences (2001)"},{"key":"9350_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1093\/imanum\/22.1.1","volume":"22","author":"YH Dai","year":"2002","unstructured":"Dai, Y.H., Liao, L.Z.: R-linear convergence of the Barzilai and Borwein gradient method. IMA J. Numer. Anal. 22, 1\u201310 (2002)","journal-title":"IMA J. Numer. Anal."},{"key":"9350_CR12","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1093\/comjnl\/7.2.149","volume":"7","author":"R Fletcher","year":"1964","unstructured":"Fletcher, R., Reeves, C.M.: Function minimization by conjugate gradients. Comput. J. 7, 149\u2013154 (1964)","journal-title":"Comput. J."},{"key":"9350_CR13","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1137\/S003614299427315X","volume":"36","author":"A Friedlander","year":"1999","unstructured":"Friedlander, A., Martinez, 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":"9350_CR14","first-page":"147","volume":"3","author":"AA Goldstein","year":"1965","unstructured":"Goldstein, A.A.: On steepest descent. SIAM J. Control 3, 147\u2013151 (1965)","journal-title":"SIAM J. Control"},{"key":"9350_CR15","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/BFb0004506","volume-title":"Optimization and Optimal Control","author":"C Lemar\u00e9chal","year":"1981","unstructured":"Lemar\u00e9chal, C.: A view of line search. In: Auslander, A., Oetti, W., Stoer J. (eds.) Optimization and Optimal Control, pp. 59\u201378. Springer, Berlin (1981)"},{"key":"9350_CR16","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-74503-9","volume-title":"Linear and nonlinear programming","author":"DG Luenberg","year":"2008","unstructured":"Luenberg, D.G., and Ye, Y.: Linear and nonlinear programming. Springer Science + Business Media, LLC, New York (2008)"},{"key":"9350_CR17","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/BF02143126","volume":"13","author":"B Molina","year":"1996","unstructured":"Molina, B., Raydan, M.: Preconditioned Barzilai\u2013Borwein method for the numerical solution of partial differential equations. Numer. Algor. 13, 45\u201360 (1996)","journal-title":"Numer. Algor."},{"key":"9350_CR18","unstructured":"Mor\u00e9, J.J., Thuente, D.J.: On line search algorithm with guaranteed sufficient decrease. Mathematics and Computer Science Division Preprint MCS-P153-0590, Argone National Laboratory, Argone (1990)"},{"key":"9350_CR19","volume-title":"Iterative Solution Of Nonlinear Equation in Several Variables","author":"JM Ortega","year":"1970","unstructured":"Ortega, J.M., Rheinboldt, W.C.: Iterative Solution Of Nonlinear Equation in Several Variables. Academic, London (1970)"},{"key":"9350_CR20","first-page":"35","volume":"16","author":"E Polak","year":"1969","unstructured":"Polak, E., Ribi\u00e9re, G.: Note sur la convergence de m\u00e9thodes de directions conjugu\u00e9es. Revue Francaise Informat. Reserche Op\u00e9rationnelle, 3e Ann\u00e9e 16, 35\u201343 (1969)","journal-title":"Reserche Op\u00e9rationnelle, 3e Ann\u00e9e"},{"key":"9350_CR21","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1016\/0041-5553(69)90035-4","volume":"9","author":"BT Polyak","year":"1969","unstructured":"Polyak, B.T.: The conjugate gradient method in extreme problems. USSR Comp. Math. Math. Phys. 9, 94\u2013112 (1969)","journal-title":"USSR Comp. Math. Math. Phys."},{"key":"9350_CR22","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1007\/BF02193062","volume":"85","author":"FA Potra","year":"1995","unstructured":"Potra, F.A., Shi, Y.: Efficient line search algorithm for unconstrained optimization. J. Optim. Theory Appl. 85, 677\u2013704 (1995)","journal-title":"J. Optim. Theory Appl."},{"key":"9350_CR23","unstructured":"Powell, M.J.D.: Some Global Convergence Properties of a Variable-Metric Algorithm For Minimization Without Exact Line Search, vol. 9, pp. 53\u201372. AIAM-AMS Proc., Philadelphia (1976)"},{"key":"9350_CR24","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1093\/imanum\/13.3.321","volume":"13","author":"M Raydan","year":"1993","unstructured":"Raydan, M.: On the Barzilai and Borwein choice of steplength for the gradient method. IMA J. Numer. Anal. 13, 321\u2013326 (1993)","journal-title":"IMA J. Numer. Anal."},{"key":"9350_CR25","doi-asserted-by":"crossref","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":"9350_CR26","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 (1970)"},{"key":"9350_CR27","first-page":"393","volume":"157","author":"Z-J Shi","year":"2004","unstructured":"Shi, Z.-J.: Convergence of line search methods for unconstrained optimization. Appl. Math. Comput. 157, 393\u2013405 (2004)","journal-title":"Appl. Math. Comput."},{"key":"9350_CR28","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1016\/S0377-0427(99)00276-9","volume":"114","author":"MN Vrahatis","year":"2000","unstructured":"Vrahatis, M.N., Androulakis, G.S., Lambrinos, J.N., Magoulas, G.D.: A class of gradient unconstrained minimization algorithms with adaptive step-size. J. Comp. and Appl. Math. 114, 367\u2013386 (2000)","journal-title":"J. Comp. and Appl. Math."},{"key":"9350_CR29","unstructured":"Yuan, Y.: A new stepsize for the steepest descent method. Research report, Institute of Computational Mathematics and Scientific\/Engineering Computing, Academy of Mathematics and Systems Sciences, Chinese Academy of Sciences (2004)"},{"key":"9350_CR30","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":"9350_CR31","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1137\/1011036","volume":"11","author":"P Wolfe","year":"1968","unstructured":"Wolfe, P.: Convergence conditions for ascent methods. SIAM Rev. 11, 226\u2013235 (1968)","journal-title":"SIAM Rev."}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-009-9350-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11075-009-9350-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-009-9350-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T01:08:14Z","timestamp":1559351294000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11075-009-9350-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,12,10]]},"references-count":31,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2010,8]]}},"alternative-id":["9350"],"URL":"https:\/\/doi.org\/10.1007\/s11075-009-9350-8","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,12,10]]}}}