A potential reduction algorithm for monotone variational inequality problems
From MaRDI portal
A potential reduction algorithm is proposed and analyzed for a class of monotone variational inequalities. It is proved that the algorithm is globally convergent. Several example are given to illustrate the efficiency of this algorithm. It is shown that the total number of iterations is very small. Comparison of this method with previous methods will be an interesting problem for future research.
Recommendations
- An explicit algorithm for solving monotone variational inequalities
- An explicit algorithm for monotone variational inequalities
- A descent algorithm for solving monotone variational inequalities and monotone complementarity problems
- An extragradient algorithm for monotone variational inequalities
- Algorithms for monotone vector variational inequalities
- A reduction method for variational inequalities
- A potential reduction algorithm for linearly constrained convex programming
- A method for solving monotone variational inequalities
- A modified homogeneous potential reduction algorithm for solving the monotone semidefinite linear complementarity problem
- A class of iterative methods for solving monotone variational inequality problems
This page was built for publication: A potential reduction algorithm for monotone variational inequality problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2721906)
