A generalized Newton method of high-order convergence for solving the large-scale linear complementarity problem
type: Item
instance of: scholarly article
title: A generalized Newton method of high-order convergence for solving the large-scale linear complementarity problem
zbMATH Open document ID: 1330.65091
published in: Journal of Inequalities and Applications
publication date: 2016-01-05T00:00:00Z
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C33
Mathematics Subject Classification ID: 90C53
zbMATH DE Number: 6526445
zbMATH Keywords: linear complementarity problem
zbMATH Keywords: generalized Newton method
zbMATH Keywords: high-order convergence
zbMATH Keywords: modulus-based nonlinear function
zbMATH Keywords: additional parameter
zbMATH Keywords: numerical experiment
author: Yajun Xie
author: Changfeng Ma
MaRDI profile type: Publication
full work available at URL: s13660-015-0937-4
OpenAlex ID: W2221354071
Wikidata QID: Q59436366
cites work: Q4003375
cites work: Q4039868
cites work: Bimatrix Equilibrium Points and Mathematical Programming
cites work: The Approximation of Fixed Points of a Continuous Mapping
cites work: The Solution of Systems of Piecewise Linear Equations
cites work: Equivalence of LCP and PLS
cites work: The Solution of a Quadratic Programming Problem Using Systematic Overrelaxation
cites work: On linear convergence of iterative methods for the variational inequality problem
cites work: Modulus-based matrix splitting iteration methods for linear complementarity problems
cites work: Matrix Multisplitting Methods with Applications to Linear Complementarity Problems∶ Parallel Asynchronous Methods
cites work: Modulus-based synchronous multisplitting iteration methods for linear complementarity problems
cites work: On the Convergence of the Multisplitting Methods for the Linear Complementarity Problem
cites work: Matrix multisplitting relaxation methods for linear complementarity problems
cites work: Q4795617
cites work: Q4453963
cites work: Parallel chaotic multisplitting iterative methods for the large sparse linear complementarity problem
cites work: Two-step modulus-based matrix splitting iteration method for linear complementarity problems
cites work: Accelerated modulus-based matrix splitting iteration methods for linear complementarity problem
cites work: A note on the convergence of the MSMAOR method for linear complementarity problems
cites work: Using vector divisions in solving the linear complementarity problem
cites work: A nonsmooth version of Newton's method
cites work: A New Nonsmooth Equations Approach to Nonlinear Complementarity Problems
cites work: Smoothing Methods and Semismooth Methods for Nondifferentiable Operator Equations
cites work: Newton's Method for B-Differentiable Equations
cites work: A monotone semismooth Newton type method for a class of complementarity problems
cites work: A semismooth equation approach to the solution of nonlinear complementarity problems
cites work: A special newton-type optimization method
cites work: A cosh-based smoothing Newton method for \(P_{0}\) nonlinear complementarity problem
DOI: 10.1186/S13660-015-0937-4
description: scientific article; zbMATH DE number 6526445