Convergence of recursive optimization algorithms using infinitesimal perturbation analysis estimates
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 795176
- scientific article; zbMATH DE number 4101065
- Optimization of Queues Using an Infinitesimal Perturbation Analysis-Based Stochastic Algorithm with General Update Times
- Convergence Properties of Infinitesimal Perturbation Analysis Estimates
- Structural conditions for perturbation analysis of queueing systems
Cited in
(14)- Stochastic comparison algorithm for continuous optimization with estimation
- Convergence of trajectories in infinite horizon optimization
- scientific article; zbMATH DE number 795176 (Why is no real title available?)
- Infinitesimal perturbation analysis for second derivative estimation and design of manufacturing flow controllers
- Optimal load sharing in soft real-time systems using likelihood ratios
- scientific article; zbMATH DE number 4101065 (Why is no real title available?)
- Convergence of perturbation analysis based optimization algorithm with fixed number of customers period
- Optimization via simulation: A review
- Structural Conditions for Perturbation Analysis Derivative Estimation: Finite-Time Performance Indices
- Scheduling policies using marked/phantom slot algorithms
- Online surrogate problem methodology for stochastic discrete resource allocation problem.
- Convergence of stochastic approximation coupled with perturbation analysis in a class of manufacturing flow control models
- Effect of model uncertainty on some optimal routing problems
- Infinitesimal perturbation analysis of a queueing system with bursty traffic
This page was built for publication: Convergence of recursive optimization algorithms using infinitesimal perturbation analysis estimates
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1198586)
