A novel technique for stochastic root-finding: enhancing the search with adaptive d-ary search

DOI10.1016/J.INS.2017.02.014zbMATH Open1434.90112OpenAlexW2586263190WikidataQ60327682 ScholiaQ60327682MaRDI QIDQ2293151FDOQ2293151

Authors: Anis Yazidi, B. John Oommen 

Publication date: 7 February 2020

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2017.02.014

Recommendations

• The stochastic root-finding problem: overview, solutions, and open questions
• Adaptive designs for stochastic root-finding
• Retrospective-approximation algorithms for the multidimensional stochastic root-finding problem
• An adaptive algorithm for solving stochastic multi-point boundary value problems
• Stationary adaptive search strategy as an alternative to the method of stochastic approximation
• Stochastic search algorithm with an application to multidimensional integration
• Adaptive stochastic approximation by the simultaneous perturbation method
• On Choosing Parameters in Retrospective-Approximation Algorithms for Stochastic Root Finding and Simulation Optimization
• scientific article; zbMATH DE number 1783877
• On stochasticity preserving methods for the computation of the matrix \(p\)th root

zbMATH Keywords

learning automatastochastic point location problemstochastic root finding problem

Mathematics Subject Classification ID

Stochastic systems and control (93E99) Stochastic programming (90C15)

Cites Work

• Pattern recognition and machine learning.
• Title not available (Why is that?)
• A Stochastic Approximation Method
• Computing with Noisy Information
• Stochastic Estimation of the Maximum of a Regression Function
• Planning Algorithms
• Springer handbook of robotics. With DVD
• Title not available (Why is that?)
• Sequential transmission using noiseless feedback
• A combined procedure for optimization via simulation
• Principles of Artificial Neural Networks
• Finding minimum weight connected dominating set in stochastic graph based on learning automata
• Title not available (Why is that?)
• The asymptotic optimality of discretized linear reward-inaction learning automata
• Collaborative 20 Questions for Target Localization
• Discretized pursuit learning automata
• Absorbing and Ergodic Discretized Two-Action Learning Automata
• A Note on the Learning Behavior of Variable-Structure Stochastic Automata
• Bisection search with noisy responses
• Up-and-Down Designs for Selecting the Dose with Maximum Success Probability

Cited In (1)

• Title not available (Why is that?)

Uses Software

• PRMLT

This page was built for publication: A novel technique for stochastic root-finding: enhancing the search with adaptive \(d\)-ary search

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2293151)