AbstractWe provide two certificates of convexity for arbitrary basic closed semi-algebraic sets of Rn. 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, in principle, can be obtained numerically (however, up to machine precision)
Convex algebraic geometry concerns the interplay between optimization theory and real algebraic geo...
33 pages, 2 figures, 5 tablesInternational audienceIn a first contribution, we revisit two certifica...
International audienceWe describe an elementary algorithm to build convex inner approximations of no...
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...
The goal of the current paper is to introduce the notion of certificates which verify the accuracy o...
International audienceLet \Gamma be a structure with a finite relational signature and a first-order...
This dissertation studies certain asymmetric (in the sense of not closed under complement) propertie...
Abstract. A set S ⊆ Rn is called to be semidefinite programming (SDP) representable if S equals the ...
A hierarchy of convex relaxations for semialgebraic problems is introduced. For questions reducible ...
A technique for generating invariant polynomial inequalities of bounded degree is presented using th...
Abstract. A technique for generating invariant polynomial inequalities of bounded degree is presente...
On constraint qualifications with generalized convexity and optimality condition
Convex algebraic geometry concerns the interplay between optimization theory and real algebraic geo...
33 pages, 2 figures, 5 tablesInternational audienceIn a first contribution, we revisit two certifica...
International audienceWe describe an elementary algorithm to build convex inner approximations of no...
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...
The goal of the current paper is to introduce the notion of certificates which verify the accuracy o...
International audienceLet \Gamma be a structure with a finite relational signature and a first-order...
This dissertation studies certain asymmetric (in the sense of not closed under complement) propertie...
Abstract. A set S ⊆ Rn is called to be semidefinite programming (SDP) representable if S equals the ...
A hierarchy of convex relaxations for semialgebraic problems is introduced. For questions reducible ...
A technique for generating invariant polynomial inequalities of bounded degree is presented using th...
Abstract. A technique for generating invariant polynomial inequalities of bounded degree is presente...
On constraint qualifications with generalized convexity and optimality condition
Convex algebraic geometry concerns the interplay between optimization theory and real algebraic geo...
33 pages, 2 figures, 5 tablesInternational audienceIn a first contribution, we revisit two certifica...
International audienceWe describe an elementary algorithm to build convex inner approximations of no...
DOI
Add to ORKG