2001
DOI: 10.1016/s0165-1684(00)00275-9
|View full text |Cite
|
Sign up to set email alerts
|

A general method to devise maximum-likelihood signal restoration multiplicative algorithms with non-negativity constraints

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
109
0
1

Year Published

2006
2006
2021
2021

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 92 publications
(110 citation statements)
references
References 32 publications
0
109
0
1
Order By: Relevance
“…Projected gradient methods [6], [7] are based on successive projections on the feasible region. Multiplicative algorithms are very popular to solve NMF problems [8]. All these algorithms are however based on batch processing, which is not suitable for online system identification problems.…”
Section: Introductionmentioning
confidence: 99%
“…Projected gradient methods [6], [7] are based on successive projections on the feasible region. Multiplicative algorithms are very popular to solve NMF problems [8]. All these algorithms are however based on batch processing, which is not suitable for online system identification problems.…”
Section: Introductionmentioning
confidence: 99%
“…5.1. About this second step, in a series of recent papers Lanteri et al [Lan01,Lan02] proposed a general approach, denoted as split gradient method (SGM), to the design of iterative methods for the minimization of a wide class of convex (and also non-convex) functionals of the following type:…”
Section: Split Gradient Methods (Sgm)mentioning
confidence: 99%
“…The applicability of the method requires explicit expressions for the dependence of these arrays on f. Then the general structure of the iterative algorithm, as described in Lanteri et al [Lan01], is as follows:…”
Section: Split Gradient Methods (Sgm)mentioning
confidence: 99%
See 2 more Smart Citations