2020
DOI: 10.15587/1729-4061.2020.210129
|View full text |Cite
|
Sign up to set email alerts
|

Studying the properties of a robust algorithm for identifying linear objects, which minimizes a combined functional

Abstract: This paper addresses the task of identifying the parameters of a linear object in the presence of non-Gaussian interference. The identification algorithm is a gradient procedure for minimizing the combined functional. The combined functional, in turn, consists of the fourth-degree functional and a modular functional, whose weights are set using a mixing parameter. Such a combination of functionals makes it possible to obtain estimates that demonstrate robust properties. We have determined the conditions for th… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2021
2021
2021
2021

Publication Types

Select...
1

Relationship

1
0

Authors

Journals

citations
Cited by 1 publication
(2 citation statements)
references
References 35 publications
(85 reference statements)
0
2
0
Order By: Relevance
“…A combined criterion consisting of a fourth-power and modular criterion was proposed in [27,28]. These works established the asymptotic and non-asymptomatic properties of the identification algorithm and investigated the effect of selecting the mixing parameter value on the properties of estimates.…”
Section: Literature Review and Problem Statementmentioning
confidence: 99%
See 1 more Smart Citation
“…A combined criterion consisting of a fourth-power and modular criterion was proposed in [27,28]. These works established the asymptotic and non-asymptomatic properties of the identification algorithm and investigated the effect of selecting the mixing parameter value on the properties of estimates.…”
Section: Literature Review and Problem Statementmentioning
confidence: 99%
“…Substituting these expressions in (27) and the simple transformations considering the introduced designations (28) produce For the algorithm to converge, one needs to meet the following condition that is, the expression in the right-hand part of (30) should be negative. Because 1, λ ≤ the first term is not positive.…”
Section: Algorithm Convergence Studymentioning
confidence: 99%