873 citations · 5.4k across the 120 of their papers we have counts for
9 papers · 1 filter
A globally convergent algorithm for nonconvex optimization based on block coordinate update
Yangyang Xu, Wotao Yin
Nonconvex optimization problems arise in many areas of computational science and engineering and are (approximately) solved by a variety of algorithms. Existing algorithms usually…
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…
Block stochastic gradient iteration for convex and nonconvex optimization
Yangyang Xu, Wotao Yin
The stochastic gradient (SG) method can minimize an objective function composed of a large number of differentiable functions, or solve a stochastic optimization problem, to a mode…
Self Equivalence of the Alternating Direction Method of Multipliers
Ming Yan, Wotao Yin
The alternating direction method of multipliers (ADM or ADMM) breaks a complex optimization problem into much simpler subproblems. The ADM algorithms are typically short and easy t…
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…
Sparse Recovery via Differential Inclusions
Stanley Osher, Feng Ruan, Jiechao Xiong +2
In this paper, we recover sparse signals from their noisy linear measurements by solving nonlinear differential inclusions, which is based on the notion of inverse scale space (ISS…