2 citations · 3 across the 9 of their papers we have counts for
Showing 2022 · math.OCShow all
3 papers · 2 filters
math.OC2022★ 2 cited
Resilient Distributed Optimization
Jingxuan Zhu, Yixuan Lin, Alvaro Velasquez +1
This paper considers a distributed optimization problem in the presence of Byzantine agents capable of introducing untrustworthy information into the communication network. A resil…
math.OC2022
Reaching a Consensus with Limited Information
Jingxuan Zhu, Yixuan Lin, Ji Liu +1
In its simplest form the well known consensus problem for a networked family of autonomous agents is to devise a set of protocols or update rules, one for each agent, which can ena…
math.OC2022
Subgradient-Push Is of the Optimal Convergence Rate
Yixuan Lin, Ji Liu
The push-sum based subgradient is an important method for distributed convex optimization over unbalanced directed graphs, which is known to converge at a rate of $O(\ln t/\sqrt{t}…