TSNNLS

Tsnnls: A solver for large sparse least squares problems with non-negative variables. The solution of large, sparse constrained least-squares problems is a staple in scientific and engineering applications. However, currently available codes for such problems are proprietary or based on MATLAB. We announce a freely available C implementation of the fast block pivoting algorithm of Portugal, Judice, and Vicente. Our version is several times faster than Matstoms’ MATLAB implementation of the same algorithm. Further, our code matches the accuracy of MATLAB’s built-in lsqnonneg function


References in zbMATH (referenced in 4 articles )

Showing results 1 to 4 of 4.
Sorted by year (citations)

  1. Ashton, Ted; Cantarella, Jason; Piatek, Michael; Rawdon, Eric J.: Knot tightening by constrained gradient descent (2011)
  2. Han, Bohyung; Joo, Seong-Wook; Davis, Larry S.: Multi-camera tracking with adaptive resource allocation (2011) ioport
  3. Kim, Jingu; Park, Haesun: Fast nonnegative matrix factorization: an active-set-like method and comparisons (2011)
  4. Cantarella, Jason; Piatek, Michael: Tsnnls: A solver for large sparse least squares problems with non-negative variables (2004) ioport


Further publications can be found at: http://www.jasoncantarella.com/webpage/index.php?title=Papers