Nonconvex sorted _1 minimization for sparse approximation
From MaRDI portal
Publication:2516375
Abstract: The norm is the tight convex relaxation for the "norm" and has been successfully applied for recovering sparse signals. For problems with fewer samplings, one needs to enhance the sparsity by nonconvex penalties such as "norm". As one method for solving minimization problems, iteratively reweighted minimization updates the weight for each component based on the value of the same component at the previous iteration. It assigns large weights on small components in magnitude and small weights on large components in magnitude. In this paper, we consider a weighted penalty with the set of the weights fixed and the weights are assigned based on the sort of all the components in magnitude. The smallest weight is assigned to the largest component in magnitude. This new penalty is called nonconvex sorted . Then we propose two methods for solving nonconvex sorted minimization problems: iteratively reweighted minimization and iterative sorted thresholding, and prove that both methods will converge to a local optimum. We also show that both methods are generalizations of iterative support detection and iterative hard thresholding respectively. The numerical experiments demonstrate the better performance of assigning weights by sort compared to minimization.
Recommendations
- Iterative reweighted methods for \(\ell _1-\ell _p\) minimization
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- Iterative reweighted minimization methods for \(l_p\) regularized unconstrained nonlinear programming
- Compressed sensing recovery via nonconvex shrinkage penalties
- Weighted \(\ell_p\) (\(0<p\le 1\)) minimization with non-uniform weights for sparse recovery under partial support information
Cites work
- A note on the complexity of \(L _{p }\) minimization
- Alternating direction algorithms for \(\ell_1\)-problems in compressive sensing
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- Atomic Decomposition by Basis Pursuit
- Complexity of unconstrained \(L_2 - L_p\) minimization
- Compressed sensing and best \(k\)-term approximation
- Convergence of the reweighted \(\ell_1\) minimization algorithm for \(\ell_2-\ell_p\) minimization
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- Greed is Good: Algorithmic Results for Sparse Approximation
- Hard thresholding pursuit: an algorithm for compressive sensing
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- Improved iteratively reweighted least squares for unconstrained smoothed _q minimization
- Iterative hard thresholding for compressed sensing
- Iterative thresholding for sparse approximations
- Iteratively reweighted least squares minimization for sparse recovery
- Recovering Sparse Signals With a Certain Family of Nonconvex Penalties and DC Programming
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
- Sparse Approximate Solutions to Linear Systems
- Sparse image and signal processing. Wavelets, curvelets, morphological diversity
- Sparse recovery by non-convex optimization - instance optimality
- Sparse signal reconstruction via iterative support detection
- Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
- Statistics for high-dimensional data. Methods, theory and applications.
- Subspace Pursuit for Compressive Sensing Signal Reconstruction
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
Cited in
(18)- Fast L1-L2 minimization via a proximal operator
- Fast algorithms for robust principal component analysis with an upper bound on the rank
- A class of null space conditions for sparse recovery via nonconvex, non-separable minimizations
- Sorted concave penalized regression
- Generalized sparse recovery model and its neural dynamical optimization method for compressed sensing
- Morozov's discrepancy principle for _1-_2 sparsity regularization
- Weighted <inline-formula> <tex-math notation="LaTeX">$\ell _{1}$ </tex-math></inline-formula>-Minimization for Generalized Non-Uniform Sparse Model
- Bregman iteration algorithm for sparse nonnegative matrix factorizations via alternating l₁-norm minimization
- A projected gradient method for \(\alpha\ell_1-\beta\ell_2\) sparsity regularization
- The trimmed Lasso: sparse recovery guarantees and practical optimization by the generalized soft-min penalty
- \(\alpha\ell_1-\beta\ell_2\) regularization for sparse recovery
- Sparse Recovery via Partial Regularization: Models, Theory, and Algorithms
- scientific article; zbMATH DE number 6746123 (Why is no real title available?)
- Exact penalization for cardinality and rank-constrained optimization problems via partial regularization
- Accelerated sparse recovery via gradient descent with nonlinear conjugate gradient momentum
- Sorted \(L_1/L_2\) minimization for sparse signal recovery
- A projected gradient method for nonlinear inverse problems with _1 - _2 sparsity regularization
- Truncated Huber penalty for sparse signal recovery with convergence analysis
This page was built for publication: Nonconvex sorted \(\ell_1\) minimization for sparse approximation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2516375)
