Decomposable score function estimators for sensitivity analysis and optimization of queueing networks
DOI10.1007/BF02060942zbMath0764.62069MaRDI QIDQ1207845
Publication date: 16 May 1993
Published in: Annals of Operations Research (Search for Journal in Brave)
modulessensitivity analysisperformance evaluationvariancebiasexponential familyconnected queuesdecomposable score function estimatorslocal regenerative cyclesopen non-Markovian queueing networksqueueing network stabilizer and optimizersimulation packagestandard score function estimatorstruncated score functions estimators
Programming involving graphs or networks (90C35) Non-Markovian processes: estimation (62M09) Inference from stochastic processes (62M99) Probabilistic methods, stochastic differential equations (65C99)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- How to optimize discrete-event systems from a single sample path by the score function method
- Simulation methods of queues: An overview
- Sampling derivatives of probabilities
- Smoothing complements and randomized score functions
- Distributed expert systems for queueing network capacity planning
- Sensitivity analysis of discrete event systems by the push out method
- Importance Sampling for Stochastic Simulations
- A Unified View of the IPA, SF, and LR Gradient Estimation Techniques
- Estimating Derivatives Via Poisson's Equation
- Strong Convexity Results for Queueing Systems
- Stochastic convexity and its applications
- A Monte Carlo Method for Sensitivity Analysis and Parametric Optimization of Nonlinear Stochastic Systems
- The efficiency and heavy traffic properties of the score function method in sensitivity analysis of queueing models
- Sensitivity Analysis for Simulations via Likelihood Ratios
This page was built for publication: Decomposable score function estimators for sensitivity analysis and optimization of queueing networks
