<?xml version="1.0" encoding="UTF-8"?>
<rss xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" version="2.0">
  <channel>
    <title>topic Re: Looking for fastest optimization subroutines in SAS/IML Software and Matrix Computations</title>
    <link>https://communities.sas.com/t5/SAS-IML-Software-and-Matrix/Looking-for-fastest-optimization-subroutines/m-p/92606#M602</link>
    <description>&lt;HTML&gt;&lt;HEAD&gt;&lt;/HEAD&gt;&lt;BODY&gt;&lt;P&gt;Gosh, speed depends on so many things, you should really time it for the problem you have with, say, 10% of the data.&lt;/P&gt;&lt;P&gt;&lt;/P&gt;&lt;P&gt;Given that you have Jacobian and Hessian information, I'd probably use one of the Newton techniques. The Newton-Raphons (NLPNRA) algorithm has quadratic convergence near the solution, so I use it when I can get a good starting guess.&amp;nbsp;&amp;nbsp; I'd&amp;nbsp; use&amp;nbsp; the quasi-Newton algorithm (NLPQN) when the Hessian matrix is much more expensive to compute than the function and derivatives.&lt;/P&gt;&lt;/BODY&gt;&lt;/HTML&gt;</description>
    <pubDate>Sun, 02 Jun 2013 10:12:58 GMT</pubDate>
    <dc:creator>Rick_SAS</dc:creator>
    <dc:date>2013-06-02T10:12:58Z</dc:date>
    <item>
      <title>Looking for fastest optimization subroutines</title>
      <link>https://communities.sas.com/t5/SAS-IML-Software-and-Matrix/Looking-for-fastest-optimization-subroutines/m-p/92605#M601</link>
      <description>&lt;HTML&gt;&lt;HEAD&gt;&lt;/HEAD&gt;&lt;BODY&gt;&lt;P&gt;I am performing an optimization with a large set of data.&amp;nbsp; I can provide analytic gradient and hessian modules, but they are computationally intensive, like the function module.&amp;nbsp; Of the optimization subroutines in IML (call NLP__), which one is the fastest?&lt;/P&gt;&lt;/BODY&gt;&lt;/HTML&gt;</description>
      <pubDate>Sat, 01 Jun 2013 22:53:51 GMT</pubDate>
      <guid>https://communities.sas.com/t5/SAS-IML-Software-and-Matrix/Looking-for-fastest-optimization-subroutines/m-p/92605#M601</guid>
      <dc:creator>opti_miser</dc:creator>
      <dc:date>2013-06-01T22:53:51Z</dc:date>
    </item>
    <item>
      <title>Re: Looking for fastest optimization subroutines</title>
      <link>https://communities.sas.com/t5/SAS-IML-Software-and-Matrix/Looking-for-fastest-optimization-subroutines/m-p/92606#M602</link>
      <description>&lt;HTML&gt;&lt;HEAD&gt;&lt;/HEAD&gt;&lt;BODY&gt;&lt;P&gt;Gosh, speed depends on so many things, you should really time it for the problem you have with, say, 10% of the data.&lt;/P&gt;&lt;P&gt;&lt;/P&gt;&lt;P&gt;Given that you have Jacobian and Hessian information, I'd probably use one of the Newton techniques. The Newton-Raphons (NLPNRA) algorithm has quadratic convergence near the solution, so I use it when I can get a good starting guess.&amp;nbsp;&amp;nbsp; I'd&amp;nbsp; use&amp;nbsp; the quasi-Newton algorithm (NLPQN) when the Hessian matrix is much more expensive to compute than the function and derivatives.&lt;/P&gt;&lt;/BODY&gt;&lt;/HTML&gt;</description>
      <pubDate>Sun, 02 Jun 2013 10:12:58 GMT</pubDate>
      <guid>https://communities.sas.com/t5/SAS-IML-Software-and-Matrix/Looking-for-fastest-optimization-subroutines/m-p/92606#M602</guid>
      <dc:creator>Rick_SAS</dc:creator>
      <dc:date>2013-06-02T10:12:58Z</dc:date>
    </item>
  </channel>
</rss>

