895 citations · 5.3k across the 104 of their papers we have counts for
4 papers · 2 filters
Improved Iteration Complexity Bounds of Cyclic Block Coordinate Descent for Convex Problems
Ruoyu Sun, Mingyi Hong
The iteration complexity of the block-coordinate descent (BCD) type algorithm has been under extensive investigation. It was recently shown that for convex problems the classical c…
A Unified Algorithmic Framework for Block-Structured Optimization Involving Big Data
Mingyi Hong, Meisam Razaviyayn, Zhi-Quan Luo +1
This article presents a powerful algorithmic framework for big data optimization, called the Block Successive Upper bound Minimization (BSUM). The BSUM includes as special cases ma…
Stochastic Proximal Gradient Consensus Over Random Networks
Mingyi Hong, Tsung-Hui Chang
We consider solving a convex, possibly stochastic optimization problem over a randomly time-varying multi-agent network. Each agent has access to some local objective function, and…
Quantized Consensus ADMM for Multi-Agent Distributed Optimization
Shengyu Zhu, Mingyi Hong, Biao Chen
Multi-agent distributed optimization over a network minimizes a global objective formed by a sum of local convex functions using only local computation and communication. We develo…