Newton's method for B-differentiable equations
Mathematics of Operations Research
Mathematical Programming: Series A and B
Homotopy continuation methods for nonlinear complementarity problems
Mathematics of Operations Research
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
A general framework of continuation methods for complementarity problems
Mathematics of Operations Research
A non-interior-point continuation method for linear complementarity problems
SIAM Journal on Matrix Analysis and Applications
A parameterized Newton method and a quasi-Newton method for nonsmooth equations
Computational Optimization and Applications
On quadratic and OnL convergence of a predictor-corrector algorithm for LCP
Mathematical Programming: Series A and B
A Globally Convergent Successive Approximation Method for Severely Nonsmooth Equations
SIAM Journal on Control and Optimization
A continuation method for monotone variational inequalities
Mathematical Programming: Series A and B
Smoothing methods for convex inequalities and linear complementarity problems
Mathematical Programming: Series A and B
A class of smoothing functions for nonlinear and mixed complementarity problems
Computational Optimization and Applications
On finite termination of an iterative method for linear complementarity problems
Mathematical Programming: Series A and B
Some Noninterior Continuation Methods for LinearComplementarity Problems
SIAM Journal on Matrix Analysis and Applications
A superlinear infeasible-interior-point algorithm for monotone complementarity problems
Mathematics of Operations Research
Implementation of a continuation method for normal maps
Mathematical Programming: Series A and B - Special issue on computational nonsmooth optimization
A Comparison of Large Scale Mixed Complementarity Problem Solvers
Computational Optimization and Applications
A Hybrid Smoothing Method for Mixed Nonlinear ComplementarityProblems
Computational Optimization and Applications
A continuation method for (strongly) monotone variational inequalities
Mathematical Programming: Series A and B
Mathematics of Operations Research
Mathematical Programming: Series A and B
On Homotopy-Smoothing Methods for Box-Constrained Variational Inequalities
SIAM Journal on Control and Optimization
An Infeasible Path-Following Method for Monotone Complementarity Problems
SIAM Journal on Optimization
Smooth Approximations to Nonlinear Complementarity Problems
SIAM Journal on Optimization
Complexity of a noninterior path-following method for the linear complementarity problem
Journal of Optimization Theory and Applications
Computational Optimization and Applications
Applications of smoothing methods in numerical analysis and optimization
Focus on computational neurobiology
Hi-index | 0.00 |
In this paper, we propose a continuation method for box constrained variational inequality problems. The continuation method is based on the class of Gabriel-Moré smooth functions and has the following attractive features: It can start from any point; It has a simple and natural neighborhood definition; It solves only one approximate Newton equation at each iteration; It converges globally linearly and locally quadratically under nondegeneracy assumption at the solution point and other suitable assumptions. A hybrid method is also presented, which is shown to preserve the above convergence properties without the nondegeneracy assumption at the solution point. In particular, the hybrid method converges finitely for affine problems.