Publication
IEEE SPM
Paper

Convex optimization for big data: Scalable, randomized, and parallel algorithms for big data analytics

View publication

Abstract

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.

Date

Publication

IEEE SPM

Authors

Topics

Share