A modified damped Newton method for linear complementarity problems

DOI10.1007/s11075-006-9028-4zbMath1106.65052OpenAlexW1986243928MaRDI QIDQ857647

Jun-Liang Dong, Zhong Zhi Bai

Publication date: 19 December 2006

Published in: Numerical Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11075-006-9028-4

zbMATH Keywords

global convergencenumerical resultsinexact splitting method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Methods of quasi-Newton type (90C53) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items (15)

The convergence of modulus-based matrix splitting iteration methods for implicit complementarity problems ⋮ Inexact multisplitting methods for linear complementarity problems ⋮ The reduced order method for solving the linear complementarity problem with an \(M\)-matrix ⋮ Un algoritmo Newton inexacto para complementariedad horizontal ⋮ Newton-type methods for solving quasi-complementarity problems via sign-based equation ⋮ The sign-based methods for solving a class of nonlinear complementarity problems ⋮ A generalization of Müller's iteration method based on standard information ⋮ The modulus-based matrix double splitting iteration method for linear complementarity problems ⋮ Two class of synchronous matrix multisplitting schemes for solving linear complementarity problems ⋮ On the semilocal convergence of damped Newton's method ⋮ Shifted skew-symmetric iteration methods for nonsymmetric linear complementarity problems ⋮ A non-modulus linear method for solving the linear complementarity problem ⋮ A sign-based linear method for horizontal linear complementarity problems ⋮ The PMCGAOR and PMCSSOR methods for solving linear complementarity problems ⋮ A generalized two-step modulus-based matrix splitting iteration method for implicit complementarity problems of H+-matrices

Uses Software

• KELLEY

Cites Work

• On convergence of two-stage splitting methods for linear complementarity problems
• On the convergence of a basic iterative method for the implicit complementarity problem
• \(H\)-splittings and two-stage iterative methods
• Solution of symmetric linear complementarity problems by iterative methods
• Asynchronous parallel nonlinear multisplitting relaxation methods for large sparse nonlinear complementarity problems
• A class of asynchronous parallel nonlinear accelerated overrelaxation methods for the nonlinear complementarity problems
• Chaotic iterative methods for the linear complementarity problems
• The convergence of parallel iteration algorithms for linear complementarity problems
• A Newton-type method for positive-semidefinite linear complementarity problems
• A multisplitting method for symmetric linear complementarity problems
• Newton's Method for B-Differentiable Equations
• Convergence of Iterates of an Inexact Matrix Splitting Algorithm for the Symmetric Monotone Linear Complementarity Problem
• On the monotone convergence of matrix multisplitting relaxation methods for the linear complementarity problem
• Matrix multisplitting relaxation methods for linear complementarity problems
• Hermitian and Skew-Hermitian Splitting Methods for Non-Hermitian Positive Definite Linear Systems
• On the Convergence of the Multisplitting Methods for the Linear Complementarity Problem
• Some Noninterior Continuation Methods for Linear Complementarity Problems
• Inexact Newton methods for the nonlinear complementarity problem
• Matrix Multisplitting Methods with Applications to Linear Complementarity Problems∶ Parallel Asynchronous Methods
• The Solution of a Quadratic Programming Problem Using Systematic Overrelaxation
• Complementarity problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A modified damped Newton method for linear complementarity problems