A nonmonotone line search technique for Newton's method
SIAM Journal on Numerical Analysis
Projected gradient methods for linearly constrained problems
Mathematical Programming: Series A and B
Mathematical Programming: Series A and B
Convergence analysis of some algorithms for solving nonsmooth equations
Mathematics of Operations Research
On finite termination of an iterative method for linear complementarity problems
Mathematical Programming: Series A and B
Unconstrained optimization reformulations of variational inequality problems
Journal of Optimization Theory and Applications
Solution of monotone complementarity problems with locally Lipschitzian functions
Mathematical Programming: Series A and B - Special issue on computational nonsmooth optimization
Equivalence of variational inequality problems to unconstrained minimization
Mathematical Programming: Series A and B
Mathematical Programming: Series A and B
A Theoretical and Numerical Comparison of Some Semismooth Algorithms for Complementarity Problems
Computational Optimization and Applications
Some Methods Based on the D-Gap Function for Solving Monotone Variational Inequalities
Computational Optimization and Applications
Journal of Global Optimization
Regularized nonsmooth Newton method for multi-class support vector machines
Optimization Methods & Software - Systems Analysis, Optimization and Data Mining in Biomedicine
An algorithm based on the generalized D-gap function for equilibrium problems
Journal of Computational and Applied Mathematics
Computational Optimization and Applications
A globalized Newton method for the computation of normalized Nash equilibria
Journal of Global Optimization
On regularity conditions for complementarity problems
Computational Optimization and Applications
Hi-index | 0.00 |
We present a new method for the solution of the box constrained variational inequality problem (BVIP). Basically, this method is a nonsmooth Newton method applied to a reformulation of BVIP as a system of nonsmooth equations involving the natural residual. The method is globalized by using the D-gap function. We show that the proposed algorithm is globally and fast locally convergent. Moreover, if the problem is described by an affine function, the algorithm has a finite termination property. Numerical results for some large-scale variational inequality problems are reported.