activity
20052023
most citedGuaranteed Matrix Completion via Non-convex Factorization

339 citations · 2.5k across the 73 of their papers we have counts for

collaborators
Showing 2014 · math.OCShow all

5 papers · 2 filters

math.OC2014★ 19 cited

Convergence Analysis of Alternating Direction Method of Multipliers for a Family of Nonconvex Problems

Mingyi Hong, Zhi-Quan Luo, Meisam Razaviyayn

The alternating direction method of multipliers (ADMM) is widely used to solve large-scale linearly constrained optimization problems, convex or nonconvex, in many engineering fiel…

math.OC2014★ 21 cited

Parallel Direction Method of Multipliers

Huahua Wang, Arindam Banerjee, Zhi-Quan Luo

We consider the problem of minimizing block-separable convex functions subject to linear constraints. While the Alternating Direction Method of Multipliers (ADMM) for two-block lin…

math.OC2014★ 58 cited

Parallel Successive Convex Approximation for Nonsmooth Nonconvex Optimization

Meisam Razaviyayn, Mingyi Hong, Zhi-Quan Luo +1

Consider the problem of minimizing the sum of a smooth (possibly non-convex) and a convex (possibly nonsmooth) function involving a large number of variables. A popular approach to…

math.OC2014

On the Linear Convergence of the Approximate Proximal Splitting Method for Non-Smooth Convex Optimization

Mojtaba Kadkhodaie, Maziar Sanjabi, Zhi-Quan Luo

Consider the problem of minimizing the sum of two convex functions, one being smooth and the other non-smooth. In this paper, we introduce a general class of approximate proximal s…

math.OC2014★ 65 cited

A Block Successive Upper Bound Minimization Method of Multipliers for Linearly Constrained Convex Optimization

Mingyi Hong, Tsung-Hui Chang, Xiangfeng Wang +3

Consider the problem of minimizing the sum of a smooth convex function and a separable nonsmooth convex function subject to linear coupling constraints. Problems of this form arise…