231 related articles for article (PubMed ID: 30892254)
1. 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]
2. Nonconvex Nonsmooth Low Rank Minimization via Iteratively Reweighted Nuclear Norm.
Lu C; Tang J; Yan S; Lin Z
IEEE Trans Image Process; 2016 Feb; 25(2):829-39. PubMed ID: 26841392
[TBL] [Abstract][Full Text] [Related]
3. A Nonconvex Relaxation Approach to Low-Rank Tensor Completion.
Zhang X
IEEE Trans Neural Netw Learn Syst; 2019 Jun; 30(6):1659-1671. PubMed ID: 30346292
[TBL] [Abstract][Full Text] [Related]
4. Inertial proximal alternating minimization for nonconvex and nonsmooth problems.
Zhang Y; He S
J Inequal Appl; 2017; 2017(1):232. PubMed ID: 29026279
[TBL] [Abstract][Full Text] [Related]
5. Proximal iteratively reweighted algorithm for low-rank matrix recovery.
Ma CQ; Ren YS
J Inequal Appl; 2018; 2018(1):12. PubMed ID: 29367824
[TBL] [Abstract][Full Text] [Related]
6. Convergence of Proximal Iteratively Reweighted Nuclear Norm Algorithm for Image Processing.
Tao Sun ; Hao Jiang ; Lizhi Cheng
IEEE Trans Image Process; 2017 Dec; 26(12):5632-5644. PubMed ID: 28858798
[TBL] [Abstract][Full Text] [Related]
7. On the convergence of nonconvex minimization methods for image recovery.
Xiao J; Ng MK; Yang YF
IEEE Trans Image Process; 2015 May; 24(5):1587-98. PubMed ID: 25675457
[TBL] [Abstract][Full Text] [Related]
8. Low-rank structure learning via nonconvex heuristic recovery.
Deng Y; Dai Q; Liu R; Zhang Z; Hu S
IEEE Trans Neural Netw Learn Syst; 2013 Mar; 24(3):383-96. PubMed ID: 24808312
[TBL] [Abstract][Full Text] [Related]
9. Large-Scale Affine Matrix Rank Minimization With a Novel Nonconvex Regularizer.
Wang Z; Liu Y; Luo X; Wang J; Gao C; Peng D; Chen W
IEEE Trans Neural Netw Learn Syst; 2022 Sep; 33(9):4661-4675. PubMed ID: 33646960
[TBL] [Abstract][Full Text] [Related]
10. 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]
11. Generalized Nonconvex Approach for Low-Tubal-Rank Tensor Recovery.
Wang H; Zhang F; Wang J; Huang T; Huang J; Liu X
IEEE Trans Neural Netw Learn Syst; 2022 Aug; 33(8):3305-3319. PubMed ID: 33513116
[TBL] [Abstract][Full Text] [Related]
12. Matrix Completion Based on Non-convex Low Rank Approximation.
Nie F; Hu Z; Li X
IEEE Trans Image Process; 2018 Dec; ():. PubMed ID: 30571624
[TBL] [Abstract][Full Text] [Related]
13. Robust Low-Rank Tensor Recovery via Nonconvex Singular Value Minimization.
Chen L; Jiang X; Liu X; Zhou Z
IEEE Trans Image Process; 2020 Sep; PP():. PubMed ID: 32946392
[TBL] [Abstract][Full Text] [Related]
14. An efficient matrix bi-factorization alternative optimization method for low-rank matrix recovery and completion.
Liu Y; Jiao LC; Shang F; Yin F; Liu F
Neural Netw; 2013 Dec; 48():8-18. PubMed ID: 23891807
[TBL] [Abstract][Full Text] [Related]
15. LRR for Subspace Segmentation via Tractable Schatten-$p$ Norm Minimization and Factorization.
Zhang H; Yang J; Shang F; Gong C; Zhang Z
IEEE Trans Cybern; 2018 Mar; ():. PubMed ID: 29993878
[TBL] [Abstract][Full Text] [Related]
16. Fast and accurate matrix completion via truncated nuclear norm regularization.
Hu Y; Zhang D; Ye J; Li X; He X
IEEE Trans Pattern Anal Mach Intell; 2013 Sep; 35(9):2117-30. PubMed ID: 23868774
[TBL] [Abstract][Full Text] [Related]
17. Hyperspectral Images Denoising via Nonconvex Regularized Low-Rank and Sparse Matrix Decomposition.
Xie T; Li S; Sun B
IEEE Trans Image Process; 2020; 29():44-56. PubMed ID: 31329555
[TBL] [Abstract][Full Text] [Related]
18. 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]
19. 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]
20. Large-Scale Low-Rank Matrix Learning with Nonconvex Regularizers.
Yao Q; Kwok JT; Wang T; Liu TY
IEEE Trans Pattern Anal Mach Intell; 2019 Nov; 41(11):2628-2643. PubMed ID: 30040624
[TBL] [Abstract][Full Text] [Related]
[Next] [New Search]
