A Smoothing Newton Method for Extended Vertical Linear Complementarity Problems
From MaRDI portal
Publication:4702248
DOI10.1137/S0895479897329837zbMath1017.90114OpenAlexW2066977799MaRDI QIDQ4702248
Publication date: 24 November 1999
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0895479897329837
Numerical computation of solutions to systems of equations (65H10) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Degree theory for nonlinear operators (47H11)
Related Items
Global linear and quadratic one-step smoothing Newton method for vertical linear complementarity problems ⋮ Projected splitting methods for vertical linear complementarity problems ⋮ A generalized complementarity approach to solving real option problems ⋮ A SAA nonlinear regularization method for a stochastic extended vertical linear complementarity problem ⋮ Global convergence of a smooth approximation method for mathematical programs with complementarity constraints ⋮ A modulus-based formulation for the vertical linear complementarity problem ⋮ A new kind of modulus-based matrix splitting methods for vertical linear complementarity problems ⋮ Un algoritmo Newton inexacto para complementariedad horizontal ⋮ On almost smooth functions and piecewise smooth functions ⋮ A smoothing SAA method for a stochastic mathematical program with complementarity constraints. ⋮ A modulus-based matrix splitting method for the vertical nonlinear complementarity problem ⋮ Relaxation modulus-based matrix splitting iteration method for vertical linear complementarity problem ⋮ Convergence analysis of projected SOR iteration method for a class of vertical linear complementarity problems ⋮ The inexact log-exponential regularization method for mathematical programs with vertical complementarity constraints ⋮ A power penalty method for discrete HJB equations ⋮ Generalized multilinear games and vertical tensor complementarity problems ⋮ Existence of the least element solution of the vertical block \(Z\)-tensor complementarity problem ⋮ Quadratic one-step smoothing Newton method for \(P_{0}\)-LCP without strict complementarity. ⋮ Global error bounds for the extended vertical LCP ⋮ A network of options: evaluating complex interdependent decisions under uncertainty ⋮ A sample average approximation regularization method for a stochastic mathematical program with general vertical complementarity constraints ⋮ On the ERM formulation and a stochastic approximation algorithm of the stochastic-\(R_0\) EVLCP ⋮ A smoothing-type algorithm for solving nonlinear complementarity problems with a non-monotone line search ⋮ Smooth convex approximation to the maximum eigenvalue function ⋮ Smoothing methods for nonsmooth, nonconvex minimization ⋮ New multiplier method for solving linear complementarity problems ⋮ A primal-dual algorithm for minimizing a sum of Euclidean norms ⋮ A block principal pivoting algorithm for vertical generalized LCP with a vertical block P-matrix ⋮ A partially smoothing Jacobian method for nonlinear complementarity problems with \(P_0\) function ⋮ On the finite termination of an entropy function based non-interior continuation method for vertical linear complementarity problems
