Convergence of sequence of minimizers

The name of the pictureThe name of the pictureThe name of the pictureClash Royale CLAN TAG#URR8PPP











up vote
1
down vote

favorite












Suppose $mathcalX$ is compact, and consider an optimization problem: $$max_x in X_n f(x)$$ where $f$ is a continuous function, and $X_nsubseteq mathcalX$ is a sequence of compact sets converging to some set $X subseteq mathcalX$ (for example, in the Hausdorff metric). Now let $x_n$ be a sequence of minimizers of $f$; i.e. $f(x_n) = min_x in X_n f(x)$. Note that $f(x)$ may have multiple minimums.



I am interested in conditions under which the arbitrary sequence of minimizers $x_n$ converges to a point in $X subset mathcalX$. Does anybody know?



Further Background:



I often see the statement: by compactness of $mathcalX$, we can assume without loss of generality that $x_n to x in mathcalX$. My problem with this statement is that it uses the fact that $x_n$ has a convergent subsequence, and says nothing about whether my original sequence converges.



This discussion is also related to the theorem of the maximum, which I believe can be used to establish that $X^*(n) = argmin f(x) : x in X_n$ is upper hemicontinuous. However, similar to the point above, it seems to me that upper hemicontinuity is not enough to guarantee that $x_n to x$, only that it has a convergent subsequence.







share|cite|improve this question



















  • I may need to think about this more, but off the top of my head, you may need to restrict $f$ to have only one minimizer on the set $X$. For example, take $X_n=[0,1]$ for all $n$ (and thus $X=[0,1]$), $f(x)=x^4-x^2$, and $x_n=(-1)^n/sqrt2$. Since this sequence of minimizers is alternating, it doesn’t converge. If $f$ has two minimizers on $X$, I think this kind of construction will always be possible.
    – David M.
    Jul 22 at 15:01











  • My understanding of the statement in bold is, in fact, that it refers to the existence of a subsequence with the property stated, i.e. one can assume that one started with that subsequence right in the beginning. If you want to prove existence in $X$, this is usually sufficient. Unless you really need convergence of the original sequence (e.g because $x_n$ is related to $x_n+1$ in some way you cannot give up, or if you want to combine existence with uniqueness) for some reason I'd read it that way.
    – Thomas
    Jul 22 at 16:54














up vote
1
down vote

favorite












Suppose $mathcalX$ is compact, and consider an optimization problem: $$max_x in X_n f(x)$$ where $f$ is a continuous function, and $X_nsubseteq mathcalX$ is a sequence of compact sets converging to some set $X subseteq mathcalX$ (for example, in the Hausdorff metric). Now let $x_n$ be a sequence of minimizers of $f$; i.e. $f(x_n) = min_x in X_n f(x)$. Note that $f(x)$ may have multiple minimums.



I am interested in conditions under which the arbitrary sequence of minimizers $x_n$ converges to a point in $X subset mathcalX$. Does anybody know?



Further Background:



I often see the statement: by compactness of $mathcalX$, we can assume without loss of generality that $x_n to x in mathcalX$. My problem with this statement is that it uses the fact that $x_n$ has a convergent subsequence, and says nothing about whether my original sequence converges.



This discussion is also related to the theorem of the maximum, which I believe can be used to establish that $X^*(n) = argmin f(x) : x in X_n$ is upper hemicontinuous. However, similar to the point above, it seems to me that upper hemicontinuity is not enough to guarantee that $x_n to x$, only that it has a convergent subsequence.







share|cite|improve this question



















  • I may need to think about this more, but off the top of my head, you may need to restrict $f$ to have only one minimizer on the set $X$. For example, take $X_n=[0,1]$ for all $n$ (and thus $X=[0,1]$), $f(x)=x^4-x^2$, and $x_n=(-1)^n/sqrt2$. Since this sequence of minimizers is alternating, it doesn’t converge. If $f$ has two minimizers on $X$, I think this kind of construction will always be possible.
    – David M.
    Jul 22 at 15:01











  • My understanding of the statement in bold is, in fact, that it refers to the existence of a subsequence with the property stated, i.e. one can assume that one started with that subsequence right in the beginning. If you want to prove existence in $X$, this is usually sufficient. Unless you really need convergence of the original sequence (e.g because $x_n$ is related to $x_n+1$ in some way you cannot give up, or if you want to combine existence with uniqueness) for some reason I'd read it that way.
    – Thomas
    Jul 22 at 16:54












up vote
1
down vote

favorite









up vote
1
down vote

favorite











Suppose $mathcalX$ is compact, and consider an optimization problem: $$max_x in X_n f(x)$$ where $f$ is a continuous function, and $X_nsubseteq mathcalX$ is a sequence of compact sets converging to some set $X subseteq mathcalX$ (for example, in the Hausdorff metric). Now let $x_n$ be a sequence of minimizers of $f$; i.e. $f(x_n) = min_x in X_n f(x)$. Note that $f(x)$ may have multiple minimums.



I am interested in conditions under which the arbitrary sequence of minimizers $x_n$ converges to a point in $X subset mathcalX$. Does anybody know?



Further Background:



I often see the statement: by compactness of $mathcalX$, we can assume without loss of generality that $x_n to x in mathcalX$. My problem with this statement is that it uses the fact that $x_n$ has a convergent subsequence, and says nothing about whether my original sequence converges.



This discussion is also related to the theorem of the maximum, which I believe can be used to establish that $X^*(n) = argmin f(x) : x in X_n$ is upper hemicontinuous. However, similar to the point above, it seems to me that upper hemicontinuity is not enough to guarantee that $x_n to x$, only that it has a convergent subsequence.







share|cite|improve this question











Suppose $mathcalX$ is compact, and consider an optimization problem: $$max_x in X_n f(x)$$ where $f$ is a continuous function, and $X_nsubseteq mathcalX$ is a sequence of compact sets converging to some set $X subseteq mathcalX$ (for example, in the Hausdorff metric). Now let $x_n$ be a sequence of minimizers of $f$; i.e. $f(x_n) = min_x in X_n f(x)$. Note that $f(x)$ may have multiple minimums.



I am interested in conditions under which the arbitrary sequence of minimizers $x_n$ converges to a point in $X subset mathcalX$. Does anybody know?



Further Background:



I often see the statement: by compactness of $mathcalX$, we can assume without loss of generality that $x_n to x in mathcalX$. My problem with this statement is that it uses the fact that $x_n$ has a convergent subsequence, and says nothing about whether my original sequence converges.



This discussion is also related to the theorem of the maximum, which I believe can be used to establish that $X^*(n) = argmin f(x) : x in X_n$ is upper hemicontinuous. However, similar to the point above, it seems to me that upper hemicontinuity is not enough to guarantee that $x_n to x$, only that it has a convergent subsequence.









share|cite|improve this question










share|cite|improve this question




share|cite|improve this question









asked Jul 22 at 14:52









möbius

834718




834718











  • I may need to think about this more, but off the top of my head, you may need to restrict $f$ to have only one minimizer on the set $X$. For example, take $X_n=[0,1]$ for all $n$ (and thus $X=[0,1]$), $f(x)=x^4-x^2$, and $x_n=(-1)^n/sqrt2$. Since this sequence of minimizers is alternating, it doesn’t converge. If $f$ has two minimizers on $X$, I think this kind of construction will always be possible.
    – David M.
    Jul 22 at 15:01











  • My understanding of the statement in bold is, in fact, that it refers to the existence of a subsequence with the property stated, i.e. one can assume that one started with that subsequence right in the beginning. If you want to prove existence in $X$, this is usually sufficient. Unless you really need convergence of the original sequence (e.g because $x_n$ is related to $x_n+1$ in some way you cannot give up, or if you want to combine existence with uniqueness) for some reason I'd read it that way.
    – Thomas
    Jul 22 at 16:54
















  • I may need to think about this more, but off the top of my head, you may need to restrict $f$ to have only one minimizer on the set $X$. For example, take $X_n=[0,1]$ for all $n$ (and thus $X=[0,1]$), $f(x)=x^4-x^2$, and $x_n=(-1)^n/sqrt2$. Since this sequence of minimizers is alternating, it doesn’t converge. If $f$ has two minimizers on $X$, I think this kind of construction will always be possible.
    – David M.
    Jul 22 at 15:01











  • My understanding of the statement in bold is, in fact, that it refers to the existence of a subsequence with the property stated, i.e. one can assume that one started with that subsequence right in the beginning. If you want to prove existence in $X$, this is usually sufficient. Unless you really need convergence of the original sequence (e.g because $x_n$ is related to $x_n+1$ in some way you cannot give up, or if you want to combine existence with uniqueness) for some reason I'd read it that way.
    – Thomas
    Jul 22 at 16:54















I may need to think about this more, but off the top of my head, you may need to restrict $f$ to have only one minimizer on the set $X$. For example, take $X_n=[0,1]$ for all $n$ (and thus $X=[0,1]$), $f(x)=x^4-x^2$, and $x_n=(-1)^n/sqrt2$. Since this sequence of minimizers is alternating, it doesn’t converge. If $f$ has two minimizers on $X$, I think this kind of construction will always be possible.
– David M.
Jul 22 at 15:01





I may need to think about this more, but off the top of my head, you may need to restrict $f$ to have only one minimizer on the set $X$. For example, take $X_n=[0,1]$ for all $n$ (and thus $X=[0,1]$), $f(x)=x^4-x^2$, and $x_n=(-1)^n/sqrt2$. Since this sequence of minimizers is alternating, it doesn’t converge. If $f$ has two minimizers on $X$, I think this kind of construction will always be possible.
– David M.
Jul 22 at 15:01













My understanding of the statement in bold is, in fact, that it refers to the existence of a subsequence with the property stated, i.e. one can assume that one started with that subsequence right in the beginning. If you want to prove existence in $X$, this is usually sufficient. Unless you really need convergence of the original sequence (e.g because $x_n$ is related to $x_n+1$ in some way you cannot give up, or if you want to combine existence with uniqueness) for some reason I'd read it that way.
– Thomas
Jul 22 at 16:54




My understanding of the statement in bold is, in fact, that it refers to the existence of a subsequence with the property stated, i.e. one can assume that one started with that subsequence right in the beginning. If you want to prove existence in $X$, this is usually sufficient. Unless you really need convergence of the original sequence (e.g because $x_n$ is related to $x_n+1$ in some way you cannot give up, or if you want to combine existence with uniqueness) for some reason I'd read it that way.
– Thomas
Jul 22 at 16:54















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',
convertImagesToLinks: true,
noModals: false,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
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%2f2859473%2fconvergence-of-sequence-of-minimizers%23new-answer', 'question_page');

);

Post as a guest



































active

oldest

votes













active

oldest

votes









active

oldest

votes






active

oldest

votes










 

draft saved


draft discarded


























 


draft saved


draft discarded














StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2859473%2fconvergence-of-sequence-of-minimizers%23new-answer', 'question_page');

);

Post as a guest













































































Comments

Popular posts from this blog

What is the equation of a 3D cone with generalised tilt?

Color the edges and diagonals of a regular polygon

Relationship between determinant of matrix and determinant of adjoint?