Related papers: Algorithms Based on Unions of Nonexpansive Maps
In this paper, we unify all know iterative methods by introducing a new explicit iterative scheme for approximation of common fixed points of finite families of total asymptotically $I$-nonexpansive mappings. Note that such a scheme…
Motivated by Pryce's structural index reduction method for differential algebraic equations (DAEs), we show the complexity of the fixed-point iteration algorithm and propose a fixed-point iteration method with parameters. It leads to a…
This paper introduces a systematic methodological framework to design and analyze distributed algorithms for optimization and games over networks. Starting from a centralized method, we identify an aggregation function involving all the…
The main purpose of this paper is to extend some fixed point results for single valued $b$-enriched nonexpansive mappings to the case of multivalued mappings. To this end, we introduce *-$b$-enriched nonexpansive mappings, as a…
In this present article, we get sufficient conditions for the existence and uniqueness of fixed points and common fixed points for single and double mapping satisfying various contractive conditions within the partially ordered…
This paper investigates the problem of finding a fixed point for a global nonexpansive operator under time-varying communication graphs in real Hilbert spaces, where the global operator is separable and composed of an aggregate sum of local…
We study a fixed point iterative method based on generalized relaxation of strictly quasi-nonexpansive operators. The iterative method is assembled by averaging of strings, and each string is composed of finitely many strictly…
We introduce a framework for online structure theory. Our approach generalises notions arising independently in several areas of computability theory and complexity theory. We suggest a unifying approach using operators where we allow the…
In this paper, we study the nonexpansive properties of metric resolvent, and present a convergence rate analysis for the associated fixed-point iterations (Banach-Picard and Krasnosel'skii-Mann types). Equipped with a variable metric, we…
Let $X$ be a complex Banach space with $\dim X\geq3$ and $B(X)$ the algebra of all bounded linear operators on $X$. Suppose $\phi:B(X)\longrightarrow B(X)$ is a surjective map satisfying the following property: $Fix(AB)=Fix(\phi(A)\phi(B)),…
Using tools from topology and functional analysis, we provide a framework where artificial neural networks, and their architectures, can be formally described. We define the notion of machine in a general topological context and show how…
This paper seeks to advance the theory of nonexpansive mappings by introducing and exploring a novel class of nonexpansive type mappings, which we aptly designate as perimetric nonexpansive mappings. We establish that the collection of…
We introduce regularity notions for averaged nonexpansive operators. Combined with regularity notions of their fixed point sets, we obtain linear and strong convergence results for quasicyclic, cyclic, and random iterations. New convergence…
In the renormalisation analysis of critical phenomena in quasi-periodic systems, a fundamental role is often played by fixed points of functional recurrences of the form \begin{equation*} f_{n}(x) = \sum_{i=1}^\ell a_i(x) f_{n_i}…
In this paper, a new optimization framework is defined that includes the optimization framework recently proposed in [1]-[2] as a special case. The convex optimization in [1]-[2] includes centralized optimization and distributed…
Starting from a result of Stewart, Tijdeman and Ruzsa on iterated difference sequences, we introduce the notion of iterated compositions of linear operations. We prove a general result on the stability of such compositions (with bounded…
This paper investigates how the compositional structure of neural networks shapes their optimization landscape and training dynamics. We analyze the gradient flow associated with overparameterized optimization problems, which can be…
In this work, using a new geometrical approach we study to the existence of the fixed-point of mappings that independence of the smoothness, and also of their single-values or multi-values. This work proved the theorems that generalize in…
Motivated by federated learning, we consider the hub-and-spoke model of distributed optimization in which a central authority coordinates the computation of a solution among many agents while limiting communication. We first study some past…
Many iterative optimization algorithms involve compositions of special cases of Lipschitz continuous operators, namely firmly nonexpansive, averaged and nonexpansive operators. The structure and properties of the compositions are of…