Results 261 to 270 of about 72,594 (306)

The Newton-X platform for mixed quantum-classical dynamics.

Phys Chem Chem Phys
Barbatti M, Mattos RS, Demoulin B, de O Bispo M, Bondanza M, Brady M, Crespo-Otero R, de Miranda EGF, Dral PO, Granucci G, Hehn A, Hernández FJ, Iuzzolino G, Kar R, Kossoski F, Lischka H, Mennucci B, Mukherjee S, Mukhopadhyay A, Perrella F, Persico M, Pinheiro M, Pittner J, Plasser F, Rega N, Sangiogo-Gil E, Thorat T, Toldo JM, Tomaz AA, Varella MTDN, Vasquez L.   +30 more
europepmc   +1 more source

Stochastic Approximation

, 1961
openaire   +1 more source

Some of the next articles are maybe not open access.

Related searches:

A Stochastic Approximation Method

IEEE Transactions on Systems, Man, and Cybernetics, 1971
A new algorithm for stochastic approximation has been proposed, along with the assumptions and conditions necessary for convergence. It has been proved by two different methods that the algorithm converges to the sought value in the mean-square sense and with probability one.
Naresh K. Sinha, Michael P. Griscik
openaire   +1 more source

Accelerated Stochastic Approximation

SIAM Journal on Optimization, 1993
A technique to accelerate the convergence of the Robbins-Monro stochastic approximation algorithm for the multidimensional case is studied. It is based on generalization of Kesten's idea that (in the one-dimensional case) frequent changes of the signs of the differences of subsequent observations indicate that the estimates are close to the real ...
Bernard Delyon, Anatoli B. Juditsky
openaire   +1 more source

Quasi stochastic approximation

Proceedings of the 2011 American Control Conference, 2011
In recent work it was shown that a deterministic analog of stochastic approximation can be formulated to obtain a Q-learning algorithm for approximate optimal control of deterministic and stochastic systems. This paper provides a general foundation for “quasi-stochastic approximation” in which all of the processes under consideration are deterministic,
Darshan Shirodkar, Sean P. Meyn
openaire   +1 more source

On the Stochastic Approximation Coefficients

IEEE Transactions on Systems, Man, and Cybernetics, 1974
A simple and straightforward derivation of the optimal form for the Kiefer-Wolfowitz stochastic approximation coefficients is presented. The results follow immediately from the mean-square sense convergence proof for the Kiefer-Wolfowitz algorithm by minimizing the upper bound of the error variance.
openaire   +2 more sources

On approximate stochastic realization

Mathematics of Control, Signals, and Systems, 1991
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +3 more sources

Fast Approximate Stochastic Tractography

Neuroinformatics, 2011
Many different probabilistic tractography methods have been proposed in the literature to overcome the limitations of classical deterministic tractography: (i) lack of quantitative connectivity information; and (ii) robustness to noise, partial volume effects and selection of seed region.
Juan Eugenio Iglesias, Paul M. Thompson, Cheng-Yi Liu, Zhuowen Tu   +3 more
openaire   +2 more sources

Stochastic Approximation

1996
This chapter deals with algorithms for the optimization of simulated systems.In particular we study stochastic variants of the gradient algorithm xn+1=xn−an∇F(xn)] which was introduced in (1.27) to solve the optimization problem [F(x)=∥∥∥MinimizeF(x)x∈Rd] where F is bounded from below.
openaire   +3 more sources