Sparse optimization theory and methods
From MaRDI portal
Publication:4569597
DOI10.1201/9781315113142zbMATH Open1391.90003OpenAlexW2874258323MaRDI QIDQ4569597FDOQ4569597
Authors: Yun-Bin Zhao 
Publication date: 26 June 2018
Full work available at URL: https://doi.org/10.1201/9781315113142
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 \(\ell_1\)-minimization for sparse solutions to underdetermined linear systems
- Sparse and robust signal reconstruction
Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Cited In (26)
- Newton-type optimal thresholding algorithms for sparse optimization problems
- Optimal $k$-Thresholding Algorithms for Sparse Optimization Problems
- Nonuniqueness of solutions of a class of \(\ell_0\)-minimization problems
- Stability of 1-bit compressed sensing in sparse data reconstruction
- Heavy-ball-based hard thresholding algorithms for sparse signal recovery
- Title not available (Why is that?)
- Stability analysis of a class of sparse optimization problems
- Sparse Optimization with Least-Squares Constraints
- DC formulations and algorithms for sparse optimization problems
- Global optimization for sparse solution of least squares problems
- Nonnegative partial \(s\)-goodness for the equivalence of a 0-1 linear program to weighted linear programming
- Sparse convex optimization toolkit: a mixed-integer framework
- Improved RIP-based bounds for guaranteed performance of two compressed sensing algorithms
- Title not available (Why is that?)
- Scaled proximal gradient methods for sparse optimization problems
- Solution uniqueness of convex piecewise affine functions based optimization with applications to constrained \(\ell_1\) minimization
- On the generally randomized extended Gauss-Seidel method
- Dual-density-based reweighted \(\ell_1\)-algorithms for a class of \(\ell_0\)-minimization problems
- A fast homotopy algorithm for gridless sparse recovery
- An introduction to sparse stochastic processes
- Large sparse numerical optimization
- A survey on compressive sensing: classical results and recent advancements
- Partial gradient optimal thresholding algorithms for a class of sparse optimization problems
- Weighted thresholding homotopy method for sparsity constrained optimization
- Characterization of \(\ell_1\) minimizer in one-bit compressed sensing
- Sparse null basis computations in structural 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)
