{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T05:34:52Z","timestamp":1761888892156,"version":"build-2065373602"},"reference-count":27,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[2017,12,1]],"date-time":"2017-12-01T00:00:00Z","timestamp":1512086400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2017,12,1]],"date-time":"2017-12-01T00:00:00Z","timestamp":1512086400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["EURO Journal on Computational Optimization"],"published-print":{"date-parts":[[2017,12]]},"DOI":"10.1007\/s13675-017-0080-8","type":"journal-article","created":{"date-parts":[[2017,1,30]],"date-time":"2017-01-30T15:50:22Z","timestamp":1485791422000},"page":"529-553","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":5,"title":["Nonsmooth spectral gradient methods for unconstrained optimization"],"prefix":"10.1016","volume":"5","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1216-9594","authenticated-orcid":false,"given":"Milagros","family":"Loreto","sequence":"first","affiliation":[]},{"given":"Hugo","family":"Aponte","sequence":"additional","affiliation":[]},{"given":"Debora","family":"Cores","sequence":"additional","affiliation":[]},{"given":"Marcos","family":"Raydan","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1007\/s13675-017-0080-8_CR1","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1093\/imanum\/8.1.141","article-title":"Two point step size gradient methods","volume":"8","author":"Barzilai","year":"1988","journal-title":"IMA J Numer Anal"},{"key":"10.1007\/s13675-017-0080-8_CR2","doi-asserted-by":"crossref","unstructured":"Birgin EG, Mart\u00ednez JM, Raydan M (2009) Spectral projected gradient methods, in encyclopedia of optimization, (2nd Edn), Floudas CA, Pardalos PM, Part 19, pp 3652\u20133659","DOI":"10.1007\/978-0-387-74759-0_629"},{"issue":"3","key":"10.1007\/s13675-017-0080-8_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.18637\/jss.v060.i03","article-title":"Spectral projected gradient methods: review and perspectives","volume":"60","author":"Birgin","year":"2014","journal-title":"J Stat Softw"},{"key":"10.1007\/s13675-017-0080-8_CR4","first-page":"77","article-title":"The simplex gradient and noisy optimization problems","volume":"24","author":"Bortz","year":"1998","journal-title":"Comput Methods Opt Des Control Prog Syst Control Theory"},{"key":"10.1007\/s13675-017-0080-8_CR5","doi-asserted-by":"crossref","first-page":"567","DOI":"10.1287\/moor.27.3.567.317","article-title":"Approximating subdifferentials by random sampling of gradients","volume":"27","author":"Burke","year":"2002","journal-title":"Math Op Res"},{"key":"10.1007\/s13675-017-0080-8_CR6","doi-asserted-by":"crossref","first-page":"751","DOI":"10.1137\/030601296","article-title":"A robust gradient sampling algorithm for nonsmooth, nonconvex optimization","volume":"15","author":"Burke","year":"2005","journal-title":"SIAM J Optim"},{"year":"1990","series-title":"Optimization and nonsmooth analysis","author":"Clarke","key":"10.1007\/s13675-017-0080-8_CR7"},{"year":"2009","series-title":"Introduction to derivative-free optimization","author":"Conn","key":"10.1007\/s13675-017-0080-8_CR8"},{"key":"10.1007\/s13675-017-0080-8_CR9","doi-asserted-by":"crossref","first-page":"3174","DOI":"10.1016\/j.cor.2005.11.024","article-title":"Spectral projected subgradient with a momentum term for the Lagrangean dual approach","volume":"34","author":"Crema","year":"2007","journal-title":"Comput Op Res"},{"key":"10.1007\/s13675-017-0080-8_CR10","doi-asserted-by":"crossref","first-page":"1302","DOI":"10.1080\/10556788.2012.714781","article-title":"An adaptive gradient sampling algorithm for non-smooth optimization","volume":"28","author":"Curtis","year":"2013","journal-title":"Optim Methods Softw"},{"key":"10.1007\/s13675-017-0080-8_CR11","unstructured":"Custodio AL (2007) Aplica\u00e7\u00f5es de Derivadas Simpl\u00e9cticas em M\u00e9todos de Procura Directa, PhD. Thesis, New University of Lisbon, Lisbon, Portugal"},{"key":"10.1007\/s13675-017-0080-8_CR12","doi-asserted-by":"crossref","first-page":"770","DOI":"10.1093\/imanum\/drn045","article-title":"Using simplex gradients of nonsmooth functions in direct search methods","volume":"28","author":"Custodio","year":"2008","journal-title":"IMA J N Anal"},{"key":"10.1007\/s13675-017-0080-8_CR13","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1137\/050646706","article-title":"Using sampling and simplex derivatives in pattern search methods","volume":"18","author":"Custodio","year":"2007","journal-title":"SIAM J Optim"},{"key":"10.1007\/s13675-017-0080-8_CR14","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1016\/j.cam.2007.07.017","article-title":"A derivative-free nonmonotone line search technique for unconstrained optimization","volume":"219","author":"Diniz-Ehrhardt","year":"2008","journal-title":"J Comput Appl Math"},{"key":"10.1007\/s13675-017-0080-8_CR15","doi-asserted-by":"crossref","unstructured":"Fletcher R (2005) On the Barzilai-Borwein method. In Qi L,Teo K, Yang X (eds) Optimization and control with applications, series in applied optimization Vol 96, Springer, New York, pp 235\u2013256","DOI":"10.1007\/0-387-24255-4_10"},{"key":"10.1007\/s13675-017-0080-8_CR16","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1007\/BF01584320","article-title":"Optimization of Lipschitz continuos functions","volume":"3","author":"Goldstein","year":"1977","journal-title":"Math Program"},{"key":"10.1007\/s13675-017-0080-8_CR17","doi-asserted-by":"crossref","first-page":"707","DOI":"10.1137\/0723046","article-title":"A nonmonotone line search technique for Newton\u2019s method","volume":"23","author":"Grippo","year":"1986","journal-title":"SIAM J Numer Anal"},{"key":"10.1007\/s13675-017-0080-8_CR18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10589-014-9665-9","article-title":"A class of derivative-free nonmonotone optimization algorithms employing coordinate rotations and gradient approximations","volume":"60","author":"Grippo","year":"2015","journal-title":"Comput Optim Appl"},{"key":"10.1007\/s13675-017-0080-8_CR19","first-page":"521","article-title":"Benchmark of Some Nonsmooth Optimization Solvers for Computing Nonconvex Proximal Points","volume":"2","author":"Hare","year":"2006","journal-title":"Pac J Optim"},{"key":"10.1007\/s13675-017-0080-8_CR20","doi-asserted-by":"crossref","unstructured":"Helou ES, Santos SA, Sim\u00f5es LEA (2016) On the differentiability check in gradient sampling. Optim Methods Softw 31(5):983\u20131007","DOI":"10.1080\/10556788.2016.1178262"},{"key":"10.1007\/s13675-017-0080-8_CR21","unstructured":"Karmitsa N (2007) Test Problems for Large-Scale Nonsmooth Minimization, Reports of the Department of Mathematical Information Technology, Series B. Scientific Computing, No. B. 4\/2007, University of Jyv\u00e4skyl\u00e4,"},{"key":"10.1007\/s13675-017-0080-8_CR22","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1137\/050639673","article-title":"Convergence of the gradient sampling algorithm for nonsmooth nonconvex optimization","volume":"18","author":"Kiwiel","year":"2007","journal-title":"SIAM J Optim"},{"key":"10.1007\/s13675-017-0080-8_CR23","doi-asserted-by":"crossref","first-page":"1429","DOI":"10.1090\/S0025-5718-06-01840-0","article-title":"Spectral residual method without gradient information for solving large-scale nonlinear systems of equations","volume":"75","author":"La Cruz","year":"2006","journal-title":"Math Comput"},{"key":"10.1007\/s13675-017-0080-8_CR24","doi-asserted-by":"crossref","first-page":"915","DOI":"10.1007\/s11590-014-0792-0","article-title":"Convergence analysis for the modified spectral projected subgradient method","volume":"9","author":"Loreto","year":"2015","journal-title":"Optim Lett"},{"key":"10.1007\/s13675-017-0080-8_CR25","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1093\/imanum\/13.3.321","article-title":"On the Barzilai and Borwein choice of steplength for the gradient method","volume":"13","author":"Raydan","year":"1993","journal-title":"IMA J Numer Anal"},{"key":"10.1007\/s13675-017-0080-8_CR26","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1137\/S1052623494266365","article-title":"The Barzilai and Borwein gradient method for the large scale unconstrained minimization problem","volume":"7","author":"Raydan","year":"1997","journal-title":"SIAM J Optim"},{"key":"10.1007\/s13675-017-0080-8_CR27","doi-asserted-by":"crossref","first-page":"845","DOI":"10.1007\/s11590-014-0815-x","article-title":"The calculus of simplex gradients","volume":"9","author":"Regis","year":"2015","journal-title":"Optim Lett"}],"container-title":["EURO Journal on Computational Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13675-017-0080-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13675-017-0080-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2192440621000927?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2192440621000927?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13675-017-0080-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T03:46:21Z","timestamp":1761882381000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S2192440621000927"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,12]]},"references-count":27,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2017,12]]}},"alternative-id":["S2192440621000927"],"URL":"https:\/\/doi.org\/10.1007\/s13675-017-0080-8","relation":{},"ISSN":["2192-4406"],"issn-type":[{"type":"print","value":"2192-4406"}],"subject":[],"published":{"date-parts":[[2017,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Nonsmooth spectral gradient methods for unconstrained optimization","name":"articletitle","label":"Article Title"},{"value":"EURO Journal on Computational Optimization","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1007\/s13675-017-0080-8","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2017 The author(s). Published by Elsevier B.V. on behalf of Association of European Operational Research Societies (EURO). Published by Elsevier Ltd All rights reserved.","name":"copyright","label":"Copyright"}]}}