Global convergence rate of proximal incremental aggregated gradient methods

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

doi:10.1137/16M1094415

Publications · Journal article · SIAM J. Optim. 2018

Global convergence rate of proximal incremental aggregated gradient methods

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

SIAM Journal on Optimization, 28(2), pp. 1282–1300, 2018.

Publisher (DOI)

Topics

Incremental methods & data ordering

Cite

@article{vanli2018piag,
  title   = {Global convergence rate of proximal incremental aggregated gradient methods},
  author  = {Nuri Denizcan Vanli and Mert Gürbüzbalaban and Asuman Ozdaglar},
  year    = {2018},
  journal = {SIAM Journal on Optimization},
  volume  = {28(2)},
  pages   = {1282--1300},
  doi     = {10.1137/16M1094415},
}

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)
Surpassing gradient descent provably: a cyclic incremental method with linear convergence rate (SIAM J. Optim., 2018)
A double incremental aggregated gradient method with linear convergence rate for large-scale optimization (ICASSP, 2017)

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