Maximizing a strictly concave function over a compact convex set












1












$begingroup$


Let $f: S to mathbb{R}$ be a (strictly) concave function, where



$S := {y in mathbb{R}^m: ygeq 0,, sum_{i=1}^m y_i=1 }$.



I want to show that there is a $y^*in S$, which maximizes $f$. $S$ is a convex set and I found some results from convex optimization that strictly convex functions on convex sets have unique minimizers if local minima exist. Here, the set $S$ is also compact; how can we use this to prove the existence of a maximizing $y^*in S$?



Thanks in advance!










share|cite|improve this question









$endgroup$












  • $begingroup$
    Apply the result yo have quoted to $-f$.
    $endgroup$
    – Kavi Rama Murthy
    Dec 2 '18 at 23:15










  • $begingroup$
    This result needs the existence of local minima of -$f$. How does this follow from the compactness of $S$?
    $endgroup$
    – Max93
    Dec 2 '18 at 23:28






  • 1




    $begingroup$
    @Max93: All convex functions are continuous (in fact, locally Lipschitz continuous), so you can appeal to the Extreme Value Theorem which says that continuous functions attain their maxima / minima over compact sets.
    $endgroup$
    – VHarisop
    Dec 4 '18 at 19:17










  • $begingroup$
    @VHarisop : Thank you! For the Extreme Value Theorem one needs that the function is continuous on the compact set, but doesn't it only follow from the convexity that the function is continuous on the interior? Why isn't this a problem?
    $endgroup$
    – Max93
    Dec 4 '18 at 20:21










  • $begingroup$
    @Max93: My apologies, I read the statement hastily and thought $f$ was defined everywhere.
    $endgroup$
    – VHarisop
    Dec 4 '18 at 20:57
















1












$begingroup$


Let $f: S to mathbb{R}$ be a (strictly) concave function, where



$S := {y in mathbb{R}^m: ygeq 0,, sum_{i=1}^m y_i=1 }$.



I want to show that there is a $y^*in S$, which maximizes $f$. $S$ is a convex set and I found some results from convex optimization that strictly convex functions on convex sets have unique minimizers if local minima exist. Here, the set $S$ is also compact; how can we use this to prove the existence of a maximizing $y^*in S$?



Thanks in advance!










share|cite|improve this question









$endgroup$












  • $begingroup$
    Apply the result yo have quoted to $-f$.
    $endgroup$
    – Kavi Rama Murthy
    Dec 2 '18 at 23:15










  • $begingroup$
    This result needs the existence of local minima of -$f$. How does this follow from the compactness of $S$?
    $endgroup$
    – Max93
    Dec 2 '18 at 23:28






  • 1




    $begingroup$
    @Max93: All convex functions are continuous (in fact, locally Lipschitz continuous), so you can appeal to the Extreme Value Theorem which says that continuous functions attain their maxima / minima over compact sets.
    $endgroup$
    – VHarisop
    Dec 4 '18 at 19:17










  • $begingroup$
    @VHarisop : Thank you! For the Extreme Value Theorem one needs that the function is continuous on the compact set, but doesn't it only follow from the convexity that the function is continuous on the interior? Why isn't this a problem?
    $endgroup$
    – Max93
    Dec 4 '18 at 20:21










  • $begingroup$
    @Max93: My apologies, I read the statement hastily and thought $f$ was defined everywhere.
    $endgroup$
    – VHarisop
    Dec 4 '18 at 20:57














1












1








1


1



$begingroup$


Let $f: S to mathbb{R}$ be a (strictly) concave function, where



$S := {y in mathbb{R}^m: ygeq 0,, sum_{i=1}^m y_i=1 }$.



I want to show that there is a $y^*in S$, which maximizes $f$. $S$ is a convex set and I found some results from convex optimization that strictly convex functions on convex sets have unique minimizers if local minima exist. Here, the set $S$ is also compact; how can we use this to prove the existence of a maximizing $y^*in S$?



Thanks in advance!










share|cite|improve this question









$endgroup$




Let $f: S to mathbb{R}$ be a (strictly) concave function, where



$S := {y in mathbb{R}^m: ygeq 0,, sum_{i=1}^m y_i=1 }$.



I want to show that there is a $y^*in S$, which maximizes $f$. $S$ is a convex set and I found some results from convex optimization that strictly convex functions on convex sets have unique minimizers if local minima exist. Here, the set $S$ is also compact; how can we use this to prove the existence of a maximizing $y^*in S$?



Thanks in advance!







optimization convex-analysis convex-optimization






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked Dec 2 '18 at 22:55









Max93Max93

31029




31029












  • $begingroup$
    Apply the result yo have quoted to $-f$.
    $endgroup$
    – Kavi Rama Murthy
    Dec 2 '18 at 23:15










  • $begingroup$
    This result needs the existence of local minima of -$f$. How does this follow from the compactness of $S$?
    $endgroup$
    – Max93
    Dec 2 '18 at 23:28






  • 1




    $begingroup$
    @Max93: All convex functions are continuous (in fact, locally Lipschitz continuous), so you can appeal to the Extreme Value Theorem which says that continuous functions attain their maxima / minima over compact sets.
    $endgroup$
    – VHarisop
    Dec 4 '18 at 19:17










  • $begingroup$
    @VHarisop : Thank you! For the Extreme Value Theorem one needs that the function is continuous on the compact set, but doesn't it only follow from the convexity that the function is continuous on the interior? Why isn't this a problem?
    $endgroup$
    – Max93
    Dec 4 '18 at 20:21










  • $begingroup$
    @Max93: My apologies, I read the statement hastily and thought $f$ was defined everywhere.
    $endgroup$
    – VHarisop
    Dec 4 '18 at 20:57


















  • $begingroup$
    Apply the result yo have quoted to $-f$.
    $endgroup$
    – Kavi Rama Murthy
    Dec 2 '18 at 23:15










  • $begingroup$
    This result needs the existence of local minima of -$f$. How does this follow from the compactness of $S$?
    $endgroup$
    – Max93
    Dec 2 '18 at 23:28






  • 1




    $begingroup$
    @Max93: All convex functions are continuous (in fact, locally Lipschitz continuous), so you can appeal to the Extreme Value Theorem which says that continuous functions attain their maxima / minima over compact sets.
    $endgroup$
    – VHarisop
    Dec 4 '18 at 19:17










  • $begingroup$
    @VHarisop : Thank you! For the Extreme Value Theorem one needs that the function is continuous on the compact set, but doesn't it only follow from the convexity that the function is continuous on the interior? Why isn't this a problem?
    $endgroup$
    – Max93
    Dec 4 '18 at 20:21










  • $begingroup$
    @Max93: My apologies, I read the statement hastily and thought $f$ was defined everywhere.
    $endgroup$
    – VHarisop
    Dec 4 '18 at 20:57
















$begingroup$
Apply the result yo have quoted to $-f$.
$endgroup$
– Kavi Rama Murthy
Dec 2 '18 at 23:15




$begingroup$
Apply the result yo have quoted to $-f$.
$endgroup$
– Kavi Rama Murthy
Dec 2 '18 at 23:15












$begingroup$
This result needs the existence of local minima of -$f$. How does this follow from the compactness of $S$?
$endgroup$
– Max93
Dec 2 '18 at 23:28




$begingroup$
This result needs the existence of local minima of -$f$. How does this follow from the compactness of $S$?
$endgroup$
– Max93
Dec 2 '18 at 23:28




1




1




$begingroup$
@Max93: All convex functions are continuous (in fact, locally Lipschitz continuous), so you can appeal to the Extreme Value Theorem which says that continuous functions attain their maxima / minima over compact sets.
$endgroup$
– VHarisop
Dec 4 '18 at 19:17




$begingroup$
@Max93: All convex functions are continuous (in fact, locally Lipschitz continuous), so you can appeal to the Extreme Value Theorem which says that continuous functions attain their maxima / minima over compact sets.
$endgroup$
– VHarisop
Dec 4 '18 at 19:17












$begingroup$
@VHarisop : Thank you! For the Extreme Value Theorem one needs that the function is continuous on the compact set, but doesn't it only follow from the convexity that the function is continuous on the interior? Why isn't this a problem?
$endgroup$
– Max93
Dec 4 '18 at 20:21




$begingroup$
@VHarisop : Thank you! For the Extreme Value Theorem one needs that the function is continuous on the compact set, but doesn't it only follow from the convexity that the function is continuous on the interior? Why isn't this a problem?
$endgroup$
– Max93
Dec 4 '18 at 20:21












$begingroup$
@Max93: My apologies, I read the statement hastily and thought $f$ was defined everywhere.
$endgroup$
– VHarisop
Dec 4 '18 at 20:57




$begingroup$
@Max93: My apologies, I read the statement hastily and thought $f$ was defined everywhere.
$endgroup$
– VHarisop
Dec 4 '18 at 20:57










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


}
});














draft saved

draft discarded


















StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3023336%2fmaximizing-a-strictly-concave-function-over-a-compact-convex-set%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
















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%2f3023336%2fmaximizing-a-strictly-concave-function-over-a-compact-convex-set%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

Plaza Victoria

In PowerPoint, is there a keyboard shortcut for bulleted / numbered list?

How to put 3 figures in Latex with 2 figures side by side and 1 below these side by side images but in...