We propose and study the iteration-complexity of an inexact version of the Spingarn’s partial inverse method. Its complexity analysis is performed by viewing it in the framework of the hybrid proximal extragradient (HPE) method, for which pointwise and ergodic iteration-complexity has been established recently by Monteiro and Svaiter. As applications, we propose and analyze the iteration-comple...

In this paper, we extend the improved pointwise iteration-complexity result of a dynamic regularized alternating direction method of multipliers (ADMM) for a new stepsize domain. In this complexity analysis, the stepsize parameter can even be chosen in the interval (0, 2) instead of interval (0, (1 + √ 5)/2). As usual, our analysis is established by interpreting this ADMM variant as an instance...

This paper presents and studies the iteration-complexity of two new inexact variants of Rockafellar’s proximal method of multipliers (PMM) for solving convex programming (CP) problems with a finite number of functional inequality constraints. In contrast to the first variant which solves convex quadratic programming (QP) subproblems at every iteration, the second one solves convex constrained q...

We consider the forward-backward splitting method for nding a zero of the sum of two maximal monotone mappings. This method is known to converge when the inverse of the forward mapping is strongly monotone. We propose a modiication to this method, in the spirit of the extragradient method for monotone variational inequalities, under which the method converges assuming only the forward mapping i...

A new framework for analyzing Fejér convergent algorithms is presented. Using this framework we define a very general class of Fejér convergent algorithms and establish its convergence properties. We also introduce a new definition of approximations of resolvents which preserve some useful features of the exact resolvent, and use this concept to present an unifying view of the Forward-Backward ...

Correspondence: jwpeng6@yahoo. com.cn School of Mathematics, Chongqing Normal University, Chongqing 400047, PR China Abstract In this article, we introduce some new iterative schemes based on the extragradient method (and the hybrid method) for finding a common element of the set of solutions of a generalized equilibrium problem, and the set of fixed points of a family of infinitely nonexpansiv...

In this paper, we consider the algorithm proposed in recent years by Censor, Gibali and Reich, which solves split variational inequality problem, and Korpelevich's extragradient method, which solves variational inequality problems. As our main result, we propose an iterative method for finding an element to solve a class of split variational inequality problems under weaker conditions and get a...

Abstract In a real Banach space, let the VI indicate variational inclusion for two accretive operators and CFPP denote common fixed point problem of countably many nonexpansive mappings. this article, we introduce generalized extragradient implicit method solving general system inequalities (GSVI) with constraints. Strong convergence suggested to solution GSVI constraints under some suitable as...