Ke Wei
Cited by
Cited by
Rapid, robust, and reliable blind deconvolution via nonconvex optimization
X Li, S Ling, T Strohmer, K Wei
Applied and computational harmonic analysis 47 (3), 893-934, 2019
Normalized iterative hard thresholding for matrix completion
J Tanner, K Wei
SIAM Journal on Scientific Computing 35 (5), S104-S125, 2013
Solving systems of phaseless equations via Kaczmarz methods: A proof of concept study
K Wei
arXiv preprint arXiv:1502.01822, 2015
Low rank matrix completion by alternating steepest descent methods
J Tanner, K Wei
Oxford Numerical Analysis Group Preprint, 2014
Guarantees of Riemannian Optimization for Low Rank Matrix Recovery
K Wei, JF Cai, TF Chan, S Leung
SIAM Journal on Matrix Analysis and Applications 37 (3), 1198-1222, 2016
CGIHT: Conjugate Gradient Iterative Hard Thresholding for Compressed Sensing and Matrix Completion
JD Blanchard, J Tanner, K Wei
Fast and provable algorithms for spectrally sparse signal reconstruction via low-rank Hankel matrix completion
JF Cai, T Wang, K Wei
Applied and Computational Harmonic Analysis 46 (1), 94-121, 2019
Conjugate Gradient Iterative Hard Thresholding: Observed Noise Stability for Compressed Sensing
JD Blanchard, J Tanner, K Wei
Guarantees of riemannian optimization for low rank matrix completion
K Wei, JF Cai, TF Chan, S Leung
Inverse Problems & Imaging 14 (2), 233, 2020
When do birds of a feather flock together? k-means, proximity, and conic programming
X Li, Y Li, S Ling, T Strohmer, K Wei
Mathematical Programming 179 (1), 295-341, 2020
Spectral compressed sensing via projected gradient descent
JF Cai, T Wang, K Wei
SIAM Journal on Optimization 28 (3), 2625-2653, 2018
Accelerated alternating projections for robust principal component analysis
HQ Cai, JF Cai, K Wei
The Journal of Machine Learning Research 20 (1), 685-717, 2019
Fast iterative hard thresholding for compressed sensing
K Wei
Riemannian proximal gradient methods
W Huang, K Wei
Mathematical Programming, 1-43, 2021
Solving systems of phaseless equations via Riemannian optimization with optimal sampling complexity
JF Cai, K Wei
arXiv preprint arXiv:1809.02773, 2018
Primal-dual method for continuous max-flow approaches
K Wei, X Tai, T Chan, S Leung
Proceedings of 5th ECCOMAS Conference on Computational Vision and Medical …, 2016
Toward the optimal construction of a loss function without spurious local minima for solving quadratic equations
Z Li, JF Cai, K Wei
IEEE Transactions on Information Theory 66 (5), 3242-3260, 2019
Extending FISTA to Riemannian optimization for sparse PCA
W Huang, K Wei
arXiv preprint arXiv:1909.05485, 2019
Painless breakups—Efficient demixing of low rank matrices
T Strohmer, K Wei
Journal of Fourier Analysis and Applications 25 (1), 1-31, 2019
Exploiting the structure effectively and efficiently in low-rank matrix recovery
JF Cai, K Wei
Handbook of Numerical Analysis 19, 21-51, 2018
The system can't perform the operation now. Try again later.
Articles 1–20