How to show negative entropy function $f(x)=sum_{i=1}^nx_ilog(x_i)$ is strongly convex?
$begingroup$
Let $x in mathbb{R}^n$ belongs to $S$ where
$$
S= {x in mathbb{R}^n mid x succ 0, |x|_{infty} leq M}
$$
where $succ$ is the generalized inequality which means all elements of $x$ are positive and $log$ is natural logarithm. Use the following theorem to show that $f(x)=sum_{i=1}^nx_ilog(x_i)$ is $frac{1}{M}$-strongly convex over $S$.
Theorem: f is $alpha$-strongly convex if and only if $nabla^2f(x) succeq alpha I$ for all $x$.
Definition:$f$ is $alpha$-strongly convex if there exist a constant $alpha$ such that
$$ f(y) geq f(x)+left<f '(x),y-xright>+frac{alpha}{2}|y-x|^2$$
or
$$ left<f'(y)-f '(x),y-xright> geq alpha|y-x|^2$$
for all $x,y$.
linear-algebra convex-analysis hessian-matrix
$endgroup$
add a comment |
$begingroup$
Let $x in mathbb{R}^n$ belongs to $S$ where
$$
S= {x in mathbb{R}^n mid x succ 0, |x|_{infty} leq M}
$$
where $succ$ is the generalized inequality which means all elements of $x$ are positive and $log$ is natural logarithm. Use the following theorem to show that $f(x)=sum_{i=1}^nx_ilog(x_i)$ is $frac{1}{M}$-strongly convex over $S$.
Theorem: f is $alpha$-strongly convex if and only if $nabla^2f(x) succeq alpha I$ for all $x$.
Definition:$f$ is $alpha$-strongly convex if there exist a constant $alpha$ such that
$$ f(y) geq f(x)+left<f '(x),y-xright>+frac{alpha}{2}|y-x|^2$$
or
$$ left<f'(y)-f '(x),y-xright> geq alpha|y-x|^2$$
for all $x,y$.
linear-algebra convex-analysis hessian-matrix
$endgroup$
add a comment |
$begingroup$
Let $x in mathbb{R}^n$ belongs to $S$ where
$$
S= {x in mathbb{R}^n mid x succ 0, |x|_{infty} leq M}
$$
where $succ$ is the generalized inequality which means all elements of $x$ are positive and $log$ is natural logarithm. Use the following theorem to show that $f(x)=sum_{i=1}^nx_ilog(x_i)$ is $frac{1}{M}$-strongly convex over $S$.
Theorem: f is $alpha$-strongly convex if and only if $nabla^2f(x) succeq alpha I$ for all $x$.
Definition:$f$ is $alpha$-strongly convex if there exist a constant $alpha$ such that
$$ f(y) geq f(x)+left<f '(x),y-xright>+frac{alpha}{2}|y-x|^2$$
or
$$ left<f'(y)-f '(x),y-xright> geq alpha|y-x|^2$$
for all $x,y$.
linear-algebra convex-analysis hessian-matrix
$endgroup$
Let $x in mathbb{R}^n$ belongs to $S$ where
$$
S= {x in mathbb{R}^n mid x succ 0, |x|_{infty} leq M}
$$
where $succ$ is the generalized inequality which means all elements of $x$ are positive and $log$ is natural logarithm. Use the following theorem to show that $f(x)=sum_{i=1}^nx_ilog(x_i)$ is $frac{1}{M}$-strongly convex over $S$.
Theorem: f is $alpha$-strongly convex if and only if $nabla^2f(x) succeq alpha I$ for all $x$.
Definition:$f$ is $alpha$-strongly convex if there exist a constant $alpha$ such that
$$ f(y) geq f(x)+left<f '(x),y-xright>+frac{alpha}{2}|y-x|^2$$
or
$$ left<f'(y)-f '(x),y-xright> geq alpha|y-x|^2$$
for all $x,y$.
linear-algebra convex-analysis hessian-matrix
linear-algebra convex-analysis hessian-matrix
edited Jan 17 at 19:57
Saeed
asked Dec 28 '18 at 18:57
SaeedSaeed
1,036310
1,036310
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
First of all, It seems to me that in the definition of $alpha$-strongly convex function should have a coefficient of $alpha$ but not $frac{alpha}{2}$.
Now here goes the proof
$$
begin{aligned}
frac{partial^2 f}{partial x_i partial_j} & = &frac{partial}{partial x_j}[log(x_i) + 1] \
& = & left {
begin{aligned}
1/x_i quad text{if } i =j \
0 quad text{if } i neq j
end{aligned}
right .
end{aligned}
$$
Since $0<x_ileq M$, then $1/x_i geq 1/M$
Thus $nabla^2 f geq frac{1}{M} I$, which is the theorem for $1/M$-strongly convex function.
$endgroup$
$begingroup$
I added two equivalent definition of $alpha$-strongly convex functions. In the last two lines $1/x_i geq 1/M$, $nabla^2 f geq 1/M$ and $1/M$ strongly convex.
$endgroup$
– Saeed
Jan 17 at 20:05
$begingroup$
you are right. It should be $1/M$ strongly convex.
$endgroup$
– MoonKnight
Jan 17 at 21:53
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%2f3055187%2fhow-to-show-negative-entropy-function-fx-sum-i-1nx-i-logx-i-is-strongl%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$
First of all, It seems to me that in the definition of $alpha$-strongly convex function should have a coefficient of $alpha$ but not $frac{alpha}{2}$.
Now here goes the proof
$$
begin{aligned}
frac{partial^2 f}{partial x_i partial_j} & = &frac{partial}{partial x_j}[log(x_i) + 1] \
& = & left {
begin{aligned}
1/x_i quad text{if } i =j \
0 quad text{if } i neq j
end{aligned}
right .
end{aligned}
$$
Since $0<x_ileq M$, then $1/x_i geq 1/M$
Thus $nabla^2 f geq frac{1}{M} I$, which is the theorem for $1/M$-strongly convex function.
$endgroup$
$begingroup$
I added two equivalent definition of $alpha$-strongly convex functions. In the last two lines $1/x_i geq 1/M$, $nabla^2 f geq 1/M$ and $1/M$ strongly convex.
$endgroup$
– Saeed
Jan 17 at 20:05
$begingroup$
you are right. It should be $1/M$ strongly convex.
$endgroup$
– MoonKnight
Jan 17 at 21:53
add a comment |
$begingroup$
First of all, It seems to me that in the definition of $alpha$-strongly convex function should have a coefficient of $alpha$ but not $frac{alpha}{2}$.
Now here goes the proof
$$
begin{aligned}
frac{partial^2 f}{partial x_i partial_j} & = &frac{partial}{partial x_j}[log(x_i) + 1] \
& = & left {
begin{aligned}
1/x_i quad text{if } i =j \
0 quad text{if } i neq j
end{aligned}
right .
end{aligned}
$$
Since $0<x_ileq M$, then $1/x_i geq 1/M$
Thus $nabla^2 f geq frac{1}{M} I$, which is the theorem for $1/M$-strongly convex function.
$endgroup$
$begingroup$
I added two equivalent definition of $alpha$-strongly convex functions. In the last two lines $1/x_i geq 1/M$, $nabla^2 f geq 1/M$ and $1/M$ strongly convex.
$endgroup$
– Saeed
Jan 17 at 20:05
$begingroup$
you are right. It should be $1/M$ strongly convex.
$endgroup$
– MoonKnight
Jan 17 at 21:53
add a comment |
$begingroup$
First of all, It seems to me that in the definition of $alpha$-strongly convex function should have a coefficient of $alpha$ but not $frac{alpha}{2}$.
Now here goes the proof
$$
begin{aligned}
frac{partial^2 f}{partial x_i partial_j} & = &frac{partial}{partial x_j}[log(x_i) + 1] \
& = & left {
begin{aligned}
1/x_i quad text{if } i =j \
0 quad text{if } i neq j
end{aligned}
right .
end{aligned}
$$
Since $0<x_ileq M$, then $1/x_i geq 1/M$
Thus $nabla^2 f geq frac{1}{M} I$, which is the theorem for $1/M$-strongly convex function.
$endgroup$
First of all, It seems to me that in the definition of $alpha$-strongly convex function should have a coefficient of $alpha$ but not $frac{alpha}{2}$.
Now here goes the proof
$$
begin{aligned}
frac{partial^2 f}{partial x_i partial_j} & = &frac{partial}{partial x_j}[log(x_i) + 1] \
& = & left {
begin{aligned}
1/x_i quad text{if } i =j \
0 quad text{if } i neq j
end{aligned}
right .
end{aligned}
$$
Since $0<x_ileq M$, then $1/x_i geq 1/M$
Thus $nabla^2 f geq frac{1}{M} I$, which is the theorem for $1/M$-strongly convex function.
edited Jan 17 at 21:53
answered Jan 17 at 18:13
MoonKnightMoonKnight
1,429611
1,429611
$begingroup$
I added two equivalent definition of $alpha$-strongly convex functions. In the last two lines $1/x_i geq 1/M$, $nabla^2 f geq 1/M$ and $1/M$ strongly convex.
$endgroup$
– Saeed
Jan 17 at 20:05
$begingroup$
you are right. It should be $1/M$ strongly convex.
$endgroup$
– MoonKnight
Jan 17 at 21:53
add a comment |
$begingroup$
I added two equivalent definition of $alpha$-strongly convex functions. In the last two lines $1/x_i geq 1/M$, $nabla^2 f geq 1/M$ and $1/M$ strongly convex.
$endgroup$
– Saeed
Jan 17 at 20:05
$begingroup$
you are right. It should be $1/M$ strongly convex.
$endgroup$
– MoonKnight
Jan 17 at 21:53
$begingroup$
I added two equivalent definition of $alpha$-strongly convex functions. In the last two lines $1/x_i geq 1/M$, $nabla^2 f geq 1/M$ and $1/M$ strongly convex.
$endgroup$
– Saeed
Jan 17 at 20:05
$begingroup$
I added two equivalent definition of $alpha$-strongly convex functions. In the last two lines $1/x_i geq 1/M$, $nabla^2 f geq 1/M$ and $1/M$ strongly convex.
$endgroup$
– Saeed
Jan 17 at 20:05
$begingroup$
you are right. It should be $1/M$ strongly convex.
$endgroup$
– MoonKnight
Jan 17 at 21:53
$begingroup$
you are right. It should be $1/M$ strongly convex.
$endgroup$
– MoonKnight
Jan 17 at 21:53
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%2f3055187%2fhow-to-show-negative-entropy-function-fx-sum-i-1nx-i-logx-i-is-strongl%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