The following pages link to Min Tao (Q291884):
Displaying 31 items.
- (Q163997) (redirect page) (← links)
- Rigorous convergence analysis of alternating variable minimization with multiplier methods for quadratic programming problems with equality constraints (Q291885) (← links)
- An inexact parallel splitting augmented Lagrangian method for monotone variational inequalities with separable structures (Q453611) (← links)
- The generalized proximal point algorithm with step size 2 is not necessarily convergent (Q721955) (← links)
- Convergence analysis of the direct extension of ADMM for multiple-block separable convex minimization (Q723737) (← links)
- On preconditioned and relaxed AVMM methods for quadratic programming problems with equality constraints (Q730628) (← links)
- Convergence study of indefinite proximal ADMM with a relaxation factor (Q782911) (← links)
- On Glowinski's open question on the alternating direction method of multipliers (Q1730806) (← links)
- On the optimal linear convergence rate of a generalized proximal point algorithm (Q1742669) (← links)
- Solving a class of matrix minimization problems by linear variational inequality approaches (Q2431152) (← links)
- Comparison of two approximal proximal point algorithms for monotone variational inequalities (Q2644627) (← links)
- Error bound and isocost imply linear convergence of DCA-based algorithms to D-stationarity (Q2697002) (← links)
- An alternating direction-based contraction method for linearly constrained separable convex programming problems (Q2841146) (← links)
- Constrained Total Variation Deblurring Models and Fast Algorithms Based on Alternating Direction Method of Multipliers (Q2873212) (← links)
- Alternating Direction Method with Gaussian Back Substitution for Separable Convex Programming (Q2910874) (← links)
- Accelerated Uzawa methods for convex optimization (Q2970101) (← links)
- Recovering Low-Rank and Sparse Components of Matrices from Incomplete and Noisy Observations (Q3004974) (← links)
- (Q3572657) (← links)
- (Q3642004) (← links)
- Decomposition Methods for Computing Directional Stationary Solutions of a Class of Nonsmooth Nonconvex Optimization Problems (Q4641680) (← links)
- On the $O(1/t)$ Convergence Rate of Alternating Direction Method with Logarithmic-Quadratic Proximal Regularization (Q4915172) (← links)
- (Q4979593) (← links)
- Minimization of $L_1$ Over $L_2$ for Sparse Signal Recovery with Convergence Guarantee (Q5071446) (← links)
- Minimizing L <sub>1</sub> over L <sub>2</sub> norms on the gradient (Q5076010) (← links)
- A splitting method for separable convex programming (Q5174194) (← links)
- Convergence Rate Analysis for the Alternating Direction Method of Multipliers with a Substitution Procedure for Separable Convex Programming (Q5359115) (← links)
- Linearized Alternating Direction Method of Multipliers for Constrained Linear Least-Squares Problem (Q5406928) (← links)
- (Q5425177) (← links)
- Limited-Angle CT Reconstruction via the $L_1/L_2$ Minimization (Q5860341) (← links)
- Critical role of domain switching on the fracture toughness of poled ferroelectrics (Q5926685) (← links)
- Study on \(L_1\) over \(L_2\) Minimization for nonnegative signal recovery (Q6101685) (← links)
