{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T11:39:24Z","timestamp":1780573164521,"version":"3.54.1"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2017,12,27]],"date-time":"2017-12-27T00:00:00Z","timestamp":1514332800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2018,11]]},"DOI":"10.1007\/s11075-017-0460-4","type":"journal-article","created":{"date-parts":[[2017,12,27]],"date-time":"2017-12-27T02:13:38Z","timestamp":1514340818000},"page":"769-786","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":35,"title":["Hybridization of accelerated gradient descent method"],"prefix":"10.1007","volume":"79","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5073-143X","authenticated-orcid":false,"given":"Milena","family":"Petrovi\u0107","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Vladimir","family":"Rako\u010devi\u0107","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nata\u0161a","family":"Kontrec","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Stefan","family":"Pani\u0107","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dejan","family":"Ili\u0107","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2017,12,27]]},"reference":[{"key":"460_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":"460_CR2","unstructured":"Andrei, N.: An unconstrained optimization test functions collection. http:\/\/www.ici.ro\/camo\/journal\/vol10\/v10a10.pdf"},{"key":"460_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":"460_CR4","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1007\/978-1-4419-9467-7","volume-title":"Convex analysis and monotone operator theory in Hilbert spaces","author":"H Bauschke","year":"2011","unstructured":"Bauschke, H., Combettes, P. L.: Convex analysis and monotone operator theory in Hilbert spaces, p 144. Springer, Berlin (2011)"},{"key":"460_CR5","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1090\/S0002-9947-1936-1501880-4","volume":"40","author":"JA Clarkson","year":"1936","unstructured":"Clarkson, J.A.: Uniformly convex spaces. Trans. Am. Math. Soc. 40, 396\u2013414 (1936)","journal-title":"Trans. Am. Math. Soc."},{"key":"460_CR6","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":"460_CR7","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":"460_CR8","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":"460_CR9","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1090\/S0002-9939-1974-0336469-5","volume":"44","author":"S Ishikawa","year":"1974","unstructured":"Ishikawa, S: Fixed points by a new iteration method. Proc. Am. Math. Soc. 44, 147\u2013150 (1974)","journal-title":"Proc. Am. Math. Soc."},{"key":"460_CR10","doi-asserted-by":"crossref","unstructured":"Khan, S.H.: A Picard-Mann hybrid iterative process. Fixed Point Theory Appl. 2013, 69. Springer Open Journal (2013)","DOI":"10.1186\/1687-1812-2013-69"},{"key":"460_CR11","doi-asserted-by":"crossref","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)","DOI":"10.1007\/BFb0004506"},{"key":"460_CR12","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., Ye, Y.: Linear and nonlinear programming. Springer Science+Business Media LLC, New York (2008)"},{"key":"460_CR13","doi-asserted-by":"crossref","first-page":"506","DOI":"10.1090\/S0002-9939-1953-0054846-3","volume":"4","author":"WR Mann","year":"1953","unstructured":"Mann, W.R.: Mean value methods in iterations. Proc. Am. Math. Soc. 4, 506\u2013510 (1953)","journal-title":"Proc. Am. Math. Soc."},{"key":"460_CR14","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":"460_CR15","volume-title":"On line search algorithm with guaranteed sufficient decrease, Mathematics and Computer Science Division Preprint MCS-P153-0590","author":"JJ Mor\u00e9","year":"1990","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)"},{"issue":"3","key":"460_CR16","first-page":"543","volume":"269","author":"YeE Nesterov","year":"1983","unstructured":"Nesterov, Ye.E.: A method for solving the convex programming problem with convergence rate O ( 1 k 2 ) $(\\frac {1}{k^2})$ . Dokl. Acad. Nauk SSSR 269(3), 543\u2013547 (1983)","journal-title":"Dokl. Acad. Nauk SSSR"},{"key":"460_CR17","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 Press, New York (1970)"},{"key":"460_CR18","first-page":"309","volume":"250","author":"Petrovi\u0107 M.J.","year":"2015","unstructured":"Petrovi\u0107 M.J.: An accelerated double step size method in unconstrained optimization. Appl. Math. Comput. 250, 309\u2013319 (2015)","journal-title":"Appl. Math. Comput."},{"key":"460_CR19","doi-asserted-by":"crossref","unstructured":"Petrovi\u0107, M.J., Stanimirovi\u0107, P.S.: Accelerated double direction method for solving unconstrained optimization problems. Math. Probl. Eng. 2014, Article ID 965104, 8 pp (2014)","DOI":"10.1155\/2014\/965104"},{"key":"460_CR20","doi-asserted-by":"crossref","unstructured":"Stanimirovi\u0107, P.S., Milovanovi\u0107, G.V., Petrovi\u0107, M.J.: A transformation of accelerated double step size method for unconstrained optimization. Math. Probl. Eng. 2015, Article ID 283679, 8 pp (2015)","DOI":"10.1155\/2015\/283679"},{"key":"460_CR21","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":"460_CR22","first-page":"53","volume":"9","author":"MJD Powell","year":"1976","unstructured":"Powell, M.J.D.: Some global convergence properties of a variable-metric algorithm for minimization without exact line search. AIAM-AMS Proc. Phila. 9, 53\u201372 (1976)","journal-title":"AIAM-AMS Proc. Phila."},{"key":"460_CR23","first-page":"145","volume":"6","author":"E Picard","year":"1890","unstructured":"Picard, E: Memoire sur la theorie des equations aux derivees partielles et la methode des approximations successives. J. Math. Pures Appl. 6, 145\u2013210 (1890)","journal-title":"J. Math. Pures Appl."},{"key":"460_CR24","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":"460_CR25","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":"460_CR26","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1007\/s11075-009-9350-8","volume":"54","author":"PS Stanimirovi\u0107","year":"2010","unstructured":"Stanimirovi\u0107, P.S., Miladinovi\u0107, M.B.: Accelerated gradient descent methods with line search. Numer. Algor. 54, 503\u2013520 (2010)","journal-title":"Numer. Algor."},{"key":"460_CR27","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, Berlin (2006)"},{"key":"460_CR28","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."},{"key":"460_CR29","doi-asserted-by":"crossref","DOI":"10.1142\/5021","volume-title":"Convex analysis in general vector spaces","author":"C Zalinescu","year":"2002","unstructured":"Zalinescu, C.: Convex analysis in general vector spaces. World Scientific, Singapore (2002)"}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11075-017-0460-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-017-0460-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-017-0460-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,8]],"date-time":"2019-10-08T14:47:47Z","timestamp":1570546067000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11075-017-0460-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,12,27]]},"references-count":29,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,11]]}},"alternative-id":["460"],"URL":"https:\/\/doi.org\/10.1007\/s11075-017-0460-4","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,12,27]]}}}