Neural Networks for Signal Processing X. Proceedings of the 2000 IEEE Signal Processing Society Workshop (Cat. No.00TH8501)
DOI: 10.1109/nnsp.2000.889363
|View full text |Cite
|
Sign up to set email alerts
|

Separable nonlinear least-squares methods for on-line estimation of neural nets Hammerstein models

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Publication Types

Select...
4

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(3 citation statements)
references
References 8 publications
0
3
0
Order By: Relevance
“…(22) at every iteration by means of a recursive least squares algorithm. For an extensive derivation the reader is referred to [21,19].…”
Section: On-line Parameter Identification With Modified Recursive Levmentioning
confidence: 99%
“…(22) at every iteration by means of a recursive least squares algorithm. For an extensive derivation the reader is referred to [21,19].…”
Section: On-line Parameter Identification With Modified Recursive Levmentioning
confidence: 99%
“…In addition to the contributions mentioned above, a lot of other works on Hammerstein system identification exist in the literature. For example, Ngia and Westwick et al applied the separable non‐linear least squares optimisation methods in [35] to identify the Hammerstein models [36, 37], Goethals et al [38] presented a subspace identification method for Hammerstein systems using the least squares support vector machines.…”
Section: Introductionmentioning
confidence: 99%
“…Besides the obvious advantage of reducing the number of parameters to be determined by eliminating the linear parameters, it has been shown [30,33,22,24] that the resulting reduced problem is better conditioned than the original full one, and if the same optimization algorithm is used it always converges in less iterations. Since with a careful implementation, the cost per iteration is about the same, these results and extensive applications as reported in [14] (where a wealth of references can be found) indicate that there is a net gain in using VP over solving the unreduced problem with a conventional non-linear least squares algorithm.…”
Section: Introductionmentioning
confidence: 99%