Twenty-five years of greedy bases

dc.contributor.authorAlbiac Alesanco, Fernando José
dc.contributor.authorAnsorena, José L.
dc.contributor.authorTemlyakov, Vladimir
dc.contributor.departmentEstadística, Informática y Matemáticases_ES
dc.contributor.departmentEstatistika, Informatika eta Matematikaeu
dc.contributor.departmentInstitute for Advanced Materials and Mathematics - INAMAT2en
dc.date.accessioned2025-03-03T12:45:12Z
dc.date.issued2025-05-01
dc.date.updated2025-03-03T12:23:06Z
dc.description.abstractAlthough the basic idea behind the concept of a greedy basis had been around for some time, the formal development of a theory of greedy bases was initiated in 1999 with the publication of the article [S.V. Konyagin and V.N. Temlyakov, A remark on greedy approximation in Banach spaces, East J. Approx. 5 (3) (1999), 365-379]. The theoretical simplicity of the thresholding greedy algorithm became a model for a procedure widely used in numerical applications and the subject of greedy bases evolved very rapidly from the point of view of approximation theory. The idea of studying greedy bases and related greedy algorithms attracted also the attention of researchers with a classical Banach space theory background. From the more abstract point of functional analysis, the theory of greedy bases and its derivates evolved very fast as many fundamental results were discovered and new ramifications branched out. Hundreds of papers on greedy-like bases and several monographs have been written since the appearance of the aforementioned foundational paper. After twenty-five years, the theory is very much alive and it continues to be a very active research topic both for functional analysts and for researchers interested in the applied nature of nonlinear approximation alike. This is why we believe it is a good moment to gather a selection of 25 open problems (one per year since 1999!) whose solution would contribute to advance the state of art of this beautiful topic.en
dc.description.sponsorshipThe research of F. Albiac and J.L. Ansorena was partially funded by the Spanish Ministry for Science and Innovation under Grant PID2022-138342NB-I00 for Functional analysis methods in approximation theory and applications. The research of V.N. Temlyakov (Section 13) was supported by the Russian Science Foundation under Grant No. 23-71-30001, https://rscf.ru/project/23-71-30001/, and performed at Lomonosov Moscow State University.
dc.embargo.lift2027-05-01
dc.embargo.terms2027-05-01
dc.format.mimetypeapplication/pdfen
dc.identifier.citationAlbiac, F., Ansorena, J. L., Temlyakov, V. (2025) Twenty-five years of greedy bases. Journal of Approximation Theory, 307, 1-23. https://doi.org/10.1016/j.jat.2024.106141
dc.identifier.doi10.1016/j.jat.2024.106141
dc.identifier.issn0021-9045
dc.identifier.urihttps://academica-e.unavarra.es/handle/2454/53645
dc.language.isoeng
dc.publisherElsevier
dc.relation.ispartofJournal of Approximation Theory, 307(2025), 1-23
dc.relation.projectIDinfo:eu-repo/grantAgreement/AEI/Plan Estatal de Investigación Científica y Técnica y de Innovación 2021-2023/PID2022-138342NB-I00/ES/
dc.relation.publisherversionhttps://doi.org/10.1016/j.jat.2024.106141
dc.rights© 2024 Elsevier Inc. This manuscript version is made available under the CC-BY-NC-ND 4.0.
dc.rights.accessRightsinfo:eu-repo/semantics/embargoedAccess
dc.rights.urihttps://creativecommons.org/licenses/by-nc-nd/4.0/
dc.subjectAlmost greedyen
dc.subjectAnd quasi-greedy basisen
dc.subjectGreedyen
dc.subjectNonlinear approximationen
dc.subjectThresholding greedy algorithmen
dc.titleTwenty-five years of greedy basesen
dc.typeinfo:eu-repo/semantics/article
dc.type.versioninfo:eu-repo/semantics/acceptedVersion
dspace.entity.typePublication
relation.isAuthorOfPublication3a702006-6ba1-41ba-93bf-ea9fee1de239
relation.isAuthorOfPublication.latestForDiscovery3a702006-6ba1-41ba-93bf-ea9fee1de239

Files

Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
Albiac.pdf
Size:
394.56 KB
Format:
Adobe Portable Document Format
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed to upon submission
Description: