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

Journal of Artificial Intelligence and Soft Computing Research
Volume 8 (2018): Issue 4 (October 2018)
By: Yan Zhao and  Qingshan Liu  
Open Access
|May 2018
DOI: https://doi.org/10.1515/jaiscr-2018-0018
Journal RSS Feed
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
Keywords:
Decomposable nonconvex quadratic programming,
multi-agent network,
consensus,
Lyapunov method
Related subjects:
Computer sciences,
Databases and data mining,
Artificial intelligence

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

Previous articleVolume 8 (2018): Issue 4 (October 2018)Next article