Why does NLopt have L-BFGS but not BFGS?












1












$begingroup$


NLopt, the "free/open-source library for nonlinear optimization, providing a common interface for a number of different free optimization routines..." has a L-BFGS routine but seemingly, no BFGS routine. The closest I can see in the list of algorithms might be the SLSQP routine which does use BFGS. I have two questions:




  1. Why is there no BFGS routine?

  2. Should I just use the L-BFGS routine instead?


Some context. I am using R which has a basic optim function that allows you to choose BFGS and L-BFGS as algorithms. However, one situation where it is not possible to use L-BFGS instead of BFGS is when the objective function evaluates to NaN at points of the search space. My problem only involves about ten parameters so memory is not an issue.










share|cite|improve this question









$endgroup$

















    1












    $begingroup$


    NLopt, the "free/open-source library for nonlinear optimization, providing a common interface for a number of different free optimization routines..." has a L-BFGS routine but seemingly, no BFGS routine. The closest I can see in the list of algorithms might be the SLSQP routine which does use BFGS. I have two questions:




    1. Why is there no BFGS routine?

    2. Should I just use the L-BFGS routine instead?


    Some context. I am using R which has a basic optim function that allows you to choose BFGS and L-BFGS as algorithms. However, one situation where it is not possible to use L-BFGS instead of BFGS is when the objective function evaluates to NaN at points of the search space. My problem only involves about ten parameters so memory is not an issue.










    share|cite|improve this question









    $endgroup$















      1












      1








      1





      $begingroup$


      NLopt, the "free/open-source library for nonlinear optimization, providing a common interface for a number of different free optimization routines..." has a L-BFGS routine but seemingly, no BFGS routine. The closest I can see in the list of algorithms might be the SLSQP routine which does use BFGS. I have two questions:




      1. Why is there no BFGS routine?

      2. Should I just use the L-BFGS routine instead?


      Some context. I am using R which has a basic optim function that allows you to choose BFGS and L-BFGS as algorithms. However, one situation where it is not possible to use L-BFGS instead of BFGS is when the objective function evaluates to NaN at points of the search space. My problem only involves about ten parameters so memory is not an issue.










      share|cite|improve this question









      $endgroup$




      NLopt, the "free/open-source library for nonlinear optimization, providing a common interface for a number of different free optimization routines..." has a L-BFGS routine but seemingly, no BFGS routine. The closest I can see in the list of algorithms might be the SLSQP routine which does use BFGS. I have two questions:




      1. Why is there no BFGS routine?

      2. Should I just use the L-BFGS routine instead?


      Some context. I am using R which has a basic optim function that allows you to choose BFGS and L-BFGS as algorithms. However, one situation where it is not possible to use L-BFGS instead of BFGS is when the objective function evaluates to NaN at points of the search space. My problem only involves about ten parameters so memory is not an issue.







      optimization






      share|cite|improve this question













      share|cite|improve this question











      share|cite|improve this question




      share|cite|improve this question










      asked Jan 22 at 23:59









      AlexAlex

      193111




      193111






















          1 Answer
          1






          active

          oldest

          votes


















          2












          $begingroup$

          Although the algorithms are similar, their implementation is quite different: BFGS often constructs and stores the approximated Hessian explicitly, while L-BFGS uses the two-loop recursion by Jorge Nocedal. You can mimic BFGS by setting nlopt_set_vector_storage to a large number (at least the number of iterations).






          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%2f3083896%2fwhy-does-nlopt-have-l-bfgs-but-not-bfgs%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









            2












            $begingroup$

            Although the algorithms are similar, their implementation is quite different: BFGS often constructs and stores the approximated Hessian explicitly, while L-BFGS uses the two-loop recursion by Jorge Nocedal. You can mimic BFGS by setting nlopt_set_vector_storage to a large number (at least the number of iterations).






            share|cite|improve this answer









            $endgroup$


















              2












              $begingroup$

              Although the algorithms are similar, their implementation is quite different: BFGS often constructs and stores the approximated Hessian explicitly, while L-BFGS uses the two-loop recursion by Jorge Nocedal. You can mimic BFGS by setting nlopt_set_vector_storage to a large number (at least the number of iterations).






              share|cite|improve this answer









              $endgroup$
















                2












                2








                2





                $begingroup$

                Although the algorithms are similar, their implementation is quite different: BFGS often constructs and stores the approximated Hessian explicitly, while L-BFGS uses the two-loop recursion by Jorge Nocedal. You can mimic BFGS by setting nlopt_set_vector_storage to a large number (at least the number of iterations).






                share|cite|improve this answer









                $endgroup$



                Although the algorithms are similar, their implementation is quite different: BFGS often constructs and stores the approximated Hessian explicitly, while L-BFGS uses the two-loop recursion by Jorge Nocedal. You can mimic BFGS by setting nlopt_set_vector_storage to a large number (at least the number of iterations).







                share|cite|improve this answer












                share|cite|improve this answer



                share|cite|improve this answer










                answered Jan 23 at 1:07









                LinAlgLinAlg

                9,9291521




                9,9291521






























                    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%2f3083896%2fwhy-does-nlopt-have-l-bfgs-but-not-bfgs%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

                    Mario Kart Wii

                    The Binding of Isaac: Rebirth/Afterbirth

                    What does “Dominus providebit” mean?