Results 21 to 30 of about 429,862 (310)
On Discontinuity Problem at Fixed Point
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
R. P. Pant +2 more
openaire +3 more sources
The fixed point problem of a simple reversible language [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Armando B. Matos +2 more
openaire +2 more sources
Δ-convergence for proximal point algorithm and fixed point problem in CAT(0) spaces
In this paper, we prove the Δ-convergence of a modified proximal point algorithm for common fixed points in a CAT(0) space for different classes of generalized nonexpansive mappings including a total asymptotically nonexpansive mapping, a multivalued ...
Shamshad Husain, Nisha Singh
doaj +1 more source
On the nonlinear implicit complementarity problem
In this paper, we consider a new class of implicit complementarity problem and study the existence of its solution. An iterative algorithm is also given to find the approximate solution of the new problem and prove that this approximate solution ...
A. H. Siddiqi, Q. H. Ansari
doaj +1 more source
The split common fixed point problem for infinite families of demicontractive mappings
In this paper, we propose a new algorithm for solving the split common fixed point problem for infinite families of demicontractive mappings. Strong convergence of the proposed method is established under suitable control conditions.
Adisak Hanjing, Suthep Suantai
doaj +1 more source
A dual problem to least fixed points
AbstractAfter a simple and convenient generalization of the notion of continuous functions and continuous lattices we answer the following question: when for a given element x of a complete lattice there is a least continuous function having x as a least fixed point?
V. L. Nguyen, Jean-Louis Lassez
openaire +2 more sources
Convergence Rate Analysis for Averaged Fixed Point Iterations in Common Fixed Point Problems [PDF]
Summary: In this paper, we establish sublinear and linear convergence of fixed point iterations generated by averaged operators in a Hilbert space. Our results are achieved under a bounded Hölder regularity assumption which generalizes the well-known notion of bounded linear regularity.
Jonathan M. Borwein +2 more
openaire +3 more sources
Complexity of fixed point counting problems in Boolean networks [PDF]
A Boolean network (BN) with $n$ components is a discrete dynamical system described by the successive iterations of a function $f:\{0,1\}^n \to \{0,1\}^n$. This model finds applications in biology, where fixed points play a central role. For example, in genetic regulations, they correspond to cell phenotypes.
Florian Bridoux +3 more
openaire +3 more sources
Fixed point structures on a set-mapping pair and cartesian product
In this paper we study the following problem (Problem 4.2 in, I.A. Rus, Sets with structure, mappings and fixed point property: fixed point structures, Fixed Point Theory 23, No. 2 (2022), 689-706):
Rus Ioan A., Şerban Marcel-Adrian
doaj +1 more source
A note on two fixed point problems
The authors discuss and extend the applicability of the exterior ellipsoid algorithm for approximating the fixed points of a system of nonlinear equations. It is shown that the ellipsoid algorithms could be extended and applied to larger classes of functions that are only nonexpanding in the direction of fixed points.
Ch. Boonyasiriwat +2 more
openaire +2 more sources

