Related papers: ${\cal T}$-class algorithms for pseudocontractions…
The binary perceptron problem asks us to find a sign vector in the intersection of independently chosen random halfspaces with intercept $-\kappa$. We analyze the performance of the canonical discrepancy minimization algorithms of…
Regular convergence, together with various other types of convergence, has been studied since the 1970s for the discrete approximations of linear operators. In this paper, we consider the eigenvalue approximation of compact operators whose…
In this paper, we investigate the inverse quasi-variational inequality problem in finite-dimensional spaces. First, we introduce a second-order dynamical system whose trajectory converges exponentially to the solution of the inverse…
The homogenization of elliptic divergence-type fourth-order operators with periodic coefficients is studied in a (periodic) domain. The aim is to find an operator with constant coefficients and represent the equation through a perturbation…
We study set-valued mappings defined by solution sets of parametric systems of equalities and inequalities. We prove Lipschitz-like continuity of these mappings under relaxed constant rank constraint qualification.
We consider a variation of the classical proximal-gradient algorithm for the iterative minimization of a cost function consisting of a sum of two terms, one smooth and the other prox-simple, and whose relative weight is determined by a…
In this paper, we study the strong convergence of an algorithm to solve the variational inequality problem which extends(Thong et al, Numerical Algorithms. 78, 1045-1060 (2018)). We have reduced and refined some of their algorithm's…
In this research article, we discuss two topics. Firstly, we introduce SCC-Map and $\phi$-contraction type $T$-coupling. By using these two definitions, we generalize $\phi$-contraction type coupling given by H. Aydi et al. [3] to…
We propose an abstract stochastic scheme for solving a broad range of monotone operator inclusion problems in Hilbert spaces. This framework allows for the introduction of stochasticity at several levels in monotone operator splitting…
We present a unified theoretical framework for parametric low-rank approximation, a research area devoted to the development of efficient algorithms that act as adaptive alternatives of traditional methods such as Singular Value…
Tseng's forward-backward-forward algorithm is a valuable alternative for Korpelevich's extragradient method when solving variational inequalities over a convex and closed set governed by monotone and Lipschitz continuous operators, as it…
The paper introduces and characterizes new notions of Lipschitzian and H\"olderian full stability of solutions to general parametric variational systems described via partial subdifferential and normal cone mappings acting in Hilbert…
We discuss some results concerning fixed point equations in the setting of topological *-algebras of unbounded operators. In particular, an existence result is obtained for what we have called {\em weak $\tau$ strict contractions}, and some…
Given a Hilbert space and a finite family of operators defined on the space, the common fixed point problem (CFPP) is to find a point in the intersection of the fixed point sets of these operators. Instances of the problem have numerous…
Lipschitz continuity of algorithms, introduced by Kumabe and Yoshida (FOCS'23), measures the stability of an algorithm against small input perturbations. Algorithms with small Lipschitz continuity are desirable, as they ensure reliable…
We consider stochastic variational inequality problems where the mapping is monotone over a compact convex set. We present two robust variants of stochastic extragradient algorithms for solving such problems. Of these, the first scheme…
We present and analyze a pollution-free Petrov-Galerkin multiscale finite element method for the Helmholtz problem with large wave number $\kappa$ as a variant of [Peterseim, ArXiv:1411.1944, 2014]. We use standard continuous $Q_1$ finite…
We study geometric variations of the discriminating code problem. In the \emph{discrete version} of the problem, a finite set of points $P$ and a finite set of objects $S$ are given in $\mathbb{R}^d$. The objective is to choose a subset…
A new, simple and unified approach in the theory of contractive mappings was recently given by Samet \emph{et al.} (Nonlinear Anal. 75, 2012, 2154-2165) by using the concepts of $\alpha$-$\psi$-contractive type mappings and…
We extend to $p$-uniformly convex spaces tools from the analysis of fixed point iterations in linear spaces. This study is restricted to an appropriate generalization of single-valued, pointwise $\alpha$-averaged mappings. Our main…