Originally Posted by

**uli** A Linear Matrix Inequality (LMI) $\displaystyle A(x) > 0$ where $\displaystyle A(x) = \sum_i x_i A_i + B$ and $\displaystyle A_i = A_i^T$ and $\displaystyle A_i , B$ is given. $\displaystyle x$ is a vector in $\displaystyle R^n$.

...and thus $\displaystyle Ax$ is a vector in $\displaystyle \mathbb{R}^n$. What does it mean that a vector is greater/less than zero?

Tonio

Then, the linear map $\displaystyle x \rightarrow Cx$ from $\displaystyle R^n$ to $\displaystyle S$, where $\displaystyle S$ is a space of symmetric matrices with prescribed block diagonal structure, is associated such that $\displaystyle A(x) = Cx+B$. The range of this map is $\displaystyle E = range(C)$.

My Question is, how to obtain $\displaystyle E$ ??

I guess, that $\displaystyle C = [A_1,A_2,...]$ is a matrix which columns are the matrices $\displaystyle A_i$.

And $\displaystyle E$ is then the column space of $\displaystyle C$ ??

And when I want to find a matrix which is orthogonal to $\displaystyle E$, is it then a matrix which is orthogonal to $\displaystyle C$ ??

As you might have noticed, I've no idea what to do.

So, please help me.

thanks