Realizability of greedy algorithms

DOI10.1134/S0081543811050117zbMath1254.90303MaRDI QIDQ643840

E. D. Livshits

Publication date: 2 November 2011

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

zbMATH Keywords

categorygreedy algorithmsbest \(m\)-term approximation

Mathematics Subject Classification ID

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

Cites Work

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

This page was built for publication: Realizability of greedy algorithms