Sparse Optimization Theory and Methods

DOI10.1201/9781315113142zbMath1391.90003OpenAlexW2874258323MaRDI QIDQ4569597

Yun-bin Zhao

Publication date: 26 June 2018

Full work available at URL: https://doi.org/10.1201/9781315113142

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Related Items (max. 100)

A survey on compressive sensing: classical results and recent advancements ⋮ Improved RIP-based bounds for guaranteed performance of two compressed sensing algorithms ⋮ Newton-type optimal thresholding algorithms for sparse optimization problems ⋮ Solution uniqueness of convex piecewise affine functions based optimization with applications to constrained ℓ₁ minimization ⋮ Unnamed Item ⋮ 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 ⋮ Stability of 1-bit compressed sensing in sparse data reconstruction ⋮ 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 ⋮ 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 ⋮ Characterization of ℓ1 minimizer in one-bit compressed sensing ⋮ Partial gradient optimal thresholding algorithms for a class of sparse optimization problems ⋮ Weighted thresholding homotopy method for sparsity constrained optimization

This page was built for publication: Sparse Optimization Theory and Methods