@article{eff060ce16e943db99f219cad0da92e1,
title = "Sparse regularization via bidualization",
abstract = "The paper considers the sparse envelope function, defined as the biconjugate of the sum of a squared ℓ2-norm function and the indicator of the set of k-sparse vectors. It is shown that both function and proximal values of the sparse envelope function can be reduced into a one-dimensional search that can be efficiently performed in linear time complexity in expectation. The sparse envelope function naturally serves as a regularizer that can handle both sparsity and grouping information in inverse problems, and can also be utilized in sparse support vector machine problems.",
keywords = "Biconjugate, Convex envelope, Randomized root search, Sparsity",
author = "Amir Beck and Yehonathan Refael",
note = "Publisher Copyright: {\textcopyright} 2021, The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature.",
year = "2022",
month = mar,
doi = "10.1007/s10898-021-01089-w",
language = "אנגלית",
volume = "82",
pages = "463--482",
journal = "Journal of Global Optimization",
issn = "0925-5001",
publisher = "Springer Netherlands",
number = "3",
}