The sign-based methods for solving a class of nonlinear complementarity problems
type: Item
instance of: scholarly article
title: The sign-based methods for solving a class of nonlinear complementarity problems
zbMATH Open document ID: 1416.90052
author: Hua Zheng
author: Ling Liu
published in: Journal of Optimization Theory and Applications
publication date: 2019-03-06T00:00:00Z
Mathematics Subject Classification ID: 90C33
Mathematics Subject Classification ID: 65F05
zbMATH DE Number: 7032495
zbMATH Keywords: nonlinear complementarity problem
zbMATH Keywords: modulus-based method
zbMATH Keywords: sign pattern
zbMATH Keywords: Newton's method
MaRDI profile type: Publication
full work available at URL: s10957-018-1361-y
OpenAlex ID: W2886832173
cites work: Q4039868
cites work: The Linear Complementarity Problem
cites work: Engineering and Economic Applications of Complementarity Problems
cites work: Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
cites work: The monotone convergence of a class of parallel nonlinear relaxation methods for nonlinear complementarity problems
cites work: New comparison theorem for the nonlinear multisplitting relaxation method for the nonlinear complementarity problems
cites work: A class of parallel nonlinear multisplitting relaxation methods for the large sparse nonlinear complementarity problems
cites work: Asynchronous parallel nonlinear multisplitting relaxation methods for large sparse nonlinear complementarity problems
cites work: A class of asynchronous parallel nonlinear accelerated overrelaxation methods for the nonlinear complementarity problems
cites work: Modulus-based matrix splitting iteration methods for linear complementarity problems
cites work: A general modulus-based matrix splitting method for linear complementarity problems of \(H\)-matrices
cites work: A modified modulus method for symmetric positive-definite linear complementarity problems
cites work: Nonstationary extrapolated modulus algorithms for the solution of the linear complementarity problem
cites work: Modulus-based synchronous multisplitting iteration methods for linear complementarity problems
cites work: Modulus-based synchronous two-stage multisplitting iteration methods for linear complementarity problems
cites work: Two-step modulus-based matrix splitting iteration method for linear complementarity problems
cites work: Two-Step Modulus-Based Synchronous Multisplitting Iteration Methods for Linear Complementarity Problems
cites work: Two-stage multisplitting iteration methods using modulus-based matrix splitting as inner iteration for linear complementarity problems
cites work: Improved convergence theorems of modulus-based matrix splitting iteration methods for linear complementarity problems
cites work: Improved convergence theorems of the two-step modulus-based matrix splitting and synchronous multisplitting iteration methods for solving linear complementarity problems
cites work: Accelerated modulus-based matrix splitting iteration methods for linear complementarity problem
cites work: A general accelerated modulus-based matrix splitting iteration method for solving linear complementarity problems
cites work: The modulus-based nonsmooth Newton's method for solving linear complementarity problems
cites work: A preconditioned modulus-based iteration method for solving linear complementarity problems ofH-matrices
cites work: A relaxation modulus-based matrix splitting iteration method for solving linear complementarity problems
cites work: A class of two-stage iterative methods for systems of weakly nonlinear equations
cites work: Block and asynchronous two-stage methods for mildly nonlinear systems
cites work: Modulus-based matrix splitting iteration methods for a class of nonlinear complementarity problem
cites work: The modulus-based matrix splitting algorithms for a class of weakly nonlinear complementarity problems.
cites work: Fixed point approach for complementarity problems
cites work: A semismooth equation approach to the solution of nonlinear complementarity problems
cites work: Improved convergence theorems of modulus-based matrix splitting iteration method for nonlinear complementarity problems of \(H\)-matrices
cites work: Two-step modulus-based matrix splitting iteration method for a class of nonlinear complementarity problems
cites work: A two-step modulus-based matrix splitting iteration method for solving nonlinear complementarity problems of \(H_+\)-matrices
cites work: Modified modulus-based matrix splitting algorithms for a class of weakly nondifferentiable nonlinear complementarity problems
cites work: Accelerated modulus-based matrix splitting iteration methods for a restricted class of nonlinear complementarity problems
cites work: Q4326384
cites work: On the Convergence of the Multisplitting Methods for the Linear Complementarity Problem
cites work: A modified damped Newton method for linear complementarity problems
cites work: Superlinearly Convergent $O ( \sqrt{n} L )$-Iteration Interior-Point Algorithms for Linear Programming and the Monotone Linear Complementarity Problem
cites work: Local convergence of interior-point algorithms for degenerate monotone LCP
cites work: A path-following interior-point algorithm for linear and quadratic problems
cites work: A superquadratic infeasible-interior-point method for linear complementarity problems
cites work: On quadratic and \(O(\sqrt{n}L)\) convergence of a predictor-corrector algorithm for LCP
cites work: A non-modulus linear method for solving the linear complementarity problem
cites work: Q3933378
cites work: Parallel solutions of variational inequality problems with nonlinear source terms
cites work: Free boundary problems with nonlinear source terms
cites work: A monotone semismooth Newton type method for a class of complementarity problems
cites work: Methods of conjugate gradients for solving linear systems
cites work: GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
DOI: 10.1007/S10957-018-1361-Y
description: scientific article; zbMATH DE number 7032495