The stochastic root-finding problem
From MaRDI portal
Publication:4635179
DOI10.1145/1921598.1921603zbMATH Open1386.65054OpenAlexW2103446957MaRDI QIDQ4635179FDOQ4635179
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
Cited In (16)
- Rate-Based Daily Arrival Process Models with Application to Call Centers
- An introduction to multiobjective simulation optimization
- Simulation optimization: a review of algorithms and applications
- Title not available (Why is that?)
- Robust Simulation with Likelihood-Ratio Constrained Input Uncertainty
- Generalized probabilistic bisection for stochastic root finding
- A solution to the weak instrument bias in 2SLS estimation: indirect inference with stochastic approximation
- Probabilistic Bisection Converges Almost as Quickly as Stochastic Approximation
- Algorithms for Kullback--Leibler Approximation of Probability Measures in Infinite Dimensions
- An adaptive zero-variance importance sampling approximation for static network dependability evaluation
- A novel technique for stochastic root-finding: enhancing the search with adaptive \(d\)-ary search
- Technical Note—Consistency Analysis of Sequential Learning Under Approximate Bayesian Inference
- Probabilistic bisection with spatial metamodels
- Robust Analysis in Stochastic Simulation: Computation and Performance Guarantees
- On Sampling Rates in Simulation-Based Recursions
- On Choosing Parameters in Retrospective-Approximation Algorithms for Stochastic Root Finding and Simulation Optimization
This page was built for publication: The stochastic root-finding problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4635179)
