Computational approaches to non-convex, sparsity-inducing multi-penalty regularization
From MaRDI portal
Publication:4989924
DOI10.1088/1361-6420/abdd46zbMath1464.94012arXiv1908.02503OpenAlexW3123017845MaRDI QIDQ4989924
Johannes Maly, Zeljko Kereta, Valeriya Naumova
Publication date: 27 May 2021
Published in: Inverse Problems (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1908.02503
non-convex optimizationmulti-penalty regularizationiterative thresholding\(l_q\)-regularization \((0<q<1)\)
Nonconvex programming, global optimization (90C26) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)
Related Items (1)
Cites Work
- Unnamed Item
- Nearly unbiased variable selection under minimax concave penalty
- A mathematical introduction to compressive sensing
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- From error bounds to the complexity of first-order descent methods for convex functions
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Global error bounds for piecewise convex polynomials
- Adaptive multi-penalty regularization based on a generalized Lasso path
- Minimization of non-smooth, non-convex functionals by iterative thresholding
- Sparsity-enforcing regularisation and ISTA revisited
- Conditions on optimal support recovery in unmixing problems by means of multi-penalty regularization
- Minimization of multi-penalty functionals by alternating iterative thresholding and optimal parameter choices
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- Linear convergence of adaptively iterative thresholding algorithms for compressed sensing
- Damping Noise-Folding and Enhanced Support Recovery in Compressed Sensing
- First-Order Methods in Optimization
- Sparse Regularization: Convergence Of Iterative Jumping Thresholding Algorithm
- Information Theoretic Bounds for Compressed Sensing
- Convex analysis and monotone operator theory in Hilbert spaces
This page was built for publication: Computational approaches to non-convex, sparsity-inducing multi-penalty regularization
