Asset Details
Do you wish to reserve the book?
Greedy algorithms: a review and open problems
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
Greedy algorithms: a review and open problems
Do you wish to request the book?
Greedy algorithms: a review and open problems
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Journal Article
Greedy algorithms: a review and open problems
2025
Overview
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.
Publisher
Springer International Publishing,Springer Nature B.V,SpringerOpen
Subject
