We consider a class of stochastic approximation (SA) algorithms for solving a system of estimating equations. The standard condition for the convergence of the SA algorithms is that the estimating functions are locally Lipschitz continuous. Here, we show that this condition can be relaxed to the extent that the estimating functions are bounded and continuous almost everywhere. As a consequence, the use of the SA algorithm can be extended to some problems with irregular estimating functions. Our theoretical results are illustrated by solving an estimation problem for exponential power mixture models
In this paper, we propose a Sample Average Approximation (SAA) method for a class of Stochastic Math...
This paper is dedicated to Prof. Eduardo Sontag on the occasion of his seventieth birthday. In this ...
AbstractThis paper develops an a.s. convergence theory for a class of projected stochastic approxima...
We consider a class of stochastic approximation (SA) algorithms for solving a system of estimating e...
We consider a class of stochastic approximation (SA) algorithms for solving a system of estimating e...
We consider a class of stochastic approximation (SA) algorithms for solving a system of estimating e...
We consider a class of stochastic approximation (SA) algorithms for solving a system of estimating e...
Stochastic approximation algorithms are iterative procedures which are used to approximate a target ...
We present a sufficient and necessary condition for the convergence of stochastic approximation algo...
We present a sufficient and necessary condition for the convergence of stochastic approximation algo...
In this paper we discuss the sample average approximation (SAA) method for a class of stochastic pro...
Sample average approximation (SAA), a popular method for tractably solving stochastic optimization p...
AbstractResults on the convergence with probability one of stochastic approximation algorithms of th...
In this paper, we are interested in the almost sure convergence of randomly truncated stochastic alg...
AbstractA generalization of Robbins-Monro stochastic approximation is presented in the paper. It is ...
In this paper, we propose a Sample Average Approximation (SAA) method for a class of Stochastic Math...
This paper is dedicated to Prof. Eduardo Sontag on the occasion of his seventieth birthday. In this ...
AbstractThis paper develops an a.s. convergence theory for a class of projected stochastic approxima...
We consider a class of stochastic approximation (SA) algorithms for solving a system of estimating e...
We consider a class of stochastic approximation (SA) algorithms for solving a system of estimating e...
We consider a class of stochastic approximation (SA) algorithms for solving a system of estimating e...
We consider a class of stochastic approximation (SA) algorithms for solving a system of estimating e...
Stochastic approximation algorithms are iterative procedures which are used to approximate a target ...
We present a sufficient and necessary condition for the convergence of stochastic approximation algo...
We present a sufficient and necessary condition for the convergence of stochastic approximation algo...
In this paper we discuss the sample average approximation (SAA) method for a class of stochastic pro...
Sample average approximation (SAA), a popular method for tractably solving stochastic optimization p...
AbstractResults on the convergence with probability one of stochastic approximation algorithms of th...
In this paper, we are interested in the almost sure convergence of randomly truncated stochastic alg...
AbstractA generalization of Robbins-Monro stochastic approximation is presented in the paper. It is ...
In this paper, we propose a Sample Average Approximation (SAA) method for a class of Stochastic Math...
This paper is dedicated to Prof. Eduardo Sontag on the occasion of his seventieth birthday. In this ...
AbstractThis paper develops an a.s. convergence theory for a class of projected stochastic approxima...