AbstractThe stochastic approximation method of Robbins and Monro, after some modifications, is shown to be a powerful technique for obtaining numerical solutions of deterministic problems. Both algebraic equations and two point boundary value problems in ordinary differential equations are solved. The convergence rate is shown to be reasonably fast and results are surprisingly accurate. Our proposed procedure is more general than the original approach. Deterministic problems with multiple roots can be solved whereas the original Robbins-Monro method is restricted to a monotone increasing regression function with a single root
summary:Let $M : \bold R \rightarrow \bold R$ be observable, with experimental errors, at integer po...
We consider classes of stochastic linear programming problems which can be efficiently solved by det...
Numerical methods for stochastic differential equations, including Taylor expansion approximations, ...
AbstractStochastic approximation originally proposed by Robbins and Monro for stochastic problems is...
This paper discusses the use of the Robbins Monro algorithm and the Kiefer Wolfowitz algorithm in th...
: A deterministic approach is proposed for proving the convergence of stochastic algorithms of the m...
AbstractA generalization of Robbins-Monro stochastic approximation is presented in the paper. It is ...
Stochastic approximation algorithms are iterative procedures which are used to approximate a target ...
AbstractThe paper deals with weak approximations of stochastic differential equations of Itô type, w...
We prove convergence with probability one of a multivariate Markov stochastic approximation procedur...
AbstractAn evaluation method for numerical schemes of stochastic differential equations is treated. ...
Abstract: This paper examines the effect of varying stepsizes in finding the approximate solution of...
The stochastic root-finding problem (SRFP) is that of solving a non-linear system of equations using...
Several attempt to dampen the curse of dimensionnality problem of the Dynamic Programming approach f...
This paper is dedicated to Prof. Eduardo Sontag on the occasion of his seventieth birthday. In this ...
summary:Let $M : \bold R \rightarrow \bold R$ be observable, with experimental errors, at integer po...
We consider classes of stochastic linear programming problems which can be efficiently solved by det...
Numerical methods for stochastic differential equations, including Taylor expansion approximations, ...
AbstractStochastic approximation originally proposed by Robbins and Monro for stochastic problems is...
This paper discusses the use of the Robbins Monro algorithm and the Kiefer Wolfowitz algorithm in th...
: A deterministic approach is proposed for proving the convergence of stochastic algorithms of the m...
AbstractA generalization of Robbins-Monro stochastic approximation is presented in the paper. It is ...
Stochastic approximation algorithms are iterative procedures which are used to approximate a target ...
AbstractThe paper deals with weak approximations of stochastic differential equations of Itô type, w...
We prove convergence with probability one of a multivariate Markov stochastic approximation procedur...
AbstractAn evaluation method for numerical schemes of stochastic differential equations is treated. ...
Abstract: This paper examines the effect of varying stepsizes in finding the approximate solution of...
The stochastic root-finding problem (SRFP) is that of solving a non-linear system of equations using...
Several attempt to dampen the curse of dimensionnality problem of the Dynamic Programming approach f...
This paper is dedicated to Prof. Eduardo Sontag on the occasion of his seventieth birthday. In this ...
summary:Let $M : \bold R \rightarrow \bold R$ be observable, with experimental errors, at integer po...
We consider classes of stochastic linear programming problems which can be efficiently solved by det...
Numerical methods for stochastic differential equations, including Taylor expansion approximations, ...