A global linear and local quadratic continuation smoothing method for variational inequalities with box constraints

Numerical optimization and variational techniques (65K10) Variational inequalities (49J40) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items (14)

A nonmonotone smoothing Newton algorithm for solving general box constrained variational inequalities ⋮ A smoothing Newton method for the second-order cone complementarity problem. ⋮ Finite termination of a Newton-type algorithm for a class of affine variational inequality problems ⋮ Predictor-corrector smoothing Newton method, based on a new smoothing function, for solving the nonlinear complementarity problem with a \(P_0\) function ⋮ Finite termination of a Newton-type algorithm based on a new class of smoothing functions for the affine variational inequality problem ⋮ On the finite convergence of Newton-type methods for \(P_{0}\) affine variational inequalities ⋮ Inexact non-interior continuation method for monotone semidefinite complementarity problems ⋮ A predictor-corrector smoothing Newton method for solving the mixed complementarity problem with aP₀-function ⋮ Complexity of a noninterior path-following method for the linear complementarity problem ⋮ Improving the convergence of non-interior point algorithms for nonlinear complementarity problems ⋮ Inexact non-interior continuation method for solving large-scale monotone SDCP ⋮ An exterior point polynomial-time algorithm for convex quadratic programming ⋮ On the finite termination of an entropy function based non-interior continuation method for vertical linear complementarity problems ⋮ An interior point parameterized central path following algorithm for linearly constrained convex programming

This page was built for publication: A global linear and local quadratic continuation smoothing method for variational inequalities with box constraints