2016
DOI: 10.1007/s41060-016-0037-7
|View full text |Cite
|
Sign up to set email alerts
|

Accelerated anti-lopsided algorithm for nonnegative least squares

Abstract: Nonnegative least squares (NNLS) problem has been widely used in scientific computation and data modeling, especially for low-rank representation such as nonnegative matrix and tensor factorization. When applied to large-scale datasets, first-order methods are preferred to provide fast flexible computation for regularized NNLS variants, but they still have the limitations of performance and convergence as key challenges. In this paper, we propose an = 1 for all variables x i to implicitly exploit the second-or… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
6
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
3
1
1

Relationship

0
5

Authors

Journals

citations
Cited by 6 publications
(6 citation statements)
references
References 19 publications
0
6
0
Order By: Relevance
“…As discussed in [31], NNLS implicitly performs 1 -regularization and promotes the sparsity of the resulting solution provided that the measurement matrix B satisfies the M + -criterion [32], i.e., there exits a vector In terms of numerical implementations, the NNLS can be posed as an unconstrained LS problem over the positive orthant and can be solved by several efficient techniques such as Gradient Projection, Primal-Dual techniques, etc., with an affordable computational complexity [34], generally significantly less than CS algorithms for problems of the same size and sparsity level. We refer to [35,36] for the recent progress on the numerical solution of NNLS and a discussion on other related work in the literature.…”
Section: Path Strength Estimation Via Non-negative Least Squaresmentioning
confidence: 99%
See 1 more Smart Citation
“…As discussed in [31], NNLS implicitly performs 1 -regularization and promotes the sparsity of the resulting solution provided that the measurement matrix B satisfies the M + -criterion [32], i.e., there exits a vector In terms of numerical implementations, the NNLS can be posed as an unconstrained LS problem over the positive orthant and can be solved by several efficient techniques such as Gradient Projection, Primal-Dual techniques, etc., with an affordable computational complexity [34], generally significantly less than CS algorithms for problems of the same size and sparsity level. We refer to [35,36] for the recent progress on the numerical solution of NNLS and a discussion on other related work in the literature.…”
Section: Path Strength Estimation Via Non-negative Least Squaresmentioning
confidence: 99%
“…In Fig. 9, we illustrate the lower and upper bounds on the achievable ergodic rate (see (36) and (37)) as a function of SNR BBF . While it is clear that the lower bound is interference-limited while the upper bound is not, we notice that the gap between the bounds is quite small in the regime of low pre-beamforming SNR (SNR BBF < 10 dB), which is relevant in mmWave applications.…”
Section: B Effectiveness Of Single-carrier Modulationmentioning
confidence: 99%
“…In terms of numerical implementations, the NNLS in (69) can be posed as an unconstrained Least-Squares problem over the positive orthant and can be solved by efficient techniques such as Gradient Projection, Primal-Dual techniques, etc., with an affordable computational complexity [30]. We refer to [31,32] for the recent progress on the numerical solution of NNLS and a discussion on other related work in the literature. Using the estimate s in (69), one can obtain an estimate of the measure µ as in (68) and an estimate of σ dl as in (67) followed by an appropriate truncation.…”
Section: B Interpolation From Ul Covariance Matrixmentioning
confidence: 99%
“…To do so, the following optimization problem was solved where the inequality is considered element-wise. To compute the NNLS coefficients efficiently, we implemented the algorithm described in Nguyen and Ho (2017). We modified the algorithm to be able to perform computations on a matrix of responses instead of on a single vector.…”
Section: Methodsmentioning
confidence: 99%