3 citations · 4 across the 2 of their papers we have counts for
2 papers
math.OC2019★ 1 cited
A Suitable Conjugacy for the l0 Pseudonorm
Jean-Philippe Chancelier, Michel De Lara, Ponts Paristech
The so-called l0 pseudonorm on R d counts the number of nonzero components of a vector. It is well-known that the l0 pseudonorm is not convex, as its Fenchel biconjugate is zero. I…
math.OC2019★ 3 cited
Lower Bound Convex Programs for Exact Sparse Optimization
Jean-Philippe Chancelier, Michel De Lara, Ponts Paristech
In exact sparse optimization problems on Rd (also known as sparsity constrained problems), one looks for solution that have few nonzero components. In this paper, we consider probl…