A convex relaxation framework consisting of a primal-dual alternative algorithm for solving _0 sparsity-induced optimization problems with application to signal recovery based image restoration
From MaRDI portal
Publication:2095175
Recommendations
- A two-metric variable scaled forward-backward algorithm for \(\ell_0\) optimization problem and its applications
- The proximal alternating iterative hard thresholding method for \(l_0\) minimization, with complexity \(\mathcal{O}(1/\sqrt{k})\)
- Image restoration by minimizing zero norm of wavelet frame coefficients
- Sparse and smooth signal estimation: convexification of \(\ell_0\)-formulations
- $\ell _0$ Minimization for wavelet frame based image restoration
Cites work
- scientific article; zbMATH DE number 3465097 (Why is no real title available?)
- scientific article; zbMATH DE number 3522263 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- $rm K$-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation
- A Fast Approach for Overcomplete Sparse Decomposition Based on Smoothed $\ell ^{0}$ Norm
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A continuous exact \(\ell_0\) penalty (CEL0) for least squares regularized problem
- A majorize-minimize subspace approach for \(\ell_2-\ell_0\) image regularization
- An efficient algorithm for \(\ell_{0}\) minimization in wavelet frame based image restoration
- Analysis of multi-stage convex relaxation for sparse regularization
- Best subset selection via a modern optimization lens
- Better Subset Regression Using the Nonnegative Garrote
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- Complementarity formulations of \(\ell_0\)-norm optimization
- Complexity of unconstrained \(L_2 - L_p\) minimization
- Compressed sensing
- Compression and denoising using \(l _{0}\)-norm
- Decoding by Linear Programming
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- Exact penalty decomposition method for zero-norm minimization based on MPEC formulation
- Introduction to nonsmooth optimization. Theory, practice and software
- Iterative adaptive nonconvex low-rank tensor approximation to image restoration based on ADMM
- Iterative thresholding for sparse approximations
- Local Linear Convergence of ISTA and FISTA on the LASSO Problem
- Mathematical programs with cardinality constraints: reformulation by complementarity-type conditions and a regularization method
- Nearly unbiased variable selection under minimax concave penalty
- Nonconvex Nonsmooth Low Rank Minimization via Iteratively Reweighted Nuclear Norm
- Orthogonal Matching Pursuit for Sparse Signal Recovery With Noise
- Robust Linear Regression via $\ell_0$ Regularization
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
- Sparse Signal Recovery via Generalized Entropy Functions Minimization
- Sparse and redundant representations. From theory to applications in signal and image processing.
- Sparse modeling for image and vision processing
- Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
- Stable recovery of sparse overcomplete representations in the presence of noise
- Strong oracle optimality of folded concave penalized estimation
- Successive Concave Sparsity Approximation for Compressed Sensing
- Successive convex approximations to cardinality-constrained convex programs: a piecewise-linear DC approach
- The Concave-Convex Procedure
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
Cited in
(4)- A primal–dual fixed point algorithm for convex separable minimization with applications to image restoration
- A two-metric variable scaled forward-backward algorithm for \(\ell_0\) optimization problem and its applications
- Poissonian image restoration via the \(L_1/L_2\)-based minimization
- Relaxation approaches for nonlinear sparse optimization problems
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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2095175)
