Minimizing mixed-norm subject to a nonconvex quartic constraint for small n and m
0
How can one solve this mixed-norm minimization problem subject to a quartic constraint for small N and M (ex: M=12 and N=4):
- $textbf{c} = [c_{1},...,c_{N}]^T$
- $minbiggl (|textbf{c}|_{1} + beta|textbf{c}|_{2} ^2biggr) subjectspace
tospace sumlimits_ {m=1} ^M (|v_ {m} |^2-textbf{c}^Htextbf{a}_mtextbf{a}_m^Htextbf{c})
^2leqepsilon$
Thank you for advance for any suggestions.
optimization qcqp
asked Jan 4 at 14:58
kogitokogito
1013
New contributor
kogito is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
add a comment |
0
How can one solve this mixed-norm minimization problem subject to a quartic constraint for small N and M (ex: M=12 and N=4):
- $textbf{c} = [c_{1},...,c_{N}]^T$
- $minbiggl (|textbf{c}|_{1} + beta|textbf{c}|_{2} ^2biggr) subjectspace
tospace sumlimits_ {m=1} ^M (|v_ {m} |^2-textbf{c}^Htextbf{a}_mtextbf{a}_m^Htextbf{c})
^2leqepsilon$
Thank you for advance for any suggestions.
optimization qcqp
asked Jan 4 at 14:58
kogitokogito
1013
New contributor
kogito is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
1
This is not a convex problem, so you should remove that tag
– Johan Löfberg
Jan 4 at 17:21
2
...and it is not a quadratic constraint, it is quartic
– Johan Löfberg
Jan 4 at 17:22
Thank you for your comment. The problem is taken from this paper and there they mention that it is quadratic.
– kogito
Jan 4 at 17:50
1
Well that is obviously incorrect as you have a square of a quadratic. What they do is that they write the nonconvex quartic model as a rank-constrained (thus non-convex) semidefinite program with a convex quadratic constraint.
– Johan Löfberg
Jan 4 at 21:07
add a comment |
0
0
0
How can one solve this mixed-norm minimization problem subject to a quartic constraint for small N and M (ex: M=12 and N=4):
- $textbf{c} = [c_{1},...,c_{N}]^T$
- $minbiggl (|textbf{c}|_{1} + beta|textbf{c}|_{2} ^2biggr) subjectspace
tospace sumlimits_ {m=1} ^M (|v_ {m} |^2-textbf{c}^Htextbf{a}_mtextbf{a}_m^Htextbf{c})
^2leqepsilon$
Thank you for advance for any suggestions.
optimization qcqp
asked Jan 4 at 14:58
kogitokogito
1013
New contributor
kogito is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
How can one solve this mixed-norm minimization problem subject to a quartic constraint for small N and M (ex: M=12 and N=4):
- $textbf{c} = [c_{1},...,c_{N}]^T$
- $minbiggl (|textbf{c}|_{1} + beta|textbf{c}|_{2} ^2biggr) subjectspace
tospace sumlimits_ {m=1} ^M (|v_ {m} |^2-textbf{c}^Htextbf{a}_mtextbf{a}_m^Htextbf{c})
^2leqepsilon$
Thank you for advance for any suggestions.
optimization qcqp
optimization qcqp
asked Jan 4 at 14:58
kogitokogito
1013
New contributor
kogito is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
asked Jan 4 at 14:58
kogitokogito
1013
New contributor
kogito is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
edited Jan 4 at 21:35
kogito
asked Jan 4 at 14:58
kogitokogito
1013
New contributor
kogito is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
asked Jan 4 at 14:58
kogitokogito
1013
asked Jan 4 at 14:58
kogitokogito
1013
1013
New contributor
kogito is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
New contributor
kogito is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
kogito is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
1
This is not a convex problem, so you should remove that tag
– Johan Löfberg
Jan 4 at 17:21
2
...and it is not a quadratic constraint, it is quartic
– Johan Löfberg
Jan 4 at 17:22
Thank you for your comment. The problem is taken from this paper and there they mention that it is quadratic.
– kogito
Jan 4 at 17:50
1
Well that is obviously incorrect as you have a square of a quadratic. What they do is that they write the nonconvex quartic model as a rank-constrained (thus non-convex) semidefinite program with a convex quadratic constraint.
– Johan Löfberg
Jan 4 at 21:07
add a comment |
1
This is not a convex problem, so you should remove that tag
– Johan Löfberg
Jan 4 at 17:21
2
...and it is not a quadratic constraint, it is quartic
– Johan Löfberg
Jan 4 at 17:22
Thank you for your comment. The problem is taken from this paper and there they mention that it is quadratic.
– kogito
Jan 4 at 17:50
1
Well that is obviously incorrect as you have a square of a quadratic. What they do is that they write the nonconvex quartic model as a rank-constrained (thus non-convex) semidefinite program with a convex quadratic constraint.
– Johan Löfberg
Jan 4 at 21:07
1
1
This is not a convex problem, so you should remove that tag
– Johan Löfberg
Jan 4 at 17:21
This is not a convex problem, so you should remove that tag
– Johan Löfberg
Jan 4 at 17:21
2
2
...and it is not a quadratic constraint, it is quartic
– Johan Löfberg
Jan 4 at 17:22
...and it is not a quadratic constraint, it is quartic
– Johan Löfberg
Jan 4 at 17:22
Thank you for your comment. The problem is taken from this paper and there they mention that it is quadratic.
– kogito
Jan 4 at 17:50
Thank you for your comment. The problem is taken from this paper and there they mention that it is quadratic.
– kogito
Jan 4 at 17:50
1
1
Well that is obviously incorrect as you have a square of a quadratic. What they do is that they write the nonconvex quartic model as a rank-constrained (thus non-convex) semidefinite program with a convex quadratic constraint.
– Johan Löfberg
Jan 4 at 21:07
Well that is obviously incorrect as you have a square of a quadratic. What they do is that they write the nonconvex quartic model as a rank-constrained (thus non-convex) semidefinite program with a convex quadratic constraint.
– Johan Löfberg
Jan 4 at 21:07
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
});
}
});
kogito is a new contributor. Be nice, and check out our Code of Conduct.
draft saved
draft discarded
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%2f3061731%2fminimizing-mixed-norm-subject-to-a-nonconvex-quartic-constraint-for-small-n-and%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
kogito is a new contributor. Be nice, and check out our Code of Conduct.
draft saved
draft discarded
kogito is a new contributor. Be nice, and check out our Code of Conduct.
kogito is a new contributor. Be nice, and check out our Code of Conduct.
kogito is a new contributor. Be nice, and check out our Code of Conduct.
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.
draft saved
draft discarded
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%2f3061731%2fminimizing-mixed-norm-subject-to-a-nonconvex-quartic-constraint-for-small-n-and%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
1
This is not a convex problem, so you should remove that tag
– Johan Löfberg
Jan 4 at 17:21
2
...and it is not a quadratic constraint, it is quartic
– Johan Löfberg
Jan 4 at 17:22
Thank you for your comment. The problem is taken from this paper and there they mention that it is quadratic.
– kogito
Jan 4 at 17:50
1
Well that is obviously incorrect as you have a square of a quadratic. What they do is that they write the nonconvex quartic model as a rank-constrained (thus non-convex) semidefinite program with a convex quadratic constraint.
– Johan Löfberg
Jan 4 at 21:07