Descent method with inexact linesearch for mixed variational inequalities
From MaRDI portal
Publication:1037072
DOI10.3103/S1066369X09080052zbMath1175.49008MaRDI QIDQ1037072
Publication date: 13 November 2009
Published in: Russian Mathematics (Search for Journal in Brave)
Variational inequalities (49J40) Newton-type methods (49M15) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items (4)
The extragradient method for solving variational inequalities in the presence of computational errors ⋮ A proximal point algorithm for finding a common zero of a finite family of maximal monotone operators in the presence of computational errors ⋮ Relative rotation and variational inequalities ⋮ Solution method for monotone mixed variational inequalities
Cites Work
- Unnamed Item
- Unnamed Item
- Application of the proximal point method to nonmonotone equilibrium problems
- Descent methods for monotone equilibrium problems in Banach spaces
- Equivalent differentiable optimization problems and descent methods for asymmetric variational inequality problems
- Nonlinear programming and variational inequality problems. A unified approach
- On convergence of descent methods for variational inequalities in a Hilbert space
- \(D\)-gap functions and descent methods for a class of monotone equilibrium problems
- Combined relaxation methods for variational inequalities
- The method of descent over an interval function for nonsmooth equilibrium problems
- Variational principles for variational inequalities
- Merit functions and descent algorithms for a class of variational ineqality problems
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- ON THE UNIFICATION OF THE CALCULUS OF VARIATIONS AND THE THEORY OF MONOTONE NONLINEAR OPERATORS IN BANACH SPACES
This page was built for publication: Descent method with inexact linesearch for mixed variational inequalities
