Parallel Newton methods for the nonlinear complementarity problem
From MaRDI portal
Publication:1116901
DOI10.1007/BF01589414zbMath0665.90091MaRDI QIDQ1116901
Publication date: 1988
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Newton-type methods (49M15) Numerical methods based on nonlinear programming (49M37) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items
A class of parallel nonlinear multisplitting relaxation methods for the large sparse nonlinear complementarity problems, An equilibrium model for urban transit assignment based on game theory, Partially and totally asynchronous algorithms for linear complementarity problems, Elastoplastic analysis of structures with nonlinear hardening: A nonlinear complementarity approach, Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Parallel successive overrelaxation methods for symmetric linear complementarity problems and linear programs
- On the convergence of a basic iterative method for the implicit complementarity problem
- Parallel gradient projection successive overrelaxation for symmetric linear complementarity problems and linear programs
- Two-stage parallel iterative methods for the symmetric linear complementarity problem
- Necessary and sufficient conditions for the convergence of iterative methods for the linear complementarity problem
- Distributed asynchronous computation of fixed points
- Strongly Regular Generalized Equations
- Iterative methods for variational and complementarity problems
- Asynchronous Iterative Methods for Multiprocessors
- Inexact Newton methods for the nonlinear complementarity problem
