The difference between $(partial f)^{-1}$ and $partial f^*$ on non-reflexive space.
$begingroup$
Let $X$ be a Banach space, $f:Xto Bbb Rcup{infty}$ be a proper function. The multifunction $(partial f)^{-1}$ is defined by
$$
(partial f)^{-1}(x^*) = { xin X : x^* in partial f(x) }.
$$
It can be shown that $(partial f)^{-1} = partial f^*$ if $X$ is reflexive. Of course, $f^*$ is the Fenchel conjugate of $f$.
For a non-reflexive $X$, has anyone seen a concrete example of when
$$
(partial f)^{-1}(x^*) subsetneq partial f^*(x^*)?
$$
More specifically, I am interested in the case that $(partial f)^{-1}(x^*)=emptyset$ but $partial f^*(x^*)$ is non-empty.
real-analysis functional-analysis convex-analysis convex-optimization
$endgroup$
add a comment |
$begingroup$
Let $X$ be a Banach space, $f:Xto Bbb Rcup{infty}$ be a proper function. The multifunction $(partial f)^{-1}$ is defined by
$$
(partial f)^{-1}(x^*) = { xin X : x^* in partial f(x) }.
$$
It can be shown that $(partial f)^{-1} = partial f^*$ if $X$ is reflexive. Of course, $f^*$ is the Fenchel conjugate of $f$.
For a non-reflexive $X$, has anyone seen a concrete example of when
$$
(partial f)^{-1}(x^*) subsetneq partial f^*(x^*)?
$$
More specifically, I am interested in the case that $(partial f)^{-1}(x^*)=emptyset$ but $partial f^*(x^*)$ is non-empty.
real-analysis functional-analysis convex-analysis convex-optimization
$endgroup$
add a comment |
$begingroup$
Let $X$ be a Banach space, $f:Xto Bbb Rcup{infty}$ be a proper function. The multifunction $(partial f)^{-1}$ is defined by
$$
(partial f)^{-1}(x^*) = { xin X : x^* in partial f(x) }.
$$
It can be shown that $(partial f)^{-1} = partial f^*$ if $X$ is reflexive. Of course, $f^*$ is the Fenchel conjugate of $f$.
For a non-reflexive $X$, has anyone seen a concrete example of when
$$
(partial f)^{-1}(x^*) subsetneq partial f^*(x^*)?
$$
More specifically, I am interested in the case that $(partial f)^{-1}(x^*)=emptyset$ but $partial f^*(x^*)$ is non-empty.
real-analysis functional-analysis convex-analysis convex-optimization
$endgroup$
Let $X$ be a Banach space, $f:Xto Bbb Rcup{infty}$ be a proper function. The multifunction $(partial f)^{-1}$ is defined by
$$
(partial f)^{-1}(x^*) = { xin X : x^* in partial f(x) }.
$$
It can be shown that $(partial f)^{-1} = partial f^*$ if $X$ is reflexive. Of course, $f^*$ is the Fenchel conjugate of $f$.
For a non-reflexive $X$, has anyone seen a concrete example of when
$$
(partial f)^{-1}(x^*) subsetneq partial f^*(x^*)?
$$
More specifically, I am interested in the case that $(partial f)^{-1}(x^*)=emptyset$ but $partial f^*(x^*)$ is non-empty.
real-analysis functional-analysis convex-analysis convex-optimization
real-analysis functional-analysis convex-analysis convex-optimization
asked Feb 1 at 17:41


BigbearZzzBigbearZzz
9,04721653
9,04721653
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
The following should work:
Let $X=c_0$ and $f=tfrac{1}{2}|cdot|^2$ on $c_0$.
Then $f^*$ looks likewise, but uses the norm on $c_0^*=ell_1$.
Now take a sequence in $ell_1$ such as $x^* =(1/2^n)_{ngeq 1}$.
Then $partial f^*(x^*)={(1,1,ldots)_{ngeq 1}}$
but $(partial f)^{-1}=varnothing$ (because $(1,1,ldots)notin c_0$).
$endgroup$
$begingroup$
Interesting example. I have one question, if you don't mind. I know the part about getting $f^*$ from $f$ but how did you calculate $partial f^*(x^*)={(1,1,ldots)_{ngeq 1}}$? I've never done calculation like this before.
$endgroup$
– BigbearZzz
Feb 4 at 16:38
$begingroup$
Write $J=partial tfrac{1}{2}|cdot|^2$. Then $(Jz)_n = |z|mathrm{Sign}(z_n)$ by the chain rule, where $mathrm{Sign}$ is the sign function, but with $mathrm{Sign}(0)=[-1,1]$. Unfortunately, I don't have a good reference for this - but websearch duality map or normalized duality map. (If anybody has one, please post.) I recommend you try this for the $ell_1$ norm on $mathbb{R}^2$ - this example is nothing but that generalization.
$endgroup$
– max_zorn
Feb 4 at 17:36
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%2f3096528%2fthe-difference-between-partial-f-1-and-partial-f-on-non-reflexive-s%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 following should work:
Let $X=c_0$ and $f=tfrac{1}{2}|cdot|^2$ on $c_0$.
Then $f^*$ looks likewise, but uses the norm on $c_0^*=ell_1$.
Now take a sequence in $ell_1$ such as $x^* =(1/2^n)_{ngeq 1}$.
Then $partial f^*(x^*)={(1,1,ldots)_{ngeq 1}}$
but $(partial f)^{-1}=varnothing$ (because $(1,1,ldots)notin c_0$).
$endgroup$
$begingroup$
Interesting example. I have one question, if you don't mind. I know the part about getting $f^*$ from $f$ but how did you calculate $partial f^*(x^*)={(1,1,ldots)_{ngeq 1}}$? I've never done calculation like this before.
$endgroup$
– BigbearZzz
Feb 4 at 16:38
$begingroup$
Write $J=partial tfrac{1}{2}|cdot|^2$. Then $(Jz)_n = |z|mathrm{Sign}(z_n)$ by the chain rule, where $mathrm{Sign}$ is the sign function, but with $mathrm{Sign}(0)=[-1,1]$. Unfortunately, I don't have a good reference for this - but websearch duality map or normalized duality map. (If anybody has one, please post.) I recommend you try this for the $ell_1$ norm on $mathbb{R}^2$ - this example is nothing but that generalization.
$endgroup$
– max_zorn
Feb 4 at 17:36
add a comment |
$begingroup$
The following should work:
Let $X=c_0$ and $f=tfrac{1}{2}|cdot|^2$ on $c_0$.
Then $f^*$ looks likewise, but uses the norm on $c_0^*=ell_1$.
Now take a sequence in $ell_1$ such as $x^* =(1/2^n)_{ngeq 1}$.
Then $partial f^*(x^*)={(1,1,ldots)_{ngeq 1}}$
but $(partial f)^{-1}=varnothing$ (because $(1,1,ldots)notin c_0$).
$endgroup$
$begingroup$
Interesting example. I have one question, if you don't mind. I know the part about getting $f^*$ from $f$ but how did you calculate $partial f^*(x^*)={(1,1,ldots)_{ngeq 1}}$? I've never done calculation like this before.
$endgroup$
– BigbearZzz
Feb 4 at 16:38
$begingroup$
Write $J=partial tfrac{1}{2}|cdot|^2$. Then $(Jz)_n = |z|mathrm{Sign}(z_n)$ by the chain rule, where $mathrm{Sign}$ is the sign function, but with $mathrm{Sign}(0)=[-1,1]$. Unfortunately, I don't have a good reference for this - but websearch duality map or normalized duality map. (If anybody has one, please post.) I recommend you try this for the $ell_1$ norm on $mathbb{R}^2$ - this example is nothing but that generalization.
$endgroup$
– max_zorn
Feb 4 at 17:36
add a comment |
$begingroup$
The following should work:
Let $X=c_0$ and $f=tfrac{1}{2}|cdot|^2$ on $c_0$.
Then $f^*$ looks likewise, but uses the norm on $c_0^*=ell_1$.
Now take a sequence in $ell_1$ such as $x^* =(1/2^n)_{ngeq 1}$.
Then $partial f^*(x^*)={(1,1,ldots)_{ngeq 1}}$
but $(partial f)^{-1}=varnothing$ (because $(1,1,ldots)notin c_0$).
$endgroup$
The following should work:
Let $X=c_0$ and $f=tfrac{1}{2}|cdot|^2$ on $c_0$.
Then $f^*$ looks likewise, but uses the norm on $c_0^*=ell_1$.
Now take a sequence in $ell_1$ such as $x^* =(1/2^n)_{ngeq 1}$.
Then $partial f^*(x^*)={(1,1,ldots)_{ngeq 1}}$
but $(partial f)^{-1}=varnothing$ (because $(1,1,ldots)notin c_0$).
answered Feb 1 at 18:41
max_zornmax_zorn
3,44061429
3,44061429
$begingroup$
Interesting example. I have one question, if you don't mind. I know the part about getting $f^*$ from $f$ but how did you calculate $partial f^*(x^*)={(1,1,ldots)_{ngeq 1}}$? I've never done calculation like this before.
$endgroup$
– BigbearZzz
Feb 4 at 16:38
$begingroup$
Write $J=partial tfrac{1}{2}|cdot|^2$. Then $(Jz)_n = |z|mathrm{Sign}(z_n)$ by the chain rule, where $mathrm{Sign}$ is the sign function, but with $mathrm{Sign}(0)=[-1,1]$. Unfortunately, I don't have a good reference for this - but websearch duality map or normalized duality map. (If anybody has one, please post.) I recommend you try this for the $ell_1$ norm on $mathbb{R}^2$ - this example is nothing but that generalization.
$endgroup$
– max_zorn
Feb 4 at 17:36
add a comment |
$begingroup$
Interesting example. I have one question, if you don't mind. I know the part about getting $f^*$ from $f$ but how did you calculate $partial f^*(x^*)={(1,1,ldots)_{ngeq 1}}$? I've never done calculation like this before.
$endgroup$
– BigbearZzz
Feb 4 at 16:38
$begingroup$
Write $J=partial tfrac{1}{2}|cdot|^2$. Then $(Jz)_n = |z|mathrm{Sign}(z_n)$ by the chain rule, where $mathrm{Sign}$ is the sign function, but with $mathrm{Sign}(0)=[-1,1]$. Unfortunately, I don't have a good reference for this - but websearch duality map or normalized duality map. (If anybody has one, please post.) I recommend you try this for the $ell_1$ norm on $mathbb{R}^2$ - this example is nothing but that generalization.
$endgroup$
– max_zorn
Feb 4 at 17:36
$begingroup$
Interesting example. I have one question, if you don't mind. I know the part about getting $f^*$ from $f$ but how did you calculate $partial f^*(x^*)={(1,1,ldots)_{ngeq 1}}$? I've never done calculation like this before.
$endgroup$
– BigbearZzz
Feb 4 at 16:38
$begingroup$
Interesting example. I have one question, if you don't mind. I know the part about getting $f^*$ from $f$ but how did you calculate $partial f^*(x^*)={(1,1,ldots)_{ngeq 1}}$? I've never done calculation like this before.
$endgroup$
– BigbearZzz
Feb 4 at 16:38
$begingroup$
Write $J=partial tfrac{1}{2}|cdot|^2$. Then $(Jz)_n = |z|mathrm{Sign}(z_n)$ by the chain rule, where $mathrm{Sign}$ is the sign function, but with $mathrm{Sign}(0)=[-1,1]$. Unfortunately, I don't have a good reference for this - but websearch duality map or normalized duality map. (If anybody has one, please post.) I recommend you try this for the $ell_1$ norm on $mathbb{R}^2$ - this example is nothing but that generalization.
$endgroup$
– max_zorn
Feb 4 at 17:36
$begingroup$
Write $J=partial tfrac{1}{2}|cdot|^2$. Then $(Jz)_n = |z|mathrm{Sign}(z_n)$ by the chain rule, where $mathrm{Sign}$ is the sign function, but with $mathrm{Sign}(0)=[-1,1]$. Unfortunately, I don't have a good reference for this - but websearch duality map or normalized duality map. (If anybody has one, please post.) I recommend you try this for the $ell_1$ norm on $mathbb{R}^2$ - this example is nothing but that generalization.
$endgroup$
– max_zorn
Feb 4 at 17:36
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%2f3096528%2fthe-difference-between-partial-f-1-and-partial-f-on-non-reflexive-s%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