Comparison of Purely Greedy and Orthogonal Greedy Algorithm

DOI10.1134/S0001434624010048MaRDI QIDQ6494789zbMATH OpenFDO

Authors K. S. Vishnevetskiy

Publication date 30 April 2024

Published in Mathematical Notes (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/S0001434624010048

Mathematics Subject Classification ID

Approximations and expansions (41Axx) Numerical approximation and computational geometry (primarily algorithms) (65Dxx) Artificial intelligence (68Txx)

Recommendations

• Comparison of the convergence rate of pure greedy and orthogonal greedy algorithms
• Vector greedy algorithms
• Realizability of greedy algorithms
• Projection greedy algorithm
• On greedy algorithms for dictionaries with bounded cumulative coherence

Cites work

• Greedy approximation
• On the coincidence of pure greedy and best \(m\)-term approximations
• Relaxation in greedy approximation

Cited in

(3)

• Comparison of pure greedy algorithm with pure greedy algorithm in a pair of dictionaries
• Brief introduction in greedy approximation
• Consecutive projections and greedy approximation in Hilbert space

This page was built for publication: Comparison of Purely Greedy and Orthogonal Greedy Algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6494789)