Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

The Lawson‐Hanson algorithm with deviation maximization: Finite convergence and sparse recovery

From MaRDI portal
Publication:6178057
Jump to:navigation, search

DOI10.1002/nla.2490arXiv2108.05345OpenAlexW4315574907MaRDI QIDQ6178057

Monica Dessole, Fabio Marcuzzi, Unnamed Author

Publication date: 18 January 2024

Published in: Numerical Linear Algebra with Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2108.05345


zbMATH Keywords

nonnegative least squaressparse recoveryblock pivoting


Mathematics Subject Classification ID

Orthogonalization in numerical linear algebra (65F25) Numerical methods for mathematical programming, optimization and variational techniques (65K99)





This page was built for publication: The Lawson‐Hanson algorithm with deviation maximization: Finite convergence and sparse recovery

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:6178057&oldid=35665364"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 10 July 2024, at 08:00.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki