Achieving acceleration in distributed optimization via direct discretization of the heavy-ball ODE
© 2019 American Automatic Control Council. We develop a distributed algorithm for convex Empirical Risk Minimization, the problem of minimizing large but finite sum of convex functions over networks. The proposed algorithm is derived from directly discretizing the second-order heavy-ball differentia...
Main Authors: | Zhang, J, Uribe, CA, Mokhtari, A, Jadbabaie, A |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Civil and Environmental Engineering |
Format: | Article |
Language: | English |
Published: |
IEEE
2023
|
Online Access: | https://hdl.handle.net/1721.1/148596 |
Similar Items
-
Direct Runge-Kutta discretization achieves acceleration
by: Zhang, Jingzhao, et al.
Published: (2021) -
Direct Runge-Kutta discretization achieves acceleration
by: Zhang, Jingzhao, et al.
Published: (2022) -
Acceleration in First Order Quasi-strongly Convex Optimization by ODE Discretization
by: Zhang, Jingzhao, et al.
Published: (2021) -
QUOTIENTS OF THE COMPLEX BALL BY DISCRETE-GROUPS
by: Kirwan, F, et al.
Published: (1987) -
Non-Bayesian Social Learning with Uncertain Models over Time-Varying Directed Graphs
by: Uribe, CA, et al.
Published: (2023)