{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T16:13:25Z","timestamp":1772295205486,"version":"3.50.1"},"reference-count":37,"publisher":"Informa UK Limited","issue":"5","content-domain":{"domain":["www.tandfonline.com"],"crossmark-restriction":true},"short-container-title":["Optimization Methods and Software"],"published-print":{"date-parts":[[2021,9,3]]},"DOI":"10.1080\/10556788.2019.1653868","type":"journal-article","created":{"date-parts":[[2019,8,22]],"date-time":"2019-08-22T18:53:32Z","timestamp":1566500012000},"page":"998-1029","update-policy":"https:\/\/doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":12,"title":["Accelerated multiple step-size methods for solving unconstrained optimization problems"],"prefix":"10.1080","volume":"36","author":[{"given":"Branislav","family":"Ivanov","sequence":"first","affiliation":[{"name":"Technical Faculty in Bor, University of Belgrade, Bor, Serbia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0655-3741","authenticated-orcid":false,"given":"Predrag S.","family":"Stanimirovi\u0107","sequence":"additional","affiliation":[{"name":"Faculty of Sciences and Mathematics, University of Ni\u0161, Ni\u0161, Serbia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gradimir V.","family":"Milovanovi\u0107","sequence":"additional","affiliation":[{"name":"Serbian Academy of Sciences and Arts, Belgrade, Serbia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sne\u017eana","family":"Djordjevi\u0107","sequence":"additional","affiliation":[{"name":"Faculty of Technology, University of Ni\u0161, Ni\u0161, Serbia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ivona","family":"Brajevi\u0107","sequence":"additional","affiliation":[{"name":"Faculty of Sciences and Mathematics, University of Ni\u0161, Ni\u0161, Serbia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"301","published-online":{"date-parts":[[2019,8,22]]},"reference":[{"key":"CIT0001","doi-asserted-by":"publisher","DOI":"10.1007\/s11075-006-9023-9"},{"key":"CIT0002","first-page":"147","volume":"10","author":"Andrei N.","year":"2008","journal-title":"Adv. Model. Optim."},{"key":"CIT0003","unstructured":"N. Andrei, Relaxed gradient descent and a new gradient descent methods for unconstrained optimization. Visited August 19, 2018. Available at https:\/\/camo.ici.ro\/neculai\/newgrad.pdf."},{"key":"CIT0004","doi-asserted-by":"publisher","DOI":"10.1093\/imanum\/8.1.141"},{"key":"CIT0005","doi-asserted-by":"publisher","DOI":"10.1023\/A:1025551602679"},{"key":"CIT0006","unstructured":"Y.H. Dai, Alternate step gradient method, Report AMSS\u20132001\u2013041, Academy of Mathematics and Systems Sciences, Chinese Academy of Sciences, Beijing, 2001."},{"key":"CIT0007","unstructured":"Y.H. Dai and R. Fletcher, On the asymptotic behaviour of some new gradient methods, Numerical Analysis Report, NA\/212, Dept. of Math. University of Dundee, Scotland, UK, 2003."},{"key":"CIT0008","doi-asserted-by":"publisher","DOI":"10.1023\/A:1014838419611"},{"key":"CIT0009","doi-asserted-by":"publisher","DOI":"10.1093\/imanum\/23.3.377"},{"key":"CIT0010","doi-asserted-by":"publisher","DOI":"10.3934\/jimo.2005.1.181"},{"key":"CIT0011","unstructured":"Y.H. Dai and H. Zhang, An adaptive two-point step-size gradient method, Research report, Institute of Computational Mathematics and Scientific\/Engineering Computing, Chinese Academy of Sciences, Beijing, 2001."},{"key":"CIT0012","first-page":"8672","volume":"218","author":"Djordjevi\u0107 S.S.","year":"2012","journal-title":"Appl. Math. Comput."},{"key":"CIT0013","doi-asserted-by":"publisher","DOI":"10.1007\/s101070100263"},{"key":"CIT0014","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9939-1974-0336469-5"},{"key":"CIT0015","doi-asserted-by":"publisher","DOI":"10.1186\/1687-1812-2013-69"},{"key":"CIT0016","doi-asserted-by":"publisher","DOI":"10.5937\/univtho6-10134"},{"key":"CIT0017","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9939-1953-0054846-3"},{"key":"CIT0018","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-011-9864-9"},{"key":"CIT0019","doi-asserted-by":"publisher","DOI":"10.1007\/b98874"},{"key":"CIT0020","volume-title":"Iterative Solution of Nonlinear Equation in Several Variables","author":"Ortega J.M.","year":"1970"},{"key":"CIT0021","doi-asserted-by":"publisher","DOI":"10.1017\/S0004972718000552"},{"key":"CIT0022","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2014.10.104"},{"key":"CIT0023","doi-asserted-by":"publisher","DOI":"10.1155\/2014\/965104"},{"key":"CIT0024","doi-asserted-by":"publisher","DOI":"10.1155\/2018\/1523267"},{"key":"CIT0025","doi-asserted-by":"publisher","DOI":"10.1007\/s11075-017-0460-4"},{"key":"CIT0026","doi-asserted-by":"publisher","DOI":"10.5937\/univtho7-14337"},{"key":"CIT0027","first-page":"145","volume":"6","author":"Picard E.","year":"1890","journal-title":"J. Math. Pures Appl."},{"key":"CIT0028","doi-asserted-by":"publisher","DOI":"10.1023\/A:1013708715892"},{"key":"CIT0029","doi-asserted-by":"publisher","DOI":"10.1093\/imanum\/13.3.321"},{"key":"CIT0030","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623494266365"},{"key":"CIT0031","doi-asserted-by":"publisher","DOI":"10.1515\/9781400873173"},{"key":"CIT0032","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2003.08.058"},{"key":"CIT0033","doi-asserted-by":"publisher","DOI":"10.1007\/s11075-009-9350-8"},{"key":"CIT0034","doi-asserted-by":"publisher","DOI":"10.1155\/2015\/283679"},{"key":"CIT0035","volume-title":"Optimization Theory and Methods: Nonlinear Programming","author":"Sun W.","year":"2006"},{"key":"CIT0036","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-0427(99)00276-9"},{"key":"CIT0037","unstructured":"Y. Yuan, A new stepsize for the steepest descent method, J. Comput. Math. 24 (2006), pp. 149\u2013156."}],"container-title":["Optimization Methods and Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/10556788.2019.1653868","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,2]],"date-time":"2022-06-02T08:25:24Z","timestamp":1654158324000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/10556788.2019.1653868"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8,22]]},"references-count":37,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2021,9,3]]}},"alternative-id":["10.1080\/10556788.2019.1653868"],"URL":"https:\/\/doi.org\/10.1080\/10556788.2019.1653868","relation":{},"ISSN":["1055-6788","1029-4937"],"issn-type":[{"value":"1055-6788","type":"print"},{"value":"1029-4937","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,8,22]]},"assertion":[{"value":"The publishing and review policy for this title is described in its Aims & Scope.","order":1,"name":"peerreview_statement","label":"Peer Review Statement"},{"value":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=goms20","URL":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=goms20","order":2,"name":"aims_and_scope_url","label":"Aim & Scope"},{"value":"2018-08-27","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2019-08-01","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2019-08-22","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}