Nonconvex sorted \(\ell_1\) minimization for sparse approximation
From MaRDI portal
Publication:2516375
DOI10.1007/s40305-014-0069-4zbMath1319.49050arXiv1409.8179OpenAlexW1989834782MaRDI QIDQ2516375
Publication date: 31 July 2015
Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1409.8179
nonconvex optimizationsparse approximationlocal minimizeriterative sorted thresholdingiteratively reweighted \(\ell_1\) minimization
Nonconvex programming, global optimization (90C26) Numerical optimization and variational techniques (65K10) Numerical methods based on nonlinear programming (49M37) Methods of reduced gradient type (90C52)
Related Items
Exact penalization for cardinality and rank-constrained optimization problems via partial regularization ⋮ Generalized sparse recovery model and its neural dynamical optimization method for compressed sensing ⋮ Accelerated sparse recovery via gradient descent with nonlinear conjugate gradient momentum ⋮ Sorted \(L_1/L_2\) minimization for sparse signal recovery ⋮ Morozov's discrepancy principle for \(\alpha\ell_1-\beta\ell_2\) sparsity regularization ⋮ A class of null space conditions for sparse recovery via nonconvex, non-separable minimizations ⋮ A projected gradient method for αℓ 1 − βℓ 2 sparsity regularization ** ⋮ Fast L1-L2 minimization via a proximal operator ⋮ Fast algorithms for robust principal component analysis with an upper bound on the rank ⋮ $ \newcommand{\e}{{\rm e}} {\alpha\ell_{1}-\beta\ell_{2}}$ regularization for sparse recovery ⋮ Sparse Recovery via Partial Regularization: Models, Theory, and Algorithms
Uses Software
Cites Work
- Unnamed Item
- Statistics for high-dimensional data. Methods, theory and applications.
- A note on the complexity of \(L _{p }\) minimization
- Iterative hard thresholding for compressed sensing
- Iterative thresholding for sparse approximations
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- Convergence of the reweighted \(\ell_1\) minimization algorithm for \(\ell_2-\ell_p\) minimization
- Sparse recovery by non-convex optimization - instance optimality
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
- Complexity of unconstrained \(L_2 - L_p\) minimization
- Improved Iteratively Reweighted Least Squares for Unconstrained Smoothed $\ell_q$ Minimization
- Compressed sensing and best 𝑘-term approximation
- Alternating Direction Algorithms for $\ell_1$-Problems in Compressive Sensing
- Hard Thresholding Pursuit: An Algorithm for Compressive Sensing
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Greed is Good: Algorithmic Results for Sparse Approximation
- Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- Iteratively reweighted least squares minimization for sparse recovery
- Atomic Decomposition by Basis Pursuit
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- Recovering Sparse Signals With a Certain Family of Nonconvex Penalties and DC Programming
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- Sparse Approximate Solutions to Linear Systems
- Subspace Pursuit for Compressive Sensing Signal Reconstruction
- Sparse Signal Reconstruction via Iterative Support Detection
- Sparse Image and Signal Processing
