A Continuous-Time Distributed Algorithm for Solving a Class of Decomposable Nonconvex Quadratic Programming

In this paper, a continuous-time distributed algorithm is presented to solve a class of decomposable quadratic programming problems. In the quadratic programming, even if the objective function is nonconvex, the algorithm can still perform well under an extra condition combining with the objective,...

Celý popis

Podrobná bibliografie

Vydáno v:	Journal of Artificial Intelligence and Soft Computing Research Ročník 8; číslo 4; s. 283 - 291
Hlavní autoři:	Zhao, Yan, Liu, Qingshan
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Warsaw De Gruyter Open 01.10.2018 De Gruyter Brill Sp. z o.o., Paradigm Publishing Services
Témata:	Algorithms consensus Decomposable nonconvex quadratic programming Decomposition Lyapunov method multi-agent network Multiagent systems Optimization Quadratic programming
ISSN:	2083-2567, 2083-2567, 2449-6499
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!