{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,10]],"date-time":"2025-05-10T16:29:14Z","timestamp":1746894554506,"version":"3.40.3"},"publisher-location":"Boston, MA","reference-count":19,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387747583"},{"type":"electronic","value":"9780387747590"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-0-387-74759-0_281","type":"book-chapter","created":{"date-parts":[[2008,8,25]],"date-time":"2008-08-25T11:01:04Z","timestamp":1219662064000},"page":"1603-1608","source":"Crossref","is-referenced-by-count":1,"title":["Information-based Complexity and Information-based Optimization"],"prefix":"10.1007","author":[{"given":"J. F.","family":"Traub","sequence":"first","affiliation":[]},{"given":"A. G.","family":"Werschulz","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"281_CR1_281","doi-asserted-by":"crossref","first-page":"711","DOI":"10.2307\/3215096","volume":"34","author":"J.M. Calvin","year":"1997","unstructured":"Calvin JM (1997) Average performance of adaptive algorithms for global optimization. Ann Appl Probab 34:711\u2013730","journal-title":"Ann. Appl. Probab."},{"key":"281_CR2_281","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1006\/jcom.1999.0504","volume":"15","author":"Z. Huang","year":"1999","unstructured":"Huang Z, Khachiyan L, Sikorski K (1999) Approximating fixed points of weakly contracting mappings. J\u00a0Complexity 15:200\u2013213","journal-title":"J. Complexity"},{"key":"281_CR3_281","first-page":"191","volume":"20","author":"L.G. Khachiyan","year":"1979","unstructured":"Khachiyan LG (1979) A\u00a0polynomial algorithm in linear programming. Soviet Math Dokl 20:191\u2013194","journal-title":"Soviet Math. Dokl."},{"key":"281_CR4_281","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1145\/2422.322418","volume":"31","author":"N. Megiddo","year":"1984","unstructured":"Megiddo N (1984) Linear programming in linear time when the dimension is fixed. J\u00a0ACM 31:114\u2013127","journal-title":"J. ACM"},{"key":"281_CR5_281","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1006\/jcom.1994.1025","volume":"10","author":"A.S. Nemirovsky","year":"1994","unstructured":"Nemirovsky AS (1994) On parallel complexity of nonsmooth convex optimization. J\u00a0Complexity 10:451\u2013463","journal-title":"J. Complexity"},{"key":"281_CR6_281","volume-title":"Problem complexity and method efficiency in optimization","author":"A.S. Nemirovsky","year":"1983","unstructured":"Nemirovsky AS, Yudin DB (1983) Problem complexity and method efficiency in optimization. Wiley\/Interscience, New York"},{"key":"281_CR7_281","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0079792","volume-title":"Deterministic and stochastic error bounds in numerical analysis","author":"E. Novak","year":"1988","unstructured":"Novak E (1988) Deterministic and stochastic error bounds in numerical analysis, vol\u00a01349. Springer, Berlin"},{"key":"281_CR8_281","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511600814","volume-title":"Noisy information and computational complexity","author":"L. Plaskota","year":"1996","unstructured":"Plaskota L (1996) Noisy information and computational complexity. Cambridge Univ. Press, Cambridge"},{"key":"281_CR9_281","doi-asserted-by":"crossref","unstructured":"Ritter K (1990) Approximation and optimization on the Wiener space. J\u00a0Complexity 337\u2013364","DOI":"10.1016\/0885-064X(90)90027-B"},{"key":"281_CR10_281","volume-title":"Optimal solution of nonlinear equations","author":"K. Sikorski","year":"2000","unstructured":"Sikorski K (2000) Optimal solution of nonlinear equations. Oxford Univ. Press, Oxford"},{"key":"281_CR11_281","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/jcom.1997.0463","volume":"14","author":"I.H. Sloan","year":"1998","unstructured":"Sloan IH, Wo\u017aniakowski H (1998) When are quasi-Monte Carlo algorithms efficient for high dimensional integrals? J Complexity 14:1\u201333","journal-title":"J. Complexity"},{"issue":"2","key":"281_CR12_281","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1287\/opre.34.2.250","volume":"34","author":"E. Tardos","year":"1986","unstructured":"Tardos E (1986) A\u00a0strongly polynomial algorithm to solve combinatorial linear programs. Oper Res 34(2):250\u2013256","journal-title":"Oper. Res."},{"key":"281_CR13_281","volume-title":"Information-based complexity","author":"J.F. Traub","year":"1988","unstructured":"Traub JF, Wasilkowski GW, Wo\u017aniakowski H (1988) Information-based complexity. Acad. Press, New York"},{"key":"281_CR14_281","volume-title":"Complexity and information","author":"J.F. Traub","year":"1998","unstructured":"Traub JF, Werschulz AG (1998) Complexity and information. Cambridge Univ. Press, Cambridge"},{"key":"281_CR15_281","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/0167-6377(82)90047-5","volume":"1","author":"J.F. Traub","year":"1982","unstructured":"Traub JF, Wo\u017aniakowski H (1982) Complexity of linear programming. Oper Res Lett 1:59\u201362","journal-title":"Oper. Res. Lett."},{"key":"281_CR16_281","volume-title":"Nonlinear optimization: Complexity issues","author":"S.A. Vavasis","year":"1991","unstructured":"Vavasis SA (1991) Nonlinear optimization: Complexity issues. Oxford Univ. Press, Oxford"},{"key":"281_CR17_281","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/0885-064X(89)90004-6","volume":"5","author":"G.W. Wasilkowski","year":"1989","unstructured":"Wasilkowski GW (1989) Randomization for continuous problems. J\u00a0Complexity 5:195\u2013218","journal-title":"J. Complexity"},{"issue":"2 (Ser. B)","key":"281_CR18_281","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/BF01581086","volume":"57","author":"G.W. Wasilkowski","year":"1992","unstructured":"Wasilkowski GW (1992) On average complexity of global optimization problems. Math Program 57(2)(Ser. B):313\u2013324","journal-title":"Math. Program."},{"key":"281_CR19_281","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198535898.001.0001","volume-title":"The computational complexity of differential and integral equations: An information-based approach","author":"A.G. Werschulz","year":"1991","unstructured":"Werschulz AG (1991) The computational complexity of differential and integral equations: An information-based approach. Oxford Univ. Press, Oxford"}],"container-title":["Encyclopedia of Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-74759-0_281","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,11]],"date-time":"2024-07-11T09:55:12Z","timestamp":1720691712000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-387-74759-0_281"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9780387747583","9780387747590"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-74759-0_281","relation":{},"subject":[],"published":{"date-parts":[[2008]]}}}