IDEAS home Printed from https://ideas.repec.org/a/taf/tsysxx/v48y2017i9p1836-1843.html
   My bibliography  Save this article

Distributed Zero-Gradient-Sum (ZGS) consensus optimisation over networks with time-varying topologies

Author

Listed:
  • Jiayun Liu
  • Weisheng Chen
  • Hao Dai

Abstract

This paper addresses a distributed consensus optimisation problem over networks with time-varying topologies based on Zero-Gradient-Sum (ZGS) algorithm. First, the exponential convergence of the algorithm is guaranteed under a new condition on network topologies, called cooperatively connected. This condition does not require the topology constantly connected or jointly connected but only requires the integral of the Laplacian matrix of the network topology over a period of time is connected. Hence, it is suitable for more general time-varying topologies. Second, by establishing a key mathematical lemma, we develop a convergence analysis technique which is based on the difference of the Lyapunov function rather than its differentiation. Finally, a simulation example is also provided to verify the results obtained in this paper.

Suggested Citation

  • Jiayun Liu & Weisheng Chen & Hao Dai, 2017. "Distributed Zero-Gradient-Sum (ZGS) consensus optimisation over networks with time-varying topologies," International Journal of Systems Science, Taylor & Francis Journals, vol. 48(9), pages 1836-1843, July.
    • Handle: RePEc:taf:tsysxx:v:48:y:2017:i:9:p:1836-1843
    DOI: 10.1080/00207721.2017.1288840
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207721.2017.1288840
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/00207721.2017.1288840?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:taf:tsysxx:v:48:y:2017:i:9:p:1836-1843. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/TSYS20 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.