The stochastic root-finding problem

DOI10.1145/1921598.1921603zbMath1386.65054OpenAlexW2103446957MaRDI QIDQ4635179

Sujin Kim, Raghu Pasupathy

Publication date: 16 April 2018

Published in: ACM Transactions on Modeling and Computer Simulation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1921598.1921603

zbMATH Keywords

stochastic approximationsample-average approximationstochastic root finding

Mathematics Subject Classification ID

Related Items (12)

Algorithms for Kullback--Leibler Approximation of Probability Measures in Infinite Dimensions ⋮ An adaptive zero-variance importance sampling approximation for static network dependability evaluation ⋮ Probabilistic bisection with spatial metamodels ⋮ Robust Simulation with Likelihood-Ratio Constrained Input Uncertainty ⋮ On Sampling Rates in Simulation-Based Recursions ⋮ 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 ⋮ Rate-Based Daily Arrival Process Models with Application to Call Centers ⋮ Simulation optimization: a review of algorithms and applications ⋮ Probabilistic Bisection Converges Almost as Quickly as Stochastic Approximation ⋮ Robust Analysis in Stochastic Simulation: Computation and Performance Guarantees ⋮ Unnamed Item

This page was built for publication: The stochastic root-finding problem