Greedy algorithms: a review and open problems

Greedy algorithms are a fundamental class of mathematics and computer science algorithms, defined by their iterative approach of making locally optimal decisions to approximate global optima. In this review, we focus on two greedy algorithms. First, we examine the relaxed greedy algorithm in the con...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Journal of inequalities and applications Ročník 2025; číslo 1; s. 11 - 22
Hlavní autor: García, Andrea
Médium: Journal Article
Jazyk:angličtina
Vydáno: Cham Springer International Publishing 03.02.2025
Springer Nature B.V
SpringerOpen
Témata:
Algorithms
Analysis
Applications of Mathematics
Approximation
Banach spaces
Chebyshev approximation
Computer science
Data compression
Dictionaries
Greedy algorithm
Greedy algorithms
Greedy bases
Hilbert space
Mathematics
Mathematics and Statistics
Optimization
Review
Greedy algorithm
Greedy bases
41A46
46B15
41A65
ISSN:1029-242X, 1025-5834, 1029-242X
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Greedy algorithms are a fundamental class of mathematics and computer science algorithms, defined by their iterative approach of making locally optimal decisions to approximate global optima. In this review, we focus on two greedy algorithms. First, we examine the relaxed greedy algorithm in the context of dictionaries in Hilbert spaces, analyzing the optimality of the definition of this algorithm. Next, we provide a general overview of the thresholding greedy algorithm and the Chebyshev thresholding greedy algorithm, with particular attention to their applications to bases in p -Banach spaces with 0 < p ≤ 1 . In both cases, we conclude by posing several questions for future research.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1029-242X
1025-5834
1029-242X
DOI:10.1186/s13660-025-03254-1