Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Olbrich, Jakob"'
We propose a new framework for deriving screening rules for convex optimization problems. Our approach covers a large class of constrained and penalized optimization formulations, and works in two steps. First, given any approximate point, the struct
Externí odkaz:
http://arxiv.org/abs/1609.07478
We propose a new framework for deriving screening rules for convex optimization problems. Our approach covers a large class of constrained and penalized optimization formulations, and works in two steps. First, given any approximate point, the struct
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bccf0b62eee42b03fa573df537a82d3a
https://infoscience.epfl.ch/record/229236
https://infoscience.epfl.ch/record/229236