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

Full description

Saved in:

Bibliographic Details
Published in:	Journal of Artificial Intelligence and Soft Computing Research Vol. 8; no. 4; pp. 283 - 291
Main Authors:	Zhao, Yan, Liu, Qingshan
Format:	Journal Article
Language:	English
Published:	Warsaw De Gruyter Open 01.10.2018 De Gruyter Brill Sp. z o.o., Paradigm Publishing Services
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!