Let E be an arbitrary real Banach space andK a nonempty, closed, convex (not necessarily bounded) subset of E. If T is a member of the class of Lipschitz, strongly pseudocontractive maps with Lipschitz constant L ≥ 1, then it is shown that to each Mann iteration there is a Krasnosleskij iteration which converges faster than the Mann iteration. It is also shown that the Mann iteration converges ...

Probabilistic Point Clouds Registration (PPCR) is an algorithm that, in its multi-iteration version, outperformed state-of-the-art algorithms for local point clouds registration. However, performances have been tested using a fixed high number of iterations. To be practical usefulness, we think that the should decide by itself when to stop, on one hand avoid excessive iterations and waste compu...

Many authors have proposed fixed-point algorithms for obtaining a fixed point of G-nonexpansive mappings without using inertial techniques. To improve convergence behavior, some accelerated methods been introduced. The main aim this paper is to use coordinate affine structure create an algorithm with technique countable family in Hilbert space symmetric directed graph G and prove the weak theor...

Multi-exit iteration is a generalization of the standard binary Kleene star operation that allows for the specification of agents that, up to bisimulation equivalence, are solutions of systems of recursion equations of the form X1 def = P1X2 + Q1 .. Xn def = PnX1 + Qn where n is a positive integer, and the Pi and the Qi are process terms. The addition of multi-exit iteration to Basic Process Al...

in this paper, the optimal adaptive leader-follower consensus of linear continuous time multi-agent systems is considered. the error dynamics of each player depends on its neighbors’ information. detailed analysis of online optimal leader-follower consensus under known and unknown dynamics is presented. the introduced reinforcement learning-based algorithms learn online the approximate solution...

In this paper, we consider convex quadratic semidefinite optimization problems and provide a primal-dual Interior Point Method (IPM) based on a new kernel function with a trigonometric barrier term. Iteration complexity of the algorithm is analyzed using some easy to check and mild conditions. Although our proposed kernel function is neither a Self-Regular (SR) fun...

Finite Element problems are often solved using multigrid techniques. The most time consuming part of multigrid is the iterative smoother, such as Gauss-Seidel. To improve performance, iterative smoothers can exploit parallelism, intra-iteration data reuse, and inter-iteration data reuse. Current methods for parallelizing Gauss-Seidel on irregular grids, such as multi-coloring and ownercomputes ...