Answers are grounded in this paper and cite their sources.
A greedy algorithm for a class of convex optimization problems is presented. The algorithm is motivated from function approximation using a sparse combination of basis functions as well as some of its variants. We derive a bound on the rate of approximate minimization for this algorithm, and present examples of its application. Our analysis generalizes a number of earlier studies.
No takes yet. Share an insight, caveat, or question.
Tong Zhang (2003) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: