Stochastic quasigradient methods for optimization of discrete event systems

DOI10.1007/BF02060934zbMath0765.90069MaRDI QIDQ1207835

Yury M. Ermoliev, Alexei A. Gaivoronski

Publication date: 16 May 1993

Published in: Annals of Operations Research (Search for Journal in Brave)

zbMATH Keywords

almost sure convergencediscrete event systemsstochastic quasigradient methods

Mathematics Subject Classification ID

Stochastic programming (90C15) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (18)

Robust food-energy-water-environmental security management: Stochastic quasigradient procedure for linkage of distributed optimization models under asymmetric information and uncertainty ⋮ INVENTORY PROCESSES: QUASI-REGENERATIVE PROPERTY, PERFORMANCE EVALUATION, AND SENSITIVITY ESTIMATION VIA SIMULATION ⋮ A stochastic optimization approach for robot scheduling ⋮ A stochastic multiple gradient descent algorithm ⋮ Sample-path optimization of convex stochastic performance functions ⋮ A class of on-line portfolio selection algorithms based on linear learning ⋮ Distribution-free algorithms for predictive stochastic programming in the presence of streaming data ⋮ Short-term manpower planning for MRT carriage maintenance under mixed deterministic and stochastic demands ⋮ Aggregation and discretization in multistage stochastic programming ⋮ Gradient estimates for the performance of Markov chains and discrete event processes ⋮ Sensitivity analysis and optimization of stochastic Petri nets ⋮ Optimization of computer simulation models with rare events ⋮ Stochastic gradient algorithm with random truncations ⋮ Stochastic generalized gradient method for nonconvex nonsmooth stochastic optimization ⋮ Main directions in the development of informatics ⋮ Convergent bounds for stochastic programs with expected value constraints ⋮ Adaptive Sequential Sample Average Approximation for Solving Two-Stage Stochastic Linear Programs ⋮ Stochastic optimization on social networks with application to service pricing

Cites Work

• 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
• A central-limit-theorem version of \(L=\lambda W\)
• Conditioning for variance reduction in estimating the sensitivity of simulations
• Stochastic approximation methods for constrained and unconstrained systems
• Asymptotic properties of statistical estimators in stochastic programming
• Design and analysis of computer experiments. With comments and a rejoinder by the authors
• On-Line Optimization of Simulated Markovian Processes
• stochastic quasigradient methods and their application to system optimization^†
• A method of aggregate stochastic subgradients with on-line stepsize rules for convex stochastic programming problems
• Designing approximation schemes for stochastic optimization problems, in particular for stochastic programs with recourse
• Algorithms for stochastic programs: The case of nonstochastic tenders
• Stability in Two-Stage Stochastic Programming
• Continuity of Generalized Semi-Markov Processes
• Simulating Stable Stochastic Systems: III. Regenerative Processes and Discrete-Event Simulations
• Convergence Properties of Infinitesimal Perturbation Analysis Estimates
• Optimal step sizes in semi-stochastic approximation procedures. II
• Sensitivity Analysis for Simulations via Likelihood Ratios
• Contributions to the theory of stochastic programming
• Smoothed perturbation analysis for a class of discrete-event systems
• Stochastic Estimation of the Maximum of a Regression Function
• Robust Statistics

This page was built for publication: Stochastic quasigradient methods for optimization of discrete event systems