Some algorithms for solving mixed variational inequalities
From MaRDI portal
The authors propose some algorithms for solving mixed variational inequalities. The global convergence of these algorithms is established under pseudomonotonicity and continuity assumptions without Lipschitz conditions. Some numerical examples illustrate the proposed algorithms.
Recommendations
- New algorithms and convergence theorems for solving variational inequalities with non-Lipschitz mappings
- scientific article; zbMATH DE number 5525449
- A modified k-step resolvent algorithm for solving pseudomonotone general mixed variational inequalities
- Weak and strong convergence theorems for solving pseudo-monotone variational inequalities with non-Lipschitz mappings
- Proximal methods for mixed variational inequalities
Cited in
(8)- Hybrid algorithms for solving variational inequalities, variational inclusions, mixed equilibria, and fixed point problems
- A cutting hyperplane projection method for solving generalized quasi-variational inequalities
- On Gabay's algorithms for mixed variational inequalities
- An improved projection method for solving generalized variational inequality problems
- A derivative-based algorithm for a particular class of mixed variable optimization problems
- A modified k-step resolvent algorithm for solving pseudomonotone general mixed variational inequalities
- A double projection algorithm for multi-valued variational inequalities and a unified framework of the method
- Inexact model: a framework for optimization and variational inequalities
This page was built for publication: Some algorithms for solving mixed variational inequalities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2496523)
