Have a personal or library account? Click to login
A Continuous-Time Distributed Algorithm for Solving a Class of Decomposable Nonconvex Quadratic Programming Cover

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

By: Yan Zhao and  Qingshan Liu  
Open Access
|May 2018

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.

Language: English
Page range: 283 - 291
Submitted on: Jan 16, 2018
Accepted on: Mar 26, 2018
Published on: May 17, 2018
Published by: SAN University
In partnership with: Paradigm Publishing Services
Publication frequency: 4 issues per year

© 2018 Yan Zhao, Qingshan Liu, published by SAN University
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.