| Publication | Date of Publication | Type |
|---|
| Fast adaptive ADMM with Gaussian back substitution for multiple block linear constrained separable problems | 2026-04-27 | Paper |
A half-proximal symmetric splitting method for non-convex separable optimization
Acta Mathematica Sinica. English Series | 2025-11-19 | Paper |
Where Paths Collide: A Comprehensive Survey of Classic and Learning-Based Multi-Agent Pathfinding
(available as arXiv preprint) | 2025-01-01 | Paper |
Generalized variational framework with minimax optimization for parametric blind deconvolution
Inverse Problems | 2024-06-18 | Paper |
Mitigating disparate impact on model accuracy in differentially private learning
Information Sciences | 2024-04-11 | Paper |
An alternating structure-adapted Bregman proximal gradient descent algorithm for constrained nonconvex nonsmooth optimization problems and its inertial variant
Journal of Global Optimization | 2023-08-02 | Paper |
Perturbation techniques for convergence analysis of proximal gradient method and other first-order algorithms via variational analysis
Set-Valued and Variational Analysis | 2022-03-15 | Paper |
The distance between convex sets with Minkowski sum structure: application to collision detection
Computational Optimization and Applications | 2021-05-03 | Paper |
A block successive upper-bound minimization method of multipliers for linearly constrained convex optimization
Mathematics of Operations Research | 2021-01-08 | Paper |
Asynchronous Distributed ADMM for Large-Scale Optimization—Part I: Algorithm and<?Pub _newline ?>Convergence Analysis
IEEE Transactions on Signal Processing | 2019-02-07 | Paper |
Asynchronous Distributed ADMM for Large-Scale Optimization—Part II: Linear Convergence Analysis and Numerical Performance
IEEE Transactions on Signal Processing | 2019-02-07 | Paper |
Implementing the alternating direction method of multipliers for big datasets: a case study of least absolute shrinkage and selection operator
SIAM Journal on Scientific Computing | 2018-10-08 | Paper |
Multi-Agent Distributed Optimization via Inexact Consensus ADMM
IEEE Transactions on Signal Processing | 2018-08-22 | Paper |
Iteration complexity analysis of block coordinate descent methods
Mathematical Programming. Series A. Series B | 2017-05-15 | Paper |
Solving Multiple-Block Separable Convex Minimization Problems Using Two-Block Alternating Direction Method of Multipliers
(available as arXiv preprint) | 2016-01-25 | Paper |
| Solving Multiple-Block Separable Convex Minimization Problems Using Two-Block Alternating Direction Method of Multipliers | 2016-01-25 | Paper |
On the convergence rate of a class of proximal-based decomposition methods for monotone variational inequalities
Journal of the Operations Research Society of China | 2015-10-30 | Paper |
| A Scalable Frank-Wolfe based Augmented Lagrangian Method for Linearly Constrained Composite Convex Programming | 2015-07-27 | Paper |
WITHDRAWN: A Scalable Frank-Wolfe based Augmented Lagrangian Method for Linearly Constrained Composite Convex Programming
(available as arXiv preprint) | 2015-01-01 | Paper |
A relaxed-PPA contraction method for sparse signal recovery
Journal of Shanghai Jiaotong University (Science) | 2014-03-27 | Paper |
The linearized alternating direction method of multipliers for Dantzig selector
SIAM Journal on Scientific Computing | 2013-01-24 | Paper |
An asymmetric proximal decomposition method for convex programming with linearly coupling constraints
Advances in Operations Research | 2012-09-04 | Paper |
Proximal alternating direction-based contraction methods for separable linearly constrained convex optimization
Frontiers of Mathematics in China | 2011-04-08 | Paper |
