{"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":1777719635446,"version":"3.51.4"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2019,12,3]],"date-time":"2019-12-03T00:00:00Z","timestamp":1575331200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,12,3]],"date-time":"2019-12-03T00:00:00Z","timestamp":1575331200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Ministry of Science of Republic of Serbia","award":["174025"],"award-info":[{"award-number":["174025"]}]},{"name":"Ministry of Science of Republic of Serbia","award":["174024"],"award-info":[{"award-number":["174024"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2020,10]]},"DOI":"10.1007\/s11075-019-00821-8","type":"journal-article","created":{"date-parts":[[2019,12,16]],"date-time":"2019-12-16T15:07:34Z","timestamp":1576508854000},"page":"449-465","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["A note on hybridization process applied on transformed double step size model"],"prefix":"10.1007","volume":"85","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5073-143X","authenticated-orcid":false,"given":"Milena J.","family":"Petrovi\u0107","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vladimir","family":"Rako\u010devi\u0107","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dragana","family":"Valjarevi\u0107","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dejan","family":"Ili\u0107","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,12,3]]},"reference":[{"key":"821_CR1","unstructured":"Andrei, N.: An unconstrained optimization test functions collection, http:\/\/www.ici.ro\/camo\/journal\/vol10\/v10a10.pdf"},{"key":"821_CR2","first-page":"61","volume":"8","author":"RP Agarwal","year":"2007","unstructured":"Agarwal, R.P., Regan, D.O., Sahu, D.R.: Iterative construction of fixed points of nearly asymptotically nonexpansive mappings. J. Nonlinear convex Anal. 8, 61\u201379 (2007)","journal-title":"J. Nonlinear convex Anal."},{"issue":"2","key":"821_CR3","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/s10915-005-9063-7","volume":"30","author":"R Artebrant","year":"2007","unstructured":"Artebrant, R.: Third order accurate non-polynomial reconstruction on rectangular and triangular meshes. J. Sci. Comp. 30(2), 193\u2013221 (2007)","journal-title":"J. Sci. Comp."},{"issue":"1","key":"821_CR4","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1137\/040620187","volume":"28","author":"R Artebrant","year":"2006","unstructured":"Artebrant, R., Schroll, H.J.: Limiter-free third order logarithmic reconstruction. SIAM J. Sci. Comput. 28(1), 359\u2013381 (2006)","journal-title":"SIAM J. Sci. Comput."},{"key":"821_CR5","doi-asserted-by":"publisher","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":"821_CR6","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1186\/1687-1812-2013-69","volume":"2013","author":"SH Khan","year":"2013","unstructured":"Khan, S.H.: A Picard-Mann hybrid iterative process. Fixed Point Theory Applic. 2013, 69 (2013). Springer Open Journal 2013","journal-title":"Fixed Point Theory Applic."},{"issue":"4","key":"821_CR7","doi-asserted-by":"publisher","first-page":"892","DOI":"10.1137\/0915054","volume":"15","author":"A Marquina","year":"1994","unstructured":"Marquina, A.: Local piecewise hyperbolic reconstruction of numerical fluxes for nonlinear scalar conservation laws. SIAM J. Sci. Comput. 15(4), 892\u2013915 (1994)","journal-title":"SIAM J. Sci. Comput."},{"key":"821_CR8","doi-asserted-by":"publisher","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":"821_CR9","unstructured":"Ortega, J.M., Rheinboldt, W.C: Iterative Solution Of Nonlinear Equation in Several Variables. Academic Press (1970)"},{"key":"821_CR10","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/j.amc.2014.10.104","volume":"250","author":"MJ Petrovi\u0107","year":"2015","unstructured":"Petrovi\u0107, M.J.: An accelerated double step size method in unconstrained optimization. Applied Math. Comput. 250, 309\u2013319 (2015)","journal-title":"Applied Math. Comput."},{"issue":"2","key":"821_CR11","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1017\/S0004972718000552","volume":"98","author":"M Petrovi\u0107","year":"2018","unstructured":"Petrovi\u0107, M., Pani\u0107, S., Carevi\u0107, M.M.: Initial improvement of the hybrid accelerated gradient descent process. Bull. Aust. Math. Soc. 98(2), 331\u2013338 (2018)","journal-title":"Bull. Aust. Math. Soc."},{"issue":"3","key":"821_CR12","doi-asserted-by":"publisher","first-page":"769","DOI":"10.1007\/s11075-017-0460-4","volume":"79","author":"M Petrovi\u0107","year":"2018","unstructured":"Petrovi\u0107, M., Rakocevi\u0107, V., Kontrec, N., Pani\u0107, S., Ili\u0107, D.: Hybridization of accelerated gradient descent method. Numer. Algor. 79(3), 769\u2013786 (2018)","journal-title":"Numer. Algor."},{"issue":"965104","key":"821_CR13","first-page":"8","volume":"2014","author":"MJ Petrovi\u0107","year":"2014","unstructured":"Petrovi\u0107, M.J., Stanimirovi\u0107, P.S.: accelerated double direction method for solving unconstrained optimization problems. Math. Problems Eng. 2014(965104), 8 (2014)","journal-title":"Math. Problems Eng."},{"issue":"Article ID 2836","key":"821_CR14","first-page":"8","volume":"2015","author":"PS Stanimirovi\u0107","year":"2015","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. Problems Eng. 2015(Article ID 283679), 8 (2015)","journal-title":"Math. Problems Eng."},{"key":"821_CR15","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."},{"issue":"1","key":"821_CR16","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1137\/03060240X","volume":"27","author":"R Artebrant","year":"2005","unstructured":"Artebrant, R., Schroll, H.J.: Conservative logarithmic reconstruction and finite volume methods. SIAM J. Sci. Comput. 27(1), 294\u2013314 (2005)","journal-title":"SIAM J. Sci. Comput."},{"key":"821_CR17","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1016\/j.amc.2003.08.058","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":"821_CR18","doi-asserted-by":"crossref","unstructured":"Rockafellar, R.T: Convex Analysis. Princeton University Press (1970)","DOI":"10.1515\/9781400873173"},{"key":"821_CR19","doi-asserted-by":"publisher","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."}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-019-00821-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11075-019-00821-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-019-00821-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,12]],"date-time":"2021-02-12T13:34:34Z","timestamp":1613136874000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11075-019-00821-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12,3]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2020,10]]}},"alternative-id":["821"],"URL":"https:\/\/doi.org\/10.1007\/s11075-019-00821-8","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,12,3]]},"assertion":[{"value":"7 May 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 September 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 December 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}