Limin Hu
IEEE/ACM Transactions on Networking
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.
Limin Hu
IEEE/ACM Transactions on Networking
Minkyong Kim, Zhen Liu, et al.
INFOCOM 2008
Elizabeth A. Sholler, Frederick M. Meyer, et al.
SPIE AeroSense 1997
Elena Cabrio, Philipp Cimiano, et al.
CLEF 2013