Why is strong duality holds even though the problem is not convex?
$begingroup$
I write the question $5.29$ in Convex Optimization ,and it said
minimize $-3x_1^2+x_2^2+2x_3^2+2(x_1+x_2+x_3)$
subject to $x_1^2+x_2^2+x_3^2=1$
so strong duality holds even though the problem is not convex
I wonder that if we have to prove it is strong duality and not convex,how should we prove it?
convex-analysis convex-optimization duality-theorems
$endgroup$
add a comment |
$begingroup$
I write the question $5.29$ in Convex Optimization ,and it said
minimize $-3x_1^2+x_2^2+2x_3^2+2(x_1+x_2+x_3)$
subject to $x_1^2+x_2^2+x_3^2=1$
so strong duality holds even though the problem is not convex
I wonder that if we have to prove it is strong duality and not convex,how should we prove it?
convex-analysis convex-optimization duality-theorems
$endgroup$
$begingroup$
Perhaps you can read page 229 of the book (which is referred to from the question).
$endgroup$
– LinAlg
Nov 26 '18 at 14:28
$begingroup$
The problem actually becomes convex if we substitute $x_1^2=1-x_2^2-x_3^2$ and $x_1=-sqrt{1-x_2^2-x_3^2}$ into the objective function subject to $x_2^2+x_3^2le 1$.
$endgroup$
– A.Γ.
Dec 7 '18 at 21:56
add a comment |
$begingroup$
I write the question $5.29$ in Convex Optimization ,and it said
minimize $-3x_1^2+x_2^2+2x_3^2+2(x_1+x_2+x_3)$
subject to $x_1^2+x_2^2+x_3^2=1$
so strong duality holds even though the problem is not convex
I wonder that if we have to prove it is strong duality and not convex,how should we prove it?
convex-analysis convex-optimization duality-theorems
$endgroup$
I write the question $5.29$ in Convex Optimization ,and it said
minimize $-3x_1^2+x_2^2+2x_3^2+2(x_1+x_2+x_3)$
subject to $x_1^2+x_2^2+x_3^2=1$
so strong duality holds even though the problem is not convex
I wonder that if we have to prove it is strong duality and not convex,how should we prove it?
convex-analysis convex-optimization duality-theorems
convex-analysis convex-optimization duality-theorems
asked Nov 26 '18 at 13:09
shineeleshineele
377
377
$begingroup$
Perhaps you can read page 229 of the book (which is referred to from the question).
$endgroup$
– LinAlg
Nov 26 '18 at 14:28
$begingroup$
The problem actually becomes convex if we substitute $x_1^2=1-x_2^2-x_3^2$ and $x_1=-sqrt{1-x_2^2-x_3^2}$ into the objective function subject to $x_2^2+x_3^2le 1$.
$endgroup$
– A.Γ.
Dec 7 '18 at 21:56
add a comment |
$begingroup$
Perhaps you can read page 229 of the book (which is referred to from the question).
$endgroup$
– LinAlg
Nov 26 '18 at 14:28
$begingroup$
The problem actually becomes convex if we substitute $x_1^2=1-x_2^2-x_3^2$ and $x_1=-sqrt{1-x_2^2-x_3^2}$ into the objective function subject to $x_2^2+x_3^2le 1$.
$endgroup$
– A.Γ.
Dec 7 '18 at 21:56
$begingroup$
Perhaps you can read page 229 of the book (which is referred to from the question).
$endgroup$
– LinAlg
Nov 26 '18 at 14:28
$begingroup$
Perhaps you can read page 229 of the book (which is referred to from the question).
$endgroup$
– LinAlg
Nov 26 '18 at 14:28
$begingroup$
The problem actually becomes convex if we substitute $x_1^2=1-x_2^2-x_3^2$ and $x_1=-sqrt{1-x_2^2-x_3^2}$ into the objective function subject to $x_2^2+x_3^2le 1$.
$endgroup$
– A.Γ.
Dec 7 '18 at 21:56
$begingroup$
The problem actually becomes convex if we substitute $x_1^2=1-x_2^2-x_3^2$ and $x_1=-sqrt{1-x_2^2-x_3^2}$ into the objective function subject to $x_2^2+x_3^2le 1$.
$endgroup$
– A.Γ.
Dec 7 '18 at 21:56
add a comment |
0
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%2f3014311%2fwhy-is-strong-duality-holds-even-though-the-problem-is-not-convex%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
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.
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%2f3014311%2fwhy-is-strong-duality-holds-even-though-the-problem-is-not-convex%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$
Perhaps you can read page 229 of the book (which is referred to from the question).
$endgroup$
– LinAlg
Nov 26 '18 at 14:28
$begingroup$
The problem actually becomes convex if we substitute $x_1^2=1-x_2^2-x_3^2$ and $x_1=-sqrt{1-x_2^2-x_3^2}$ into the objective function subject to $x_2^2+x_3^2le 1$.
$endgroup$
– A.Γ.
Dec 7 '18 at 21:56