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

DOI10.1186/S13660-015-0937-4zbMATH Open1330.65091OpenAlexW2221354071WikidataQ59436366 ScholiaQ59436366MaRDI QIDQ903210FDOQ903210

Authors: Yajun Xie, Changfeng 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

Recommendations

• High-order Newton's iteration method for linear complementary problem
• A generalized Newton method for non-Hermitian positive definite linear complementarity problem
• An accelerated Newton method of high-order convergence for solving a class of weakly nonlinear complementarity problems
• A linearization method for generalized complementarity problems
• A nonsmooth inexact Newton method for the solution of large-scale nonlinear complementarity problems

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)

Cites Work

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

Cited In (4)

• High-order Newton's iteration method for linear complementary problem
• Title not available (Why is that?)
• A nonlinear optimization approach to the construction of general linear methods of high order
• Neural network approaches based on new NCP-functions for solving tensor complementarity problem

This page was built for publication: A generalized Newton method of high-order convergence for solving the large-scale linear complementarity problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q903210)