The following pages link to Hui Zhang (Q362294):
Displaying 36 items.
- Reweighted minimization model for MR image reconstruction with split Bregman method (Q362295) (← links)
- (Q435845) (redirect page) (← links)
- Strongly convex programming for exact matrix completion and robust principal component analysis (Q435847) (← links)
- New bounds for circulant Johnson-Lindenstrauss embeddings (Q471965) (← links)
- Online manifold regularization by dual ascending procedure (Q474202) (← links)
- (Q498339) (redirect page) (← links)
- On uniqueness guarantees of solution in convex regularized linear inverse problems (Q498340) (← links)
- The restricted strong convexity revisited: analysis of equivalence to error bound and quadratic growth (Q523179) (← links)
- (Q643649) (redirect page) (← links)
- A lower bound guaranteeing exact matrix completion via singular value thresholding algorithm (Q643650) (← links)
- Projected Landweber iteration for matrix completion (Q708281) (← links)
- On robust width property for Lasso and Dantzig selector (Q1709661) (← links)
- A fast fixed point algorithm for total variation deblurring and segmentation (Q1932946) (← links)
- New regularization method and iteratively reweighted algorithm for sparse vector recovery (Q2033724) (← links)
- Inertial proximal incremental aggregated gradient method with linear convergence guarantees (Q2084299) (← links)
- A weighted randomized sparse Kaczmarz method for solving linear systems (Q2099537) (← links)
- Extragradient and extrapolation methods with generalized Bregman distances for saddle point problems (Q2157903) (← links)
- Global complexity analysis of inexact successive quadratic approximation methods for regularized optimization under mild assumptions (Q2200083) (← links)
- Projective splitting methods for sums of maximal monotone operators with applications (Q2257570) (← links)
- A dual algorithm for a class of augmented convex signal recovery models (Q2257625) (← links)
- Necessary and sufficient conditions of solution uniqueness in 1-norm minimization (Q2260650) (← links)
- Nonconvex proximal incremental aggregated gradient method with linear convergence (Q2275279) (← links)
- New analysis of linear convergence of gradient-type methods via unifying error bound conditions (Q2297652) (← links)
- Restricted strong convexity and its applications to convergence analysis of gradient-type methods in convex optimization (Q2355319) (← links)
- Projected shrinkage algorithm for box-constrained \(\ell _1\)-minimization (Q2361128) (← links)
- One condition for solution uniqueness and robustness of both \(\ell_1\)-synthesis and \(\ell_1\)-analysis minimizations (Q2374380) (← links)
- Nuclear norm regularization with a low-rank constraint for matrix completion (Q3061226) (← links)
- (Q3071307) (← links)
- (Q3451275) (← links)
- Robust analysis ℓ<sub>1</sub>-recovery from Gaussian measurements and total variation minimization (Q4594564) (← links)
- Revisiting linearized Bregman iterations under Lipschitz-like convexity condition (Q5058656) (← links)
- Adaptively sketched Bregman projection methods for linear systems (Q5076003) (← links)
- Training GANs with centripetal acceleration (Q5858988) (← links)
- Sparse sampling Kaczmarz–Motzkin method with linear convergence (Q6139724) (← links)
- Adaptively Sketched Bregman Projection Methods for Linear Systems (Q6386942) (← links)
- Revisiting Linearized Bregman Iterations under Lipschitz-like Convexity Condition (Q6392757) (← links)
