Random projections for the nonnegative least-squares problem
DOI10.1016/j.laa.2009.03.026zbMath1167.65032OpenAlexW2120565458MaRDI QIDQ1030739
Christos Boutsidis, Petros Drineas
Publication date: 2 July 2009
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2009.03.026
samplingconvex optimizationnumerical examplesquadratic optimizationrandomized algorithmHadamard transformrandom projectionsfast Johnson-Lindestrauss transformleast-squares regression problemsnon negative least-squaresoptimum nonnegative solution
Numerical mathematical programming methods (65K05) Convex programming (90C25) Quadratic programming (90C20)
Related Items (8)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Faster least squares approximation
- Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform
- Sampling from large matrices
- Sampling algorithms for l2 regression and applications
- An interior point Newton-like method for non-negative least-squares problems with degenerate solution
- Nonnegative Matrix Factorization Based on Alternating Nonnegativity Constrained Least Squares and Active Set Method
- Relative-Error $CUR$ Matrix Decompositions
- On computational aspects of bounded linear least squares problems
- Extensions and Applications of the Householder Algorithm for Solving Linear Least Squares Problems
This page was built for publication: Random projections for the nonnegative least-squares problem