A note on the complexity of proximal iterative hard thresholding algorithm
From MaRDI portal
Recommendations
- Iterative hard thresholding methods for \(l_0\) regularized convex cone programming
- A new linear convergence result for the iterative soft thresholding algorithm
- A convergent iterative hard thresholding for nonnegative sparsity optimization
- Accelerated iterative hard thresholding algorithm for \(l_0\) regularized regression problem
- Convergence of iterative hard-thresholding algorithm with continuation
Cites work
- $\ell _0$ Minimization for wavelet frame based image restoration
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- An accelerated proximal gradient algorithm for frame-based image restoration via the balanced approach
- An efficient algorithm for \(\ell_{0}\) minimization in wavelet frame based image restoration
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- Compressed sensing
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Iterative hard thresholding for compressed sensing
- Iterative hard thresholding methods for \(l_0\) regularized convex cone programming
- Iterative thresholding for sparse approximations
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Signal Recovery by Proximal Forward-Backward Splitting
- Smooth minimization of non-smooth functions
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- The proximal point algorithm revisited
- Tight frame: an efficient way for high-resolution image reconstruction
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- Wavelet Algorithms for High-Resolution Image Reconstruction
Cited in
(5)- A new conjugate gradient hard thresholding pursuit algorithm for sparse signal recovery
- A convergent iterative hard thresholding for nonnegative sparsity optimization
- A new proximal iterative hard thresholding method with extrapolation for \(\ell _0\) minimization
- Iterative hard thresholding methods for \(l_0\) regularized convex cone programming
- Mean squared error bounds for the Rangan-Goyal soft thresholding algorithm
This page was built for publication: A note on the complexity of proximal iterative hard thresholding algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q259117)
