A class of parallel nonlinear multisplitting relaxation methods for the large sparse nonlinear complementarity problems
From MaRDI portal
Publication:1352799
DOI10.1016/0898-1221(96)00169-1zbMath0865.65048OpenAlexW2005865704MaRDI QIDQ1352799
Publication date: 10 July 1997
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0898-1221(96)00169-1
parallel computationsuccessive overrelaxationlocal convergencenonlinear complementarity problemsmultisplitting
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Parallel numerical computation (65Y05)
Related Items
The relaxation modulus-based matrix splitting iteration method for solving a class of nonlinear complementarity problems ⋮ Accelerated modulus-based matrix splitting iteration methods for a restricted class of nonlinear complementarity problems ⋮ Improved Inexact Alternating Direction Methods for a Class of Nonlinear Complementarity Problems ⋮ Two-Step Modulus-Based Synchronous Multisplitting Iteration Methods for Nonlinear Complementarity Problems ⋮ Modulus-based matrix splitting algorithms for the quasi-complementarity problems ⋮ Modulus-based synchronous multisplitting iteration methods without auxiliary variable for solving vertical linear complementarity problems ⋮ Modulus-based synchronous multisplitting iteration methods for large sparse vertical linear complementarity problems ⋮ The sign-based methods for solving a class of nonlinear complementarity problems ⋮ A direct preconditioned modulus-based iteration method for solving nonlinear complementarity problems of \(H\)-matrices ⋮ Modulus-based matrix splitting methods for a class of horizontal nonlinear complementarity problems ⋮ A generalized modulus-based Newton method for solving a class of non-linear complementarity problems with \(P\)-matrices ⋮ Modulus-Based Multisplitting Iteration Methods for a Class of Nonlinear Complementarity Problems ⋮ 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 ⋮ A preconditioned general two-step modulus-based matrix splitting iteration method for linear complementarity problems of \(H_+\)-matrices ⋮ A generalized two-step modulus-based matrix splitting iteration method for implicit complementarity problems of H+-matrices ⋮ Two-step modulus-based matrix splitting iteration method for a class of nonlinear complementarity problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Parallel nonlinear multisplitting methods
- Asynchronous parallel successive overrelaxation for the symmetric linear complementarity problem
- Parallel Newton methods for the nonlinear complementarity problem
- Local convergence of quasi-Newton methods for B-differentiable equations
- New comparison theorem for the nonlinear multisplitting relaxation method for the nonlinear complementarity problems
- Parallel nonlinear multisplitting relaxation methods
- The monotone convergence of a class of parallel nonlinear relaxation methods for nonlinear complementarity problems
- Newton's method for the nonlinear complementarity problem: a B- differentiable equation approach
- Multi-Splittings of Matrices and Parallel Solution of Linear Systems
- Iterative methods for variational and complementarity problems
- Equivalence of the Complementarity Problem to a System of Nonlinear Equations
This page was built for publication: A class of parallel nonlinear multisplitting relaxation methods for the large sparse nonlinear complementarity problems