54 citations · 139 across the 11 of their papers we have counts for
8 papers
Expander Graph and Communication-Efficient Decentralized Optimization
Yat-Tin Chow, Wei Shi, Tianyu Wu +1
In this paper, we discuss how to design the graph topology to reduce the communication complexity of certain algorithms for decentralized optimization. Our goal is to minimize the…
Decentralized Consensus Optimization with Asynchrony and Delays
Tianyu Wu, Kun Yuan, Qing Ling +2
We propose an asynchronous, decentralized algorithm for consensus optimization. The algorithm runs over a network in which the agents communicate with their neighbors and perform l…
Cyclic Coordinate Update Algorithms for Fixed-Point Problems: Analysis and Applications
Yat Tin Chow, Tianyu Wu, Wotao Yin
Many problems reduce to the fixed-point problem of solving . To this problem, we apply the coordinate-update algorithms, which update only one or a few components of at…
A Primer on Coordinate Descent Algorithms
Hao-Jun Michael Shi, Shenyinying Tu, Yangyang Xu +1
This monograph presents a class of algorithms called coordinate descent algorithms for mathematicians, statisticians, and engineers outside the field of optimization. This particul…
A fast patch-dictionary method for whole image recovery
Yangyang Xu, Wotao Yin
Various algorithms have been proposed for dictionary learning. Among those for image processing, many use image patches to form dictionaries. This paper focuses on whole-image reco…
Faster convergence rates of relaxed Peaceman-Rachford and ADMM under regularity assumptions
Damek Davis, Wotao Yin
Splitting schemes are a class of powerful algorithms that solve complicated monotone inclusion and convex optimization problems that are built from many simpler pieces. They give r…