A convex relaxation framework consisting of a primal-dual alternative algorithm for solving \(\ell_0\) sparsity-induced optimization problems with application to signal recovery based image restoration
DOI10.1016/j.cam.2022.114878OpenAlexW4303521013MaRDI QIDQ2095175
Publication date: 9 November 2022
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2022.114878
Ridge regression; shrinkage estimators (Lasso) (62J07) Linear regression; mixed models (62J05) Applications of mathematical programming (90C90) Nonconvex programming, global optimization (90C26) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Nearly unbiased variable selection under minimax concave penalty
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Best subset selection via a modern optimization lens
- Iterative thresholding for sparse approximations
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- Successive convex approximations to cardinality-constrained convex programs: a piecewise-linear DC approach
- Compression and denoising using \(l _{0}\)-norm
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
- An efficient algorithm for \(\ell_{0}\) minimization in wavelet frame based image restoration
- Iterative adaptive nonconvex low-rank tensor approximation to image restoration based on ADMM
- Complexity of unconstrained \(L_2 - L_p\) minimization
- Strong oracle optimality of folded concave penalized estimation
- Sparse Modeling for Image and Vision Processing
- A Majorize-Minimize Subspace Approach for $\ell_2-\ell_0$ Image Regularization
- Introduction to Nonsmooth Optimization
- Local Linear Convergence of ISTA and FISTA on the LASSO Problem
- Better Subset Regression Using the Nonnegative Garrote
- A Continuous Exact $\ell_0$ Penalty (CEL0) for Least Squares Regularized Problem
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Decoding by Linear Programming
- Stable recovery of sparse overcomplete representations in the presence of noise
- Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
- Sparse and Redundant Representations
- The Concave-Convex Procedure
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- A Fast Approach for Overcomplete Sparse Decomposition Based on Smoothed $\ell ^{0}$ Norm
- $rm K$-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation
- Nonconvex Nonsmooth Low Rank Minimization via Iteratively Reweighted Nuclear Norm
- Successive Concave Sparsity Approximation for Compressed Sensing
- Robust Linear Regression via $\ell_0$ Regularization
- Sparse Signal Recovery via Generalized Entropy Functions Minimization
- Orthogonal Matching Pursuit for Sparse Signal Recovery With Noise
- Mathematical Programs with Cardinality Constraints: Reformulation by Complementarity-Type Conditions and a Regularization Method
- Compressed sensing
This page was built for publication: A convex relaxation framework consisting of a primal-dual alternative algorithm for solving \(\ell_0\) sparsity-induced optimization problems with application to signal recovery based image restoration
