@article{b6f6f1452ddb4058a40668b1bb4fac2f,
title = "Multi-agent network flows that solve linear complementarity problems",
abstract = "In this paper, we consider linear complementarity problems with positive definite matrices through a multi-agent network. We propose a distributed continuous-time algorithm and show its correctness and convergence. Moreover, with the help of Kalman–Yakubovich–Popov lemma and Lyapunov function, we prove its asymptotic convergence. We also present an alternative distributed algorithm in terms of an ordinary differential equation. Finally, we illustrate the effectiveness of our method by simulations.",
keywords = "Continuous-time algorithm, Distributed algorithm, Linear complementarity problem, Multi-agent network, Nonsmooth algorithm",
author = "Shu Liang and Xianlin Zeng",
note = "Publisher Copyright: {\textcopyright} 2018 Institute of Information Theory and Automation of The Czech Academy of Sciences. All Rights Reserved.",
year = "2018",
doi = "10.14736/kyb-2018-3-0542",
language = "English",
volume = "54",
pages = "542--556",
journal = "Kybernetika",
issn = "0023-5954",
publisher = "Academy of Sciences of the Czech Republic",
number = "3",
}