<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>06106995</id>
  <dt>j</dt>
  <an>06106995</an>
  <augroup>
    <au>Brooks, J.P.</au>
    <au>Dul\'a, J.H.</au>
  </augroup>
  <ti>The $L_1$-norm best-fit hyperplane problem.</ti>
  <so>Appl. Math. Lett. 26, No. 1, 51-55 (2013).</so>
  <py>2013</py>
  <pu>Elsevier Science Ltd. (Pergamon), Oxford</pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
    <ut>$L_1$ norm</ut>
    <ut>$L_1$ regression</ut>
    <ut>linear programming</ut>
    <ut>subspace fitting</ut>
    <ut>algorithm</ut>
    <ut>best-fit hyperplane problem</ut>
    <ut>$L_{1}$ projection</ut>
    <ut>location theory</ut>
    <ut>computer vision</ut>
    <ut>multivariate statistics</ut>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
    <li>doi:10.1016/j.aml.2012.03.031</li>
  </ligroup>
  <abgroup>
    <ab>Summary: We formalize an algorithm for solving the $L_{1}$-norm best-fit hyperplane problem derived using first principles and geometric insights about $L_{1}$ projection and $L_{1}$ regression. The procedure follows from a new proof of global optimality and relies on the solution of a small number of linear programs. The procedure is implemented for validation and testing. This analysis of the $L_{1}$-norm best-fit hyperplane problem makes the procedure accessible to applications in areas such as location theory, computer vision, and multivariate statistics.</ab>
    <rv></rv>
  </abgroup>
</item>