Subgradient calculus: Understanding weighted sums property proof
$begingroup$
I'm reading page 72 of this pdf, and I can't understand the proof of the weighted sums property of the subdifferential $partial f$. Weighted sums satisfies:
Given two convex functions $f$ and $g$ on $mathbb{R}^n$ and $lambda, mu > 0$, and a function $h(x) = lambda f(x) + mu g(x)$, then:
$$partial h(x) = lambda partial f(x) + mu partial g(x) $$
For any $x in text{int Dom } h$
For the proof, author uses Corollary 1.2.1 and propositions 3.4.1:
Proposition 3.4.1 (page 69):
$$f′_h(x) = max{h^T d ; d in partial f(x)}$$
with $h in mathbb{R}^n$ and $f$ is a convex function. In short, the directional derivative is the support function of the set $partial f$.
Corollary 1.2.1 in this pdf:
Let $psi_M(x) = sup{y^Tx; y in M}$.
$M$ is a convex set. Function $psi_M(x)$ is called the support function of the set $M$.
Let $M1$ and $M2$ be two closed convex sets.
If for any $x in text{Dom }psi_{M2}$ we have $psi_{M1}(x) leq psi_{M2}(x)$ then $M1 subset M2$
Let $text{Dom }psi_{M1} = text{Dom }psi_{M2}$ and for any $x in text{Dom }psi_{M1}$ we have $psi_{M1}(x) = psi_{M2}(x)$. Then $M1 equiv M2$
Proof of weighted sums:
Let $x in text{int Dom } f cap text{int Dom } g$. Then for any vector $h in mathbb{R}^n$ (notation in this pdf is weird because author uses the same letter for vectors and functions):
$$f'_h(x) = lambda f'_h(x) + mu g'_h(x)$$
I think here's a typo: the term to the left should be $h'_h(x)$:
$$h'_h(x) = lambda f'_h(x) + mu g'_h(x) $$
$$h'_h(x) = max{lambda h^Td_1 ; d_1 in partial f (x) } + max { mu h^Td_2 ; d_2 in partial g(x) } $$
$$ = max{h^T (lambda d_1 + mu d_2) ; d_1 in partial f (x) ; d_2 in partial g(x) } $$
$$ = max{h^T d ; d in lambda partial f (x) + mu partial g(x) }$$
from this point, author uses Corollary 1.2.1 to obtain the property of weighted sums, but doesn't say how. Was the author saying that function $f$ is equal to function $h$ because of this corollary? How do I obtain the equivalence with $partial h(x)$?
convex-optimization subgradient
$endgroup$
add a comment |
$begingroup$
I'm reading page 72 of this pdf, and I can't understand the proof of the weighted sums property of the subdifferential $partial f$. Weighted sums satisfies:
Given two convex functions $f$ and $g$ on $mathbb{R}^n$ and $lambda, mu > 0$, and a function $h(x) = lambda f(x) + mu g(x)$, then:
$$partial h(x) = lambda partial f(x) + mu partial g(x) $$
For any $x in text{int Dom } h$
For the proof, author uses Corollary 1.2.1 and propositions 3.4.1:
Proposition 3.4.1 (page 69):
$$f′_h(x) = max{h^T d ; d in partial f(x)}$$
with $h in mathbb{R}^n$ and $f$ is a convex function. In short, the directional derivative is the support function of the set $partial f$.
Corollary 1.2.1 in this pdf:
Let $psi_M(x) = sup{y^Tx; y in M}$.
$M$ is a convex set. Function $psi_M(x)$ is called the support function of the set $M$.
Let $M1$ and $M2$ be two closed convex sets.
If for any $x in text{Dom }psi_{M2}$ we have $psi_{M1}(x) leq psi_{M2}(x)$ then $M1 subset M2$
Let $text{Dom }psi_{M1} = text{Dom }psi_{M2}$ and for any $x in text{Dom }psi_{M1}$ we have $psi_{M1}(x) = psi_{M2}(x)$. Then $M1 equiv M2$
Proof of weighted sums:
Let $x in text{int Dom } f cap text{int Dom } g$. Then for any vector $h in mathbb{R}^n$ (notation in this pdf is weird because author uses the same letter for vectors and functions):
$$f'_h(x) = lambda f'_h(x) + mu g'_h(x)$$
I think here's a typo: the term to the left should be $h'_h(x)$:
$$h'_h(x) = lambda f'_h(x) + mu g'_h(x) $$
$$h'_h(x) = max{lambda h^Td_1 ; d_1 in partial f (x) } + max { mu h^Td_2 ; d_2 in partial g(x) } $$
$$ = max{h^T (lambda d_1 + mu d_2) ; d_1 in partial f (x) ; d_2 in partial g(x) } $$
$$ = max{h^T d ; d in lambda partial f (x) + mu partial g(x) }$$
from this point, author uses Corollary 1.2.1 to obtain the property of weighted sums, but doesn't say how. Was the author saying that function $f$ is equal to function $h$ because of this corollary? How do I obtain the equivalence with $partial h(x)$?
convex-optimization subgradient
$endgroup$
add a comment |
$begingroup$
I'm reading page 72 of this pdf, and I can't understand the proof of the weighted sums property of the subdifferential $partial f$. Weighted sums satisfies:
Given two convex functions $f$ and $g$ on $mathbb{R}^n$ and $lambda, mu > 0$, and a function $h(x) = lambda f(x) + mu g(x)$, then:
$$partial h(x) = lambda partial f(x) + mu partial g(x) $$
For any $x in text{int Dom } h$
For the proof, author uses Corollary 1.2.1 and propositions 3.4.1:
Proposition 3.4.1 (page 69):
$$f′_h(x) = max{h^T d ; d in partial f(x)}$$
with $h in mathbb{R}^n$ and $f$ is a convex function. In short, the directional derivative is the support function of the set $partial f$.
Corollary 1.2.1 in this pdf:
Let $psi_M(x) = sup{y^Tx; y in M}$.
$M$ is a convex set. Function $psi_M(x)$ is called the support function of the set $M$.
Let $M1$ and $M2$ be two closed convex sets.
If for any $x in text{Dom }psi_{M2}$ we have $psi_{M1}(x) leq psi_{M2}(x)$ then $M1 subset M2$
Let $text{Dom }psi_{M1} = text{Dom }psi_{M2}$ and for any $x in text{Dom }psi_{M1}$ we have $psi_{M1}(x) = psi_{M2}(x)$. Then $M1 equiv M2$
Proof of weighted sums:
Let $x in text{int Dom } f cap text{int Dom } g$. Then for any vector $h in mathbb{R}^n$ (notation in this pdf is weird because author uses the same letter for vectors and functions):
$$f'_h(x) = lambda f'_h(x) + mu g'_h(x)$$
I think here's a typo: the term to the left should be $h'_h(x)$:
$$h'_h(x) = lambda f'_h(x) + mu g'_h(x) $$
$$h'_h(x) = max{lambda h^Td_1 ; d_1 in partial f (x) } + max { mu h^Td_2 ; d_2 in partial g(x) } $$
$$ = max{h^T (lambda d_1 + mu d_2) ; d_1 in partial f (x) ; d_2 in partial g(x) } $$
$$ = max{h^T d ; d in lambda partial f (x) + mu partial g(x) }$$
from this point, author uses Corollary 1.2.1 to obtain the property of weighted sums, but doesn't say how. Was the author saying that function $f$ is equal to function $h$ because of this corollary? How do I obtain the equivalence with $partial h(x)$?
convex-optimization subgradient
$endgroup$
I'm reading page 72 of this pdf, and I can't understand the proof of the weighted sums property of the subdifferential $partial f$. Weighted sums satisfies:
Given two convex functions $f$ and $g$ on $mathbb{R}^n$ and $lambda, mu > 0$, and a function $h(x) = lambda f(x) + mu g(x)$, then:
$$partial h(x) = lambda partial f(x) + mu partial g(x) $$
For any $x in text{int Dom } h$
For the proof, author uses Corollary 1.2.1 and propositions 3.4.1:
Proposition 3.4.1 (page 69):
$$f′_h(x) = max{h^T d ; d in partial f(x)}$$
with $h in mathbb{R}^n$ and $f$ is a convex function. In short, the directional derivative is the support function of the set $partial f$.
Corollary 1.2.1 in this pdf:
Let $psi_M(x) = sup{y^Tx; y in M}$.
$M$ is a convex set. Function $psi_M(x)$ is called the support function of the set $M$.
Let $M1$ and $M2$ be two closed convex sets.
If for any $x in text{Dom }psi_{M2}$ we have $psi_{M1}(x) leq psi_{M2}(x)$ then $M1 subset M2$
Let $text{Dom }psi_{M1} = text{Dom }psi_{M2}$ and for any $x in text{Dom }psi_{M1}$ we have $psi_{M1}(x) = psi_{M2}(x)$. Then $M1 equiv M2$
Proof of weighted sums:
Let $x in text{int Dom } f cap text{int Dom } g$. Then for any vector $h in mathbb{R}^n$ (notation in this pdf is weird because author uses the same letter for vectors and functions):
$$f'_h(x) = lambda f'_h(x) + mu g'_h(x)$$
I think here's a typo: the term to the left should be $h'_h(x)$:
$$h'_h(x) = lambda f'_h(x) + mu g'_h(x) $$
$$h'_h(x) = max{lambda h^Td_1 ; d_1 in partial f (x) } + max { mu h^Td_2 ; d_2 in partial g(x) } $$
$$ = max{h^T (lambda d_1 + mu d_2) ; d_1 in partial f (x) ; d_2 in partial g(x) } $$
$$ = max{h^T d ; d in lambda partial f (x) + mu partial g(x) }$$
from this point, author uses Corollary 1.2.1 to obtain the property of weighted sums, but doesn't say how. Was the author saying that function $f$ is equal to function $h$ because of this corollary? How do I obtain the equivalence with $partial h(x)$?
convex-optimization subgradient
convex-optimization subgradient
asked Feb 1 at 20:15
Broken_WindowBroken_Window
267211
267211
add a comment |
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%2f3096681%2fsubgradient-calculus-understanding-weighted-sums-property-proof%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%2f3096681%2fsubgradient-calculus-understanding-weighted-sums-property-proof%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