7 citations · 23 across the 20 of their papers we have counts for
6 papers · 1 filter
Non-ergodic linear convergence property of the delayed gradient descent under the strongly convexity and the Polyak-Łojasiewicz condition
Hyung Jun Choi, Woocheol Choi, Jinmyoung Seok
In this work, we establish the linear convergence estimate for the gradient descent involving the delay when the cost function is -strongly convex and -smoot…
Convergence property of the Quantized Distributed Gradient descent with constant stepsizes and an effective strategy for the stepsize selection
Woocheol Choi, Myeong-Su Lee
In this paper, we establish new convergence results for the quantized distributed gradient descent and suggest a novel strategy of choosing the stepsizes for the high-performance o…
On the convergence of the distributed proximal point algorithm
Woocheol Choi
In this work, we establish convergence results for the distributed proximal point algorithm (DPPA) for distributed optimization problems. We consider the problem on the whole domai…
Inexact Online Proximal Mirror Descent for time-varying composite optimization
Woocheol Choi, Myeong-Su Lee, Seok-Bae Yun
In this paper, we consider the online proximal mirror descent for solving the time-varying composite optimization problems. For various applications, the algorithm naturally involv…
A tight bound on the stepsize of the decentralized gradient descent
Woocheol Choi
In this paper, we consider the decentralized gradinet descent (DGD) given by \begin{equation*} x_i (t+1) = \sum_{j=1}^m w_{ij} x_j (t) - α(t) \nabla f_i (x_i (t)). \end{equation*}…
On the convergence result of the gradient-push algorithm on directed graphs with constant stepsize
Woocheol Choi, Doheon Kim, Seok-Bae Yun
Distributed optimization has recieved a lot of interest due to its wide applications in various fields. It consists of multiple agents that connected by a graph and optimize a tota…