Mathematical Programming: Series A and B
A nonsmooth version of Newton's method
Mathematical Programming: Series A and B
Convergence analysis of some algorithms for solving nonsmooth equations
Mathematics of Operations Research
Local convergence of quasi-Newton methods for B-differentiable equations
Mathematical Programming: Series A and B
A parameterized Newton method and a quasi-Newton method for nonsmooth equations
Computational Optimization and Applications
A Newton method for a class of quasi-variational inequalities
Computational Optimization and Applications
On a Generalization of a Normal Map and Equation
SIAM Journal on Control and Optimization
A class of iterative methods for solving nonlinear projection equations
Journal of Optimization Theory and Applications
Superlinear convergence of smoothing quasi-Newton methods for nonsmooth equations
Journal of Computational and Applied Mathematics
A Hybrid Smoothing Method for Mixed Nonlinear ComplementarityProblems
Computational Optimization and Applications
Mathematical Programming: Series A and B
On Homotopy-Smoothing Methods for Box-Constrained Variational Inequalities
SIAM Journal on Control and Optimization
SIAM Journal on Optimization
Newton and Quasi-Newton Methods for a Class of Nonsmooth Equations and Related Problems
SIAM Journal on Optimization
A Class of Active-Set Newton Methods for Mixed Complementarity Problems
SIAM Journal on Optimization
A new smoothing and regularization Newton method for P0-NCP
Journal of Global Optimization
Hi-index | 0.01 |
A new quasi-Newton algorithm for the solution of general box constrained variational inequality problem (GVI(l, u, F, f)) is proposed in this paper. It is based on a reformulation of the variational inequality problem as a nonsmooth system of equations by using the median operator. Without smoothing approximation, the proposed quasi-Newton algorithm is directly applied to solve this class of nonsmooth equations. Under appropriate assumptions, it is proved that the algorithmic sequence globally and superlinearly converges to a solution of the equation reformulation and also of GVI(l, u, F, f). Numerical results show that our new algorithm works quite well.