Understanding minimization of jointly convex functions

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











up vote
0
down vote

favorite












I am trying to understand partial minimization of jointly convex function in one variable.



The theorem which I am facing difficulties to understand is expressed as follows.



Let $f: R^n times R^m to (-inf,+infty] $ be a jointly convex function. Then the function $g(x) =$ inf$_yin R^mf(x,y)$ , $x in R^m$ is convex



Could you please help me to understand the theorem through,



  1. What is the intuition of jointly convex function? Appreciate if you can explain it using $f(x,y) = x^2 + y^2$

  2. What is the intuition of inf$_yin R^mf(x,y)$. My understanding is the maximum value of the lower bound of the function $f$ when we vary $y$ with fixed $x$ value. Is it correct?

Appreciate your insight.







share|cite|improve this question























    up vote
    0
    down vote

    favorite












    I am trying to understand partial minimization of jointly convex function in one variable.



    The theorem which I am facing difficulties to understand is expressed as follows.



    Let $f: R^n times R^m to (-inf,+infty] $ be a jointly convex function. Then the function $g(x) =$ inf$_yin R^mf(x,y)$ , $x in R^m$ is convex



    Could you please help me to understand the theorem through,



    1. What is the intuition of jointly convex function? Appreciate if you can explain it using $f(x,y) = x^2 + y^2$

    2. What is the intuition of inf$_yin R^mf(x,y)$. My understanding is the maximum value of the lower bound of the function $f$ when we vary $y$ with fixed $x$ value. Is it correct?

    Appreciate your insight.







    share|cite|improve this question





















      up vote
      0
      down vote

      favorite









      up vote
      0
      down vote

      favorite











      I am trying to understand partial minimization of jointly convex function in one variable.



      The theorem which I am facing difficulties to understand is expressed as follows.



      Let $f: R^n times R^m to (-inf,+infty] $ be a jointly convex function. Then the function $g(x) =$ inf$_yin R^mf(x,y)$ , $x in R^m$ is convex



      Could you please help me to understand the theorem through,



      1. What is the intuition of jointly convex function? Appreciate if you can explain it using $f(x,y) = x^2 + y^2$

      2. What is the intuition of inf$_yin R^mf(x,y)$. My understanding is the maximum value of the lower bound of the function $f$ when we vary $y$ with fixed $x$ value. Is it correct?

      Appreciate your insight.







      share|cite|improve this question











      I am trying to understand partial minimization of jointly convex function in one variable.



      The theorem which I am facing difficulties to understand is expressed as follows.



      Let $f: R^n times R^m to (-inf,+infty] $ be a jointly convex function. Then the function $g(x) =$ inf$_yin R^mf(x,y)$ , $x in R^m$ is convex



      Could you please help me to understand the theorem through,



      1. What is the intuition of jointly convex function? Appreciate if you can explain it using $f(x,y) = x^2 + y^2$

      2. What is the intuition of inf$_yin R^mf(x,y)$. My understanding is the maximum value of the lower bound of the function $f$ when we vary $y$ with fixed $x$ value. Is it correct?

      Appreciate your insight.









      share|cite|improve this question










      share|cite|improve this question




      share|cite|improve this question









      asked Jul 27 at 19:29









      Malintha

      1276




      1276




















          1 Answer
          1






          active

          oldest

          votes

















          up vote
          0
          down vote













          1. That function is jointly convex because its Hessian is positive definite.

            In contrast, the function $g(x,y)=xcdot y$ is only separately convex, i.e., $xmapsto xcdot y$ and $ymapsto xcdot y$ are convex (even linear), no matter what the fixed parameter is. On the other hand, $g$ is not jointly convex: compute the Hessian matrix and discover it is not positive semidefinite.


          2. Yes.






          share|cite|improve this answer





















            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%2f2864722%2funderstanding-minimization-of-jointly-convex-functions%23new-answer', 'question_page');

            );

            Post as a guest






























            1 Answer
            1






            active

            oldest

            votes








            1 Answer
            1






            active

            oldest

            votes









            active

            oldest

            votes






            active

            oldest

            votes








            up vote
            0
            down vote













            1. That function is jointly convex because its Hessian is positive definite.

              In contrast, the function $g(x,y)=xcdot y$ is only separately convex, i.e., $xmapsto xcdot y$ and $ymapsto xcdot y$ are convex (even linear), no matter what the fixed parameter is. On the other hand, $g$ is not jointly convex: compute the Hessian matrix and discover it is not positive semidefinite.


            2. Yes.






            share|cite|improve this answer

























              up vote
              0
              down vote













              1. That function is jointly convex because its Hessian is positive definite.

                In contrast, the function $g(x,y)=xcdot y$ is only separately convex, i.e., $xmapsto xcdot y$ and $ymapsto xcdot y$ are convex (even linear), no matter what the fixed parameter is. On the other hand, $g$ is not jointly convex: compute the Hessian matrix and discover it is not positive semidefinite.


              2. Yes.






              share|cite|improve this answer























                up vote
                0
                down vote










                up vote
                0
                down vote









                1. That function is jointly convex because its Hessian is positive definite.

                  In contrast, the function $g(x,y)=xcdot y$ is only separately convex, i.e., $xmapsto xcdot y$ and $ymapsto xcdot y$ are convex (even linear), no matter what the fixed parameter is. On the other hand, $g$ is not jointly convex: compute the Hessian matrix and discover it is not positive semidefinite.


                2. Yes.






                share|cite|improve this answer













                1. That function is jointly convex because its Hessian is positive definite.

                  In contrast, the function $g(x,y)=xcdot y$ is only separately convex, i.e., $xmapsto xcdot y$ and $ymapsto xcdot y$ are convex (even linear), no matter what the fixed parameter is. On the other hand, $g$ is not jointly convex: compute the Hessian matrix and discover it is not positive semidefinite.


                2. Yes.







                share|cite|improve this answer













                share|cite|improve this answer



                share|cite|improve this answer











                answered Jul 28 at 5:15









                max_zorn

                3,15051028




                3,15051028






















                     

                    draft saved


                    draft discarded


























                     


                    draft saved


                    draft discarded














                    StackExchange.ready(
                    function ()
                    StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2864722%2funderstanding-minimization-of-jointly-convex-functions%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?