{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T11:40:47Z","timestamp":1740138047912,"version":"3.37.3"},"reference-count":36,"publisher":"Informa UK Limited","issue":"6","funder":[{"DOI":"10.13039\/501100001871","name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia","doi-asserted-by":"publisher","award":["UID\/MAT\/00324\/2013"],"award-info":[{"award-number":["UID\/MAT\/00324\/2013"]}],"id":[{"id":"10.13039\/501100001871","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100006060","name":"Fondation Sciences et Technologies pour l'A\u00e9ronautique et l'Espace","doi-asserted-by":"crossref","award":["ADTAO"],"award-info":[{"award-number":["ADTAO"]}],"id":[{"id":"10.13039\/501100006060","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Universit\u00e9 Toulouse III Paul Sabatier","award":["PhD scholarship"],"award-info":[{"award-number":["PhD scholarship"]}]}],"content-domain":{"domain":["www.tandfonline.com"],"crossmark-restriction":true},"short-container-title":["Optimization"],"published-print":{"date-parts":[[2016,6,2]]},"DOI":"10.1080\/02331934.2015.1124271","type":"journal-article","created":{"date-parts":[[2015,12,29]],"date-time":"2015-12-29T05:19:42Z","timestamp":1451366382000},"page":"1105-1128","update-policy":"https:\/\/doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":6,"title":["A second-order globally convergent direct-search method and its worst-case complexity"],"prefix":"10.1080","volume":"65","author":[{"given":"S.","family":"Gratton","sequence":"first","affiliation":[]},{"given":"C. W.","family":"Royer","sequence":"additional","affiliation":[]},{"given":"L. N.","family":"Vicente","sequence":"additional","affiliation":[]}],"member":"301","published-online":{"date-parts":[[2015,12,29]]},"reference":[{"key":"CIT0001","doi-asserted-by":"publisher","DOI":"10.1137\/04060367X"},{"key":"CIT0002","doi-asserted-by":"publisher","DOI":"10.1137\/050638382"},{"key":"CIT0003","doi-asserted-by":"publisher","DOI":"10.1080\/10556788.2013.808198"},{"key":"CIT0004","doi-asserted-by":"publisher","DOI":"10.1137\/040603371"},{"key":"CIT0005","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-009-0305-6"},{"key":"CIT0006","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-012-0578-z"},{"key":"CIT0007","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-015-9753-5"},{"key":"CIT0008","unstructured":"Boman EG.Infeasibility and negative curvature in optimization[PhD thesis]. Stanford (CA): Stanford University; 1999."},{"key":"CIT0009","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-009-0337-y"},{"key":"CIT0010","doi-asserted-by":"publisher","DOI":"10.1016\/j.jco.2011.06.001"},{"key":"CIT0011","doi-asserted-by":"publisher","DOI":"10.1137\/100812276"},{"key":"CIT0012","doi-asserted-by":"publisher","DOI":"10.1137\/060673424"},{"key":"CIT0013","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718768"},{"key":"CIT0014","doi-asserted-by":"crossref","first-page":"C478","DOI":"10.21914\/anziamj.v42i0.609","volume":"42","author":"Coope ID","year":"2000","journal-title":"ANZIAM J"},{"key":"CIT0015","doi-asserted-by":"publisher","DOI":"10.2307\/2372648"},{"journal-title":"Math. Program","year":"2015","author":"Dodangeh M","key":"CIT0016"},{"volume-title":"On the optimal order of worst case complexity of direct search, Technical Report 14\u201338","year":"2015","author":"Dodangeh M","key":"CIT0017"},{"key":"CIT0018","doi-asserted-by":"publisher","DOI":"10.1007\/s101070100263"},{"key":"CIT0019","doi-asserted-by":"publisher","DOI":"10.1080\/10556788.2013.841691"},{"key":"CIT0020","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-007-9038-8"},{"volume-title":"Trust-region methods without using derivatives: Worst case complexity and the non-smooth case, Technical Report 15\u201303","year":"2015","author":"Garmanjani R","key":"CIT0021"},{"key":"CIT0022","doi-asserted-by":"publisher","DOI":"10.1093\/imanum\/drs027"},{"key":"CIT0023","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-014-9687-3"},{"key":"CIT0024","doi-asserted-by":"publisher","DOI":"10.1080\/10556780008805794"},{"key":"CIT0025","first-page":"676","volume":"24","author":"Gratton S","year":"2006","journal-title":"J. Comput. Math"},{"key":"CIT0026","doi-asserted-by":"publisher","DOI":"10.1137\/050623012"},{"key":"CIT0027","doi-asserted-by":"publisher","DOI":"10.1137\/140961602"},{"key":"CIT0028","doi-asserted-by":"publisher","DOI":"10.1137\/S003614450242889"},{"volume-title":"Simplified complexity analysis of simplified direct search, Technical Report ERGO 14\u2013012","year":"2014","author":"Kone\u010dn\u00fd J","key":"CIT0029"},{"key":"CIT0030","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623495295250"},{"key":"CIT0031","doi-asserted-by":"publisher","DOI":"10.1007\/BF01681333"},{"key":"CIT0032","doi-asserted-by":"publisher","DOI":"10.1007\/BF01582091"},{"key":"CIT0033","doi-asserted-by":"publisher","DOI":"10.1137\/080724083"},{"key":"CIT0034","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2006.09.097"},{"key":"CIT0035","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623493250780"},{"key":"CIT0036","doi-asserted-by":"publisher","DOI":"10.1007\/s13675-012-0003-7"}],"container-title":["Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/02331934.2015.1124271","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,23]],"date-time":"2017-06-23T22:39:51Z","timestamp":1498257591000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.tandfonline.com\/doi\/full\/10.1080\/02331934.2015.1124271"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,12,29]]},"references-count":36,"journal-issue":{"issue":"6","published-online":{"date-parts":[[2015,10,7]]},"published-print":{"date-parts":[[2016,6,2]]}},"alternative-id":["10.1080\/02331934.2015.1124271"],"URL":"https:\/\/doi.org\/10.1080\/02331934.2015.1124271","relation":{},"ISSN":["0233-1934","1029-4945"],"issn-type":[{"type":"print","value":"0233-1934"},{"type":"electronic","value":"1029-4945"}],"subject":[],"published":{"date-parts":[[2015,12,29]]},"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=gopt20","URL":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=gopt20","order":2,"name":"aims_and_scope_url","label":"Aim & Scope"}]}}