-
On the composition of convex envelopes for quadrilinear terms
International audience -
Identification of MIMO switched state-space models
International audience -
High-dimension multi-label problems: convex or non convex relaxation?
International audience -
Rounding Methods for Discrete Linear Classification (Extended Version)
Learning discrete linear classifiers is known as a difficult challenge. In this paper, this learning task is cast as combinatorial optimization problem: given a... -
Selective l1 minimization for sparse recovery
International audience -
Compact relaxations for polynomial programming problems
Reduced RLT constraints are a special class of Reformulation- Linearization Technique (RLT) constraints. They apply to nonconvex (both continuous and mixed-integer)... -
Reduced RLT constraints for polynomial programming
International audience -
Sparse phase retrieval via group-sparse optimization
This paper deals with sparse phase retrieval, i.e., the problem of estimating a vector from quadratic measurements under the assumption that few components are...
