Related papers: ${\cal T}$-class algorithms for pseudocontractions…
Existence and uniqueness as well as the iterative approximation of fixed points of enriched almost contractions in Banach spaces are studied. The obtained results are generalizations of the great majority of metric fixed point theorems, in…
The Lipschitz constant plays a crucial role in certifying the robustness of neural networks to input perturbations. Since calculating the exact Lipschitz constant is NP-hard, efforts have been made to obtain tight upper bounds on the…
We consider a large class of geodesic metric spaces, including Banach spaces, hyperbolic spaces and geodesic $\mathrm{CAT}(\kappa)$-spaces, and investigate the space of nonexpansive mappings on either a convex or a star-shaped subset in…
By using the Ishikawa iterative algorithm, we approximate the fixed points and the best proximity points of a relatively non expansive mapping. Also, we use the von Neumann sequence to prove the convergence result in a Hilbert space…
A Tychonoff space $X$ is called $\kappa$-pseudocompact if for every continuous mapping $f$ of $X$ into $\mathbb{R}^\kappa$ the image $f(X)$ is compact. This notion generalizes pseudocompactness and gives a stratification of spaces lying…
We adopt an operator-theoretic perspective to study convergence of linear fixed-point iterations and discrete- time linear systems. We mainly focus on the so-called Krasnoselskij-Mann iteration x(k+1) = ( 1 - \alpha(k) ) x(k) + \alpha(k) A…
We introduce compactness classes of Hilbert space operators by grouping together all operators for which the associated singular values decay at a certain speed and establish upper bounds for the norm of the resolvent of operators belonging…
This paper studies the problem of multichannel spectral super-resolution with either constant amplitude (CA) or not. We propose two optimization problems based on low-rank Hankel-Toeplitz matrix factorization. The two problems effectively…
Combinatorial algorithms are widely used for decision-making and knowledge discovery, and it is important to ensure that their output remains stable even when subjected to small perturbations in the input. Failure to do so can lead to…
We consider hierarchical variational inequality problems, or more generally, variational inequalities defined over the set of zeros of a monotone operator. This framework includes convex optimization over equilibrium constraints and…
We incorporate inertial terms in the hybrid proximal-extragradient algorithm and investigate the convergence properties of the resulting iterative scheme designed for finding the zeros of a maximally monotone operator in real Hilbert…
We focus on the linear convergence of generalized proximal point algorithms for solving monotone inclusion problems. Under the assumption that the associated monotone operator is metrically subregular or that the inverse of the monotone…
Qualitative and quantitative aspects for variational inequalities governed by strongly pseudomonotone operators on Hilbert space are investigated in this paper. First, we establish a global error bound for the solution set of the given…
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 introduce and study a general concept of multiple fixed point for mappings defined on partially ordered distance spaces in the presence of a contraction type condition and appropriate monotonicity properties. This notion and the obtained…
Motivated by Ridgway's proof of the perceptron algorithm, we study a simple subgradient method for convex inequality systems in Hilbert space. Assuming strict feasibility and bounded subgradients, we establish finite termination for several…
We investigate the convergence properties of exact and inexact forward-backward algorithms to minimise the sum of two weakly convex functions defined on a Hilbert space, where one has a Lipschitz-continuous gradient. We show that the exact…
In this article, we study the convergence of algorithms for solving monotone inclusions in the presence of adjoint mismatch. The adjoint mismatch arises when the adjoint of a linear operator is replaced by an approximation, due to…
We investigate an inertial viscosity-type Tseng's extragradient algorithm with a new step size to solve pseudomonotone variational inequality problems in real Hilbert spaces. A strong convergence theorem of the algorithm is obtained without…
We investigate quantitative estimates in periodic homogenization of second-order elliptic systems of elasticity with singular fourth-order perturbations. The convergence rates, which depend on the scale $\kappa$ that represents the strength…