85 citations · 633 across the 51 of their papers we have counts for
Showing math.OCShow all
2 papers · 1 filter
math.OC2022★ 11 cited
Online Convex Optimization Using Coordinate Descent Algorithms
Yankai Lin, Iman Shames, Dragan Nešić
This paper considers the problem of online optimization where the objective function is time-varying. In particular, we extend coordinate descent type algorithms to the online case…
math.OC2021
Asynchronous Distributed Optimization via Dual Decomposition and Block Coordinate Subgradient Methods
Yankai Lin, Iman Shames, Dragan Nesic
We study the problem of minimizing the sum of potentially non-differentiable convex cost functions with partially overlapping dependences in an asynchronous manner, where communica…