S-NNLS: An efficient non-negative least squares algorithm for sequential data

DOI10.1002/CNM.1331MaRDI QIDQ3017933zbMATH OpenOpenAlexFDO

Authors Giuseppe Bombara, Marco Cococcioni, B. Lazzerini, F. Marcelloni

Publication date 20 July 2011

Published in International Journal for Numerical Methods in Biomedical Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/cnm.1331

zbMATH Keywords

matrix factorizationsequential estimationalgorithmnon-negative least squares

Mathematics Subject Classification ID

Numerical solutions to overdetermined systems, pseudoinverses (65F20)

Recommendations

• A non-monotonic method for large-scale non-negative least squares
• A fast algorithm for non-negativity model selection
• Fast nonnegative least squares through flexible Krylov subspaces
• Efficient Parallel Nonnegative Least Squares on Multicore Architectures
• Projected gradient method for non-negative least square

Cites work

• Algorithm 587: Two Algorithms for the Linearly Constrained Least Squares Problem

Cited in

(2)

• A non-monotonic method for large-scale non-negative least squares
• A fast algorithm for non-negativity model selection

Describes a project that uses

Uses Software

• Algorithm 587

This page was built for publication: S-NNLS: An efficient non-negative least squares algorithm for sequential data

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3017933)