minimize frobenius norm subject to rank condition












1












$begingroup$


I'm trying to solve the following problem:
Let A be (a, b) matrix. Given l < min ( a, b) , solve:



begin{align}
min_{rank(X)= l} || A - X ||_{Fro}^2
end{align}

I'm novice in optimization and don't know how to take the rank constraint into account.
Thanks!










share|cite|improve this question











$endgroup$

















    1












    $begingroup$


    I'm trying to solve the following problem:
    Let A be (a, b) matrix. Given l < min ( a, b) , solve:



    begin{align}
    min_{rank(X)= l} || A - X ||_{Fro}^2
    end{align}

    I'm novice in optimization and don't know how to take the rank constraint into account.
    Thanks!










    share|cite|improve this question











    $endgroup$















      1












      1








      1





      $begingroup$


      I'm trying to solve the following problem:
      Let A be (a, b) matrix. Given l < min ( a, b) , solve:



      begin{align}
      min_{rank(X)= l} || A - X ||_{Fro}^2
      end{align}

      I'm novice in optimization and don't know how to take the rank constraint into account.
      Thanks!










      share|cite|improve this question











      $endgroup$




      I'm trying to solve the following problem:
      Let A be (a, b) matrix. Given l < min ( a, b) , solve:



      begin{align}
      min_{rank(X)= l} || A - X ||_{Fro}^2
      end{align}

      I'm novice in optimization and don't know how to take the rank constraint into account.
      Thanks!







      optimization convex-optimization






      share|cite|improve this question















      share|cite|improve this question













      share|cite|improve this question




      share|cite|improve this question








      edited Dec 6 '18 at 9:43







      Lu Yin

















      asked Dec 6 '18 at 9:28









      Lu YinLu Yin

      183




      183






















          1 Answer
          1






          active

          oldest

          votes


















          1












          $begingroup$

          As a generic optimization problem, it is a very hard problem since rank constraints typically are intractable.



          However, this particular problem has an analytic solution in terms of the SVD
          https://en.wikipedia.org/wiki/Low-rank_approximation






          share|cite|improve this answer









          $endgroup$













            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%2f3028262%2fminimize-frobenius-norm-subject-to-rank-condition%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$

            As a generic optimization problem, it is a very hard problem since rank constraints typically are intractable.



            However, this particular problem has an analytic solution in terms of the SVD
            https://en.wikipedia.org/wiki/Low-rank_approximation






            share|cite|improve this answer









            $endgroup$


















              1












              $begingroup$

              As a generic optimization problem, it is a very hard problem since rank constraints typically are intractable.



              However, this particular problem has an analytic solution in terms of the SVD
              https://en.wikipedia.org/wiki/Low-rank_approximation






              share|cite|improve this answer









              $endgroup$
















                1












                1








                1





                $begingroup$

                As a generic optimization problem, it is a very hard problem since rank constraints typically are intractable.



                However, this particular problem has an analytic solution in terms of the SVD
                https://en.wikipedia.org/wiki/Low-rank_approximation






                share|cite|improve this answer









                $endgroup$



                As a generic optimization problem, it is a very hard problem since rank constraints typically are intractable.



                However, this particular problem has an analytic solution in terms of the SVD
                https://en.wikipedia.org/wiki/Low-rank_approximation







                share|cite|improve this answer












                share|cite|improve this answer



                share|cite|improve this answer










                answered Dec 6 '18 at 13:19









                Johan LöfbergJohan Löfberg

                5,2551811




                5,2551811






























                    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%2f3028262%2fminimize-frobenius-norm-subject-to-rank-condition%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...