Convergence rates of perturbation-analysis-Robbins-Monro-single-run algorithms for single server queues

DOI10.1109/9.633835MaRDI QIDQ4368705zbMATHOpenAlexFDO

Authors Hanfu Chen, Zengjin Han, Qian-Yu Tang

Publication date 15 January 1998

Published in IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/0ae1e5294d1ccd914ecda3dfced178e42fe8909e

zbMATH Keywords

stochastic approximationstochastic discrete-event systemsGI/G/1 queueing systemsperturbation-analysis-Robbins-Monro-single-run algorithm

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25) Stochastic programming (90C15)

Recommendations

• scientific article; zbMATH DE number 4101065
• Convergence of perturbation analysis based optimization algorithm with fixed number of customers period
• Optimization of Queues Using an Infinitesimal Perturbation Analysis-Based Stochastic Algorithm with General Update Times
• Convergence of recursive optimization algorithms using infinitesimal perturbation analysis estimates
• Stochastic Optimization by Simulation: Convergence Proofs for the GI/G/1 Queue in Steady-State

Cited in

(2)

• Convergence of perturbation analysis based optimization algorithm with fixed number of customers period
• Robustness of Rootfinding in Single-Server Queueing Models

This page was built for publication: Convergence rates of perturbation-analysis-Robbins-Monro-single-run algorithms for single server queues

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4368705)