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,...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Journal of Artificial Intelligence and Soft Computing Research Jg. 8; H. 4; S. 283 - 291
Hauptverfasser:	Zhao, Yan, Liu, Qingshan
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Warsaw De Gruyter Open 01.10.2018 De Gruyter Brill Sp. z o.o., Paradigm Publishing Services
Schlagworte:	Algorithms consensus Decomposable nonconvex quadratic programming Decomposition Lyapunov method multi-agent network Multiagent systems Optimization Quadratic programming
ISSN:	2083-2567, 2083-2567, 2449-6499
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!