Realizability of greedy algorithms

DOI10.1134/S0081543811050117MaRDI QIDQ643840zbMATH OpenFDO

Authors E. D. Livshits

Publication date 2 November 2011

Published in Proceedings of the Steklov Institute of Mathematics (Search for Journal in Brave)

zbMATH Keywords

greedy algorithmscategorybest \(m\)-term approximation

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Programming in abstract spaces (90C48)

Recommendations

• Vector greedy algorithms
• Projection greedy algorithm
• Some remarks on greedy algorithms
• Weak greedy algorithms
• On the optimality of the orthogonal greedy algorithm for \(\mu\)-coherent dictionaries

Cites work

• Greedy approximation
• On a conjecture of Huber concerning the convergence of projection pursuit regression
• Weak greedy algorithms

Cited in

(3)

• Comparison of Purely Greedy and Orthogonal Greedy Algorithm
• On the optimality of the orthogonal greedy algorithm for \(\mu\)-coherent dictionaries
• Vector greedy algorithms

This page was built for publication: Realizability of greedy algorithms

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