IDEAS home Printed from https://ideas.repec.org/a/wly/jnlaaa/v2014y2014i1n618641.html

Asynchronous Gossip‐Based Gradient‐Free Method for Multiagent Optimization

Author

Listed:
  • Deming Yuan

Abstract

This paper considers the constrained multiagent optimization problem. The objective function of the problem is a sum of convex functions, each of which is known by a specific agent only. For solving this problem, we propose an asynchronous distributed method that is based on gradient‐free oracles and gossip algorithm. In contrast to the existing work, we do not require that agents be capable of computing the subgradients of their objective functions and coordinating their step size values as well. We prove that with probability 1 the iterates of all agents converge to the same optimal point of the problem, for a diminishing step size.

Suggested Citation

  • Deming Yuan, 2014. "Asynchronous Gossip‐Based Gradient‐Free Method for Multiagent Optimization," Abstract and Applied Analysis, John Wiley & Sons, vol. 2014(1).
    • Handle: RePEc:wly:jnlaaa:v:2014:y:2014:i:1:n:618641
    DOI: 10.1155/2014/618641
    as

    Download full text from publisher

    File URL: https://doi.org/10.1155/2014/618641
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2014/618641?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
    ---><---

    References listed on IDEAS

    as
    1. NESTEROV, Yurii, 2011. "Random gradient-free minimization of convex functions," LIDAM Discussion Papers CORE 2011001, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Jiaxiang Li & Krishnakumar Balasubramanian & Shiqian Ma, 2023. "Stochastic Zeroth-Order Riemannian Derivative Estimation and Optimization," Mathematics of Operations Research, INFORMS, vol. 48(2), pages 1183-1211, May.
    2. David Kozak & Stephen Becker & Alireza Doostan & Luis Tenorio, 2021. "A stochastic subspace approach to gradient-free optimization in high dimensions," Computational Optimization and Applications, Springer, vol. 79(2), pages 339-368, June.
    3. Ruixue Zhao & Jinyan Fan, 2022. "Levenberg–Marquardt method based on probabilistic Jacobian models for nonlinear equations," Computational Optimization and Applications, Springer, vol. 83(2), pages 381-401, November.

    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:wly:jnlaaa:v:2014:y:2014:i:1:n:618641. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Wiley Content Delivery (email available below). General contact details of provider: https://onlinelibrary.wiley.com/journal/4058 .

    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.