Affiliation:
1. Department of Mathematics “Tullio Levi Civita” University of Padua Padua Italy
2. Leonardo Labs Leonardo S.p.A. Genoa Italy
Abstract
SummaryThe Lawson‐Hanson with Deviation Maximization (LHDM) method is a block algorithm for the solution of NonNegative Least Squares (NNLS) problems. In this work we devise an improved version of LHDM and we show that it terminates in a finite number of steps, unlike the previous version, originally developed for a special class of matrices. Moreover, we are concerned with finding sparse solutions of underdetermined linear systems by means of NNLS. An extensive campaign of experiments is performed in order to evaluate the performance gain with respect to the standard Lawson‐Hanson algorithm. We also show the ability of LHDM to retrieve sparse solutions, comparing it against several ‐minimization solvers in terms of solution quality and time‐to‐solution on a large set of dense instances.
Funder
Università degli Studi di Padova
Subject
Applied Mathematics,Algebra and Number Theory
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献