How do I express this inequality as an LMI?
$begingroup$
I have the following matrix inequality that I need to express as an LMI
$ (AQ+BY) Q^{-1} (AQ+BY)^T - Q + sum_i (A_i Q+B_i Y) Q^{-1} (A_i Q + B_i Y)^T < 0$
$Q > 0$
The matrices $A$, $A_i$, $B$ and $B_i$ are given. I need to find a solution for Y and Q.
I tried using the Schur complement (but failed).
So my question is: How do I make this transformation?
matrices convex-optimization matrix-equations lmis schur-complement
$endgroup$
add a comment |
$begingroup$
I have the following matrix inequality that I need to express as an LMI
$ (AQ+BY) Q^{-1} (AQ+BY)^T - Q + sum_i (A_i Q+B_i Y) Q^{-1} (A_i Q + B_i Y)^T < 0$
$Q > 0$
The matrices $A$, $A_i$, $B$ and $B_i$ are given. I need to find a solution for Y and Q.
I tried using the Schur complement (but failed).
So my question is: How do I make this transformation?
matrices convex-optimization matrix-equations lmis schur-complement
$endgroup$
$begingroup$
write it as $X-Q+sum_i X_i leq -varepsilon$ and apply the Schur complement to each $X_i$ separately
$endgroup$
– LinAlg
Dec 2 '18 at 18:53
$begingroup$
You changed the side where you placed the transpose compared with the previous question. Is this or your previous problem formulation correct?
$endgroup$
– Kwin van der Veen
Dec 2 '18 at 20:25
$begingroup$
This is the original problem formulation
$endgroup$
– Alex bGoode
Dec 3 '18 at 8:28
add a comment |
$begingroup$
I have the following matrix inequality that I need to express as an LMI
$ (AQ+BY) Q^{-1} (AQ+BY)^T - Q + sum_i (A_i Q+B_i Y) Q^{-1} (A_i Q + B_i Y)^T < 0$
$Q > 0$
The matrices $A$, $A_i$, $B$ and $B_i$ are given. I need to find a solution for Y and Q.
I tried using the Schur complement (but failed).
So my question is: How do I make this transformation?
matrices convex-optimization matrix-equations lmis schur-complement
$endgroup$
I have the following matrix inequality that I need to express as an LMI
$ (AQ+BY) Q^{-1} (AQ+BY)^T - Q + sum_i (A_i Q+B_i Y) Q^{-1} (A_i Q + B_i Y)^T < 0$
$Q > 0$
The matrices $A$, $A_i$, $B$ and $B_i$ are given. I need to find a solution for Y and Q.
I tried using the Schur complement (but failed).
So my question is: How do I make this transformation?
matrices convex-optimization matrix-equations lmis schur-complement
matrices convex-optimization matrix-equations lmis schur-complement
edited Dec 2 '18 at 16:03
Alex bGoode
asked Dec 2 '18 at 15:28
Alex bGoodeAlex bGoode
1257
1257
$begingroup$
write it as $X-Q+sum_i X_i leq -varepsilon$ and apply the Schur complement to each $X_i$ separately
$endgroup$
– LinAlg
Dec 2 '18 at 18:53
$begingroup$
You changed the side where you placed the transpose compared with the previous question. Is this or your previous problem formulation correct?
$endgroup$
– Kwin van der Veen
Dec 2 '18 at 20:25
$begingroup$
This is the original problem formulation
$endgroup$
– Alex bGoode
Dec 3 '18 at 8:28
add a comment |
$begingroup$
write it as $X-Q+sum_i X_i leq -varepsilon$ and apply the Schur complement to each $X_i$ separately
$endgroup$
– LinAlg
Dec 2 '18 at 18:53
$begingroup$
You changed the side where you placed the transpose compared with the previous question. Is this or your previous problem formulation correct?
$endgroup$
– Kwin van der Veen
Dec 2 '18 at 20:25
$begingroup$
This is the original problem formulation
$endgroup$
– Alex bGoode
Dec 3 '18 at 8:28
$begingroup$
write it as $X-Q+sum_i X_i leq -varepsilon$ and apply the Schur complement to each $X_i$ separately
$endgroup$
– LinAlg
Dec 2 '18 at 18:53
$begingroup$
write it as $X-Q+sum_i X_i leq -varepsilon$ and apply the Schur complement to each $X_i$ separately
$endgroup$
– LinAlg
Dec 2 '18 at 18:53
$begingroup$
You changed the side where you placed the transpose compared with the previous question. Is this or your previous problem formulation correct?
$endgroup$
– Kwin van der Veen
Dec 2 '18 at 20:25
$begingroup$
You changed the side where you placed the transpose compared with the previous question. Is this or your previous problem formulation correct?
$endgroup$
– Kwin van der Veen
Dec 2 '18 at 20:25
$begingroup$
This is the original problem formulation
$endgroup$
– Alex bGoode
Dec 3 '18 at 8:28
$begingroup$
This is the original problem formulation
$endgroup$
– Alex bGoode
Dec 3 '18 at 8:28
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
As mentioned in the comment from LinAlg, you can turn this into LMI's by introducing intermediate matrix inequalities and apply Schur's complement to each of those. Your first term is of the same form as each term inside summation and for simplicity I will include it into the summation. I will assume that each matrix is real, otherwise this answer would only hold if you would replace each transpose with the Hermitian transpose.
Using from your last matrix inequality that $Q$ and thus also $Q^{-1}$ are positive definite. Now since each term in the summation pre- and post multiplies $Q^{-1}$ with a matrix and the transpose of that matrix respectively, then each term has to be semi-positive definite. And the summation of semi-positive definite matrices is also semi-positive definite. When using that each summation term is upper bounded by some (as of yet unknown) semi-positive definite matrix $M_i=M_i^topsucceq0$, then using those semi-positive definite matrices instead in your first matrix inequality should yield a more conservative matrix inequality. Now by letting each $M_i$ also be a variable then the solver would be able to let each $M_i$ get arbitrarily close to the actual summation term. However, doing this does allow you to reformulate the original matrix inequality as LMI's. So your matrix inequalities can also be written as
begin{align}
Q = Q^top &succ 0 tag{1} \
Q - sum_i M_i &succ 0 tag{2} \
M_i = M_i^top &succ (A_i,Q + B_i,Y),Q^{-1} (A_i,Q + B_i,Y)^top forall,i tag{3}
end{align}
where only $(3)$ is not a LMI yet. Applying Schur's complement to $(3)$ yields
$$
begin{bmatrix}
M_i & A_i,Q + B_i,Y \
(A_i,Q + B_i,Y)^top & Q
end{bmatrix} succ 0 forall,i tag{4}
$$
which makes $(1)$, $(2)$ and $(4)$ a system of LMI's which is equivalent to your two matrix inequalities.
It can be noted that this approach only works because each summation term can be shown to be semi-positive definite. Depending on whether all summation terms are added or subtracted or if each summation term can be shown to be semi-negative definite, then the intermediate matrices might either still be upper a bound or a lower bound, such that they make the initial matrix inequality more conservative. So if a summation term would have been indefinite you would not have been able to use this approach.
$endgroup$
add a comment |
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3022762%2fhow-do-i-express-this-inequality-as-an-lmi%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
As mentioned in the comment from LinAlg, you can turn this into LMI's by introducing intermediate matrix inequalities and apply Schur's complement to each of those. Your first term is of the same form as each term inside summation and for simplicity I will include it into the summation. I will assume that each matrix is real, otherwise this answer would only hold if you would replace each transpose with the Hermitian transpose.
Using from your last matrix inequality that $Q$ and thus also $Q^{-1}$ are positive definite. Now since each term in the summation pre- and post multiplies $Q^{-1}$ with a matrix and the transpose of that matrix respectively, then each term has to be semi-positive definite. And the summation of semi-positive definite matrices is also semi-positive definite. When using that each summation term is upper bounded by some (as of yet unknown) semi-positive definite matrix $M_i=M_i^topsucceq0$, then using those semi-positive definite matrices instead in your first matrix inequality should yield a more conservative matrix inequality. Now by letting each $M_i$ also be a variable then the solver would be able to let each $M_i$ get arbitrarily close to the actual summation term. However, doing this does allow you to reformulate the original matrix inequality as LMI's. So your matrix inequalities can also be written as
begin{align}
Q = Q^top &succ 0 tag{1} \
Q - sum_i M_i &succ 0 tag{2} \
M_i = M_i^top &succ (A_i,Q + B_i,Y),Q^{-1} (A_i,Q + B_i,Y)^top forall,i tag{3}
end{align}
where only $(3)$ is not a LMI yet. Applying Schur's complement to $(3)$ yields
$$
begin{bmatrix}
M_i & A_i,Q + B_i,Y \
(A_i,Q + B_i,Y)^top & Q
end{bmatrix} succ 0 forall,i tag{4}
$$
which makes $(1)$, $(2)$ and $(4)$ a system of LMI's which is equivalent to your two matrix inequalities.
It can be noted that this approach only works because each summation term can be shown to be semi-positive definite. Depending on whether all summation terms are added or subtracted or if each summation term can be shown to be semi-negative definite, then the intermediate matrices might either still be upper a bound or a lower bound, such that they make the initial matrix inequality more conservative. So if a summation term would have been indefinite you would not have been able to use this approach.
$endgroup$
add a comment |
$begingroup$
As mentioned in the comment from LinAlg, you can turn this into LMI's by introducing intermediate matrix inequalities and apply Schur's complement to each of those. Your first term is of the same form as each term inside summation and for simplicity I will include it into the summation. I will assume that each matrix is real, otherwise this answer would only hold if you would replace each transpose with the Hermitian transpose.
Using from your last matrix inequality that $Q$ and thus also $Q^{-1}$ are positive definite. Now since each term in the summation pre- and post multiplies $Q^{-1}$ with a matrix and the transpose of that matrix respectively, then each term has to be semi-positive definite. And the summation of semi-positive definite matrices is also semi-positive definite. When using that each summation term is upper bounded by some (as of yet unknown) semi-positive definite matrix $M_i=M_i^topsucceq0$, then using those semi-positive definite matrices instead in your first matrix inequality should yield a more conservative matrix inequality. Now by letting each $M_i$ also be a variable then the solver would be able to let each $M_i$ get arbitrarily close to the actual summation term. However, doing this does allow you to reformulate the original matrix inequality as LMI's. So your matrix inequalities can also be written as
begin{align}
Q = Q^top &succ 0 tag{1} \
Q - sum_i M_i &succ 0 tag{2} \
M_i = M_i^top &succ (A_i,Q + B_i,Y),Q^{-1} (A_i,Q + B_i,Y)^top forall,i tag{3}
end{align}
where only $(3)$ is not a LMI yet. Applying Schur's complement to $(3)$ yields
$$
begin{bmatrix}
M_i & A_i,Q + B_i,Y \
(A_i,Q + B_i,Y)^top & Q
end{bmatrix} succ 0 forall,i tag{4}
$$
which makes $(1)$, $(2)$ and $(4)$ a system of LMI's which is equivalent to your two matrix inequalities.
It can be noted that this approach only works because each summation term can be shown to be semi-positive definite. Depending on whether all summation terms are added or subtracted or if each summation term can be shown to be semi-negative definite, then the intermediate matrices might either still be upper a bound or a lower bound, such that they make the initial matrix inequality more conservative. So if a summation term would have been indefinite you would not have been able to use this approach.
$endgroup$
add a comment |
$begingroup$
As mentioned in the comment from LinAlg, you can turn this into LMI's by introducing intermediate matrix inequalities and apply Schur's complement to each of those. Your first term is of the same form as each term inside summation and for simplicity I will include it into the summation. I will assume that each matrix is real, otherwise this answer would only hold if you would replace each transpose with the Hermitian transpose.
Using from your last matrix inequality that $Q$ and thus also $Q^{-1}$ are positive definite. Now since each term in the summation pre- and post multiplies $Q^{-1}$ with a matrix and the transpose of that matrix respectively, then each term has to be semi-positive definite. And the summation of semi-positive definite matrices is also semi-positive definite. When using that each summation term is upper bounded by some (as of yet unknown) semi-positive definite matrix $M_i=M_i^topsucceq0$, then using those semi-positive definite matrices instead in your first matrix inequality should yield a more conservative matrix inequality. Now by letting each $M_i$ also be a variable then the solver would be able to let each $M_i$ get arbitrarily close to the actual summation term. However, doing this does allow you to reformulate the original matrix inequality as LMI's. So your matrix inequalities can also be written as
begin{align}
Q = Q^top &succ 0 tag{1} \
Q - sum_i M_i &succ 0 tag{2} \
M_i = M_i^top &succ (A_i,Q + B_i,Y),Q^{-1} (A_i,Q + B_i,Y)^top forall,i tag{3}
end{align}
where only $(3)$ is not a LMI yet. Applying Schur's complement to $(3)$ yields
$$
begin{bmatrix}
M_i & A_i,Q + B_i,Y \
(A_i,Q + B_i,Y)^top & Q
end{bmatrix} succ 0 forall,i tag{4}
$$
which makes $(1)$, $(2)$ and $(4)$ a system of LMI's which is equivalent to your two matrix inequalities.
It can be noted that this approach only works because each summation term can be shown to be semi-positive definite. Depending on whether all summation terms are added or subtracted or if each summation term can be shown to be semi-negative definite, then the intermediate matrices might either still be upper a bound or a lower bound, such that they make the initial matrix inequality more conservative. So if a summation term would have been indefinite you would not have been able to use this approach.
$endgroup$
As mentioned in the comment from LinAlg, you can turn this into LMI's by introducing intermediate matrix inequalities and apply Schur's complement to each of those. Your first term is of the same form as each term inside summation and for simplicity I will include it into the summation. I will assume that each matrix is real, otherwise this answer would only hold if you would replace each transpose with the Hermitian transpose.
Using from your last matrix inequality that $Q$ and thus also $Q^{-1}$ are positive definite. Now since each term in the summation pre- and post multiplies $Q^{-1}$ with a matrix and the transpose of that matrix respectively, then each term has to be semi-positive definite. And the summation of semi-positive definite matrices is also semi-positive definite. When using that each summation term is upper bounded by some (as of yet unknown) semi-positive definite matrix $M_i=M_i^topsucceq0$, then using those semi-positive definite matrices instead in your first matrix inequality should yield a more conservative matrix inequality. Now by letting each $M_i$ also be a variable then the solver would be able to let each $M_i$ get arbitrarily close to the actual summation term. However, doing this does allow you to reformulate the original matrix inequality as LMI's. So your matrix inequalities can also be written as
begin{align}
Q = Q^top &succ 0 tag{1} \
Q - sum_i M_i &succ 0 tag{2} \
M_i = M_i^top &succ (A_i,Q + B_i,Y),Q^{-1} (A_i,Q + B_i,Y)^top forall,i tag{3}
end{align}
where only $(3)$ is not a LMI yet. Applying Schur's complement to $(3)$ yields
$$
begin{bmatrix}
M_i & A_i,Q + B_i,Y \
(A_i,Q + B_i,Y)^top & Q
end{bmatrix} succ 0 forall,i tag{4}
$$
which makes $(1)$, $(2)$ and $(4)$ a system of LMI's which is equivalent to your two matrix inequalities.
It can be noted that this approach only works because each summation term can be shown to be semi-positive definite. Depending on whether all summation terms are added or subtracted or if each summation term can be shown to be semi-negative definite, then the intermediate matrices might either still be upper a bound or a lower bound, such that they make the initial matrix inequality more conservative. So if a summation term would have been indefinite you would not have been able to use this approach.
answered Dec 3 '18 at 6:15
Kwin van der VeenKwin van der Veen
5,4952828
5,4952828
add a comment |
add a comment |
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3022762%2fhow-do-i-express-this-inequality-as-an-lmi%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
$begingroup$
write it as $X-Q+sum_i X_i leq -varepsilon$ and apply the Schur complement to each $X_i$ separately
$endgroup$
– LinAlg
Dec 2 '18 at 18:53
$begingroup$
You changed the side where you placed the transpose compared with the previous question. Is this or your previous problem formulation correct?
$endgroup$
– Kwin van der Veen
Dec 2 '18 at 20:25
$begingroup$
This is the original problem formulation
$endgroup$
– Alex bGoode
Dec 3 '18 at 8:28