Sparse regularization via bidualization

DOI10.1007/S10898-021-01089-WMaRDI QIDQ2114593zbMATH OpenOpenAlexFDO

Authors Amir Beck, Yehonathan Refael

Publication date 15 March 2022

Published in Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10898-021-01089-w

zbMATH Keywords

sparsityconvex envelopebiconjugaterandomized root search

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Recommendations

• A novel regularization based on the error function for sparse recovery
• Regularizers for structured sparsity
• On sparsity inducing regularization methods for machine learning
• Well-posedness and convergence rates for sparse regularization with sublinear \(l^q\) penalty term
• On the role of sparsity in inverse problems

Cites work

• scientific article; zbMATH DE number 845714 (Why is no real title available?)
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• An O(n) algorithm for quadratic knapsack problems
• Convex Analysis
• First-order methods in optimization
• From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
• Introduction to algorithms.
• Proximité et dualité dans un espace hilbertien
• Regularization and Variable Selection Via the Elastic Net
• Support-vector networks

Cited in

(1)

• scientific article; zbMATH DE number 6404124 (Why is no real title available?)

This page was built for publication: Sparse regularization via bidualization

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