A generalized Newton method of high-order convergence for solving the large-scale linear complementarity problem

DOI10.1186/s13660-015-0937-4zbMath1330.65091OpenAlexW2221354071WikidataQ59436366 ScholiaQ59436366MaRDI QIDQ903210

Ya-Jun Xie, Chang-Feng Ma

Publication date: 5 January 2016

Published in: Journal of Inequalities and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1186/s13660-015-0937-4

zbMATH Keywords

linear complementarity problemnumerical experimentgeneralized Newton methodhigh-order convergenceadditional parametermodulus-based nonlinear function

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

Neural network approaches based on new NCP-functions for solving tensor complementarity problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Accelerated modulus-based matrix splitting iteration methods for linear complementarity problem
• Two-step modulus-based matrix splitting iteration method for linear complementarity problems
• A monotone semismooth Newton type method for a class of complementarity problems
• A cosh-based smoothing Newton method for \(P_{0}\) nonlinear complementarity problem
• A semismooth equation approach to the solution of nonlinear complementarity problems
• On linear convergence of iterative methods for the variational inequality problem
• A nonsmooth version of Newton's method
• Using vector divisions in solving the linear complementarity problem
• Modulus-based synchronous multisplitting iteration methods for linear complementarity problems
• Modulus-based matrix splitting iteration methods for linear complementarity problems
• A New Nonsmooth Equations Approach to Nonlinear Complementarity Problems
• Newton's Method for B-Differentiable Equations
• Equivalence of LCP and PLS
• The Solution of Systems of Piecewise Linear Equations
• A special newton-type optimization method
• Matrix multisplitting relaxation methods for linear complementarity problems
• Smoothing Methods and Semismooth Methods for Nondifferentiable Operator Equations
• On the Convergence of the Multisplitting Methods for the Linear Complementarity Problem
• Matrix Multisplitting Methods with Applications to Linear Complementarity Problems∶ Parallel Asynchronous Methods
• A note on the convergence of the MSMAOR method for linear complementarity problems
• Bimatrix Equilibrium Points and Mathematical Programming
• The Approximation of Fixed Points of a Continuous Mapping
• The Solution of a Quadratic Programming Problem Using Systematic Overrelaxation