Raymond F. Boyce, Donald D. Chamberlin, et al.
CACM
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.
Raymond F. Boyce, Donald D. Chamberlin, et al.
CACM
Lerong Cheng, Jinjun Xiong, et al.
ASP-DAC 2008
John M. Boyer, Charles F. Wiecha
DocEng 2009
William Hinsberg, Joy Cheng, et al.
SPIE Advanced Lithography 2010