Skip to main navigation Skip to search Skip to main content

A Gradient-Descent Neurodynamic Approach for Distributed Linear Programming

  • Harbin Institute of Technology Weihai
  • Beijing Normal University

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

In this paper, a gradient-descent neurodynamic approach is proposed for the distributed linear programming problem with affine equality constraints. It is rigorously proved that the state solution of the proposed gradient-descent approach with an arbitrary initial point reaches agreement and is convergent to an optimal solution of the considered optimization problem at the same time. In the end, some numerical experiments are conducted to verify the effectiveness of the proposed gradient-descent approach.

Original languageEnglish
Title of host publicationAdvances in Neural Networks – ISNN 2019 - 16th International Symposium on Neural Networks, ISNN 2019, Proceedings
EditorsHuchuan Lu, Huajin Tang, Zhanshan Wang
PublisherSpringer Verlag
Pages45-53
Number of pages9
ISBN (Print)9783030228071
DOIs
StatePublished - 2019
Event16th International Symposium on Neural Networks, ISNN 2019 - Moscow, Russian Federation
Duration: 10 Jul 201912 Jul 2019

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume11555 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference16th International Symposium on Neural Networks, ISNN 2019
Country/TerritoryRussian Federation
CityMoscow
Period10/07/1912/07/19

Keywords

  • Convergence to an optimal solution
  • Distributed linear programming
  • Gradient-descent neurodynamic approach
  • Reach agreement

Fingerprint

Dive into the research topics of 'A Gradient-Descent Neurodynamic Approach for Distributed Linear Programming'. Together they form a unique fingerprint.

Cite this