| Recovering low-rank and sparse components of matrices from incomplete and noisy observations M Tao, X Yuan SIAM Journal on Optimization 21 (1), 57-81, 2011 | 485 | 2011 |
| Alternating direction method with Gaussian back substitution for separable convex programming B He, M Tao, X Yuan SIAM Journal on Optimization 22 (2), 313-340, 2012 | 374 | 2012 |
| Constrained total variation deblurring models and fast algorithms based on alternating direction method of multipliers RH Chan, M Tao, X Yuan SIAM Journal on imaging Sciences 6 (1), 680-697, 2013 | 199 | 2013 |
| Alternating direction algorithms for total variation deconvolution in image reconstruction M Tao, J Yang, B He TR0918, Department of Mathematics, Nanjing University, 2009 | 142 | 2009 |
| A splitting method for separable convex programming B He, M Tao, X Yuan IMA Journal of Numerical Analysis 35 (1), 394-426, 2015 | 121 | 2015 |
| An alternating direction-based contraction method for linearly constrained separable convex programming problems B He, M Tao, M Xu, X Yuan Optimization 62 (4), 573-596, 2013 | 65 | 2013 |
| An alternating direction-based contraction method for linearly constrained separable convex programming problems B He, M Tao, M Xu, X Yuan Optimization 62 (4), 573-596, 2013 | 65 | 2013 |
| On the Convergence Rate of Alternating Direction Method with Logarithmic-Quadratic Proximal Regularization M Tao, X Yuan SIAM Journal on Optimization 22 (4), 1431-1448, 2012 | 42 | 2012 |
| Convergence rate analysis for the alternating direction method of multipliers with a substitution procedure for separable convex programming B He, M Tao, X Yuan Mathematics of Operations Research 42 (3), 662-691, 2017 | 39* | 2017 |
| Convergence rate and iteration complexity on the alternating direction method of multipliers with a substitution procedure for separable convex programming B He, M Tao, X Yuan Math. Oper. Res., under revision 2, 000-000, 2012 | 35 | 2012 |
| On the Optimal Linear Convergence Rate of a Generalized Proximal Point Algorithm MIN TAO, X YUAN | 25* | |
| Decomposition methods for computing directional stationary solutions of a class of nonsmooth nonconvex optimization problems JS Pang, M Tao SIAM Journal on Optimization 28 (2), 1640-1669, 2018 | 23 | 2018 |
| An inexact parallel splitting augmented Lagrangian method for monotone variational inequalities with separable structures. M Tao, X Yuan Computational Optimization & Applications 52 (2), 2012 | 22 | 2012 |
| Linearized alternating direction method of multipliers for constrained linear least-squares problem RH Chan, M Tao, X Yuan East Asian Journal on Applied Mathematics 2 (4), 326-341, 2012 | 21 | 2012 |
| Convergence analysis of the direct extension of ADMM for multiple-block separable convex minimization M Tao, X Yuan Advances in Computational Mathematics 44, 773-813, 2018 | 20 | 2018 |
| Limited-Angle CT Reconstruction via the Minimization C Wang, M Tao, JG Nagy, Y Lou SIAM Journal on Imaging Sciences 14 (2), 749-777, 2021 | 19 | 2021 |
| A splitting method for separate convex programming with linking linear constraints B He, M Tao, X Yuan Optimization-online: http://www. optimizationonline. org/DB HTML/2010/06 …, 2010 | 16 | 2010 |
| On Glowinski’s open question on the alternating direction method of multipliers M Tao, X Yuan Journal of Optimization Theory and Applications 179, 163-196, 2018 | 15 | 2018 |
| Rigorous convergence analysis of alternating variable minimization with multiplier methods for quadratic programming problems with equality constraints ZZ Bai, M Tao BIT Numerical Mathematics 56 (2), 399-422, 2016 | 14 | 2016 |
| Convergence study of indefinite proximal ADMM with a relaxation factor M Tao Computational Optimization and Applications 77 (1), 91-123, 2020 | 9 | 2020 |
