Related papers: An inertial shrinking projection algorithm for spl…

In this work we consider stochastic gradient descent (SGD) for solving linear inverse problems in Banach spaces. SGD and its variants have been established as one of the most successful optimisation methods in machine learning, imaging and…

We present an algorithmic contribution to improve the efficiency of robust trim-fitting in outlier affected geometric regression problems. The method heavily relies on the quick sort algorithm, and we present two important insights. First,…

In the context of convex optimization problems in Hilbert spaces, we induce inertial effects into the classical ADMM numerical scheme and obtain in this way so-called inertial ADMM algorithms, the convergence properties of which we…

This paper presents an improved forward-backward splitting algorithm with two inertial parameters. It aims to find a point in the real Hilbert space at which the sum of a co-coercive operator and a maximal monotone operator vanishes. Under…

In general Banach spaces, the metric projection map lacks the powerful properties it enjoys in Hilbert spaces. There are a few generalized projections that have been proposed in order to resolve many of the deficiencies of the metric…

In this paper, we prove several fixed point theorems on both of normal partially ordered Banach spaces and regular partially ordered Banach spaces by using the normality, regularity, full regularity, and chain -complete property. Then, by…

In this paper, we study the existence of fixed points for mappings defined on complete (compact) metric space (X, d) satisfying a general contractive (contraction) inequality depended on another function. These conditions are analogous to…

This work investigates a Bregman and inertial extension of the forward-reflected-backward algorithm [Y. Malitsky and M. Tam, SIAM J. Optim., 30 (2020), pp. 1451--1472] applied to structured nonconvex minimization problems under relative…

We develop a semismooth Newton framework for the numerical solution of fixed-point equations that are posed in Banach spaces. The framework is motivated by applications in the field of obstacle-type quasi-variational inequalities and…

We consider the stochastic generalized Nash equilibrium problem (SGNEP) with joint feasibility constraints and expected-value cost functions. We propose a distributed stochastic projected reflected gradient algorithm and show its almost…

Projective splitting is a family of methods for solving inclusions involving sums of maximal monotone operators. First introduced by Eckstein and Svaiter in 2008, these methods have enjoyed significant innovation in recent years, becoming…

We introduce an abstract algorithm that aims to find the Bregman projection onto a closed convex set. As an application, the asymptotic behaviour of an iterative method for finding a fixed point of a quasi Bregman nonexpansive mapping with…

We apply a modern axiomatic system of nonstandard analysis in metric fixed point theory. In particular, we formulate a nonstandard iteration scheme for nonexpansive mappings and present a nonstandard approach to fixed-point problems in…

In this paper we study nonconvex and nonsmooth optimization problems with semi-algebraic data, where the variables vector is split into several blocks of variables. The problem consists of one smooth function of the entire variables vector…

We survey several applications of fixed point theorems in the theory of invariant subspaces. The general idea is that a fixed point theorem applied to a suitable map yields the existence of invariant subspaces for an operator on a Banach…

Aligning partially overlapping point sets where there is no prior information about the value of the transformation is a challenging problem in computer vision. To achieve this goal, we first reduce the objective of the robust point…

This article analyses the simple projection method proposed by Izuchukwu et al. [8, Algorithm 3.2] for solving variational inequality problems by incorporating momentum terms. A new step size strategy is also introduced, in which the step…

We introduce a new extragradient iterative process, motivated and inspired by [S. H. Khan, A Picard-Mann Hybrid Iterative Process, Fixed Point Theory and Applications, doi:10.1186/1687-1812-2013-69], for finding a common element of the set…

We prove global convergence of classical projection algorithms for feasibility problems involving union convex sets, which refer to sets expressible as the union of a finite number of closed convex sets. We present a unified strategy for…

Suppose that E is a Banach space, {\tau} a topology under which the norm of E becomes {\tau}-lower semicontinuous and S a commuting family of {\tau}-continuous nonexpansive mappings defined on a {\tau}-compact convex subset C of E: It is…