Results 81 to 90 of about 1,226,787 (172)
In a real Hilbert space, let GSVI and CFPP represent a general system of variational inequalities and a common fixed point problem of a countable family of nonexpansive mappings and an asymptotically nonexpansive mapping, respectively. In this paper, via
Long He +5 more
doaj +1 more source
Efficient Algorithm for the Nonadditive Traffic Assignment Problem With Link Capacity Constraints
This paper presents an insightful examination of the modeling and efficient solution algorithm for the link capacitated nonadditive traffic assignment problem (CNaTAP) to provide highly accurate flow solutions for large‐scale networks. Despite the increasing significance of the CNaTAP, the ability to efficiently solve it for satisfactory accuracy in ...
Wangxin Hu +3 more
wiley +1 more source
Convergences of Weighted Averaged Operators in p‐Uniformly Convex Metric Spaces
This paper presents improvements to theorems concerning the △‐convergence of iterative sequences in p‐uniformly convex metric spaces. The analysis focuses on sequences generated by weighted average operators applied to pairs of simultaneous quasi‐nonexpansive mappings.
Anawat Rodchan +2 more
wiley +1 more source
Strong convergence theorems for a semigroup of asymptotically nonexpansive mappings
The authors consider a strongly continuous semigroup \(T(t)\), \(t\geq 0\), of asymptotically nonexpansive operators on a closed convex subset \(K\) of a real Banach space. The set of common fixed points of the semigroup \(T(t)\) is assumed to be nonempty. Under certain assumptions, the authors establish that the implicit and explicit sequences \(u_n\)
Habtu Zegeye +2 more
openaire +3 more sources
A globally convergent composite‐step trust‐region framework for real‐time optimization
Abstract Inaccurate models limit the performance of model‐based real‐time optimization (RTO) and even cause system instability. Therefore, a RTO framework that guarantees global convergence in the presence of plant‐model mismatch is desired. In this regard, the trust‐region framework is intuitive and simple to implement for unconstrained problems ...
Duo Zhang +3 more
wiley +1 more source
Iterative Sequences for Asymptotically Quasi-nonexpansive Mappings
Some sufficient and necessary conditions are obtained for Ishikawa iterative sequences of asymtotically quasi-nonexpansive mappings to converge to their respective fixed points.
openaire +2 more sources
A Modified Iterative Approach for Fixed Point Problem in Hadamard Spaces
The role of iterative algorithms is vital in exploring the diverse domains of science and has proven to be a powerful tool for solving complex computational problems in the most trending branches of computer science. Taking motivation from this fact, we develop and apply a modified four‐step iterative algorithm to solve the fixed point problem in the ...
Asifa Tassaddiq +6 more
wiley +1 more source
Fibonacci–Mann Iteration for Monotone Asymptotically Nonexpansive Mappings in Modular Spaces
In this work, we extend the fundamental results of Schu to the class of monotone asymptotically nonexpansive mappings in modular function spaces. In particular, we study the behavior of the Fibonacci–Mann iteration process, introduced recently by ...
Mohamed A Khamsi +1 more
core +1 more source
Convergence Theorems for Two Simultaneous Quasinonexpansive Mappings in Banach Spaces
We discuss the approximation method of finding a common fixed point of two certain mappings defined on a Banach space. This paper deals with three modes of convergence, namely, weak, strong, and △‐convergences in the presence of the uniform convexity of the norm.
Satit Saejung +2 more
wiley +1 more source
Rates of asymptotic regularity for Halpern iterations of nonexpansive mappings
in C.S. Calude, G. Stefanescu, and M. Zimand (eds.), Combinatorics and Related Areas.
openaire +3 more sources

