Recommendations
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- Stability analysis of a class of sparse optimization problems
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- Reweighted _1-minimization for sparse solutions to underdetermined linear systems
- Sparse and robust signal reconstruction
Cited in
(33)- Sparse null basis computations in structural optimization
- DC formulations and algorithms for sparse optimization problems
- Dual-density-based reweighted \(\ell_1\)-algorithms for a class of \(\ell_0\)-minimization problems
- On the generally randomized extended Gauss-Seidel method
- Nonuniqueness of solutions of a class of \(\ell_0\)-minimization problems
- Partial gradient optimal thresholding algorithms for a class of sparse optimization problems
- Weighted thresholding homotopy method for sparsity constrained optimization
- Stability of 1-bit compressed sensing in sparse data reconstruction
- Newton-type optimal thresholding algorithms for sparse optimization problems
- Sparse Optimization with Least-Squares Constraints
- An introduction to sparse stochastic processes
- Global and quadratic convergence of Newton hard-thresholding pursuit
- Global optimization for sparse solution of least squares problems
- Solution uniqueness of convex piecewise affine functions based optimization with applications to constrained _1 minimization
- Stability analysis of a class of sparse optimization problems
- A fast homotopy algorithm for gridless sparse recovery
- Optimal $k$-Thresholding Algorithms for Sparse Optimization Problems
- Characterization of \(\ell_1\) minimizer in one-bit compressed sensing
- scientific article; zbMATH DE number 6797621 (Why is no real title available?)
- A survey on compressive sensing: classical results and recent advancements
- Improved RIP-based bounds for guaranteed performance of two compressed sensing algorithms
- Sparse convex optimization toolkit: a mixed-integer framework
- Heavy-ball-based hard thresholding algorithms for sparse signal recovery
- Nonnegative partial s-goodness for the equivalence of a 0-1 linear program to weighted linear programming
- Scaled proximal gradient methods for sparse optimization problems
- Variable selection via thresholding
- Levenberg-Marquardt hard thresholding pursuit for sparse bilinear inverse problems
- Sequential sample average majorization-minimization
- Splitting alternating algorithms for sparse solutions of linear systems with concatenated orthogonal matrices
- Sufficient condition based on nearly optimal order RIC for IHT algorithm
- Optimality conditions and gradient descent Newton pursuit for 0/1-loss and sparsity constrained optimization
- General decomposition pursuit algorithm for linear inverse problems
- Large sparse numerical optimization
This page was built for publication: Sparse optimization theory and methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4569597)
