Photo from archive.org
We introduce and study a new type of greedy algorithm, namely, projection greedy algorithms with respect to a given dictionary in a Hilbert space. We prove that these algorithms converge… Click to show full abstract
We introduce and study a new type of greedy algorithm, namely, projection greedy algorithms with respect to a given dictionary in a Hilbert space. We prove that these algorithms converge and estimate the rate of convergence for initial elements from the convex hull of the dictionary. Several specific examples of dictionaries are used to compare the introduced algorithms with orthogonal greedy algorithms.
Keywords:
projection greedy;
greedy;
greedy algorithm
Journal Title: Mathematical Notes
Year Published: 2021
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!
Journal Title: Mathematical Notes
Year Published: 2021
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!