{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,21]],"date-time":"2025-10-21T14:41:40Z","timestamp":1761057700420},"reference-count":26,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[2003,8,1]],"date-time":"2003-08-01T00:00:00Z","timestamp":1059696000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3638,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Complexity"],"published-print":{"date-parts":[[2003,8]]},"DOI":"10.1016\/s0885-064x(03)00026-8","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T17:16:12Z","timestamp":1051118172000},"page":"458-473","source":"Crossref","is-referenced-by-count":20,"title":["Vector greedy algorithms"],"prefix":"10.1016","volume":"19","author":[{"given":"Adam","family":"Lutoborski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vladimir N.","family":"Temlyakov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0885-064X(03)00026-8_BIB1","doi-asserted-by":"crossref","first-page":"930","DOI":"10.1109\/18.256500","article-title":"Universal approximation bounds for superposition of n sigmoidal functions","volume":"39","author":"Barron","year":"1993","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0885-064X(03)00026-8_BIB2","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/BF02678430","article-title":"Adaptive greedy approximations","volume":"13","author":"Davis","year":"1997","journal-title":"Constr. Approx."},{"key":"10.1016\/S0885-064X(03)00026-8_BIB3","doi-asserted-by":"crossref","unstructured":"R.A. DeVore, Nonlinear approximation, Acta Numer. (1998) 51\u2013150.","DOI":"10.1017\/S0962492900002816"},{"key":"10.1016\/S0885-064X(03)00026-8_BIB4","doi-asserted-by":"crossref","first-page":"737","DOI":"10.2307\/2374796","article-title":"Compression of wavelet decompositions","volume":"114","author":"DeVore","year":"1992","journal-title":"Amer. J. Math."},{"key":"10.1016\/S0885-064X(03)00026-8_BIB5","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/s00041-001-4021-8","article-title":"Nonlinear approximation by trigonometric sums","volume":"2","author":"DeVore","year":"1995","journal-title":"J. Fourier Anal. Appl."},{"key":"10.1016\/S0885-064X(03)00026-8_BIB6","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/BF02124742","article-title":"Some remarks on greedy algorithms","volume":"5","author":"DeVore","year":"1996","journal-title":"Adv. Comput. Math."},{"key":"10.1016\/S0885-064X(03)00026-8_BIB7","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1006\/jcom.1997.0458","article-title":"Nonlinear approximation in finite-dimensional spaces","volume":"13","author":"DeVore","year":"1997","journal-title":"J. Complexity"},{"key":"10.1016\/S0885-064X(03)00026-8_BIB8","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/BF02678464","article-title":"Rate of convex approximation in non-Hilbert spaces","volume":"13","author":"Donahue","year":"1997","journal-title":"Constr. Approx."},{"key":"10.1016\/S0885-064X(03)00026-8_BIB9","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1006\/acha.1993.1008","article-title":"Unconditional bases are optimal bases for data compression and for statistical estimation","volume":"1","author":"Donoho","year":"1993","journal-title":"Appl. Comput. Harmon. Anal."},{"key":"10.1016\/S0885-064X(03)00026-8_BIB10","doi-asserted-by":"crossref","first-page":"1870","DOI":"10.1214\/aos\/1069362377","article-title":"CART and best-ortho-basis","volume":"25","author":"Donoho","year":"1997","journal-title":"Ann. Statist."},{"key":"10.1016\/S0885-064X(03)00026-8_BIB11","unstructured":"V.V. Dubinin, Greedy algorithms and applications, Ph.D. Thesis, University of South Carolina, 1997."},{"key":"10.1016\/S0885-064X(03)00026-8_BIB12","doi-asserted-by":"crossref","first-page":"817","DOI":"10.1080\/01621459.1981.10477729","article-title":"Projection pursuit regression","volume":"76","author":"Friedman","year":"1981","journal-title":"J. Amer. Statist. Assoc."},{"key":"10.1016\/S0885-064X(03)00026-8_BIB13","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1214\/aos\/1176349519","article-title":"Projection pursuit","volume":"13","author":"Huber","year":"1985","journal-title":"Ann. Statist."},{"key":"10.1016\/S0885-064X(03)00026-8_BIB14","doi-asserted-by":"crossref","first-page":"880","DOI":"10.1214\/aos\/1176350382","article-title":"On a conjecture of Huber concerning the convergence of projection pursuit regression","volume":"15","author":"Jones","year":"1987","journal-title":"Ann. Statist."},{"key":"10.1016\/S0885-064X(03)00026-8_BIB15","doi-asserted-by":"crossref","first-page":"608","DOI":"10.1214\/aos\/1176348546","article-title":"A simple lemma on greedy approximation in Hilbert space and convergence rates for projection pursuit regression and neural network training","volume":"20","author":"Jones","year":"1992","journal-title":"Ann. Statist."},{"key":"10.1016\/S0885-064X(03)00026-8_BIB16","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/BF02274662","article-title":"On best m-terms approximations and the entropy of sets in the space L1","volume":"56","author":"Kashin","year":"1994","journal-title":"Math. Notes"},{"key":"10.1016\/S0885-064X(03)00026-8_BIB17","doi-asserted-by":"crossref","first-page":"922","DOI":"10.1007\/BF02304894","article-title":"On estimating approximative characteristics of classes of functions with bounded mixed derivative","volume":"58","author":"Kashin","year":"1995","journal-title":"Math. Notes"},{"key":"10.1016\/S0885-064X(03)00026-8_BIB18","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1080\/07362999208809264","article-title":"Remarks on projection pursuit regression and density estimation","volume":"10","author":"Rejt\u00f6","year":"1992","journal-title":"Stochastic Anal. Appl."},{"key":"10.1016\/S0885-064X(03)00026-8_BIB19","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1007\/BF01449770","article-title":"Zur Theorie der linearen und nichtlinearen Integralgleichungen. I","volume":"63","author":"Schmidt","year":"1906","journal-title":"Math. Annalen"},{"key":"10.1016\/S0885-064X(03)00026-8_BIB20","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1007\/s003659900090","article-title":"Greedy algorithm and m-term trigonometric approximation","volume":"14","author":"Temlyakov","year":"1998","journal-title":"Constr. Approx."},{"key":"10.1016\/S0885-064X(03)00026-8_BIB21","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1023\/A:1018900431309","article-title":"The best m-term approximation and greedy algorithms","volume":"8","author":"Temlyakov","year":"1998","journal-title":"Adv. Comput. Math."},{"key":"10.1016\/S0885-064X(03)00026-8_BIB22","first-page":"87","article-title":"Nonlinear m-term approximation with regard to the multivariate Haar system","volume":"4","author":"Temlyakov","year":"1998","journal-title":"East J. Approx."},{"key":"10.1016\/S0885-064X(03)00026-8_BIB23","unstructured":"V.N. Temlyakov, Greedy algorithms with regard to the multivariate systems with a special structure, preprint, 1998, pp. 1\u201326."},{"key":"10.1016\/S0885-064X(03)00026-8_BIB24","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1006\/jath.1998.3265","article-title":"Greedy algorithms and m-term approximation with regard to redundant dictionaries","volume":"98","author":"Temlyakov","year":"1999","journal-title":"J. Approx. Theory"},{"key":"10.1016\/S0885-064X(03)00026-8_BIB25","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1023\/A:1018917218956","article-title":"Weak greedy algorithms","volume":"12","author":"Temlyakov","year":"2000","journal-title":"Adv. Comput. Math."},{"key":"10.1016\/S0885-064X(03)00026-8_BIB26","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1023\/A:1016061804993","article-title":"A criterion for convergence of weak greedy algorithm","volume":"17","author":"Temlyakov","year":"2002","journal-title":"Adv. Comput. Math."}],"container-title":["Journal of Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0885064X03000268?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0885064X03000268?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T23:30:43Z","timestamp":1553211043000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0885064X03000268"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,8]]},"references-count":26,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2003,8]]}},"alternative-id":["S0885064X03000268"],"URL":"https:\/\/doi.org\/10.1016\/s0885-064x(03)00026-8","relation":{},"ISSN":["0885-064X"],"issn-type":[{"value":"0885-064X","type":"print"}],"subject":[],"published":{"date-parts":[[2003,8]]}}}