Tsnnls: A solver for large sparse least squares problems with non-negative variables
Jason Cantarella, Michael Piatek
Abstract
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.
Create a lesson
Related papers
manylp: reproducible, exact, and batched linear programming for genome-scale dynamic flux balance analysis
Fabio Cumbo
asdex: Automatic Sparse Differentiation in JAX
Adrian Hill, Guillaume Dalle
Scen-Opt: A Scenario Optimization Toolbox for Data-Driven Convex Programming
Ben Wooding, Simone Garatti, Marco C. Campi et al.
A performance enhancement of the Payne-Hanek range reduction algorithm
Tue Ly
DistributedDesignOptimizer: A modular Python framework for Setup, Execution and Processing of Distributed Design Optimization
Sebastian Ellmaier, Albert J. de Wit, Akilesh Raveendran et al.
KnottedGraph: Scalable knotted-graph topology for scientific and mathematical discovery
Hakan Akgün, Xianquan Yan, Kehan Liu et al.