Hans Becker, Frank Schmidt, et al.
Photomask and Next-Generation Lithography Mask Technology 2004
Paper
Sequential greedy approximation for certain convex optimization problems
Abstract
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.
Related
Frank R. Libsch, Takatoshi Tsujimura
Active Matrix Liquid Crystal Displays Technology and Applications 1997
Michael Ray, Yves C. Martin
Proceedings of SPIE - The International Society for Optical Engineering
Victor Valls, Panagiotis Promponas, et al.
IEEE Communications Magazine