A smoothing method for sparse optimization over convex sets
Sign Up to like & getrecommendations! Published in 2020 at "Optimization Letters"
DOI: 10.1007/s11590-019-01408-x
Abstract: In this paper, we investigate a class of heuristic schemes to solve the NP-hard problem of minimizing $$\ell _0$$ ℓ 0 -norm over a convex set. A well-known approximation is to consider the convex problem… read more here.
Keywords: optimization; ell norm; problem; smoothing method ... See more keywords