{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T08:12:42Z","timestamp":1776845562920,"version":"3.51.2"},"reference-count":0,"publisher":"Oxford University Press (OUP)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IMA Journal of Numerical Analysis"],"published-print":{"date-parts":[[2013,7,1]]},"DOI":"10.1093\/imanum\/drs027","type":"journal-article","created":{"date-parts":[[2012,10,26]],"date-time":"2012-10-26T00:41:44Z","timestamp":1351212104000},"page":"1008-1028","source":"Crossref","is-referenced-by-count":32,"title":["Smoothing and worst-case complexity for direct-search methods in nonsmooth optimization"],"prefix":"10.1093","volume":"33","author":[{"given":"R.","family":"Garmanjani","sequence":"first","affiliation":[]},{"given":"L. N.","family":"Vicente","sequence":"additional","affiliation":[]}],"member":"286","published-online":{"date-parts":[[2012,10,24]]},"container-title":["IMA Journal of Numerical Analysis"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/imajna\/article-pdf\/33\/3\/1008\/1876814\/drs027.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,8,23]],"date-time":"2017-08-23T08:19:03Z","timestamp":1503476343000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/imajna\/article-lookup\/doi\/10.1093\/imanum\/drs027"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,10,24]]},"references-count":0,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2013,7,3]]},"published-print":{"date-parts":[[2013,7,1]]}},"URL":"https:\/\/doi.org\/10.1093\/imanum\/drs027","relation":{},"ISSN":["0272-4979","1464-3642"],"issn-type":[{"value":"0272-4979","type":"print"},{"value":"1464-3642","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,10,24]]}}}