Sparse regularization via bidualization

DOI10.1007/S10898-021-01089-WOpenAlexW3201965340MaRDI QIDQ2114593

Yehonathan Refael, Amir Beck

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

convex envelopesparsitybiconjugaterandomized root search

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Cites Work

• Unnamed Item
• Unnamed Item
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• An O(n) algorithm for quadratic knapsack problems
• Support-vector networks
• From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
• First-Order Methods in Optimization
• Regularization and Variable Selection Via the Elastic Net
• Proximité et dualité dans un espace hilbertien
• Convex Analysis

This page was built for publication: Sparse regularization via bidualization