A novel regularization based on the error function for sparse recovery
From MaRDI portal
Publication:2660696
DOI10.1007/s10915-021-01443-wzbMath1462.90069arXiv2007.02784OpenAlexW3134155979MaRDI QIDQ2660696
Yifei Lou, Jing Qin, Weihong Guo, Ming Yan
Publication date: 31 March 2021
Published in: Journal of Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2007.02784
Nonconvex programming, global optimization (90C26) Linear programming (90C05) Inverse problems in optimal control (49N45)
Related Items
A General Framework of Rotational Sparse Approximation in Uncertainty Quantification ⋮ Sparse signal reconstruction via collaborative neurodynamic optimization ⋮ A nonconvex nonsmooth image prior based on the hyperbolic tangent function ⋮ Accelerated sparse recovery via gradient descent with nonlinear conjugate gradient momentum ⋮ Sorted \(L_1/L_2\) minimization for sparse signal recovery
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- 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
- A mathematical introduction to compressive sensing
- Computing sparse representation in a highly coherent dictionary based on difference of \(L_1\) and \(L_2\)
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- A survey of cross-validation procedures for model selection
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- Minimization of transformed \(L_1\) penalty: theory, difference of convex function algorithm, and robust application in compressed sensing
- A new primal-dual algorithm for minimizing the sum of three functions with a linear operator
- A first-order primal-dual algorithm for convex problems with applications to imaging
- A class of null space conditions for sparse recovery via nonconvex, non-separable minimizations
- Ratio and difference of \(l_1\) and \(l_2\) norms and sparse representation with coherent dictionaries
- Correcting for unknown errors in sparse high-dimensional function approximation
- Minimization of transformed \(l_1\) penalty: closed form representation and iterative thresholding algorithms
- Coherence Pattern–Guided Compressive Sensing with Unresolved Grids
- Linear Inversion of Band-Limited Reflection Seismograms
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- Uncertainty principles and ideal atomic decomposition
- Sparse Approximate Solutions to Linear Systems
- Likelihood-Based Selection and Sharp Parameter Estimation
- 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
- On Iteratively Reweighted Algorithms for Nonsmooth Nonconvex Optimization in Computer Vision
- The Computational Complexity of the Restricted Isometry Property, the Nullspace Property, and Related Concepts in Compressed Sensing
- Towards a Mathematical Theory of Super‐resolution
- Stable signal recovery from incomplete and inaccurate measurements
- On Bounds for the Normal Integral
- Compressed sensing
