Results 21 to 30 of about 5,139 (262)
Adaptive Approximate Policy Iteration
, 2020 Model-free reinforcement learning algorithms combined with value function approximation have recently achieved impressive performance in a variety of application domains. However, the theoretical understanding of such algorithms is limited, and existing results are largely focused on episodic or discounted Markov decision processes (MDPs). In this work,
Hao, Botao +4 more
openaire +2 more sources
Approximating fixed points by ishikawa iterates [PDF]
Bulletin of the Australian Mathematical Society, 1989 In a uniformly convex Banach space the convergence of Ishikawa iterates to a fixed point is discussed for nonexpansive and generalised nonexpansive mappings.
Maiti, M., Ghosh, M. K.
openaire +1 more source
Optimized Self-Similar Borel Summation
Axioms, 2023 The method of Fractional Borel Summation is suggested in conjunction with self-similar factor approximants. The method used for extrapolating asymptotic expansions at small variables to large variables, including the variables tending to infinity, is ...
Simon Gluzman, Vyacheslav I. Yukalov
doaj +1 more source
Forward Kinematics of Delta Manipulator by Novel Hybrid Neural Network [PDF]
International Journal of Mathematical, Engineering and Management Sciences, 2021 For the parallel configuration of the robot manipulator, the solution of Forward Kinematics (FK) is tough as compared to Inverse Kinematics (IK). This work presents a novel hybrid method of optimizing an Artificial Neural Network (ANN) specifically ...
Mahesh A. Makwana, Haresh P. Patolia
doaj +1 more source
Approximate Nullspace Iterations for KKT Systems [PDF]
SIAM Journal on Matrix Analysis and Applications, 2010 We investigate a linear iteration scheme for solving Karush-Kuhn-Tucker systems arising from optimization problems with linear equality constraints. The iterations are motivated by the simplicity of the proposed combination of iterations for the forward and adjoint systems that need to be solved and for which efficient solvers may already be available.
Ito, Kunisch, Schulz, Gherman
openaire +2 more sources
Approximating Probability Densities by Iterated Laplace Approximations [PDF]
Journal of Computational and Graphical Statistics, 2011 Comment: to appear in Journal of Computational and Graphical Statistics, http://pubs.amstat.org/loi ...
openaire +3 more sources
Approximation of Finite Hilbert and Hadamard Transforms by Using Equally Spaced Nodes
Mathematics, 2020 In the present paper, we propose a numerical method for the simultaneous approximation of the finite Hilbert and Hadamard transforms of a given function f, supposing to know only the samples of f at equidistant points. As reference interval we consider
Frank Filbir +2 more
doaj +1 more source
General multivariate arctangent function activated neural network approximations
Journal of Numerical Analysis and Approximation Theory, 2022 Here we expose multivariate quantitative approximations of Banach space valued continuous multivariate functions on a box or \(\mathbb{R}^{N}\), \(N\in \mathbb{N}\), by the multivariate normalized, quasi-interpolation, Kantorovich type and quadrature ...
George A. Anastassiou
doaj +1 more source
Iterative Method for Simultaneous Sparse Approximation [PDF]
Scientia Iranica, 2018 This paper studies the problem of Simultaneous Sparse Approximation (SSA). This problem arises in many applications which work with multiple signals maintaining some degree of dependency such as radar and sensor networks. In this paper, we introduce a new method towards joint recovery of several independent sparse signals with the same support.
Sadrizadeh, Sahar +3 more
openaire +2 more sources
Approximate Multi-matroid Intersection via Iterative Refinement [PDF]
Mathematical Programming, 2019 We introduce a new iterative rounding technique to round a point in a matroid polytope subject to further matroid constraints. This technique returns an independent set in one matroid with limited violations of the other ones. On top of the classical steps of iterative relaxation approaches, we iteratively refine/split involved matroid constraints to ...
Linhares, André +3 more
openaire +9 more sources