A Convergence Result for Asynchronous Algorithms and Applications
نویسنده
چکیده
We give in this paper a convergence result concerning parallel asynchronous algorithm with bounded delays to solve a nonlinear fixed point problems. This result is applied to calculate the solution of a strongly monotone operator. Special cases of these operators are used to solve some problems related to convex analysis like minimization of functionals, calculus of saddle point and variational inequality problem. asynchronous algorithm, nonlinear problems, monotone operators, fixed point, optimization problem, variational inequality problem, convex analysis. 2000 Mathematics Subject Classification. Primary 68W10, 47H10; Secondary 47Hxx
منابع مشابه
Strong convergence of modified iterative algorithm for family of asymptotically nonexpansive mappings
In this paper we introduce new modified implicit and explicit algorithms and prove strong convergence of the two algorithms to a common fixed point of a family of uniformly asymptotically regular asymptotically nonexpansive mappings in a real reflexive Banach space with a uniformly G$hat{a}$teaux differentiable norm. Our result is applicable in $L_{p}(ell_{p})$ spaces, $1 < p
متن کاملStrong convergence theorem for solving split equality fixed point problem which does not involve the prior knowledge of operator norms
Our contribution in this paper is to propose an iterative algorithm which does not require prior knowledge of operator norm and prove a strong convergence theorem for approximating a solution of split equality fixed point problem for quasi-nonexpansive mappings in a real Hilbert space. So many have used algorithms involving the operator norm for solving split equality fixed point problem, ...
متن کاملDistributed Asynchronous Algorithm for Cross-Entropy-Based Combinatorial Optimization
Combinatorial optimization algorithms are used in many and diverse applications; for instance, in the planning, management, and operation of manufacturing and logistic systems and communication networks. For scalability and dependability reasons, distributed and asynchronous implementations of these optimization algorithms have obvious advantages over centralized implementations. Several such a...
متن کاملConvergence rate of incremental aggregated gradient algorithms
Motivated by applications to distributed asynchronous optimization and large-scale data processing, we analyze the incremental aggregated gradient method for minimizing a sum of strongly convex functions from a novel perspective, simplifying the global convergence proofs considerably and proving a linear rate result. We also consider an aggregated method with momentum and show its linear conver...
متن کاملOn Unbounded Delays in Asynchronous Parallel Fixed-Point Algorithms
The need for scalable numerical solutions has motivated the development of asynchronous parallel algorithms, where a set of nodes run in parallel with little or no synchronization, thus computing with delayed information. This paper studies the convergence of the asynchronous parallel algorithm ARock under potentially unbounded delays. ARock is a general asynchronous algorithm that has many app...
متن کامل