Results 21 to 30 of about 7,821,983 (355)
An inertial extrapolation method for multiple-set split feasibility problem
Journal of Inequalities and Applications, 2020 In this paper, we propose an iterative algorithm with inertial extrapolation to approximate the solution of multiple-set split feasibility problem. Based on Lopez et al. (Inverse Probl.
Guash Haile Taddele +2 more
doaj +1 more source
Scientific Reports, 2021 The study concerns with the mechanical characteristics of heat and mass transfer flow of a second grade nanofluid as well as gyrotatic microorganism motion past a thin needle with dipole effect, entropy generation, thermal radiation, Arrhenius activation
Muhammad Ramzan +2 more
doaj +1 more source
Advances in Difference Equations, 2020 Iterative algorithms are widely applied to solve convex optimization problems under a suitable set of constraints. In this paper, we develop an iterative algorithm whose architecture comprises a modified version of the forward-backward splitting ...
Yasir Arfat +3 more
doaj +1 more source
Fixed points and homotopy fixed points
Commentarii Mathematici Helvetici, 1988 Let G be a finite group, EG be a free contractible G-space, and define \(X^{hG}=Map_ G(EG,X)\) (equivariant mapping space). The main theorem of this paper proves that the following two statements are equivalent (Theorem A): (1) G is a p-group. (2) For every finite G-simplicial complex X, the fixed point set \(X^ G=\emptyset\) if and only if \(X^{hG ...
Zabrodsky, A., Dror Farjoun, E.
openaire +1 more source
A Proof That Anderson Acceleration Improves the Convergence Rate in Linearly Converging Fixed-Point Methods (But Not in Those Converging Quadratically) [PDF]
SIAM Journal on Numerical Analysis, 2018 This paper provides the first proof that Anderson acceleration (AA) improves the convergence rate of general fixed point iterations. AA has been used for decades to speed up nonlinear solvers in many applications, however a rigorous mathematical ...
Claire Evans +3 more
semanticscholar +1 more source
Bulletin of the American Mathematical Society, 1982 A fixed point algebra (FPA) is a pair \(\) of Boolean algebras satisfying the following properties: (1) Each \(\alpha \in B\) is a mapping from A into A; (2) Boolean operations in B are pointwise on A; (3) each constant mapping on A is an element of B; (4) each \(\alpha \in B\) has a fixed point in A.
openaire +2 more sources
Globally Convergent Type-I Anderson Acceleration for Nonsmooth Fixed-Point Iterations [PDF]
SIAM Journal on Optimization, 2018 We consider the application of the type-I Anderson acceleration to solving general non-smooth fixed-point problems. By interleaving with safe-guarding steps, and employing a Powell-type regularization and a re-start checking for strong linear ...
Junzi Zhang +2 more
semanticscholar +1 more source
Scientific Reports, 2021 In this paper, a numerical study of MHD steady flow due to a rotating disk with mixed convection, Darcy Forchheimer’s porous media, thermal radiation, and heat generation/absorption effects are explored.
Muhammad Ramzan +3 more
doaj +1 more source
Advances in Difference Equations, 2021 We consider an optimal control problem for a time-dependent obstacle variational inequality involving fractional Liouville–Caputo derivative. The obstacle is considered as the control, and the corresponding solution to the obstacle problem is regarded as
Parinya Sa Ngiamsunthorn +2 more
doaj +1 more source
Ain Shams Engineering Journal, 2021 In this note, we propose a modification as an alternative to remove the assumption of uniformly monotone as assumed in Aliyu et al. (2019). Numerical experiment shows that the modification improves the numerical performance of the method.
Abdulkarim Hassan Ibrahim, Poom Kumam
doaj +1 more source