Sorted \(L_1/L_2\) minimization for sparse signal recovery
From MaRDI portal
Publication:6120011
DOI10.1007/s10915-024-02497-2arXiv2308.04125MaRDI QIDQ6120011
No author found.
Publication date: 25 March 2024
Published in: Journal of Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2308.04125
Nonconvex programming, global optimization (90C26) Numerical optimization and variational techniques (65K10) Linear programming (90C05)
Cites Work
- Unnamed Item
- Nearly unbiased variable selection under minimax concave penalty
- A unified approach to model selection and sparse recovery using regularized least squares
- Point source super-resolution via non-convex \(L_1\) based methods
- Theory of compressive sensing via \(\ell_1\)-minimization: a non-RIP analysis and extensions
- Computing sparse representation in a highly coherent dictionary based on difference of \(L_1\) and \(L_2\)
- SCAD-penalized regression in high-dimensional partially linear models
- Fast L1-L2 minimization via a proximal operator
- Minimization of transformed \(L_1\) penalty: theory, difference of convex function algorithm, and robust application in compressed sensing
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- Analysis of the ratio of \(\ell_1\) and \(\ell_2\) norms in compressed sensing
- Ratio and difference of \(l_1\) and \(l_2\) norms and sparse representation with coherent dictionaries
- Coordinate descent algorithms
- Nonconvex sorted \(\ell_1\) minimization for sparse approximation
- A novel regularization based on the error function for sparse recovery
- Coherence Pattern–Guided Compressive Sensing with Unresolved Grids
- Truncated $l_{1-2}$ Models for Sparse Recovery and Rank Minimization
- On Augmented Lagrangian Methods with General Lower-Level Constraints
- Decoding by Linear Programming
- A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- Sparse Approximate Solutions to Linear Systems
- Likelihood-Based Selection and Sharp Parameter Estimation
- Analysis and Algorithms for Some Compressed Sensing Models Based on L1/L2 Minimization
- Minimization of $L_1$ Over $L_2$ for Sparse Signal Recovery with Convergence Guarantee
- Minimizing L 1 over L 2 norms on the gradient
- Accelerated Schemes for the $L_1/L_2$ Minimization
- A Scale-Invariant Approach for Sparse Signal Recovery
- Minimization of $\ell_{1-2}$ for Compressed Sensing
- Sparse Signal Reconstruction via Iterative Support Detection
- Limited-Angle CT Reconstruction via the $L_1/L_2$ Minimization
- Compressed sensing
- Study on \(L_1\) over \(L_2\) Minimization for nonnegative signal recovery
This page was built for publication: Sorted \(L_1/L_2\) minimization for sparse signal recovery
