A Stochastic Approximation Algorithm with Varying Bounds
From MaRDI portal
Publication:4887726
DOI10.1287/opre.43.6.1037zbMath0852.90115OpenAlexW2036200030MaRDI QIDQ4887726
Publication date: 9 December 1996
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.43.6.1037
Related Items (18)
A direct search method for unconstrained quantile-based simulation optimization ⋮ Solving fuzzy queueing decision problems via a parametric mixed integer nonlinear programming method ⋮ Towards logistics systems parameter optimisation through the use of response surfaces ⋮ Asymptotic behavior of truncated stochastic approximation procedures ⋮ Stochastic Nelder-Mead simplex method -- a new globally convergent direct search method for simulation optimization ⋮ Truncated stochastic approximation with moving bounds: convergence ⋮ Stabilization of stochastic approximation by step size adaptation ⋮ Technical Note—Consistency Analysis of Sequential Learning Under Approximate Bayesian Inference ⋮ Markovian stochastic approximation with expanding projections ⋮ An Asymptotically Optimal Set Approach for Simulation Optimization ⋮ Rate of convergence of truncated stochastic approximation procedures with moving bounds ⋮ Multidimensional stochastic approximation ⋮ Adaptive random search for continuous simulation optimization ⋮ A stochastic quasi-Newton method for simulation response optimization ⋮ An alternating variable method with varying replications for simulation response optimization ⋮ Convergence of Markovian Stochastic Approximation with Discontinuous Dynamics ⋮ Convergence of a stochastic approximation version of the EM algorithm ⋮ Simulation response optimization via direct conjugate direction method
This page was built for publication: A Stochastic Approximation Algorithm with Varying Bounds
