The so-called l0 pseudonorm on Rd counts the number of nonzero components of a vector. It is used in sparse optimization, either as criterion or in the constraints, to obtain solutions with few nonzero entries. For such problems, the Fenchel conjugacy fails to provide relevant analysis: indeed, the Fenchel conjugate of the characteristic function of the level sets of the l0 pseudonorm is minus infinity, and the Fenchel biconjugate of the l0 pseudonorm is zero. In this paper, we display a class of conjugacies that are suitable for the l0 pseudonorm. For this purpose, we suppose given a (source) norm on Rd. With this norm, we define, on the one hand, a sequence of so-called coordinate-k norms and, on the other hand, a coupling between Rd and ...
International audienceThis paper is devoted to the analysis of necessary (not sufficient) optimality...
International audienceIn this article, we clarify the mathematical framework underlying the construc...
In exact sparse optimization problems on Rd (also known as sparsity constrained problems), one looks...
International audienceThe so-called l0 pseudonorm on Rd counts the number of nonzero components of a...
The so-called l0 pseudonorm on Rd counts the number of nonzero components of a vector. It is used in...
The l0 pseudonorm counts the nonzero coordinates of a vector. It is often used in optimization probl...
The so-called l0 pseudonorm on R d counts the number of nonzero components of a vector. It is well-k...
International audienceThe l0 pseudonorm counts the nonzero coordinates of a vector. It is often used...
The so-called l0 pseudonorm on R d counts the number of nonzero components of a vector. It is well-k...
The so-called l0 pseudonorm counts the number of nonzero components of a vector of a Euclidian space...
International audienceThe so-called l0 pseudonorm, or cardinality function, counts the number of non...
Whereas the norm of a vector measures amplitude (and is a 1-homogeneous function), sparsity is measu...
The so-called l0 pseudonorm on the Euclidean space Rd counts the number of nonzero components of a v...
The support of a vector in R d is the set of indices with nonzero entries. Functions of the support ...
The so-called l0 pseudonorm on Rd counts the number of nonzero components of a vector. We say that a...
International audienceThis paper is devoted to the analysis of necessary (not sufficient) optimality...
International audienceIn this article, we clarify the mathematical framework underlying the construc...
In exact sparse optimization problems on Rd (also known as sparsity constrained problems), one looks...
International audienceThe so-called l0 pseudonorm on Rd counts the number of nonzero components of a...
The so-called l0 pseudonorm on Rd counts the number of nonzero components of a vector. It is used in...
The l0 pseudonorm counts the nonzero coordinates of a vector. It is often used in optimization probl...
The so-called l0 pseudonorm on R d counts the number of nonzero components of a vector. It is well-k...
International audienceThe l0 pseudonorm counts the nonzero coordinates of a vector. It is often used...
The so-called l0 pseudonorm on R d counts the number of nonzero components of a vector. It is well-k...
The so-called l0 pseudonorm counts the number of nonzero components of a vector of a Euclidian space...
International audienceThe so-called l0 pseudonorm, or cardinality function, counts the number of non...
Whereas the norm of a vector measures amplitude (and is a 1-homogeneous function), sparsity is measu...
The so-called l0 pseudonorm on the Euclidean space Rd counts the number of nonzero components of a v...
The support of a vector in R d is the set of indices with nonzero entries. Functions of the support ...
The so-called l0 pseudonorm on Rd counts the number of nonzero components of a vector. We say that a...
International audienceThis paper is devoted to the analysis of necessary (not sufficient) optimality...
International audienceIn this article, we clarify the mathematical framework underlying the construc...
In exact sparse optimization problems on Rd (also known as sparsity constrained problems), one looks...