The aim of this paper is to propose a new iterative algorithm approximate the solution for variational inequality problem in real Hilbert spaces. A strong convergence result above established under certain mild conditions. Our proposed method requires computation only one projection onto feasible set each iteration. Some numerical examples are presented support that our performs better than som...

In this paper, we consider both a variant of Tseng’s modified forward-backward splitting method and an extension of Korpelevich’s method for solving generalized variational inequalities with Lipschitz continuous operators. By showing that these methods are special cases of the hybrid proximal extragradient (HPE) method introduced by Solodov and Svaiter, we derive iteration-complexity bounds for...

We introduce composite implicit and explicit iterative algorithms for solving a general system of variational inequalities and a common fixed point problem of an infinite family of nonexpansive mappings in a real smooth and uniformly convex Banach space.These composite iterative algorithms are based on Korpelevich’s extragradient method and viscosity approximation method. We first consider and ...

Abstract In this paper, we propose a new inertial iterative method to solve classical variational inequalities with pseudomonotone and Lipschitz continuous operators in the setting of real Hilbert space. The proposed scheme is basically analogous extragradient used problems spaces. strong convergence algorithm set up prior knowledge Lipschitz’s constant an operator. Finally, several computation...

* Correspondence: [email protected]. vn Department of Scientific Fundamentals, Posts and Telecommunications Institute of Technology, Hanoi, Vietnam Full list of author information is available at the end of the article Abstract In this article, we present a new iteration method for finding a common element of the set of fixed points of p strict pseudocontractions and the set of solutions of equili...

This paper presents a novel learning algorithm for structured classification, where the task is to predict multiple and interacting labels (multilabel) for an input object. The problem of finding a large-margin separation between correct multilabels and incorrect ones is formulated as a linear program. Instead of explicitly writing out the entire problem with an exponentially large constraint s...