Discrete-time regional pole-placement using convex approximations: Theory and application to a boost converter
Graph Chatbot
Chat with Graph Search
Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
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 ...
We show that for critical reversible attractive Nearest Particle Systems all equilibrium measures are convex combinations of the upper invariant equilibrium measure and the point mass at all zeros, provided the underlying renewal sequence possesses moments ...
We give compact extended formulations for the packing and partitioning orbitopes (with respect to the full symmetric group) described and analyzed in Kaibel and Pfetsch [Kaibel, V., M. E. Pfetsch. 2008. Packing and partitioning orbitopes. Math. Programming ...
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 ...
David Hilbert discovered in 1895 an important metric that is canonically associated to any convex domain Ω in the Euclidean (or projective) space. This metric is known to be Finslerian, and the usual proof assumes a certain degree of smoothness of t ...
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 ...
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 ...
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 ...
Combination approaches can improve the performance of adaptive schemes. In this paper, we study the steady-state performance of an adaptive convex combination of transversal filters and show its universality in the sense that the combination performs, in s ...
We define ``random trip", a generic mobility model for independent mobiles that contains as special cases: the random waypoint on convex or non convex domains, random walk with reflection or wrapping, city section, space graph and other models. We use Palm ...
