David A. Selby
IBM J. Res. Dev
A greedy algorithm for a class of convex optimization problems is presented in this paper. The algorithm is motivated from function approximation using 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.
David A. Selby
IBM J. Res. Dev
S.F. Fan, W.B. Yun, et al.
Proceedings of SPIE 1989
Robert G. Farrell, Catalina M. Danis, et al.
RecSys 2012
Thomas R. Puzak, A. Hartstein, et al.
CF 2007