Sparse convex optimization via adaptively regularized hard thresholding
From MaRDI portal
Recommendations
- A tight bound of hard thresholding
- Hard thresholding pursuit: an algorithm for compressive sensing
- Gradient projection Newton pursuit for sparsity constrained optimization
- An adaptive accelerated proximal gradient method and its homotopy continuation for sparse optimization
- Sparsity constrained nonlinear optimization: optimality conditions and algorithms
Cites work
- A note on guaranteed sparse recovery via \(\ell_1\)-minimization
- A survey of compressed sensing
- Book Review: A mathematical introduction to compressive sensing
- Compressed sensing
- Concentration Inequalities and Martingale Inequalities: A Survey
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- Decoding by Linear Programming
- Does $\ell _{p}$ -Minimization Outperform $\ell _{1}$ -Minimization?
- Greedy sparsity-constrained optimization
- Hard thresholding pursuit: an algorithm for compressive sensing
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- scientific article; zbMATH DE number 6765495 (Why is no real title available?)
- Iterative hard thresholding for compressed sensing
- New Bounds for Restricted Isometry Constants
- New bounds on the restricted isometry constant \(\delta _{2k}\)
- On the Theorem of Uniform Recovery of Random Sampling Matrices
- Shifting Inequality and Recovery of Sparse Signals
- Sparse Approximate Solutions to Linear Systems
- Sparse recovery algorithms: sufficient conditions in terms of restricted isometry constants
- Sparse Recovery With Orthogonal Matching Pursuit Under RIP
- Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
- Stable signal recovery from incomplete and inaccurate measurements
- The restricted isometry property and its implications for compressed sensing
- Trading accuracy for sparsity in optimization problems with sparsity constraints
- Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit
Cited in
(6)- Weighted thresholding homotopy method for sparsity constrained optimization
- Convex optimization under combinatorial sparsity constraints
- Optimal $k$-Thresholding Algorithms for Sparse Optimization Problems
- Support Recovery and Parameter Identification of Multivariate ARMA Systems with Exogenous Inputs
- A tight bound of modified iterative hard thresholding algorithm for compressed sensing.
- On the existence of a variational regularization parameter under Morozov's discrepancy principle for nonlinear inverse problems
This page was built for publication: Sparse convex optimization via adaptively regularized hard thresholding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4999097)
