<abstract xmlns="http://www.w3.org/1999/xhtml"><p> 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, constraint and coupling matrices. Inspired by recent advances in distributed optimization, the proposed continuous-time algorithm described by multi-agent network with consensus is designed and analyzed. In the network, each agent only accesses the local information of its own and from its neighbors, then all the agents in a connected network cooperatively find the optimal solution with consensus.</p></abstract>

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, constraint and coupling matrices. Inspired by recent advances in distributed optimization, the proposed continuous-time algorithm described by multi-agent network with consensus is designed and analyzed. In the network, each agent only accesses the local information of its own and from its neighbors, then all the agents in a connected network cooperatively find the optimal solution with consensus.

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

Journal of Artificial Intelligence and Soft Computing Research

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

In this paper, a continuous-time distributed algorithm is presented to solve a class of decomposable quadratic programming problems. In the quadratic...

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

Publié en ligne: 17 mai 2018

Pages: 283 - 291

Reçu: 16 janv. 2018

Accepté: 26 mars 2018

DOI: https://doi.org/10.1515/jaiscr-2018-0018

Mots clés
Decomposable nonconvex quadratic programming, multi-agent network, consensus, Lyapunov method

© 2018

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

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

Publié en ligne: 17 mai 2018

Pages: 283 - 291

Reçu: 16 janv. 2018

Accepté: 26 mars 2018

DOI: https://doi.org/10.1515/jaiscr-2018-0018

Mots clésDecomposable nonconvex quadratic programming, multi-agent network, consensus, Lyapunov method

© 2018

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

Mots clés
Decomposable nonconvex quadratic programming, multi-agent network, consensus, Lyapunov method