{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T22:23:44Z","timestamp":1757629424615,"version":"3.44.0"},"reference-count":6,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1986,12,1]],"date-time":"1986-12-01T00:00:00Z","timestamp":533779200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1986,12,1]],"date-time":"1986-12-01T00:00:00Z","timestamp":533779200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2005,9,7]],"date-time":"2005-09-07T00:00:00Z","timestamp":1126051200000},"content-version":"vor","delay-in-days":6855,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Complexity"],"published-print":{"date-parts":[[1986,12]]},"DOI":"10.1016\/0885-064x(86)90011-7","type":"journal-article","created":{"date-parts":[[2004,9,8]],"date-time":"2004-09-08T14:41:18Z","timestamp":1094654478000},"page":"333-352","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":3,"title":["Adaption helps for some nonconvex classes"],"prefix":"10.1016","volume":"2","author":[{"given":"I.P","family":"Huerta","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0885-064X(86)90011-7_BIB1","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1016\/0041-5553(71)90017-6","article-title":"On the optimality of linear methods for operator approximation for convex classes of functions","volume":"11","author":"Bakhvalov","year":"1971","journal-title":"U.S.S.R. Comput. Math. and Math. Phys."},{"key":"10.1016\/0885-064X(86)90011-7_BIB2","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1080\/00036818008839292","article-title":"Optimal sequential and nonsequential procedures for evaluating a functional","volume":"10","author":"Gal","year":"1980","journal-title":"Appl. Anal."},{"key":"10.1016\/0885-064X(86)90011-7_BIB3","series-title":"Analytic Computational Complexity","first-page":"35","article-title":"The complexity of obtaining starting points for solving operator equations by Newton's method","author":"Kung","year":"1976"},{"key":"10.1016\/0885-064X(86)90011-7_BIB4","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1145\/321864.321870","article-title":"A meta-algorithm for adaptive quadrature","volume":"22","author":"Rice","year":"1975","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0885-064X(86)90011-7_BIB5","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/BF01459080","article-title":"Bisection is optimal","volume":"40","author":"Sikorski","year":"1982","journal-title":"Numer. Math."},{"year":"1980","series-title":"A General Theory of Optimal Algorithms","author":"Traub","key":"10.1016\/0885-064X(86)90011-7_BIB6"}],"container-title":["Journal of Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0885064X86900117?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0885064X86900117?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T14:53:20Z","timestamp":1757516000000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0885064X86900117"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,12]]},"references-count":6,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1986,12]]}},"alternative-id":["0885064X86900117"],"URL":"https:\/\/doi.org\/10.1016\/0885-064x(86)90011-7","relation":{},"ISSN":["0885-064X"],"issn-type":[{"type":"print","value":"0885-064X"}],"subject":[],"published":{"date-parts":[[1986,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Adaption helps for some nonconvex classes","name":"articletitle","label":"Article Title"},{"value":"Journal of Complexity","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0885-064X(86)90011-7","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1986 Published by Elsevier Inc.","name":"copyright","label":"Copyright"}]}}