Results 51 to 60 of about 146,193 (70)
Fitted Value Function Iteration With Probability One Contractions [PDF]
This paper studies a value function iteration algorithm that can be applied to almost all stationary dynamic programming problems. Using nonexpansive function approximation and Monte Carlo integration, we develop a randomized fitted Bellman operator and ...
Jenö Pál, John Stachurski
core
Estimates of the Aggregate Quarterly Capital Stock for the Post- War U.S. Economy [PDF]
We construct quarterly aggregate gross and net capital stock series for the post-war U.S. economy using annual capital stock, capital depreciation, and capital discard figures along with quarterly investment series. We construct nominal and real measures
Daniel Levy, Haiwei Chen
core
Variational iteration algorithm-II for solving linear and non-linear ODEs
, 2012 Variational iteration method is widely used for solving linear and non-linear ODE. In this paper, the variational iteration algorithm-II is constructed and some examples are given to show its simple solution procedure and high accuracy of the obtained ...
Luis Hernández Martínez
core
Continuous State Dynamic Programming Via Nonexpansive Approximation [PDF]
This paper studies fitted value iteration for continuous state dynamic programming using nonexpansive function approximators. A number of nonexpansive approximation schemes are discussed.
John Stachurski
core
, 1992 Iteration seems to play a fundamental role in learning theory - as everywhere else. Since neurons need a rather long time to reach a stable state, Caianiello's Paradox suggests that special actions cause the iteration of state transitions until a stable ...
MAZZANTI, STEFANO, G. Germano
core
Pesquimat, 2022 “Given a closed and convex subset C of a cone Banach space E with norm ∥x∥P = d (x, 0) and a map T : C → C that satisfies the condition for all x, y ∈ C 0 ≤ s + |a| − 2b < 2(a + b) ad (T x, T y) + b (d (x, T x) + d (y, T y)) ≤ sd (x, y) The general ...
Edinson Montoro Alegre
exaly +2 more sources
Simpler Is Also Better in Approximating Fixed Points
Applied Mathematics and Computation, 2008 In this paper we demonstrate that a number of fixed point iteration problems can be solved using a modified Krasnoselskij iteration process, which is much simpler to use than the other iteration schemes that have been ...
Safeer Hussain Khan +2 more
exaly +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches: