Joel L. Wolf, Mark S. Squillante, et al.
IEEE Transactions on Knowledge and Data Engineering
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.
Joel L. Wolf, Mark S. Squillante, et al.
IEEE Transactions on Knowledge and Data Engineering
Alessandro Morari, Roberto Gioiosa, et al.
IPDPS 2011
Rolf Clauberg
IBM J. Res. Dev
Matthias Kaiserswerth
IEEE/ACM Transactions on Networking