Scaled proximal gradient methods for sparse optimization problems

DOI10.1007/S10915-023-02393-1MaRDI QIDQ6184263zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

restricted isometry propertysparse optimizationhard thresholdingscaled proximal gradient method

Mathematics Subject Classification ID

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)

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

Cites work

• scientific article; zbMATH DE number 1906319 (Why is no real title available?)
• A family of variable metric proximal methods
• A geometric proximal gradient method for sparse least squares regression with probabilistic simplex constraint
• A mathematical introduction to compressive sensing
• Atomic Decomposition by Basis Pursuit
• Best subset selection via a modern optimization lens
• CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
• Compressed sensing
• Compressive sampling
• Constructing New Weighted ℓ₁-Algorithms for the Sparsest Points of Polyhedral Sets
• Coordinate descent algorithms
• De-noising by soft-thresholding
• Decoding by Linear Programming
• Enhancing sparsity by reweighted \(\ell _{1}\) minimization
• First-order methods in optimization
• Hard thresholding pursuit: an algorithm for compressive sensing
• Iterative hard thresholding for compressed sensing
• Iterative thresholding for sparse approximations
• Matching pursuits with time-frequency dictionaries
• Newton-Step-Based Hard Thresholding Algorithms for Sparse Signal Recovery
• Optimal $k$-Thresholding Algorithms for Sparse Optimization Problems
• 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
• Reweighted _1-minimization for sparse solutions to underdetermined linear systems
• Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
• Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
• Sparse Approximate Solutions to Linear Systems
• Sparse and redundant representations. From theory to applications in signal and image processing.
• Sparse image and signal processing. Wavelets, curvelets, morphological diversity
• Sparse optimization theory and methods
• Stochastic geometry for wireless networks
• Subspace Pursuit for Compressive Sensing Signal Reconstruction
• Variational Analysis
• Why Simple Shrinkage Is Still Relevant for Redundant Representations?

Cited in

(1)

• Iterative mix thresholding algorithm with continuation technique for mix sparse optimization and application

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)