Iteration complexity analysis of block coordinate descent methods

@article{Hong2017IterationCA,
  title={Iteration complexity analysis of block coordinate descent methods},
  author={Mingyi Hong and Xiangfeng Wang and Meisam Razaviyayn and Zhi-Quan Luo},
  journal={Math. Program.},
  year={2017},
  volume={163},
  pages={85-114}
}
Question: What is the iteration complexity of the BCD (with deterministic update rules) for convex problems? Answer: Scales sublinearly as O(1/r) [H.-Wang-Razaviyayn-Luo 14] 
Highly Cited
This paper has 61 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 39 extracted citations

62 Citations

010202015201620172018
Citations per Year
Semantic Scholar estimates that this publication has 62 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 12 references

Improved Iteration Complexity Analysis for Cyclic Block Coordinate Descent Method

  • R. Sun
  • Technical Note,
  • 2014
1 Excerpt

On the Linear Convergence of the Approximate Proximal Splitting Method for Non-Smooth Convex Optimization

  • M. Sanjabi, Z.-Q. Luo
  • 2014

Clipici, “Distributed Coordinate Descent Methods for Composite Minimization

  • D. I. Necoara
  • 2013

On the complexity analysis of randomized block-coordinate descent methods

  • Z. Lu, X. Lin
  • 2013

Tetruashvili “On the convergence of block coordinate descent type methods,

  • L. A. Beck
  • SIAM Journal on Optimization,
  • 2013

Similar Papers

Loading similar papers…