General Bounds and Finite-Time Improvement for the Kiefer-Wolfowitz Stochastic Approximation Algorithm
From MaRDI portal
Publication:2879517
DOI10.1287/opre.1110.0970zbMath1252.90057OpenAlexW2100911008MaRDI QIDQ2879517
Assaf J. Zeevi, Deniz M. Cicek, Mark N. Broadie
Publication date: 26 March 2012
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/08ec3cceb6b55249dc511fa04f342b51135649a3
stochastic optimizationstochastic approximationKiefer-Wolfowitz algorithmfinite-time improvementmean-squared-error convergence
Related Items
Stopping rules for optimization algorithms based on stochastic approximation ⋮ A stochastic successive minimization method for nonsmooth nonconvex optimization with applications to transceiver design in wireless communication networks ⋮ ASTRO-DF: A Class of Adaptive Sampling Trust-Region Algorithms for Derivative-Free Stochastic Optimization ⋮ Exploring or reducing noise? A global optimization algorithm in the presence of noise ⋮ On smoothing, regularization, and averaging in stochastic approximation methods for stochastic variational inequality problems ⋮ A new hybrid stochastic approximation algorithm ⋮ Optimization-Based Calibration of Simulation Input Models ⋮ Technical Note—Consistency Analysis of Sequential Learning Under Approximate Bayesian Inference ⋮ A solution to the weak instrument bias in 2SLS estimation: indirect inference with stochastic approximation ⋮ A unified framework for stochastic optimization ⋮ Multidimensional stochastic approximation ⋮ Simulation methods for robust risk assessment and the distorted mix approach ⋮ Nonparametric Learning Algorithms for Joint Pricing and Inventory Control with Lost Sales and Censored Demand ⋮ Iterative learning control using faded measurements without system information: a gradient estimation approach
