Sankar Basu
Journal of the Franklin Institute
This article reviews recent advances in convex optimization algorithms for big data, which aim to reduce the computational, storage, and communications bottlenecks. We provide an overview of this emerging field, describe contemporary approximation techniques such as first-order methods and randomization for scalability, and survey the important role of parallel and distributed computation. The new big data algorithms are based on surprisingly simple principles and attain staggering accelerations even on classical problems. © 2014 IEEE.
Sankar Basu
Journal of the Franklin Institute
Kenneth L. Clarkson, K. Georg Hampel, et al.
VTC Spring 2007
Juliann Opitz, Robert D. Allen, et al.
Microlithography 1998
I.K. Pour, D.J. Krajnovich, et al.
SPIE Optical Materials for High Average Power Lasers 1992