136 related articles for article (PubMed ID: 32784147)
1. Global Convergence Guarantees of (A)GIST for a Family of Nonconvex Sparse Learning Problems.
Zhang H; Qian F; Shang F; Du W; Qian J; Yang J
IEEE Trans Cybern; 2022 May; 52(5):3276-3288. PubMed ID: 32784147
[TBL] [Abstract][Full Text] [Related]
2. Scalable Proximal Jacobian Iteration Method With Global Convergence Analysis for Nonconvex Unconstrained Composite Optimizations.
Zhang H; Qian J; Gao J; Yang J; Xu C
IEEE Trans Neural Netw Learn Syst; 2019 Sep; 30(9):2825-2839. PubMed ID: 30668503
[TBL] [Abstract][Full Text] [Related]
3. Low-Rank Matrix Recovery via Modified Schatten-p Norm Minimization with Convergence Guarantees.
Zhang H; Qian J; Zhang B; Yang J; Gong C; Wei Y
IEEE Trans Image Process; 2019 Dec; ():. PubMed ID: 31831418
[TBL] [Abstract][Full Text] [Related]
4. Neural network for a class of sparse optimization with L
Wei Z; Li Q; Wei J; Bian W
Neural Netw; 2022 Jul; 151():211-221. PubMed ID: 35439665
[TBL] [Abstract][Full Text] [Related]
5. A General Iterative Shrinkage and Thresholding Algorithm for Non-convex Regularized Optimization Problems.
Gong P; Zhang C; Lu Z; Huang JZ; Ye J
JMLR Workshop Conf Proc; 2013; 28(2):37-45. PubMed ID: 25285330
[TBL] [Abstract][Full Text] [Related]
6. Efficient Recovery of Low-Rank Matrix via Double Nonconvex Nonsmooth Rank Minimization.
Zhang H; Gong C; Qian J; Zhang B; Xu C; Yang J
IEEE Trans Neural Netw Learn Syst; 2019 Oct; 30(10):2916-2925. PubMed ID: 30892254
[TBL] [Abstract][Full Text] [Related]
7. OPTIMAL COMPUTATIONAL AND STATISTICAL RATES OF CONVERGENCE FOR SPARSE NONCONVEX LEARNING PROBLEMS.
Wang Z; Liu H; Zhang T
Ann Stat; 2014; 42(6):2164-2201. PubMed ID: 25544785
[TBL] [Abstract][Full Text] [Related]
8. I-LAMM FOR SPARSE LEARNING: SIMULTANEOUS CONTROL OF ALGORITHMIC COMPLEXITY AND STATISTICAL ERROR.
Fan J; Liu H; Sun Q; Zhang T
Ann Stat; 2018 Apr; 46(2):814-841. PubMed ID: 29930436
[TBL] [Abstract][Full Text] [Related]
9. Iteratively Reweighted Minimax-Concave Penalty Minimization for Accurate Low-rank Plus Sparse Matrix Decomposition.
Pokala PK; Hemadri RV; Seelamantula CS
IEEE Trans Pattern Anal Mach Intell; 2022 Dec; 44(12):8992-9010. PubMed ID: 34699349
[TBL] [Abstract][Full Text] [Related]
10. Enhanced Group Sparse Regularized Nonconvex Regression for Face Recognition.
Zhang C; Li H; Chen C; Qian Y; Zhou X
IEEE Trans Pattern Anal Mach Intell; 2022 May; 44(5):2438-2452. PubMed ID: 33108280
[TBL] [Abstract][Full Text] [Related]
11. Feature Selection With $\ell_{2,1-2}$ Regularization.
Yong Shi ; Jianyu Miao ; Zhengyu Wang ; Peng Zhang ; Lingfeng Niu
IEEE Trans Neural Netw Learn Syst; 2018 Oct; 29(10):4967-4982. PubMed ID: 29994757
[TBL] [Abstract][Full Text] [Related]
12. Unsupervised Feature Selection With Constrained ℓ₂,₀-Norm and Optimized Graph.
Nie F; Dong X; Tian L; Wang R; Li X
IEEE Trans Neural Netw Learn Syst; 2022 Apr; 33(4):1702-1713. PubMed ID: 33361007
[TBL] [Abstract][Full Text] [Related]
13. Arbitrary norm support vector machines.
Huang K; Zheng D; King I; Lyu MR
Neural Comput; 2009 Feb; 21(2):560-82. PubMed ID: 19431269
[TBL] [Abstract][Full Text] [Related]
14. Smoothing neural network for L
Li W; Bian W
Neural Netw; 2021 Nov; 143():678-689. PubMed ID: 34403868
[
