Lagrange dual of quadratic optimization problem with quadratic equality constraintsQuadratic optimisation with quadratic equality constraintsHow can we constrain lagrange multipliers in svm dual by adding constraints in primal problem?Minimization problem with infinitely many variables and linear constraintsFinding the Lagrange DualMinimizing quadratic objective subject to a quadratic equality constraintAm I stating the theorem about the dual optimization problem correctly?How to solve this non-convex optimization problem?Minimize $ mboxtr ( X^T A X ) + lambda mboxtr ( X^T B ) $ subject to $ X^T X = I $ - Linear Matrix Function with Norm Equality ConstraintCan I get a closed form of this optimization problem?Data sets for linear inequality and equality constrained quadratic optimization.
What historical events would have to change in order to make 19th century "steampunk" technology possible?
What are the G forces leaving Earth orbit?
How seriously should I take size and weight limits of hand luggage?
Can a virus destroy the BIOS of a modern computer?
Convert seconds to minutes
How to compactly explain secondary and tertiary characters without resorting to stereotypes?
How can saying a song's name be a copyright violation?
How to install cross-compiler on Ubuntu 18.04?
Am I breaking OOP practice with this architecture?
Send out email when Apex Queueable fails and test it
What is the fastest integer factorization to break RSA?
Does the Idaho Potato Commission associate potato skins with healthy eating?
Why is it a bad idea to hire a hitman to eliminate most corrupt politicians?
What reasons are there for a Capitalist to oppose a 100% inheritance tax?
Knowledge-based authentication using Domain-driven Design in C#
Do creatures with a speed 0ft., fly 30ft. (hover) ever touch the ground?
What exactly is ineptocracy?
Is it possible to create a QR code using text?
Getting extremely large arrows with tikzcd
How could sorcerers who are able to produce/manipulate almost all forms of energy communicate over large distances?
Finitely generated matrix groups whose eigenvalues are all algebraic
Machine learning testing data
How obscure is the use of 令 in 令和?
What is the most common color to indicate the input-field is disabled?
Lagrange dual of quadratic optimization problem with quadratic equality constraints
Quadratic optimisation with quadratic equality constraintsHow can we constrain lagrange multipliers in svm dual by adding constraints in primal problem?Minimization problem with infinitely many variables and linear constraintsFinding the Lagrange DualMinimizing quadratic objective subject to a quadratic equality constraintAm I stating the theorem about the dual optimization problem correctly?How to solve this non-convex optimization problem?Minimize $ mboxtr ( X^T A X ) + lambda mboxtr ( X^T B ) $ subject to $ X^T X = I $ - Linear Matrix Function with Norm Equality ConstraintCan I get a closed form of this optimization problem?Data sets for linear inequality and equality constrained quadratic optimization.
$begingroup$
What is the Lagrange dual of the following optimization problem in $w in mathbbR^2$?
$$beginarrayll textminimize & w^T Q , w\ textsubject to & w_1^2 = 1\ & w_2^2 = 1endarray$$
optimization duality-theorems non-convex-optimization qcqp
$endgroup$
add a comment |
$begingroup$
What is the Lagrange dual of the following optimization problem in $w in mathbbR^2$?
$$beginarrayll textminimize & w^T Q , w\ textsubject to & w_1^2 = 1\ & w_2^2 = 1endarray$$
optimization duality-theorems non-convex-optimization qcqp
$endgroup$
add a comment |
$begingroup$
What is the Lagrange dual of the following optimization problem in $w in mathbbR^2$?
$$beginarrayll textminimize & w^T Q , w\ textsubject to & w_1^2 = 1\ & w_2^2 = 1endarray$$
optimization duality-theorems non-convex-optimization qcqp
$endgroup$
What is the Lagrange dual of the following optimization problem in $w in mathbbR^2$?
$$beginarrayll textminimize & w^T Q , w\ textsubject to & w_1^2 = 1\ & w_2^2 = 1endarray$$
optimization duality-theorems non-convex-optimization qcqp
optimization duality-theorems non-convex-optimization qcqp
edited Mar 20 at 17:38
Rodrigo de Azevedo
13.1k41960
13.1k41960
asked Mar 20 at 17:22
user7080user7080
174
174
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
The standard representation of the constraints is$$omega_1^2=1iff omega^Tbeginbmatrix1&0\0&0endbmatrixomega=1\omega_2^2=1iff omega^Tbeginbmatrix0&0\0&1endbmatrixomega=1$$therefore
$$L(omega,lambda,nu)=omega^TQomega+omega^Tcdotleft(nu_1beginbmatrix1&0\0&0endbmatrix+nu_2beginbmatrix0&0\0&1endbmatrixright)cdotomega\=omega^Tcdotleft(Q+nu_1beginbmatrix1&0\0&0endbmatrix+nu_2beginbmatrix0&0\0&1endbmatrixright)cdotomega$$and the dual function would be:$$g(lambda,nu)=min_omegaL(omega,lambda,nu)$$which yields to the following dual problem:$$max_lambda,nu g(lambda,nu)\s.t.\lambdage 0$$
$endgroup$
$begingroup$
Thank you. But this is only the Lagrange equation, right? How do I get the dual from this?
$endgroup$
– user7080
Mar 20 at 17:35
$begingroup$
Your welcome. The dual is only an optimization over $omega$. I will add it to my answer...
$endgroup$
– Mostafa Ayaz
Mar 20 at 17:38
$begingroup$
Thank you, but what is $lambda$ here?
$endgroup$
– user7080
Mar 20 at 17:46
$begingroup$
Actually, $lambda$ stands for a most general form as a factor of inequality constraints which don't exist here. In our case $$g(lambda,nu)=g(nu)$$
$endgroup$
– Mostafa Ayaz
Mar 20 at 17:49
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%2f3155743%2flagrange-dual-of-quadratic-optimization-problem-with-quadratic-equality-constrai%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$
The standard representation of the constraints is$$omega_1^2=1iff omega^Tbeginbmatrix1&0\0&0endbmatrixomega=1\omega_2^2=1iff omega^Tbeginbmatrix0&0\0&1endbmatrixomega=1$$therefore
$$L(omega,lambda,nu)=omega^TQomega+omega^Tcdotleft(nu_1beginbmatrix1&0\0&0endbmatrix+nu_2beginbmatrix0&0\0&1endbmatrixright)cdotomega\=omega^Tcdotleft(Q+nu_1beginbmatrix1&0\0&0endbmatrix+nu_2beginbmatrix0&0\0&1endbmatrixright)cdotomega$$and the dual function would be:$$g(lambda,nu)=min_omegaL(omega,lambda,nu)$$which yields to the following dual problem:$$max_lambda,nu g(lambda,nu)\s.t.\lambdage 0$$
$endgroup$
$begingroup$
Thank you. But this is only the Lagrange equation, right? How do I get the dual from this?
$endgroup$
– user7080
Mar 20 at 17:35
$begingroup$
Your welcome. The dual is only an optimization over $omega$. I will add it to my answer...
$endgroup$
– Mostafa Ayaz
Mar 20 at 17:38
$begingroup$
Thank you, but what is $lambda$ here?
$endgroup$
– user7080
Mar 20 at 17:46
$begingroup$
Actually, $lambda$ stands for a most general form as a factor of inequality constraints which don't exist here. In our case $$g(lambda,nu)=g(nu)$$
$endgroup$
– Mostafa Ayaz
Mar 20 at 17:49
add a comment |
$begingroup$
The standard representation of the constraints is$$omega_1^2=1iff omega^Tbeginbmatrix1&0\0&0endbmatrixomega=1\omega_2^2=1iff omega^Tbeginbmatrix0&0\0&1endbmatrixomega=1$$therefore
$$L(omega,lambda,nu)=omega^TQomega+omega^Tcdotleft(nu_1beginbmatrix1&0\0&0endbmatrix+nu_2beginbmatrix0&0\0&1endbmatrixright)cdotomega\=omega^Tcdotleft(Q+nu_1beginbmatrix1&0\0&0endbmatrix+nu_2beginbmatrix0&0\0&1endbmatrixright)cdotomega$$and the dual function would be:$$g(lambda,nu)=min_omegaL(omega,lambda,nu)$$which yields to the following dual problem:$$max_lambda,nu g(lambda,nu)\s.t.\lambdage 0$$
$endgroup$
$begingroup$
Thank you. But this is only the Lagrange equation, right? How do I get the dual from this?
$endgroup$
– user7080
Mar 20 at 17:35
$begingroup$
Your welcome. The dual is only an optimization over $omega$. I will add it to my answer...
$endgroup$
– Mostafa Ayaz
Mar 20 at 17:38
$begingroup$
Thank you, but what is $lambda$ here?
$endgroup$
– user7080
Mar 20 at 17:46
$begingroup$
Actually, $lambda$ stands for a most general form as a factor of inequality constraints which don't exist here. In our case $$g(lambda,nu)=g(nu)$$
$endgroup$
– Mostafa Ayaz
Mar 20 at 17:49
add a comment |
$begingroup$
The standard representation of the constraints is$$omega_1^2=1iff omega^Tbeginbmatrix1&0\0&0endbmatrixomega=1\omega_2^2=1iff omega^Tbeginbmatrix0&0\0&1endbmatrixomega=1$$therefore
$$L(omega,lambda,nu)=omega^TQomega+omega^Tcdotleft(nu_1beginbmatrix1&0\0&0endbmatrix+nu_2beginbmatrix0&0\0&1endbmatrixright)cdotomega\=omega^Tcdotleft(Q+nu_1beginbmatrix1&0\0&0endbmatrix+nu_2beginbmatrix0&0\0&1endbmatrixright)cdotomega$$and the dual function would be:$$g(lambda,nu)=min_omegaL(omega,lambda,nu)$$which yields to the following dual problem:$$max_lambda,nu g(lambda,nu)\s.t.\lambdage 0$$
$endgroup$
The standard representation of the constraints is$$omega_1^2=1iff omega^Tbeginbmatrix1&0\0&0endbmatrixomega=1\omega_2^2=1iff omega^Tbeginbmatrix0&0\0&1endbmatrixomega=1$$therefore
$$L(omega,lambda,nu)=omega^TQomega+omega^Tcdotleft(nu_1beginbmatrix1&0\0&0endbmatrix+nu_2beginbmatrix0&0\0&1endbmatrixright)cdotomega\=omega^Tcdotleft(Q+nu_1beginbmatrix1&0\0&0endbmatrix+nu_2beginbmatrix0&0\0&1endbmatrixright)cdotomega$$and the dual function would be:$$g(lambda,nu)=min_omegaL(omega,lambda,nu)$$which yields to the following dual problem:$$max_lambda,nu g(lambda,nu)\s.t.\lambdage 0$$
edited Mar 20 at 17:40
answered Mar 20 at 17:30
Mostafa AyazMostafa Ayaz
18.2k31040
18.2k31040
$begingroup$
Thank you. But this is only the Lagrange equation, right? How do I get the dual from this?
$endgroup$
– user7080
Mar 20 at 17:35
$begingroup$
Your welcome. The dual is only an optimization over $omega$. I will add it to my answer...
$endgroup$
– Mostafa Ayaz
Mar 20 at 17:38
$begingroup$
Thank you, but what is $lambda$ here?
$endgroup$
– user7080
Mar 20 at 17:46
$begingroup$
Actually, $lambda$ stands for a most general form as a factor of inequality constraints which don't exist here. In our case $$g(lambda,nu)=g(nu)$$
$endgroup$
– Mostafa Ayaz
Mar 20 at 17:49
add a comment |
$begingroup$
Thank you. But this is only the Lagrange equation, right? How do I get the dual from this?
$endgroup$
– user7080
Mar 20 at 17:35
$begingroup$
Your welcome. The dual is only an optimization over $omega$. I will add it to my answer...
$endgroup$
– Mostafa Ayaz
Mar 20 at 17:38
$begingroup$
Thank you, but what is $lambda$ here?
$endgroup$
– user7080
Mar 20 at 17:46
$begingroup$
Actually, $lambda$ stands for a most general form as a factor of inequality constraints which don't exist here. In our case $$g(lambda,nu)=g(nu)$$
$endgroup$
– Mostafa Ayaz
Mar 20 at 17:49
$begingroup$
Thank you. But this is only the Lagrange equation, right? How do I get the dual from this?
$endgroup$
– user7080
Mar 20 at 17:35
$begingroup$
Thank you. But this is only the Lagrange equation, right? How do I get the dual from this?
$endgroup$
– user7080
Mar 20 at 17:35
$begingroup$
Your welcome. The dual is only an optimization over $omega$. I will add it to my answer...
$endgroup$
– Mostafa Ayaz
Mar 20 at 17:38
$begingroup$
Your welcome. The dual is only an optimization over $omega$. I will add it to my answer...
$endgroup$
– Mostafa Ayaz
Mar 20 at 17:38
$begingroup$
Thank you, but what is $lambda$ here?
$endgroup$
– user7080
Mar 20 at 17:46
$begingroup$
Thank you, but what is $lambda$ here?
$endgroup$
– user7080
Mar 20 at 17:46
$begingroup$
Actually, $lambda$ stands for a most general form as a factor of inequality constraints which don't exist here. In our case $$g(lambda,nu)=g(nu)$$
$endgroup$
– Mostafa Ayaz
Mar 20 at 17:49
$begingroup$
Actually, $lambda$ stands for a most general form as a factor of inequality constraints which don't exist here. In our case $$g(lambda,nu)=g(nu)$$
$endgroup$
– Mostafa Ayaz
Mar 20 at 17:49
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%2f3155743%2flagrange-dual-of-quadratic-optimization-problem-with-quadratic-equality-constrai%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