Partially and totally asynchronous algorithms for linear complementarity problems

DOI10.1007/BF00940641zbMath0725.90091OpenAlexW2157972117MaRDI QIDQ2277372

Renato De Leone

Publication date: 1991

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00940641

zbMATH Keywords

linear complementarityConvergence conditionsasynchronous parallel successive overrelaxation

Mathematics Subject Classification ID

Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (1)

Iteration grain sized asynchronous parallel algorithms in optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Parallel successive overrelaxation methods for symmetric linear complementarity problems and linear programs
• Parallel Newton methods for the nonlinear complementarity problem
• Sufficient matrices and the linear complementarity problem
• Parallel gradient projection successive overrelaxation for symmetric linear complementarity problems and linear programs
• Solution of symmetric linear complementarity problems by iterative methods
• Multi-sweep asynchronous parallel successive overrelaxation for the nonsymmetric linear complementarity problem
• Chaotic relaxation
• Asynchronous Iterative Methods for Multiprocessors

This page was built for publication: Partially and totally asynchronous algorithms for linear complementarity problems