<?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 Minimize Ax - b in L inf norm in Intel® oneAPI Math Kernel Library</title>
    <link>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/Minimize-Ax-b-in-L-inf-norm/m-p/1215864#M30137</link>
    <description>&lt;P&gt;Hello,&lt;BR /&gt;in mkl, I have found a ?gelsy function (&lt;A href="https://software.intel.com/content/www/us/en/develop/documentation/mkl-developer-reference-c/top/lapack-routines/lapack-least-squares-and-eigenvalue-problem-routines/lapack-least-squares-and-eigenvalue-problem-driver-routines/linear-least-squares-lls-problems-lapack-driver-routines/gelsy.html" target="_blank"&gt;https://software.intel.com/content/www/us/en/develop/documentation/mkl-developer-reference-c/top/lapack-routines/lapack-least-squares-and-eigenvalue-problem-routines/lapack-least-squares-and-eigenvalue-problem-driver-routines/linear-least-squares-lls-problems-lapack-driver-routines/gelsy.html&lt;/A&gt;), which&amp;nbsp;&lt;SPAN&gt;computes the minimum-norm solution to a real/complex linear least squares problem. Now, I am wondering if exists some function which computes the solution in L inf norm. Or can anyone help me how to use mkl functions to solve it?&lt;/SPAN&gt;&lt;/P&gt;</description>
    <pubDate>Thu, 08 Oct 2020 08:02:46 GMT</pubDate>
    <dc:creator>Radimoid</dc:creator>
    <dc:date>2020-10-08T08:02:46Z</dc:date>
    <item>
      <title>Minimize Ax - b in L inf norm</title>
      <link>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/Minimize-Ax-b-in-L-inf-norm/m-p/1215864#M30137</link>
      <description>&lt;P&gt;Hello,&lt;BR /&gt;in mkl, I have found a ?gelsy function (&lt;A href="https://software.intel.com/content/www/us/en/develop/documentation/mkl-developer-reference-c/top/lapack-routines/lapack-least-squares-and-eigenvalue-problem-routines/lapack-least-squares-and-eigenvalue-problem-driver-routines/linear-least-squares-lls-problems-lapack-driver-routines/gelsy.html" target="_blank"&gt;https://software.intel.com/content/www/us/en/develop/documentation/mkl-developer-reference-c/top/lapack-routines/lapack-least-squares-and-eigenvalue-problem-routines/lapack-least-squares-and-eigenvalue-problem-driver-routines/linear-least-squares-lls-problems-lapack-driver-routines/gelsy.html&lt;/A&gt;), which&amp;nbsp;&lt;SPAN&gt;computes the minimum-norm solution to a real/complex linear least squares problem. Now, I am wondering if exists some function which computes the solution in L inf norm. Or can anyone help me how to use mkl functions to solve it?&lt;/SPAN&gt;&lt;/P&gt;</description>
      <pubDate>Thu, 08 Oct 2020 08:02:46 GMT</pubDate>
      <guid>https://community.intel.com/t5/Intel-oneAPI-Math-Kernel-Library/Minimize-Ax-b-in-L-inf-norm/m-p/1215864#M30137</guid>
      <dc:creator>Radimoid</dc:creator>
      <dc:date>2020-10-08T08:02:46Z</dc:date>
    </item>
  </channel>
</rss>

