{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T06:30:51Z","timestamp":1777703451304,"version":"3.51.4"},"reference-count":31,"publisher":"Informa UK Limited","issue":"2","license":[{"start":{"date-parts":[[2024,12,9]],"date-time":"2024-12-09T00:00:00Z","timestamp":1733702400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100021856","name":"Ministero dell'Universit\u00e0 e della Ricerca","doi-asserted-by":"crossref","award":["2022J9SNP"],"award-info":[{"award-number":["2022J9SNP"]}],"id":[{"id":"10.13039\/501100021856","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100021856","name":"Ministero dell'Universit\u00e0 e della Ricerca","doi-asserted-by":"crossref","award":["2022N3ZNAX"],"award-info":[{"award-number":["2022N3ZNAX"]}],"id":[{"id":"10.13039\/501100021856","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Fundaccao para a Ciencia e a Tecnologia","award":["UIDB\/MAT\/00297\/2020"],"award-info":[{"award-number":["UIDB\/MAT\/00297\/2020"]}]},{"name":"Fundaccao para a Ciencia e a Tecnologia","award":["UIDP\/MAT\/00297\/2020"],"award-info":[{"award-number":["UIDP\/MAT\/00297\/2020"]}]},{"name":"Ministry of Education, Science and Technological Development, Republic of Serbia"},{"DOI":"10.13039\/100009112","name":"Istituto Nazionale di Alta Matematica \"Francesco Severi\"","doi-asserted-by":"crossref","award":["INdAM GNCS project"],"award-info":[{"award-number":["INdAM GNCS project"]}],"id":[{"id":"10.13039\/100009112","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["www.tandfonline.com"],"crossmark-restriction":true},"short-container-title":["Optimization Methods and Software"],"published-print":{"date-parts":[[2026,3,4]]},"DOI":"10.1080\/10556788.2024.2426620","type":"journal-article","created":{"date-parts":[[2024,12,9]],"date-time":"2024-12-09T23:18:27Z","timestamp":1733786307000},"page":"524-549","update-policy":"https:\/\/doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":5,"title":["SLiSeS: subsampled line search spectral gradient method for finite sums"],"prefix":"10.1080","volume":"41","author":[{"given":"Stefania","family":"Bellavia","sequence":"first","affiliation":[{"name":"University of Florence","place":["Florence, Italy"]},{"name":"INDAM-GNCS Research group","place":["Roma, Italy"]}]},{"given":"Nata\u0161a","family":"Kreji\u0107","sequence":"additional","affiliation":[{"name":"University of Novi Sad","place":["Novi Sad, Serbia"]}]},{"given":"Nata\u0161a","family":"Krklec Jerinki\u0107","sequence":"additional","affiliation":[{"name":"University of Novi Sad","place":["Novi Sad, Serbia"]}]},{"given":"Marcos","family":"Raydan","sequence":"additional","affiliation":[{"name":"Center for Mathematics and Applications (NovaMath), FCT NOVA","place":["Caparica, Portugal"]}]}],"member":"301","published-online":{"date-parts":[[2024,12,9]]},"reference":[{"key":"e_1_3_5_2_1","doi-asserted-by":"publisher","DOI":"10.1093\/imanum\/8.1.141"},{"key":"e_1_3_5_3_1","doi-asserted-by":"publisher","DOI":"10.2478\/caim-2020-0002"},{"key":"e_1_3_5_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-03009-4_78-1"},{"key":"e_1_3_5_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-022-00430-7"},{"key":"e_1_3_5_6_1","doi-asserted-by":"publisher","DOI":"10.18637\/jss.v060.i03"},{"key":"e_1_3_5_7_1","doi-asserted-by":"publisher","DOI":"10.1137\/17M1154679"},{"key":"e_1_3_5_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/16M1080173"},{"key":"e_1_3_5_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2020.3003539"},{"key":"e_1_3_5_10_1","doi-asserted-by":"publisher","DOI":"10.1287\/ijoo.2018.0010"},{"key":"e_1_3_5_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-004-0516-9"},{"key":"e_1_3_5_12_1","doi-asserted-by":"publisher","DOI":"10.1093\/imanum\/drl006"},{"key":"e_1_3_5_13_1","doi-asserted-by":"publisher","DOI":"10.1093\/imanum\/drs056"},{"key":"e_1_3_5_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2017.07.037"},{"key":"e_1_3_5_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-43421-1_18"},{"key":"e_1_3_5_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-023-00455-6"},{"key":"e_1_3_5_17_1","first-page":"165","article-title":"Low storage methods for unconstrained optimization","volume":"126","author":"Fletcher R.","year":"1990","unstructured":"R. Fletcher, Low storage methods for unconstrained optimization, Lect. Appl. Math. 126 (1990), pp. 165\u2013179.","journal-title":"Lect. Appl. Math."},{"key":"e_1_3_5_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/0-387-24255-4_10"},{"key":"e_1_3_5_19_1","doi-asserted-by":"publisher","DOI":"10.3934\/jimo.2008.4.299"},{"key":"e_1_3_5_20_1","doi-asserted-by":"publisher","DOI":"10.1137\/110830629"},{"key":"e_1_3_5_21_1","doi-asserted-by":"publisher","DOI":"10.1002\/jcc.540140115"},{"key":"e_1_3_5_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-019-00131-8"},{"key":"e_1_3_5_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-018-0682-6"},{"key":"e_1_3_5_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICPR48806.2021.9413313"},{"key":"e_1_3_5_25_1","doi-asserted-by":"publisher","DOI":"10.1093\/imanum\/13.3.321"},{"key":"e_1_3_5_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-12-604550-5.50015-8"},{"key":"e_1_3_5_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2018.10.022"},{"key":"e_1_3_5_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2015.03.073"},{"key":"e_1_3_5_29_1","first-page":"685","article-title":"Barzilai-borwein step size for stochastic gradient descent","volume":"29","author":"Tan C.","year":"2016","unstructured":"C. Tan, S. Ma, Y.-H. Dai, and Y. Qian, Barzilai-borwein step size for stochastic gradient descent, Adv. Neural. Inf. Process. Syst. 29 (2016), pp. 685\u2013693.","journal-title":"Adv. Neural. Inf. Process. Syst."},{"key":"e_1_3_5_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNSRE.2013.2293575"},{"key":"e_1_3_5_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2018.03.017"},{"key":"e_1_3_5_32_1","doi-asserted-by":"publisher","DOI":"10.1137\/20M1321140"}],"container-title":["Optimization Methods and Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/10556788.2024.2426620","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T09:38:44Z","timestamp":1777455524000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/10556788.2024.2426620"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,9]]},"references-count":31,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,3,4]]}},"alternative-id":["10.1080\/10556788.2024.2426620"],"URL":"https:\/\/doi.org\/10.1080\/10556788.2024.2426620","relation":{},"ISSN":["1055-6788","1029-4937"],"issn-type":[{"value":"1055-6788","type":"print"},{"value":"1029-4937","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,12,9]]},"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":"2023-05-19","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-11-03","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-12-09","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}