Partially and totally asynchronous algorithms for linear complementarity problems

DOI10.1007/BF00940641zbMATH Open0725.90091OpenAlexW2157972117MaRDI QIDQ2277372FDOQ2277372

Authors: 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

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Solution of symmetric linear complementarity problems by iterative methods
• Title not available (Why is that?)
• Sufficient matrices and the linear complementarity problem
• Asynchronous Iterative Methods for Multiprocessors
• Chaotic relaxation
• Parallel Newton methods for the nonlinear complementarity problem
• Parallel successive overrelaxation methods for symmetric linear complementarity problems and linear programs
• Parallel gradient projection successive overrelaxation for symmetric linear complementarity problems and linear programs
• Multi-sweep asynchronous parallel successive overrelaxation for the nonsymmetric linear complementarity problem

Cited In (2)

• Explicit synchronous partitioned algorithms for interface problems based on Lagrange multipliers
• Iteration grain sized asynchronous parallel algorithms in optimization

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

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