An inexact interior point proximal method for the variational inequality problem

Abstract

Abstract.We propose an infeasible interior proximal method for solving variational inequality problems with maximal monotone operators and linear constraints. The interior proximal method proposed by Auslender, Teboulle and Ben-Tiba [3] is a proximal method using a distance-like barrier function and it has a global convergence property under mild assumptions. However, this method is applicable only to problems whose feasible region has nonempty interior. The algorithm we propose is applicable to problems whose feasible region may have empty interior. Moreover, a new kind of inexact scheme is used. We present a full convergence analysis for our algorithm.Mathematical subject classification: 90C51, 65K10, 47J20, 49J40, 49J52, 49J53.

A Projection Algorithm for Non-Monotone Variational Inequalities

“…ykgox which imply that the sequences (x i k ) k∈N and (ỹ i k ) k∈N have the same cluster points. From the definition of α k in Algorithm F,ỹ k does not satisfy the inequality (10), that is, for all…”

The hybrid algorithm for the system of mixed equilibrium problems, the general system of finite variational inequalities and common fixed points for nonexpansive semigroups and strictly pseudo-contractive mappings

“…The mixed equilibrium problems include fixed point problems, variational inequality problems, optimization problems, Nash equilibrium problems, noncooperative games, economics and the equilibrium problem as special cases (see [9][10][11][12][13][14][15][16][17][18][19]). In the last two decades, many articles have appeared in the literature on the existence of solutions of equilibrium problems; see, for example [13] and references therein.…”

The Extragradient Method for Solving Variational Inequalities in the Presence of Computational Errors

“…The studies of gradient-type methods and variational inequalities are important topics in optimization theory; see, for example, [1][2][3][4][5][6][7][8][9][10][11][12] and the references mentioned therein. In the present paper, we study convergence of the subgradient method, introduced in [13] and known in the literature as the extragradient method (see also [14,Chapter 12]) to a solution of a variational inequality in a Hilbert space, under the presence of computational errors.…”