Mathematical Programming: Series A and B
A nonsmooth Newton method for variational inequalities, I: theory
Mathematical Programming: Series A and B
A nonsmooth Newton method for variational inequalities, II: numerical results
Mathematical Programming: Series A and B
A continuation method for monotone variational inequalities
Mathematical Programming: Series A and B
On the Newton-Kantorovich hypothesis for solving equations
Journal of Computational and Applied Mathematics
Hi-index | 0.00 |
We present a Kantorovich-type semilocal convergence analysis of the Newton---Josephy method for solving a certain class of variational inequalities. By using a combination of Lipschitz and center-Lipschitz conditions, and our new idea of recurrent functions, we provide an analysis with the following advantages over the earlier works (Wang 2009, Wang and Shen, Appl Math Mech 25:1291---1297, 2004) (under the same or less computational cost): weaker sufficient convergence conditions, larger convergence domain, finer error bounds on the distances involved, and an at least as precise information on the location of the solution.