• Computer Science
  • Published in ArXiv 2014

Convex Optimization for Big Data

@article{Cevher2014ConvexOF,
  title={Convex Optimization for Big Data},
  author={Volkan Cevher and Stephen Becker and Mark W. Schmidt},
  journal={ArXiv},
  year={2014},
  volume={abs/1411.0972}
}
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 like 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… CONTINUE READING

Citations

Publications citing this paper.

References

Publications referenced by this paper.
SHOWING 1-10 OF 32 REFERENCES

Efficiency of Coordinate Descent Methods on Huge-Scale Optimization Problems

  • SIAM Journal on Optimization
  • 2012
VIEW 5 EXCERPTS
HIGHLY INFLUENTIAL

Introductory Lectures on Convex Optimization - A Basic Course

  • Applied Optimization
  • 2003
VIEW 7 EXCERPTS
HIGHLY INFLUENTIAL