Convergence of a recursive robust algorithm with strongly regular observations (Q584871): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 62L20 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 62F35 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 3831127 / rank
 
Normal rank
Property / zbMATH Keywords
 
strong regularity
Property / zbMATH Keywords: strong regularity / rank
 
Normal rank
Property / zbMATH Keywords
 
stationary process
Property / zbMATH Keywords: stationary process / rank
 
Normal rank
Property / zbMATH Keywords
 
recursive robust estimation algorithms
Property / zbMATH Keywords: recursive robust estimation algorithms / rank
 
Normal rank
Property / zbMATH Keywords
 
almost sure convergence
Property / zbMATH Keywords: almost sure convergence / rank
 
Normal rank
Property / zbMATH Keywords
 
minimal asymptotic variance estimators
Property / zbMATH Keywords: minimal asymptotic variance estimators / rank
 
Normal rank
Property / zbMATH Keywords
 
adaptive estimators
Property / zbMATH Keywords: adaptive estimators / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0304-4149(84)90027-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1988568785 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of stochastic approximation schemes with discontinuous and dependent forcing terms with applications to data communication algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Methods which Converge with Probability one / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive computation of M-estimates for the parameters of a finite autoregressive process / rank
 
Normal rank
Property / cites work
 
Property / cites work: The asymptotic distribution theory of the empiric cdf for mixing stochastic processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3903911 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Estimation of a Location Parameter / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust estimation via stochastic approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust identification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost sure approximations to the Robbins-Monro and Kiefer-Wolfowitz processes with dependent noise / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4084474 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Extension of the Robbins-Monro Procedure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Limit Theorems for Random Functions. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Limit Theorems for Random Functions. II / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:52, 14 June 2024

scientific article
Language Label Description Also known as
English
Convergence of a recursive robust algorithm with strongly regular observations
scientific article

    Statements

    Convergence of a recursive robust algorithm with strongly regular observations (English)
    0 references
    0 references
    1984
    0 references
    strong regularity
    0 references
    stationary process
    0 references
    recursive robust estimation algorithms
    0 references
    almost sure convergence
    0 references
    minimal asymptotic variance estimators
    0 references
    adaptive estimators
    0 references

    Identifiers