activity
20112026
most citedParallel matrix factorization for low-rank tensor completion

368 citations · 1.4k across the 51 of their papers we have counts for

collaborators
Showing 2016Show all

6 papers · 1 filter

math.OC2016★ 10 cited

On the Convergence of Asynchronous Parallel Iteration with Unbounded Delays

Zhimin Peng, Yangyang Xu, Ming Yan +1

Recent years have witnessed the surge of asynchronous parallel (async-parallel) iterative algorithms due to problems involving very large-scale data and a large number of decision…

math.OC2016★ 54 cited

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…

math.OC2016★ 3 cited

Hybrid Jacobian and Gauss-Seidel proximal block coordinate update methods for linearly constrained convex programming

Yangyang Xu

Recent years have witnessed the rapid development of block coordinate update (BCU) methods, which are particularly suitable for problems involving large-sized data and/or variables…

math.OC2016★ 4 cited

Accelerated first-order primal-dual proximal methods for linearly constrained composite convex programming

Yangyang Xu

Motivated by big data applications, first-order methods have been extremely popular in recent years. However, naive gradient methods generally converge slowly. Hence, much efforts…

math.OC2016★ 15 cited

Randomized Primal-Dual Proximal Block Coordinate Updates

Xiang Gao, Yangyang Xu, Shuzhong Zhang

In this paper we propose a randomized primal-dual proximal block coordinate updating framework for a general multi-block convex optimization model with coupled objective function a…

math.OC2016★ 75 cited

Coordinate Friendly Structures, Algorithms and Applications

Zhimin Peng, Tianyu Wu, Yangyang Xu +2

This paper focuses on coordinate update methods, which are useful for solving problems involving large or high-dimensional datasets. They decompose a problem into simple subproblem…