Donald Samuels, Ian Stobert
SPIE Photomask Technology + EUV Lithography 2007
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.
Donald Samuels, Ian Stobert
SPIE Photomask Technology + EUV Lithography 2007
Alfonso P. Cardenas, Larry F. Bowman, et al.
ACM Annual Conference 1975
Xiaozhu Kang, Hui Zhang, et al.
ICWS 2008
Khalid Abdulla, Andrew Wirth, et al.
ICIAfS 2014