How to solve a non-convex programming problem?
Let $A$ and $C $ be $ntimes n$ symmetric matrices, and $Abullet C=Tr(A^TC)$. Let $Ssubseteq [n]times [n]times [n]$. Define a non-convex programming problem as follows.
begin{equation}
begin{split}
&max Cbullet X\
&text{ s.t.} Abullet X=1,\
&qquad quad X_{i,j}X_{i,k}=0, forall (i,j,k)in S,\
&qquad quad Xsucceq 0, Xgeq 0,
end{split}
end{equation}
where $X$ is a variable ranging over the set of $ntimes n $ symmetric matrices over $mathbb{R}$, $ Xsucceq 0$ means $X$ is positive semi-definite, $ Xgeq 0$ means each entry of $X$ is nonnegative, and $X_{i,j}$ is the $(i,j)$-entry of $X$.
Could you please tell me how to solve this problem? And how to consider its dual problem? Thank you.
combinatorics nonlinear-optimization non-convex-optimization programming semidefinite-programming
asked Nov 29 at 13:54
Xiuping
214
|
show 1 more comment
Let $A$ and $C $ be $ntimes n$ symmetric matrices, and $Abullet C=Tr(A^TC)$. Let $Ssubseteq [n]times [n]times [n]$. Define a non-convex programming problem as follows.
begin{equation}
begin{split}
&max Cbullet X\
&text{ s.t.} Abullet X=1,\
&qquad quad X_{i,j}X_{i,k}=0, forall (i,j,k)in S,\
&qquad quad Xsucceq 0, Xgeq 0,
end{split}
end{equation}
where $X$ is a variable ranging over the set of $ntimes n $ symmetric matrices over $mathbb{R}$, $ Xsucceq 0$ means $X$ is positive semi-definite, $ Xgeq 0$ means each entry of $X$ is nonnegative, and $X_{i,j}$ is the $(i,j)$-entry of $X$.
Could you please tell me how to solve this problem? And how to consider its dual problem? Thank you.
combinatorics nonlinear-optimization non-convex-optimization programming semidefinite-programming
asked Nov 29 at 13:54
Xiuping
214
You could model the product constraint as a mixed-integer SDP.
– Michal Adamaszek
Nov 29 at 15:03
@MichalAdamaszek Could you please tell me how to do it? Thanks very much.
– Xiuping
Nov 30 at 9:50
Well $xy=0, x,ygeq 0$ is the same as $0leq xleq Mz$, $0leq yleq M(1-z)$ where $z$ is a binary variable and $M$ is an upper bound on $x,y$. See docs.mosek.com/modeling-cookbook/mio.html#boolean-operators But there is not a load of MISDP solvers, if any. YALMIP can model it I think. But then it is possible that YALMIP can model your whole problem directly.
– Michal Adamaszek
Nov 30 at 9:59
@MichalAdamaszek Thank you so much. If I write the problem as a MISDP, is it the case that the optimal value of MISDP is the same with the optimal value of its dual MISDD? Thanks.
– Xiuping
Nov 30 at 10:13
I'm not sure I know what a dual of a mixed-integer problem is.
– Michal Adamaszek
Nov 30 at 12:29
|
show 1 more comment
Let $A$ and $C $ be $ntimes n$ symmetric matrices, and $Abullet C=Tr(A^TC)$. Let $Ssubseteq [n]times [n]times [n]$. Define a non-convex programming problem as follows.
begin{equation}
begin{split}
&max Cbullet X\
&text{ s.t.} Abullet X=1,\
&qquad quad X_{i,j}X_{i,k}=0, forall (i,j,k)in S,\
&qquad quad Xsucceq 0, Xgeq 0,
end{split}
end{equation}
where $X$ is a variable ranging over the set of $ntimes n $ symmetric matrices over $mathbb{R}$, $ Xsucceq 0$ means $X$ is positive semi-definite, $ Xgeq 0$ means each entry of $X$ is nonnegative, and $X_{i,j}$ is the $(i,j)$-entry of $X$.
Could you please tell me how to solve this problem? And how to consider its dual problem? Thank you.
combinatorics nonlinear-optimization non-convex-optimization programming semidefinite-programming
asked Nov 29 at 13:54
Xiuping
214
Let $A$ and $C $ be $ntimes n$ symmetric matrices, and $Abullet C=Tr(A^TC)$. Let $Ssubseteq [n]times [n]times [n]$. Define a non-convex programming problem as follows.
begin{equation}
begin{split}
&max Cbullet X\
&text{ s.t.} Abullet X=1,\
&qquad quad X_{i,j}X_{i,k}=0, forall (i,j,k)in S,\
&qquad quad Xsucceq 0, Xgeq 0,
end{split}
end{equation}
where $X$ is a variable ranging over the set of $ntimes n $ symmetric matrices over $mathbb{R}$, $ Xsucceq 0$ means $X$ is positive semi-definite, $ Xgeq 0$ means each entry of $X$ is nonnegative, and $X_{i,j}$ is the $(i,j)$-entry of $X$.
Could you please tell me how to solve this problem? And how to consider its dual problem? Thank you.
combinatorics nonlinear-optimization non-convex-optimization programming semidefinite-programming
combinatorics nonlinear-optimization non-convex-optimization programming semidefinite-programming
asked Nov 29 at 13:54
Xiuping
214
asked Nov 29 at 13:54
Xiuping
214
edited Nov 29 at 14:00
asked Nov 29 at 13:54
Xiuping
214
asked Nov 29 at 13:54
Xiuping
214
asked Nov 29 at 13:54
Xiuping
214
214
You could model the product constraint as a mixed-integer SDP.
– Michal Adamaszek
Nov 29 at 15:03
@MichalAdamaszek Could you please tell me how to do it? Thanks very much.
– Xiuping
Nov 30 at 9:50
Well $xy=0, x,ygeq 0$ is the same as $0leq xleq Mz$, $0leq yleq M(1-z)$ where $z$ is a binary variable and $M$ is an upper bound on $x,y$. See docs.mosek.com/modeling-cookbook/mio.html#boolean-operators But there is not a load of MISDP solvers, if any. YALMIP can model it I think. But then it is possible that YALMIP can model your whole problem directly.
– Michal Adamaszek
Nov 30 at 9:59
@MichalAdamaszek Thank you so much. If I write the problem as a MISDP, is it the case that the optimal value of MISDP is the same with the optimal value of its dual MISDD? Thanks.
– Xiuping
Nov 30 at 10:13
I'm not sure I know what a dual of a mixed-integer problem is.
– Michal Adamaszek
Nov 30 at 12:29
|
show 1 more comment
You could model the product constraint as a mixed-integer SDP.
– Michal Adamaszek
Nov 29 at 15:03
@MichalAdamaszek Could you please tell me how to do it? Thanks very much.
– Xiuping
Nov 30 at 9:50
Well $xy=0, x,ygeq 0$ is the same as $0leq xleq Mz$, $0leq yleq M(1-z)$ where $z$ is a binary variable and $M$ is an upper bound on $x,y$. See docs.mosek.com/modeling-cookbook/mio.html#boolean-operators But there is not a load of MISDP solvers, if any. YALMIP can model it I think. But then it is possible that YALMIP can model your whole problem directly.
– Michal Adamaszek
Nov 30 at 9:59
@MichalAdamaszek Thank you so much. If I write the problem as a MISDP, is it the case that the optimal value of MISDP is the same with the optimal value of its dual MISDD? Thanks.
– Xiuping
Nov 30 at 10:13
I'm not sure I know what a dual of a mixed-integer problem is.
– Michal Adamaszek
Nov 30 at 12:29
You could model the product constraint as a mixed-integer SDP.
– Michal Adamaszek
Nov 29 at 15:03
You could model the product constraint as a mixed-integer SDP.
– Michal Adamaszek
Nov 29 at 15:03
@MichalAdamaszek Could you please tell me how to do it? Thanks very much.
– Xiuping
Nov 30 at 9:50
@MichalAdamaszek Could you please tell me how to do it? Thanks very much.
– Xiuping
Nov 30 at 9:50
Well $xy=0, x,ygeq 0$ is the same as $0leq xleq Mz$, $0leq yleq M(1-z)$ where $z$ is a binary variable and $M$ is an upper bound on $x,y$. See docs.mosek.com/modeling-cookbook/mio.html#boolean-operators But there is not a load of MISDP solvers, if any. YALMIP can model it I think. But then it is possible that YALMIP can model your whole problem directly.
– Michal Adamaszek
Nov 30 at 9:59
Well $xy=0, x,ygeq 0$ is the same as $0leq xleq Mz$, $0leq yleq M(1-z)$ where $z$ is a binary variable and $M$ is an upper bound on $x,y$. See docs.mosek.com/modeling-cookbook/mio.html#boolean-operators But there is not a load of MISDP solvers, if any. YALMIP can model it I think. But then it is possible that YALMIP can model your whole problem directly.
– Michal Adamaszek
Nov 30 at 9:59
@MichalAdamaszek Thank you so much. If I write the problem as a MISDP, is it the case that the optimal value of MISDP is the same with the optimal value of its dual MISDD? Thanks.
– Xiuping
Nov 30 at 10:13
@MichalAdamaszek Thank you so much. If I write the problem as a MISDP, is it the case that the optimal value of MISDP is the same with the optimal value of its dual MISDD? Thanks.
– Xiuping
Nov 30 at 10:13
I'm not sure I know what a dual of a mixed-integer problem is.
– Michal Adamaszek
Nov 30 at 12:29
I'm not sure I know what a dual of a mixed-integer problem is.
– Michal Adamaszek
Nov 30 at 12:29
|
show 1 more comment
active
oldest
votes
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%2f3018649%2fhow-to-solve-a-non-convex-programming-problem%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
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.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- 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.
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%2f3018649%2fhow-to-solve-a-non-convex-programming-problem%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
You could model the product constraint as a mixed-integer SDP.
– Michal Adamaszek
Nov 29 at 15:03
@MichalAdamaszek Could you please tell me how to do it? Thanks very much.
– Xiuping
Nov 30 at 9:50
Well $xy=0, x,ygeq 0$ is the same as $0leq xleq Mz$, $0leq yleq M(1-z)$ where $z$ is a binary variable and $M$ is an upper bound on $x,y$. See docs.mosek.com/modeling-cookbook/mio.html#boolean-operators But there is not a load of MISDP solvers, if any. YALMIP can model it I think. But then it is possible that YALMIP can model your whole problem directly.
– Michal Adamaszek
Nov 30 at 9:59
@MichalAdamaszek Thank you so much. If I write the problem as a MISDP, is it the case that the optimal value of MISDP is the same with the optimal value of its dual MISDD? Thanks.
– Xiuping
Nov 30 at 10:13
I'm not sure I know what a dual of a mixed-integer problem is.
– Michal Adamaszek
Nov 30 at 12:29