Question about Lagrange Duality and saddle points












0












$begingroup$


Consider two Hilbert spaces $mathcal{H}$ and $mathcal{G}$ and an extended real valued function $f:mathcal{H}tomathbb{R}cup{+infty}$ with $finGamma_0(mathcal{H})$ the set of proper, lower semicontinuous, convex functions. We look at the following problem (we will refer to this as the primal),



$$min f(x) : Ax=0$$



where $A:mathcal{H}tomathcal{G}$ is a linear operator.



We can form the classical Lagrangian for our problem,



$$mathcal{L}(x,mu) = f(x) + langle mu, Axrangle$$



and state the dual problem,



$$max_mumin_xmathcal{L}(x,mu)$$



Let us also assume that strong duality holds. My question, then, is the following:



Imagine you have a particular solution $bar{mu}$ to the dual problem and you also have a solution $x^*inargminlimits_{x}mathcal{L}(x,bar{mu})$. Is it true that $Ax^*=0$, i.e. $x^*$ is feasible and thus $(x^*,bar{mu})$ is a saddle point/primal dual pair?










share|cite|improve this question









$endgroup$








  • 1




    $begingroup$
    If $x^*$ is a unique minimizer of $L(x,barmu)$ then yes, otherwise no.
    $endgroup$
    – A.Γ.
    Dec 14 '18 at 19:54


















0












$begingroup$


Consider two Hilbert spaces $mathcal{H}$ and $mathcal{G}$ and an extended real valued function $f:mathcal{H}tomathbb{R}cup{+infty}$ with $finGamma_0(mathcal{H})$ the set of proper, lower semicontinuous, convex functions. We look at the following problem (we will refer to this as the primal),



$$min f(x) : Ax=0$$



where $A:mathcal{H}tomathcal{G}$ is a linear operator.



We can form the classical Lagrangian for our problem,



$$mathcal{L}(x,mu) = f(x) + langle mu, Axrangle$$



and state the dual problem,



$$max_mumin_xmathcal{L}(x,mu)$$



Let us also assume that strong duality holds. My question, then, is the following:



Imagine you have a particular solution $bar{mu}$ to the dual problem and you also have a solution $x^*inargminlimits_{x}mathcal{L}(x,bar{mu})$. Is it true that $Ax^*=0$, i.e. $x^*$ is feasible and thus $(x^*,bar{mu})$ is a saddle point/primal dual pair?










share|cite|improve this question









$endgroup$








  • 1




    $begingroup$
    If $x^*$ is a unique minimizer of $L(x,barmu)$ then yes, otherwise no.
    $endgroup$
    – A.Γ.
    Dec 14 '18 at 19:54
















0












0








0





$begingroup$


Consider two Hilbert spaces $mathcal{H}$ and $mathcal{G}$ and an extended real valued function $f:mathcal{H}tomathbb{R}cup{+infty}$ with $finGamma_0(mathcal{H})$ the set of proper, lower semicontinuous, convex functions. We look at the following problem (we will refer to this as the primal),



$$min f(x) : Ax=0$$



where $A:mathcal{H}tomathcal{G}$ is a linear operator.



We can form the classical Lagrangian for our problem,



$$mathcal{L}(x,mu) = f(x) + langle mu, Axrangle$$



and state the dual problem,



$$max_mumin_xmathcal{L}(x,mu)$$



Let us also assume that strong duality holds. My question, then, is the following:



Imagine you have a particular solution $bar{mu}$ to the dual problem and you also have a solution $x^*inargminlimits_{x}mathcal{L}(x,bar{mu})$. Is it true that $Ax^*=0$, i.e. $x^*$ is feasible and thus $(x^*,bar{mu})$ is a saddle point/primal dual pair?










share|cite|improve this question









$endgroup$




Consider two Hilbert spaces $mathcal{H}$ and $mathcal{G}$ and an extended real valued function $f:mathcal{H}tomathbb{R}cup{+infty}$ with $finGamma_0(mathcal{H})$ the set of proper, lower semicontinuous, convex functions. We look at the following problem (we will refer to this as the primal),



$$min f(x) : Ax=0$$



where $A:mathcal{H}tomathcal{G}$ is a linear operator.



We can form the classical Lagrangian for our problem,



$$mathcal{L}(x,mu) = f(x) + langle mu, Axrangle$$



and state the dual problem,



$$max_mumin_xmathcal{L}(x,mu)$$



Let us also assume that strong duality holds. My question, then, is the following:



Imagine you have a particular solution $bar{mu}$ to the dual problem and you also have a solution $x^*inargminlimits_{x}mathcal{L}(x,bar{mu})$. Is it true that $Ax^*=0$, i.e. $x^*$ is feasible and thus $(x^*,bar{mu})$ is a saddle point/primal dual pair?







functional-analysis convex-analysis lagrange-multiplier






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked Dec 14 '18 at 11:06









Tony S.F.Tony S.F.

3,30821028




3,30821028








  • 1




    $begingroup$
    If $x^*$ is a unique minimizer of $L(x,barmu)$ then yes, otherwise no.
    $endgroup$
    – A.Γ.
    Dec 14 '18 at 19:54
















  • 1




    $begingroup$
    If $x^*$ is a unique minimizer of $L(x,barmu)$ then yes, otherwise no.
    $endgroup$
    – A.Γ.
    Dec 14 '18 at 19:54










1




1




$begingroup$
If $x^*$ is a unique minimizer of $L(x,barmu)$ then yes, otherwise no.
$endgroup$
– A.Γ.
Dec 14 '18 at 19:54






$begingroup$
If $x^*$ is a unique minimizer of $L(x,barmu)$ then yes, otherwise no.
$endgroup$
– A.Γ.
Dec 14 '18 at 19:54












1 Answer
1






active

oldest

votes


















1












$begingroup$

No, not necessarily. Take $min_{x} { x : x = 0 }$. The Lagrangian is $L(x,mu)=x+mu x$, the unique saddle point is $(x,mu)=(0,-1)$, while any $x$ minimizes the Lagrangian.






share|cite|improve this answer











$endgroup$













  • $begingroup$
    I was just about to post the example $min xcolon x=0$ :)
    $endgroup$
    – A.Γ.
    Dec 14 '18 at 19:55










  • $begingroup$
    @A.Γ. that is actually a better example because the rhs in the question is 0.
    $endgroup$
    – LinAlg
    Dec 14 '18 at 20:14











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
});


}
});














draft saved

draft discarded


















StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3039225%2fquestion-about-lagrange-duality-and-saddle-points%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









1












$begingroup$

No, not necessarily. Take $min_{x} { x : x = 0 }$. The Lagrangian is $L(x,mu)=x+mu x$, the unique saddle point is $(x,mu)=(0,-1)$, while any $x$ minimizes the Lagrangian.






share|cite|improve this answer











$endgroup$













  • $begingroup$
    I was just about to post the example $min xcolon x=0$ :)
    $endgroup$
    – A.Γ.
    Dec 14 '18 at 19:55










  • $begingroup$
    @A.Γ. that is actually a better example because the rhs in the question is 0.
    $endgroup$
    – LinAlg
    Dec 14 '18 at 20:14
















1












$begingroup$

No, not necessarily. Take $min_{x} { x : x = 0 }$. The Lagrangian is $L(x,mu)=x+mu x$, the unique saddle point is $(x,mu)=(0,-1)$, while any $x$ minimizes the Lagrangian.






share|cite|improve this answer











$endgroup$













  • $begingroup$
    I was just about to post the example $min xcolon x=0$ :)
    $endgroup$
    – A.Γ.
    Dec 14 '18 at 19:55










  • $begingroup$
    @A.Γ. that is actually a better example because the rhs in the question is 0.
    $endgroup$
    – LinAlg
    Dec 14 '18 at 20:14














1












1








1





$begingroup$

No, not necessarily. Take $min_{x} { x : x = 0 }$. The Lagrangian is $L(x,mu)=x+mu x$, the unique saddle point is $(x,mu)=(0,-1)$, while any $x$ minimizes the Lagrangian.






share|cite|improve this answer











$endgroup$



No, not necessarily. Take $min_{x} { x : x = 0 }$. The Lagrangian is $L(x,mu)=x+mu x$, the unique saddle point is $(x,mu)=(0,-1)$, while any $x$ minimizes the Lagrangian.







share|cite|improve this answer














share|cite|improve this answer



share|cite|improve this answer








edited Dec 14 '18 at 20:14

























answered Dec 14 '18 at 19:04









LinAlgLinAlg

9,9341521




9,9341521












  • $begingroup$
    I was just about to post the example $min xcolon x=0$ :)
    $endgroup$
    – A.Γ.
    Dec 14 '18 at 19:55










  • $begingroup$
    @A.Γ. that is actually a better example because the rhs in the question is 0.
    $endgroup$
    – LinAlg
    Dec 14 '18 at 20:14


















  • $begingroup$
    I was just about to post the example $min xcolon x=0$ :)
    $endgroup$
    – A.Γ.
    Dec 14 '18 at 19:55










  • $begingroup$
    @A.Γ. that is actually a better example because the rhs in the question is 0.
    $endgroup$
    – LinAlg
    Dec 14 '18 at 20:14
















$begingroup$
I was just about to post the example $min xcolon x=0$ :)
$endgroup$
– A.Γ.
Dec 14 '18 at 19:55




$begingroup$
I was just about to post the example $min xcolon x=0$ :)
$endgroup$
– A.Γ.
Dec 14 '18 at 19:55












$begingroup$
@A.Γ. that is actually a better example because the rhs in the question is 0.
$endgroup$
– LinAlg
Dec 14 '18 at 20:14




$begingroup$
@A.Γ. that is actually a better example because the rhs in the question is 0.
$endgroup$
– LinAlg
Dec 14 '18 at 20:14


















draft saved

draft discarded




















































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.




draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3039225%2fquestion-about-lagrange-duality-and-saddle-points%23new-answer', 'question_page');
}
);

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







Popular posts from this blog

Bundesstraße 106

Verónica Boquete

Ida-Boy-Ed-Garten