Adaptive designs for stochastic root-finding
From MaRDI portal
Recommendations
Cited in
(20)- Adaptive designs and Robbins-Monro algorithm
- Probabilistic bisection with spatial metamodels
- A novel technique for stochastic root-finding: enhancing the search with adaptive d-ary search
- Three-phase optimal design of sensitivity experiments
- Discussion of: ``Three-phase optimal design of sensitivity experiments
- An optimal stochastic approximation for estimating the effective window of a control factor
- Adaptive designs with arbitrary dependence structure
- A skewed version of the Robbins-Monro-Joseph procedure for binary response
- scientific article; zbMATH DE number 1783877 (Why is no real title available?)
- Stochastic approximation and compound delayed observations with independent random time delay distribution
- The stochastic root-finding problem: overview, solutions, and open questions
- scientific article; zbMATH DE number 754534 (Why is no real title available?)
- scientific article; zbMATH DE number 1361714 (Why is no real title available?)
- scientific article; zbMATH DE number 4113793 (Why is no real title available?)
- An adaptive design to assess the reliability of the pyrotechnic control subsystem in opening the solar array
- Probabilistic bisection converges almost as quickly as stochastic approximation
- An analytical comparison between the nonsingular quadratic performance of robust and adaptive backstepping designs
- A sequential design for determining the quantile curve in two-factor sensitivity tests
- Generalized probabilistic bisection for stochastic root finding
- Bayesian sequential experimental design for binary response data with application to electromyographic experiments
This page was built for publication: Adaptive designs for stochastic root-finding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5449212)
