A potential reduction algorithm for monotone variational inequality problems
type: Item
instance of: scholarly article
zbMATH Open document ID: 0979.49010
author: Ximing Liang
author: Jianbo Hu
author: Cheng-Xian Xu
publication date: 2001-07-11T00:00:00Z
Mathematics Subject Classification ID: 49J40
Mathematics Subject Classification ID: 90C33
zbMATH DE Number: 1616950
zbMATH Keywords: iterative scheme
zbMATH Keywords: convergence criteria
zbMATH Keywords: monotone variational inequalities
zbMATH Keywords: algorithm
MaRDI profile type: Publication
Recommended article: An explicit algorithm for solving monotone variational inequalities
Recommended article: An explicit algorithm for monotone variational inequalities
Recommended article: A descent algorithm for solving monotone variational inequalities and monotone complementarity problems
Recommended article: An extragradient algorithm for monotone variational inequalities
Recommended article: Algorithms for monotone vector variational inequalities
Recommended article: A reduction method for variational inequalities
Recommended article: A potential reduction algorithm for linearly constrained convex programming
Recommended article: Q3420701
Recommended article: A modified homogeneous potential reduction algorithm for solving the monotone semidefinite linear complementarity problem
Recommended article: Q5866921
title: A potential reduction algorithm for monotone variational inequality problems
published in: Systems Science and Mathematical Sciences
review text: 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.
reviewed by: Muhammad Aslam Noor
description: scientific article; zbMATH DE number 1616950