Global convergence rate of incremental aggregated gradient methods for nonsmooth problems

Nuri Denizcan Vanli; Mert Gürbüzbalaban; Asuman Ozdaglar

doi:10.1109/CDC.2016.7798265

Publications · Conference paper · CDC 2016

Global convergence rate of incremental aggregated gradient methods for nonsmooth problems

Nuri Denizcan Vanli, Mert Gürbüzbalaban, Asuman Ozdaglar

IEEE Conference on Decision and Control (CDC), pp. 173–178, 2016.

Publisher (DOI)

Topics

Incremental methods & data ordering

Cite

@inproceedings{vanli2016nonsmooth,
  title   = {Global convergence rate of incremental aggregated gradient methods for nonsmooth problems},
  author  = {Nuri Denizcan Vanli and Mert Gürbüzbalaban and Asuman Ozdaglar},
  year    = {2016},
  booktitle = {IEEE Conference on Decision and Control (CDC)},
  pages   = {173--178},
  doi     = {10.1109/CDC.2016.7798265},
}

Relatedsame topics

Why random reshuffling beats stochastic gradient descent (Math. Program., 2021)
Randomness and permutations in coordinate descent methods (Math. Program., 2020)
Convergence rate of incremental gradient and incremental Newton methods (SIAM J. Optim., 2019)
Global convergence rate of proximal incremental aggregated gradient methods (SIAM J. Optim., 2018)
Surpassing gradient descent provably: a cyclic incremental method with linear convergence rate (SIAM J. Optim., 2018)

← All publications · Research program · Mert Gürbüzbalaban