A new strategy for solving variational inequalities in bounded polytopes∗
- 1 January 1995
- journal article
- research article
- Published by Taylor & Francis in Numerical Functional Analysis and Optimization
- Vol. 16 (5-6), 653-668
- https://doi.org/10.1080/01630569508816637
Abstract
We consider variational inequality problems where the convex set under consideration is a bounded polytope. We define an associated box constrained minimization problem and we prove that, under a general condition on the Jacobian, the stationary points of the minimization problems are solutions of the variational inequality problem. The condtion includes the case where the operator is monotone. Based on this result we develop an algorithm that can solve large scale problems. We present numerical experiments.Keywords
This publication has 9 references indexed in Scilit:
- A new trust region algorithm for bound constrained minimizationApplied Mathematics & Optimization, 1994
- On the Resolution of Linearly Constrained Convex Minimization ProblemsSIAM Journal on Optimization, 1994
- A special newton-type optimization methodOptimization, 1992
- A B-differentiable equation-based, globally and locally quadratically convergent algorithm for nonlinear programs, complementarity and variational inequality problemsMathematical Programming, 1991
- A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple BoundsSIAM Journal on Numerical Analysis, 1991
- Testing a class of methods for solving minimization problems with simple bounds on the variablesMathematics of Computation, 1988
- A variational inequality approach for the determination of oligopolistic market equilibriumMathematical Programming, 1984
- An iterative scheme for variational inequalitiesMathematical Programming, 1983
- Iterative methods for variational and complementarity problemsMathematical Programming, 1982