A new regularization for sparse optimization

DOI10.21914/ANZIAMJ.V62.16076MaRDI QIDQ6949922zbMATH OpenFDO

Authors Josef Dick, G. Li, Dinh Duy Tran

Publication date 31 July 2025

Published in The ANZIAM Journal (Search for Journal in Brave)

Full work available at URL https://doi.org/10.21914/ANZIAMJ.V62.16076

Mathematics Subject Classification ID

Inference from stochastic processes and prediction (62M20) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Signal detection and filtering (aspects of stochastic processes) (60G35)

Cites work

• scientific article; zbMATH DE number 6438182 (Why is no real title available?)
• A unified approach to model selection and sparse recovery using regularized least squares
• Clarke Subgradients of Stratifiable Functions
• Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
• First-order methods in optimization
• Nearly unbiased variable selection under minimax concave penalty
• On $l_q$ Optimization and Matrix Completion
• SparseNet: coordinate descent with nonconvex penalties
• Stable recovery of sparse overcomplete representations in the presence of noise
• The field of reals with multisummable series and the exponential function.
• Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties

This page was built for publication: A new regularization for sparse optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6949922)