×
Abstract: A double convex combination matrix inequality arising in control and filtering problems of dynamic systems is revisited in this paper.
Abstract—A double convex combination matrix in- equality arising in control and filtering problems of dy- namic systems is revisited in this paper.
A double convex combination matrix inequality arising in control and filtering problems of dynamic systems is revisited in this paper.
Shaosheng Zhou, Wei Xing Zheng: A note on a double convex combination matrix inequality. CDC 2010: 4287-4292. a service of Schloss Dagstuhl - Leibniz Center ...
2.2 Theorem (convex combinations and Jensen's inequality). (a) A set C is convex if and only if C contains all convex combinations of its elements. (b) A ...
Consider a convex combination z of two points (x1,x2) and (y1,y2) in the set. If x y, then z = θx + (1 − θ)y y and obviously z1z2 ≥ y1y2 ≥ 1. Similar ...
matrices (x). Browse all publications. Home; Search Results. (1 - 1 of 1). Sort By. Date · A note on a double convex combination matrix inequality; Zhou, ...
A set C ⊆ Rn is a convex set if for any x, y ∈ C, we have tx+ (1−t)y ∈ C for all t ∈ [0, 1]. Another way to put in slide is that ”line segment joining any two ...
People also ask
A convex function is a function f : Rn → R such that dom(f) ⊆ Rn is convex, and f(tx + (1 − t) y) ≤ tf(x) + (1 − t)f(y). The value of the function lies below ...