Burachik, Regina S.; Lopes, Jurandir O.; da Silva, Geci J. P. An inexact interior point proximal method for the variational inequality problem. (English) Zbl 1169.65063 Comput. Appl. Math. 28, No. 1, 15-36 (2009). An inexact interior point proximal method is developed for solving variational inequality problems with maximal monotone operators and linear constraints. The generalized proximal methods used for solving this kind of constrained convex optimization problems make the assumption that the feasible region has nonempty interior. The “extragradient algorithm” developed in this work is also applicable for problems whose feasible region may have empty interior. A full convergence analysis of the algorithm is performed. A numerical implementation of the algorithm is not presented. Reviewer: Bülent Karasözen (Ankara) Cited in 19 Documents MSC: 65K10 Numerical optimization and variational techniques 47J20 Variational and other types of inequalities involving nonlinear operators (general) 49J40 Variational inequalities 49J52 Nonsmooth analysis 49J53 Set-valued and variational analysis Keywords:maximal monotone operators; outer approximation algorithm; global convergence; inexact interior point proximal method; variational inequality PDFBibTeX XMLCite \textit{R. S. Burachik} et al., Comput. Appl. Math. 28, No. 1, 15--36 (2009; Zbl 1169.65063) Full Text: Link