相关论文: The fixed point iteration of positive concave mapp…
This study presents novel methods for computing fixed points of positive concave mappings and for characterizing the existence of fixed points. These methods are particularly important in planning and optimization tasks in wireless…
Important problems in wireless networks can often be solved by computing fixed points of standard or contractive interference mappings, and the conventional fixed point algorithm is widely used for this purpose. Knowing that the mapping…
Our work presents a new iterative scheme to approximate the fixed points of nonexpansive mapping. The proposed algorithm is constructed to enhance convergence efficiency while preserving theoretical robustness. Under appropriate assumptions…
We derive conditions for the existence of fixed points of cone mappings without assuming scalability of functions. Monotonicity and scalability are often inseparable in the literature in the context of searching for fixed points of…
We introduce a fixed point iteration process built on optimization of a linear function over a compact domain. We prove the process always converges to a fixed point and explore the set of fixed points in various convex sets. In particular,…
We develop a framework for quantitative convergence analysis of Picard iterations of expansive set-valued fixed point mappings. There are two key components of the analysis. The first is a natural generalization of single-valued averaged…
Firmly nonexpansive mappings play an important role in metric fixed point theory and optimization due to their correspondence with maximal monotone operators. In this paper we do a thorough study of fixed point theory and the asymptotic…
We introduce a weak asymptotic version of nonlinear contraction, termed \emph{asymptotic pointwise contraction}. For a mapping on a metric space, this notion requires the existence of a sequence of functions that dominate the distances…
In this study we establish connections between asymptotic functions and properties of solutions to important problems in wireless networks. We start by introducing a class of self-mappings (called asymptotic mappings) constructed with…
This paper provides a fixed point theorem and iterative construction of a common fixed point for a general class of nonlinear mappings in the setup of uniformly convex hyperbolic spaces. We translate a multi-step iteration, essentially due…
This paper concerns models and convergence principles for dealing with stochasticity in a wide range of algorithms arising in nonlinear analysis and optimization in Hilbert spaces. It proposes a flexible geometric framework within which…
Nonexpansive mappings play a central role in modern optimization and monotone operator theory because their fixed points can describe solutions to optimization or critical point problems. It is known that when the mappings are sufficiently…
We extend to $p$-uniformly convex spaces tools from the analysis of fixed point iterations in linear spaces. This study is restricted to an appropriate generalization of single-valued, pointwise $\alpha$-averaged mappings. Our main…
We show that a continuous map or a continuous flow on $\R^{n}$ with a certain recurrence relation must have a fixed point. Specifically, if there is a compact set W with the property that the forward orbit of every point in $\R^{n}$…
The concept of asymptotically nonexpansive mappings is an important generalization of the class of nonexpansive mappings. Implicit midpoint procedures are extremely fundamental for solving equations involving nonlinear operators. This paper…
In the setting of CAT(k) spaces, common fixed point iterations built from prox mappings (e.g. prox-prox, Krasnoselsky-Mann relaxations, nonlinear projected-gradients) converge locally linearly under the assumption of linear metric…
We estimate convergence rates for fixed-point iterations of a class of nonlinear operators which are partially motivated from solving convex optimization problems. We introduce the notion of the generalized averaged nonexpansive (GAN)…
We present necessary conditions for monotonicity, in one form or another, of fixed point iterations of mappings that violate the usual nonexpansive property. We show that most reasonable notions of linear-type monotonicity of fixed point…
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 use fixed point theory to analyze nonnegative neural networks, which we define as neural networks that map nonnegative vectors to nonnegative vectors. We first show that nonnegative neural networks with nonnegative weights and biases can…