Add to ORKGInternational audienceWe provide two certificates of convexity for arbitrary basic semi-algebraic sets of $\R^n$. The first one is based on a necessary and sufficient condition whereas the second one is based on a sufficient (but simpler) condition only. Both certificates are obtained from any feasible solution of a related semidefinite program and so can be obtained numerically (however, up to machine precision)
33 pages, 2 figures, 5 tablesInternational audienceIn a first contribution, we revisit two certifica...
In this paper we study the concept of algebraic core for convex sets in general vector spaces withou...
In this paper, we study the rate of convergence of the cyclic projection algorithm applied to finite...
International audienceWe provide two certificates of convexity for arbitrary basic semi-algebraic se...
AbstractWe provide two certificates of convexity for arbitrary basic closed semi-algebraic sets of R...
Mathematical Programming, Series A. Published electronically on May 7th 2008International audienceWe...
International audienceLet \Gamma be a structure with a finite relational signature and a first-order...
The goal of the current paper is to introduce the notion of certificates which verify the accuracy o...
This dissertation studies certain asymmetric (in the sense of not closed under complement) propertie...
A hierarchy of convex relaxations for semialgebraic problems is introduced. For questions reducible ...
Abstract. A set S ⊆ Rn is called to be semidefinite programming (SDP) representable if S equals the ...
A technique for generating invariant polynomial inequalities of bounded degree is presented using t...
A technique for generating invariant polynomial inequalities of bounded degree is presented using th...
33 pages, 2 figures, 5 tablesInternational audienceIn a first contribution, we revisit two certifica...
In this paper we study the concept of algebraic core for convex sets in general vector spaces withou...
In this paper, we study the rate of convergence of the cyclic projection algorithm applied to finite...
International audienceWe provide two certificates of convexity for arbitrary basic semi-algebraic se...
AbstractWe provide two certificates of convexity for arbitrary basic closed semi-algebraic sets of R...
Mathematical Programming, Series A. Published electronically on May 7th 2008International audienceWe...
International audienceLet \Gamma be a structure with a finite relational signature and a first-order...
The goal of the current paper is to introduce the notion of certificates which verify the accuracy o...
This dissertation studies certain asymmetric (in the sense of not closed under complement) propertie...
A hierarchy of convex relaxations for semialgebraic problems is introduced. For questions reducible ...
Abstract. A set S ⊆ Rn is called to be semidefinite programming (SDP) representable if S equals the ...
A technique for generating invariant polynomial inequalities of bounded degree is presented using t...
A technique for generating invariant polynomial inequalities of bounded degree is presented using th...
33 pages, 2 figures, 5 tablesInternational audienceIn a first contribution, we revisit two certifica...
In this paper we study the concept of algebraic core for convex sets in general vector spaces withou...
In this paper, we study the rate of convergence of the cyclic projection algorithm applied to finite...