Multi-agent network flows that solve linear complementarity problems.

DOI10.14736/KYB-2018-3-0542MaRDI QIDQ4558738zbMATH OpenOpenAlexFDO

Authors Shu Liang, Xianlin Zeng

Publication date 29 November 2018

Published in Kybernetika (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/10338.dmlcz/147435

zbMATH Keywords

linear complementarity problemdistributed algorithmmulti-agent networkcontinuous-time algorithmnonsmooth algorithm

Mathematics Subject Classification ID

Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Distributed algorithms (68W15)

Recommendations

• A distributed algorithm for solving mixed equilibrium problems
• scientific article; zbMATH DE number 5259866
• A distributed simplex algorithm for degenerate linear programs and multi-agent assignments
• Continuous distributed algorithms for solving linear equations in finite time
• Computation of linear algebraic equations with solvability verification over multi-agent networks.

Cited in

(1)

• A distributed simplex algorithm for degenerate linear programs and multi-agent assignments

This page was built for publication: Multi-agent network flows that solve linear complementarity problems.

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