Momentum methods for stochastic optimization over time-varying directed networks
- 23 April 2020
- journal article
- research article
- Published by Elsevier in Signal Processing
- Vol. 174, 107614
Abstract
No abstract availableKeywords
This publication has 31 references indexed in Scilit:
- Average consensus on general strongly connected digraphsAutomatica, 2012
- Optimal Stochastic Approximation Algorithms for Strongly Convex Stochastic Composite Optimization I: A Generic Algorithmic FrameworkSIAM Journal on Optimization, 2012
- Dual Averaging for Distributed Optimization: Convergence Analysis and Network ScalingIEEE Transactions on Automatic Control, 2011
- Primal-dual first-order methods with ${\mathcal {O}(1/\epsilon)}$ iteration-complexity for cone programmingMathematical Programming, 2009
- Primal-dual subgradient methods for convex problemsMathematical Programming, 2007
- Interior Gradient and Proximal Methods for Convex and Conic OptimizationSIAM Journal on Optimization, 2006
- Smooth minimization of non-smooth functionsMathematical Programming, 2004
- Higher-order implicit strong numerical schemes for stochastic differential equationsJournal of Statistical Physics, 1992
- Decentralized optimization for distributed-lag models of discrete systemsAutomatica, 1975
- Some methods of speeding up the convergence of iteration methodsUSSR Computational Mathematics and Mathematical Physics, 1964