Related papers: Weak convergence theorems for a symmetric generali…
The problem of minimizing the sum of nonsmooth, convex objective functions defined on a real Hilbert space over the intersection of fixed point sets of nonexpansive mappings, onto which the projections cannot be efficiently computed, is…
Parallel and cyclic projection algorithms are proposed for minimizing the sum of a finite family of convex functions over the intersection of a finite family of closed convex subsets of a Hilbert space. These algorithms are of…
In this paper, inspired by Iemoto and Takahashi [S. Iemoto, W. Takahashi, Nonlinear Analysis 71, (2009), 2082-2089], we study the Halpern's method to approximate strongly fixed points of a nonexpansive mapping and of a nonspreading mapping.…
We consider strongly-convex-strongly-concave saddle-point problems with general non-bilinear objective and different condition numbers with respect to the primal and the dual variables. First, we consider such problems with smooth composite…
In this paper, we study the weak sharpness of the solution set of variational inequality problem (in short, VIP) and the finite convergence property of the sequence generated by some algorithm for finding the solutions of VIP. In…
In this paper, we propose and analyze a fast two-point gradient algorithm for solving nonlinear ill-posed problems, which is based on the sequential subspace optimization method. A complete convergence analysis is provided under the…
This paper is concerned with the study of a family of fixed point iterations combining relaxation with different inertial (acceleration) principles. We provide a systematic, unified and insightful analysis of the hypotheses that ensure…
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…
This paper addresses the approximation of fractional harmonic maps. Besides a unit-length constraint, one has to tackle the difficulty of nonlocality. We establish weak compactness results for critical points of the fractional Dirichlet…
We present W-cycle multigrid algorithms for the solution of the linear system of equations arising from a wide class of $hp$-version discontinuous Galerkin discretizations of elliptic problems. Starting from a classical framework in…
A new weak Galerkin (WG) finite element method is introduced and analyzed in this paper for the biharmonic equation in its primary form. This method is highly robust and flexible in the element construction by using discontinuous piecewise…
The main purpose of this paper is to exhibit a simple variational setting for finding fully nontrivial solutions to the weakly coupled elliptic system (1.1). We show that such solutions correspond to critical points of a…
Algorithms for min-max optimization and variational inequalities are often studied under monotonicity assumptions. Motivated by non-monotone machine learning applications, we follow the line of works [Diakonikolas et al., 2021, Lee and Kim,…
In this paper we accomplish the development of the fast rank-adaptive solver for tensor-structured symmetric positive definite linear systems in higher dimensions. In [arXiv:1301.6068] this problem is approached by alternating minimization…
Strong convergence of a new iterative process based on the Shrinking projection method to a common element of the set of common fixed points of an infinite family of relatively quasi-nonexpansive multivalued mappings and the solution set of…
In this paper, we develop rapidly convergent forward-backward algorithms for computing zeroes of the sum of finitely many maximally monotone operators. A modification of the classical forward-backward method for two general operators is…
Interior-point methods for linear programming problems require the repeated solution of a linear system of equations. Solving these linear systems is non-trivial due to the severe ill-conditioning of the matrices towards convergence. This…
It is well known that as a famous type of iterative methods in numerical linear algebra, Gauss-Seidel iterative methods are convergent for linear systems with strictly or irreducibly diagonally dominant matrices, invertible $H-$matrices…
Let $X$ be a real Banach space with a normalized duality mapping uniformly norm-to-weak$^\star$ continuous on bounded sets or a reflexive Banach space which admits a weakly continuous duality mapping $J_{\Phi}$ with gauge $\phi$. Let $f$ be…
We establish common fixed point theorems for two pairs of weakly compatible self-mappings using an auxiliary function of two variables. Unlike classical results, our theorems do not assume continuity of the mappings and require completeness…