We propose an inertial Douglas–Rachford splitting algorithm for finding the set of zeros of
the sum of two maximally monotone operators in Hilbert spaces and investigate its …

In this article, we propose a new efficient self‐adaptive method and prove that it converges
strongly to a minimum‐norm solution of a generalized split feasibility problem in real Hilbert …

In this paper, we obtain successively weak, strong and linear convergence analysis of the
sequence of iterates generated by our proposed subgradient extragradient method with …

Convergent sequences of real numbers play a fundamental role in many different problems
in system theory, eg, in Lyapunov stability analysis, as well as in optimization theory and …

In this article, we first introduce a modified inertial Mann algorithm and an inertial CQ-
algorithm by combining the accelerated Mann algorithm and the CQ-algorithm with the …

We propose a forward–backward proximal-type algorithm with inertial/memory effects for
minimizing the sum of a nonsmooth function with a smooth one in the nonconvex setting …

In this paper, we present two new relaxed inertial subgradient extragradient methods for
solving variational inequality problems in a real Hilbert space. We establish the …

In this paper, we introduce an algorithm as combination between the subgradient
extragradient method and inertial method for solving variational inequality problems in …

We introduce and investigate the convergence properties of an inertial forward-backward-
forward splitting algorithm for approaching the set of zeros of the sum of a maximally …

In this work, we propose a new version of inertial relaxed CQ algorithms for solving the split
feasibility problems in the frameworks of Hilbert spaces. We then prove its strong …