On a Primal-Dual Analytic Center Cutting Plane Method for VariationalInequalities
Computational Optimization and Applications - Special issue on computational optimization—a tribute to Olvi Mangasarian, part I
Convergence of the Gradient Projection Method for Generalized Convex Minimization
Computational Optimization and Applications
Splitting Algorithms for General Pseudomonotone Mixed Variational Inequalities
Journal of Global Optimization
Local convergence analysis of projection-type algorithms: unified approach
Journal of Optimization Theory and Applications
Some new projection methods for variational inequalities
Applied Mathematics and Computation
Some recent advances in projection-type methods for variational inequalities
Journal of Computational and Applied Mathematics - Proceedings of the international conference on recent advances in computational mathematics
Comparison of Two Kinds of Prediction-Correction Methods for Monotone Variational Inequalities
Computational Optimization and Applications
Journal of Global Optimization
Solving variational inequalities with a quadratic cut method: a primal-dual, Jacobian-free approach
Computers and Operations Research
An Extended Projection Neural Network for Constrained Optimization
Neural Computation
A novel neural network for a class of convex quadratic minimax problems
Neural Computation
A simple self-adaptive alternating direction method for linear variational inequality problems
Computers & Mathematics with Applications
A new neural network for solving nonlinear projection equations
Neural Networks
A self-adaptive projection method with improved step-size for solving variational inequalities
Computers & Mathematics with Applications
A new class of projection and contraction methods for solving variational inequality problems
Computers & Mathematics with Applications
ISNN '07 Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks, Part III
Modified extragradient methods for solving variational inequalities
Computers & Mathematics with Applications
A new projection-based neural network for constrained variational inequalities
IEEE Transactions on Neural Networks
Using ACCPM in a simplicial decomposition algorithm for the traffic assignment problem
Computational Optimization and Applications
On a Stabilization Problem of Nonlinear Programming Neural Networks
Neural Processing Letters
A non-interior-point smoothing method for variational inequality problem
Journal of Computational and Applied Mathematics
A note on Solodov and Tseng's methods for maximal monotone mappings
Journal of Computational and Applied Mathematics
A new one-layer neural network for linear and quadratic programming
IEEE Transactions on Neural Networks
Korpelevich's method for variational inequality problems in Banach spaces
Journal of Global Optimization
Computational Optimization and Applications
Modified resolvent algorithm for general mixed quasi-variational inequalities
Mathematical and Computer Modelling: An International Journal
An infeasible-start path-following method for monotone LCPs
Mathematical and Computer Modelling: An International Journal
Some algorithms for general monotone mixed variational inequalities
Mathematical and Computer Modelling: An International Journal
A new iterative method for monotone mixed varitational inequalities
Mathematical and Computer Modelling: An International Journal
An extraresolvent method for monotone mixed variational inequalities
Mathematical and Computer Modelling: An International Journal
A neural network for the linear complementarity problem
Mathematical and Computer Modelling: An International Journal
Solving general convex nonlinear optimization problems by an efficient neurodynamic model
Engineering Applications of Artificial Intelligence
Computational Optimization and Applications
Hi-index | 0.00 |
We propose new methods for solving the variational inequality problem where the underlying function $F$ is monotone. These methods may be viewed as projection-type methods in which the projection direction is modified by a strongly monotone mapping of the form $I - \alpha F$ or, if $F$ is affine with underlying matrix $M$, of the form $I+ \alpha M^T$, with $\alpha \in (0,\infty)$. We show that these methods are globally convergent, and if in addition a certain error bound based on the natural residual holds locally, the convergence is linear. Computational experience with the new methods is also reported.