Analysis of an identification algorithm arising in the adaptive estimation of Markov chains (Q1262282): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Optimal control of Markov processes with incomplete state information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic control of two partially observed competing queues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gradient approach for recursive estimation and control in finite Markov chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Products of Random Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete-time multivariable adaptive control / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive control of service in queueing systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal adaptive control of priority assignment in queueing systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general Martingale approach to discrete-time stochastic control and estimation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5590550 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A limit theorem for partially observed Markov chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: A limit theorem for Markov chains in compact metric spaces with applications to products of random matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identification of a transition matrix of a Markov chain from noisy measurements of state / rank
 
Normal rank
Property / cites work
 
Property / cites work: The average-optimal adaptive control of a Markov renewal model in presence of an unknown parameter / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Survey of Some Results in Stochastic Adaptive Control / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic approximation with discontinuous dynamics and state dependent noise: w.p. 1 and weak convergence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3344923 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic approximation methods for constrained and unconstrained systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Invariant Measure Approach to the Convergence of Stochastic Approximations with State Dependent Noise / rank
 
Normal rank
Property / cites work
 
Property / cites work: Théorèmes de convergence presque sure pour une classe d'algorithmes stochastiques à pas decroissant / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimation and control in discounted stochastic dynamic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence results for continuous-time adaptive stochastic filtering algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-negative matrices and Markov chains. 2nd ed / rank
 
Normal rank

Latest revision as of 11:33, 20 June 2024

scientific article
Language Label Description Also known as
English
Analysis of an identification algorithm arising in the adaptive estimation of Markov chains
scientific article

    Statements

    Analysis of an identification algorithm arising in the adaptive estimation of Markov chains (English)
    0 references
    0 references
    0 references
    0 references
    1990
    0 references
    The paper is devoted to the adaptive estimation problem for partially observable finite-state Markov chains. The authors describe an algorithm which utilizes the recursive equation characterizing the conditional distribution of the state of the Markov chain, given the past observations. Several important analytical properties of this algorithm are studied. In particular, an interesting connection is established with the ordinary differential equation method for stochastic approximations. This allows to give a deep analysis of the algorithms suggested here. We find in the paper clearly formulated statements as well as their detailed proofs. Some useful related topics are also discussed.
    0 references
    0 references
    0 references
    0 references
    0 references
    adaptive estimation
    0 references
    finite-state Markov chains
    0 references
    stochastic approximations
    0 references
    0 references
    0 references
    0 references