Robust low-rank tensor recovery via nonconvex singular value minimization
L Chen, X Jiang, X Liu, Z Zhou - IEEE Transactions on Image …, 2020 - ieeexplore.ieee.org
Tensor robust principal component analysis via tensor nuclear norm (TNN) minimization has
been recently proposed to recover the low-rank tensor corrupted with sparse noise/outliers …
been recently proposed to recover the low-rank tensor corrupted with sparse noise/outliers …
Off-grid DOA estimation with nonconvex regularization via joint sparse representation
In this paper, we address the problem of direction-of-arrival (DOA) estimation using sparse
representation. As the performance of on-grid DOA estimation methods will degrade when …
representation. As the performance of on-grid DOA estimation methods will degrade when …
Learning proximal operator methods for nonconvex sparse recovery with theoretical guarantee
Sparse recovery has attracted considerable attention in signal processing community these
years, because of its widespread usage in many applications. Though lots of convex and …
years, because of its widespread usage in many applications. Though lots of convex and …
Square-root lasso with nonconvex regularization: An admm approach
Square-root least absolute shrinkage and selection operator (Lasso), a variant of Lasso, has
recently been proposed with a key advantage that the optimal regularization parameter is …
recently been proposed with a key advantage that the optimal regularization parameter is …
An off-grid DOA estimation method using proximal splitting and successive nonconvex sparsity approximation
Direction-of-arrival (DOA) estimation is a fundamental problem in many signal processing.
Recently, a variety of sparsity-aware methods have been proposed for DOA estimation. The …
Recently, a variety of sparsity-aware methods have been proposed for DOA estimation. The …
Nonconvex sparse logistic regression with weakly convex regularization
In this paper, we propose to fit a sparse logistic regression model by a weakly convex
regularized nonconvex optimization problem. The idea is based on the finding that a weakly …
regularized nonconvex optimization problem. The idea is based on the finding that a weakly …
Sparse Recovery Conditions and Performance Bounds for -Minimization
In sparse recovery, a sparse signal with nonzero entries is to be reconstructed from a
compressed measurement with (). The pseudonorm has been found to be a sparsity …
compressed measurement with (). The pseudonorm has been found to be a sparsity …
2-D learned proximal gradient algorithm for fast sparse matrix recovery
Many real-world problems can be modeled as sparse matrix recovery from two-dimensional
(2D) measurements, which is recognized as one of the most important topics in signal …
(2D) measurements, which is recognized as one of the most important topics in signal …
Nonconvex sparse logistic regression via proximal gradient descent
In this work we propose to fit a sparse logistic regression model by a weakly convex
regularized nonconvex optimization problem. The idea is based on the finding that a weakly …
regularized nonconvex optimization problem. The idea is based on the finding that a weakly …