Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.
AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.
We prove a Hadwiger transversal-type result, characterizing convex position on a family of non-crossing convex bodies in the plane. This theorem suggests a definition for the order type of a family of convex bodies, generalizing the usual definition of ord ...
Any finite, separately convex, positively homogeneous function on R2 is convex. This was first established by the first author ["Direct methods in calculus of variations", Springer-Verlag (1989)]. Here we give a new and concise proof of this re ...
In this paper, we introduce the notion of a constrained Minkowski sumwhich for two (finite) point-sets P,Q R2 and a set of k inequalities Ax b is defined as the point-set (P Q)Ax b= x = p+q | P, q Q, Ax b. We show that typical subsequ ...
In this paper, we introduce the notion of a constrained Minkowski sum: for two (finite) point-sets P, Q subset of R-2 and a set of k inequalities Ax >= b, it is defined as the point-set (P circle plus Q)(Ax >= b) = {x = p + q vertical bar p is an element o ...
Max-min fairness is widely used in various areas of networking. In every case where it is used, there is a proof of existence and one or several algorithms for computing it; in most, but not all cases, they are based on the notion of bottlenecks. In spite ...
Convex parameterization of fixed-order robust stabilizing controllers for systems with polytopic uncertainty is represented as an LMI using KYP Lemma. This parameterization is a convex inner-approximation of the whole non-convex set of stabilizing controll ...
Suppose d > 2, n > d+1, and we have a set P of n points in d-dimensional Euclidean space. Then P contains a subset Q of d points such that for any p ∈ P, the convex hull of Q∪{p} does not contain the origin in its interior.We also show that for non-emp ...
In this thesis we deal with three different but connected questions. Firstly (cf. Chapter 2) we make a systematic study of the generalized notions of convexity for sets. We study the notions of polyconvex, quasiconvex and rank one convex set. We remark tha ...
Convex parameterization of fixed-order robust stabilizing controllers for systems with polytopic uncertainty is represented as an LMI using KYP Lemma. This parameterization is a convex inner-approximation of the whole non- convex set of stabilizing control ...
