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

DOI10.1016/j.ins.2017.02.014zbMath1434.90112OpenAlexW2586263190WikidataQ60327682 ScholiaQ60327682MaRDI QIDQ2293151

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

zbMATH Keywords

learning automatastochastic point location problemstochastic root finding problem

Mathematics Subject Classification ID

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

Uses Software

• PRMLT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finding minimum weight connected dominating set in stochastic graph based on learning automata
• Bisection Search with Noisy Responses
• Collaborative 20 Questions for Target Localization
• The asymptotic optimality of discretized linear reward-inaction learning automata
• Discretized pursuit learning automata
• Absorbing and Ergodic Discretized Two-Action Learning Automata
• Sequential transmission using noiseless feedback
• Computing with Noisy Information
• A combined procedure for optimization via simulation
• A Note on the Learning Behavior of Variable-Structure Stochastic Automata
• Up-and-Down Designs for Selecting the Dose with Maximum Success Probability
• Planning Algorithms
• Stochastic Estimation of the Maximum of a Regression Function
• A Stochastic Approximation Method
• Principles of Artificial Neural Networks

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