IDEAS home Printed from https://ideas.repec.org/a/spr/comgts/v21y2024i1d10.1007_s10287-023-00492-w.html
   My bibliography  Save this article

Decentralized optimization with affine constraints over time-varying networks

Author

Listed:
  • Demyan Yarmoshik

    (Moscow Institute of Physics and Technology
    Institute for Information Transmission Problems)

  • Alexander Rogozin

    (Moscow Institute of Physics and Technology)

  • Alexander Gasnikov

    (Moscow Institute of Physics and Technology
    Skoltech
    Institute for Information Transmission Problems)

Abstract

The decentralized optimization paradigm assumes that each term of a finite-sum objective is privately stored by the corresponding agent. Agents are only allowed to communicate with their neighbors in the communication graph. We consider the case when the agents additionally have local affine constraints and the communication graph can change over time. We provide the first linearly convergent decentralized algorithm for time-varying networks by generalizing the optimal decentralized algorithm ADOM to the case of affine constraints. We show that its rate of convergence is optimal for first-order methods by providing the lower bounds for the number of communications and oracle calls.

Suggested Citation

  • Demyan Yarmoshik & Alexander Rogozin & Alexander Gasnikov, 2024. "Decentralized optimization with affine constraints over time-varying networks," Computational Management Science, Springer, vol. 21(1), pages 1-23, June.
  • Handle: RePEc:spr:comgts:v:21:y:2024:i:1:d:10.1007_s10287-023-00492-w
    DOI: 10.1007/s10287-023-00492-w
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10287-023-00492-w
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s10287-023-00492-w?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.

    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:spr:comgts:v:21:y:2024:i:1:d:10.1007_s10287-023-00492-w. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.