Scaled proximal gradient methods for sparse optimization problems
DOI10.1007/S10915-023-02393-1zbMATH Open1530.65063OpenAlexW4388909717MaRDI QIDQ6184263FDOQ6184263
Authors: Guiyun Xiao, Shuqin Zhang, Zheng-Jian Bai 
Publication date: 5 January 2024
Published in: Journal of Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10915-023-02393-1
Recommendations
- Optimal $k$-Thresholding Algorithms for Sparse Optimization Problems
- Partial gradient optimal thresholding algorithms for a class of sparse optimization problems
- Gradient projection Newton pursuit for sparsity constrained optimization
- New convergence results for the scaled gradient projection method
- Iterative projection gradient hard thresholding pursuit algorithm for sparse optimization
Numerical mathematical programming methods (65K05) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Nonconvex programming, global optimization (90C26) Iterative numerical methods for linear systems (65F10) Inverse problems in linear algebra (15A29)
Cites Work
- Best subset selection via a modern optimization lens
- Atomic Decomposition by Basis Pursuit
- Variational Analysis
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- First-order methods in optimization
- Matching pursuits with time-frequency dictionaries
- Compressive sampling
- Decoding by Linear Programming
- Title not available (Why is that?)
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
- Sparse and redundant representations. From theory to applications in signal and image processing.
- Compressed sensing
- De-noising by soft-thresholding
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Iterative hard thresholding for compressed sensing
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- A family of variable metric proximal methods
- A mathematical introduction to compressive sensing
- Reweighted \(\ell_1\)-minimization for sparse solutions to underdetermined linear systems
- Stochastic geometry for wireless networks
- Sparse Approximate Solutions to Linear Systems
- Sparse image and signal processing. Wavelets, curvelets, morphological diversity
- Iterative thresholding for sparse approximations
- Coordinate descent algorithms
- Subspace Pursuit for Compressive Sensing Signal Reconstruction
- Hard thresholding pursuit: an algorithm for compressive sensing
- Optimal $k$-Thresholding Algorithms for Sparse Optimization Problems
- Why Simple Shrinkage Is Still Relevant for Redundant Representations?
- Sparse optimization theory and methods
- Constructing New Weighted ℓ1-Algorithms for the Sparsest Points of Polyhedral Sets
- Newton-Step-Based Hard Thresholding Algorithms for Sparse Signal Recovery
- A geometric proximal gradient method for sparse least squares regression with probabilistic simplex constraint
This page was built for publication: Scaled proximal gradient methods for sparse optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6184263)
