Comparison of Purely Greedy and Orthogonal Greedy Algorithm

DOI10.1134/S0001434624010048MaRDI QIDQ6494789FDOQ6494789

Authors: K. S. Vishnevetskiy 

Publication date: 30 April 2024

Published in: Mathematical Notes (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (1)

• Comparison of pure greedy algorithm with pure greedy algorithm in a pair of dictionaries

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)