How to show that $min_{x in mathbb{R}^4} x^Tx$ subject to $x^TAx geq 1$ has a global minimizer?












1












$begingroup$


Consider the following problem:



$$min_{x in mathbb{R}^4} x^Tx$$



over $C={x in mathbb{R}^4 mid x^TAx geq 1}$ where $A in mathbb{R}^{4 times 4}$ is a symmetric matrix with two distinct positive eigenvalues and other eigenvalues of $A$ are nonpositive.



How to show that this problem has a global minimizer?



I need to show that there exist $x_*$ in $C$ for which I have
$$
x_*^Tx_* leq x^Tx ,,, forall x in mathbb{R}^4
$$



or to come up with something like the following
$$
|x|^2= |x_*|^2 + alpha ,,, forall x in mathbb{R}^4 ,,,, 0<alpha in mathbb{R}
$$



My try:



$A$ is symmetric, so it can be written as $A=u Lambda u^T$. Hence,



$$
x^TAx=x^Tu Lambda u^Tx geq 1
$$



So



$$
z^T Lambda z geq 1
$$
where $u^Tx=z in mathbb{R}^4$. So the optimization problem would be



$$min_{x in mathbb{R}^4} z^Tz$$
over $z^T Lambda z geq 1$.
How can we proceed?






linear-algebra optimization symmetric-matrices







share|cite|improve this question









$endgroup$

















    1












    $begingroup$


    Consider the following problem:



    $$min_{x in mathbb{R}^4} x^Tx$$



    over $C={x in mathbb{R}^4 mid x^TAx geq 1}$ where $A in mathbb{R}^{4 times 4}$ is a symmetric matrix with two distinct positive eigenvalues and other eigenvalues of $A$ are nonpositive.



    How to show that this problem has a global minimizer?



    I need to show that there exist $x_*$ in $C$ for which I have
    $$
    x_*^Tx_* leq x^Tx ,,, forall x in mathbb{R}^4
    $$



    or to come up with something like the following
    $$
    |x|^2= |x_*|^2 + alpha ,,, forall x in mathbb{R}^4 ,,,, 0<alpha in mathbb{R}
    $$



    My try:



    $A$ is symmetric, so it can be written as $A=u Lambda u^T$. Hence,



    $$
    x^TAx=x^Tu Lambda u^Tx geq 1
    $$



    So



    $$
    z^T Lambda z geq 1
    $$
    where $u^Tx=z in mathbb{R}^4$. So the optimization problem would be



    $$min_{x in mathbb{R}^4} z^Tz$$
    over $z^T Lambda z geq 1$.
    How can we proceed?






    linear-algebra optimization symmetric-matrices







    share|cite|improve this question









    $endgroup$















      1












      1








      1





      $begingroup$


      Consider the following problem:



      $$min_{x in mathbb{R}^4} x^Tx$$



      over $C={x in mathbb{R}^4 mid x^TAx geq 1}$ where $A in mathbb{R}^{4 times 4}$ is a symmetric matrix with two distinct positive eigenvalues and other eigenvalues of $A$ are nonpositive.



      How to show that this problem has a global minimizer?



      I need to show that there exist $x_*$ in $C$ for which I have
      $$
      x_*^Tx_* leq x^Tx ,,, forall x in mathbb{R}^4
      $$



      or to come up with something like the following
      $$
      |x|^2= |x_*|^2 + alpha ,,, forall x in mathbb{R}^4 ,,,, 0<alpha in mathbb{R}
      $$



      My try:



      $A$ is symmetric, so it can be written as $A=u Lambda u^T$. Hence,



      $$
      x^TAx=x^Tu Lambda u^Tx geq 1
      $$



      So



      $$
      z^T Lambda z geq 1
      $$
      where $u^Tx=z in mathbb{R}^4$. So the optimization problem would be



      $$min_{x in mathbb{R}^4} z^Tz$$
      over $z^T Lambda z geq 1$.
      How can we proceed?






      linear-algebra optimization symmetric-matrices







      share|cite|improve this question









      $endgroup$




      Consider the following problem:



      $$min_{x in mathbb{R}^4} x^Tx$$



      over $C={x in mathbb{R}^4 mid x^TAx geq 1}$ where $A in mathbb{R}^{4 times 4}$ is a symmetric matrix with two distinct positive eigenvalues and other eigenvalues of $A$ are nonpositive.



      How to show that this problem has a global minimizer?



      I need to show that there exist $x_*$ in $C$ for which I have
      $$
      x_*^Tx_* leq x^Tx ,,, forall x in mathbb{R}^4
      $$



      or to come up with something like the following
      $$
      |x|^2= |x_*|^2 + alpha ,,, forall x in mathbb{R}^4 ,,,, 0<alpha in mathbb{R}
      $$



      My try:



      $A$ is symmetric, so it can be written as $A=u Lambda u^T$. Hence,



      $$
      x^TAx=x^Tu Lambda u^Tx geq 1
      $$



      So



      $$
      z^T Lambda z geq 1
      $$
      where $u^Tx=z in mathbb{R}^4$. So the optimization problem would be



      $$min_{x in mathbb{R}^4} z^Tz$$
      over $z^T Lambda z geq 1$.
      How can we proceed?






      linear-algebra optimization symmetric-matrices




      linear-algebra optimization symmetric-matrices






      share|cite|improve this question













      share|cite|improve this question











      share|cite|improve this question




      share|cite|improve this question










      asked Dec 17 '18 at 1:40









      SepideSepide

      3038




      3038






















          1 Answer
          1






          active

          oldest

          votes


















          1












          $begingroup$

          Choose some $R>0$ such that $B_R:={z^Tzle R^2}$ has nonempty intersection with $F:={z^TAzge1}$. Now $B_Rcap F$ is compact and has a global minimiser, which must also be a global minimiser for the original problem (why?).



          Hint: minimisation over $F$ is minimisation over $(Fcap B_R)cup (Fcaptext{cl}( B_R^c))$. But minimising $|x|^2$ over $(Fcap B_R)$ must yield an optimal value that is smaller than or equal to minimising over $(Fcaptext{cl}( B_R^c))$.






          share|cite|improve this answer











          $endgroup$













          • $begingroup$
            I do not know, can you explain it to me?
            $endgroup$
            – Sepide
            Dec 17 '18 at 2:08










          • $begingroup$
            @Sepide because any objective value outside B_R is surely >= inside B_R.
            $endgroup$
            – Vim
            Dec 17 '18 at 2:10










          • $begingroup$
            Is the ball contained in the feasible set? If so, for the points that are not in the ball but are in the feasible set, how we know that we cannot find a point that has a value less that what we get from the point that is inside the ball?
            $endgroup$
            – Sepide
            Dec 17 '18 at 2:22










          • $begingroup$
            @Sepide the ball doesn't have to be contained in the feasible region because we only care about the intersection of the ball and the feasibility. Please see my edit.
            $endgroup$
            – Vim
            Dec 17 '18 at 3:17











          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%2f3043447%2fhow-to-show-that-min-x-in-mathbbr4-xtx-subject-to-xtax-geq-1-has%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









          1












          $begingroup$

          Choose some $R>0$ such that $B_R:={z^Tzle R^2}$ has nonempty intersection with $F:={z^TAzge1}$. Now $B_Rcap F$ is compact and has a global minimiser, which must also be a global minimiser for the original problem (why?).



          Hint: minimisation over $F$ is minimisation over $(Fcap B_R)cup (Fcaptext{cl}( B_R^c))$. But minimising $|x|^2$ over $(Fcap B_R)$ must yield an optimal value that is smaller than or equal to minimising over $(Fcaptext{cl}( B_R^c))$.






          share|cite|improve this answer











          $endgroup$













          • $begingroup$
            I do not know, can you explain it to me?
            $endgroup$
            – Sepide
            Dec 17 '18 at 2:08










          • $begingroup$
            @Sepide because any objective value outside B_R is surely >= inside B_R.
            $endgroup$
            – Vim
            Dec 17 '18 at 2:10










          • $begingroup$
            Is the ball contained in the feasible set? If so, for the points that are not in the ball but are in the feasible set, how we know that we cannot find a point that has a value less that what we get from the point that is inside the ball?
            $endgroup$
            – Sepide
            Dec 17 '18 at 2:22










          • $begingroup$
            @Sepide the ball doesn't have to be contained in the feasible region because we only care about the intersection of the ball and the feasibility. Please see my edit.
            $endgroup$
            – Vim
            Dec 17 '18 at 3:17
















          1












          $begingroup$

          Choose some $R>0$ such that $B_R:={z^Tzle R^2}$ has nonempty intersection with $F:={z^TAzge1}$. Now $B_Rcap F$ is compact and has a global minimiser, which must also be a global minimiser for the original problem (why?).



          Hint: minimisation over $F$ is minimisation over $(Fcap B_R)cup (Fcaptext{cl}( B_R^c))$. But minimising $|x|^2$ over $(Fcap B_R)$ must yield an optimal value that is smaller than or equal to minimising over $(Fcaptext{cl}( B_R^c))$.






          share|cite|improve this answer











          $endgroup$













          • $begingroup$
            I do not know, can you explain it to me?
            $endgroup$
            – Sepide
            Dec 17 '18 at 2:08










          • $begingroup$
            @Sepide because any objective value outside B_R is surely >= inside B_R.
            $endgroup$
            – Vim
            Dec 17 '18 at 2:10










          • $begingroup$
            Is the ball contained in the feasible set? If so, for the points that are not in the ball but are in the feasible set, how we know that we cannot find a point that has a value less that what we get from the point that is inside the ball?
            $endgroup$
            – Sepide
            Dec 17 '18 at 2:22










          • $begingroup$
            @Sepide the ball doesn't have to be contained in the feasible region because we only care about the intersection of the ball and the feasibility. Please see my edit.
            $endgroup$
            – Vim
            Dec 17 '18 at 3:17














          1












          1








          1





          $begingroup$

          Choose some $R>0$ such that $B_R:={z^Tzle R^2}$ has nonempty intersection with $F:={z^TAzge1}$. Now $B_Rcap F$ is compact and has a global minimiser, which must also be a global minimiser for the original problem (why?).



          Hint: minimisation over $F$ is minimisation over $(Fcap B_R)cup (Fcaptext{cl}( B_R^c))$. But minimising $|x|^2$ over $(Fcap B_R)$ must yield an optimal value that is smaller than or equal to minimising over $(Fcaptext{cl}( B_R^c))$.






          share|cite|improve this answer











          $endgroup$



          Choose some $R>0$ such that $B_R:={z^Tzle R^2}$ has nonempty intersection with $F:={z^TAzge1}$. Now $B_Rcap F$ is compact and has a global minimiser, which must also be a global minimiser for the original problem (why?).



          Hint: minimisation over $F$ is minimisation over $(Fcap B_R)cup (Fcaptext{cl}( B_R^c))$. But minimising $|x|^2$ over $(Fcap B_R)$ must yield an optimal value that is smaller than or equal to minimising over $(Fcaptext{cl}( B_R^c))$.







          share|cite|improve this answer














          share|cite|improve this answer



          share|cite|improve this answer








          edited Dec 17 '18 at 3:21

























          answered Dec 17 '18 at 1:47









          VimVim

          8,12031348




          8,12031348












          • $begingroup$
            I do not know, can you explain it to me?
            $endgroup$
            – Sepide
            Dec 17 '18 at 2:08










          • $begingroup$
            @Sepide because any objective value outside B_R is surely >= inside B_R.
            $endgroup$
            – Vim
            Dec 17 '18 at 2:10










          • $begingroup$
            Is the ball contained in the feasible set? If so, for the points that are not in the ball but are in the feasible set, how we know that we cannot find a point that has a value less that what we get from the point that is inside the ball?
            $endgroup$
            – Sepide
            Dec 17 '18 at 2:22










          • $begingroup$
            @Sepide the ball doesn't have to be contained in the feasible region because we only care about the intersection of the ball and the feasibility. Please see my edit.
            $endgroup$
            – Vim
            Dec 17 '18 at 3:17


















          • $begingroup$
            I do not know, can you explain it to me?
            $endgroup$
            – Sepide
            Dec 17 '18 at 2:08










          • $begingroup$
            @Sepide because any objective value outside B_R is surely >= inside B_R.
            $endgroup$
            – Vim
            Dec 17 '18 at 2:10










          • $begingroup$
            Is the ball contained in the feasible set? If so, for the points that are not in the ball but are in the feasible set, how we know that we cannot find a point that has a value less that what we get from the point that is inside the ball?
            $endgroup$
            – Sepide
            Dec 17 '18 at 2:22










          • $begingroup$
            @Sepide the ball doesn't have to be contained in the feasible region because we only care about the intersection of the ball and the feasibility. Please see my edit.
            $endgroup$
            – Vim
            Dec 17 '18 at 3:17
















          $begingroup$
          I do not know, can you explain it to me?
          $endgroup$
          – Sepide
          Dec 17 '18 at 2:08




          $begingroup$
          I do not know, can you explain it to me?
          $endgroup$
          – Sepide
          Dec 17 '18 at 2:08












          $begingroup$
          @Sepide because any objective value outside B_R is surely >= inside B_R.
          $endgroup$
          – Vim
          Dec 17 '18 at 2:10




          $begingroup$
          @Sepide because any objective value outside B_R is surely >= inside B_R.
          $endgroup$
          – Vim
          Dec 17 '18 at 2:10












          $begingroup$
          Is the ball contained in the feasible set? If so, for the points that are not in the ball but are in the feasible set, how we know that we cannot find a point that has a value less that what we get from the point that is inside the ball?
          $endgroup$
          – Sepide
          Dec 17 '18 at 2:22




          $begingroup$
          Is the ball contained in the feasible set? If so, for the points that are not in the ball but are in the feasible set, how we know that we cannot find a point that has a value less that what we get from the point that is inside the ball?
          $endgroup$
          – Sepide
          Dec 17 '18 at 2:22












          $begingroup$
          @Sepide the ball doesn't have to be contained in the feasible region because we only care about the intersection of the ball and the feasibility. Please see my edit.
          $endgroup$
          – Vim
          Dec 17 '18 at 3:17




          $begingroup$
          @Sepide the ball doesn't have to be contained in the feasible region because we only care about the intersection of the ball and the feasibility. Please see my edit.
          $endgroup$
          – Vim
          Dec 17 '18 at 3:17


















          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%2f3043447%2fhow-to-show-that-min-x-in-mathbbr4-xtx-subject-to-xtax-geq-1-has%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

          Quarter-circle Tiles

          Image
          up vote 0 down vote favorite I have $99$ identical square tiles, each with a quarter-circle drawn on it like this: [asy] size(1.5cm); draw(Arc((2,0),1,90,180),red+1); draw((0,0)--(2,0)--(2,2)--(0,2)--(0,0)); [/asy] When I arrange the tiles in a $9times 11$ rectangular grid, each with a random orientation, what is the expected value of the number of full circles I form? I think this problem has to do with finding the chance any given 2x2 square has a circle, but I can't find it. expected-value share | cite | improve this question asked Nov 20 at 15:03 6minecraftninja 1 2
          Read more

          build a pushdown automaton that recognizes the reverse language of a given pushdown automaton?

          Image
          0 I think it's similiar to NFAs. I replace the finite states of the given automaton for start-states for my new automaton. I do it with $epsilon$ -transition from the start state to the actual finite states of the given automaton. The start state of the given automaton will be my accepting(finite) state of my new one. All transitions will be reversed of course to recognize the reversed word. But how do I have to change the stack of the pushdown automaton? That's tricky. formal-languages automata context-free-grammar share | cite | improve this question edited Nov 29 '18 at 14:20 joee
          Read more

          Mont Emei

          Image
          Mont Emei.mw-parser-output .entete.map{background-image:url("//upload.wikimedia.org/wikipedia/commons/7/7a/Picto_infobox_map.png")} Vue du sommet Wanfo du mont Emei Géographie Altitude 3 099  m , Wanfo Coordonnées 29° 31′ 11″ nord, 103° 19′ 57″ est Administration Pays   Chine Province Sichuan Ville-préfecture Leshan Géolocalisation sur la carte : Sichuan Mont Emei Géolocalisation sur la carte : Chine Mont Emei modifier   Paysage panoramique du mont Emei, incluant le paysage panoramique du grand Bouddha de Leshan *   Patrimoine mondial de l'UNESCO Passerelle en bois sur le versant ouest Pays   Chine Subdivision Sichuan Type Mixte Critères (iv) (vi) (x) Superficie 15 400 ha Numéro d’identification 779 Zone géographique Asie et Pacifique  ** Année d’inscription 1996 (20 e session) * Descriptif officiel UNESCO ** Classification géog
          Read more