IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v189y2021i2d10.1007_s10957-021-01828-9.html
   My bibliography  Save this article

Decentralized Optimization Over Tree Graphs

Author

Listed:
  • Yuning Jiang

    (Shanghai Tech University)

  • Dimitris Kouzoupis

    (University of Freiburg)

  • Haoyu Yin

    (Shanghai Tech University)

  • Moritz Diehl

    (University of Freiburg)

  • Boris Houska

    (Shanghai Tech University)

Abstract

This paper presents a decentralized algorithm for non-convex optimization over tree-structured networks. We assume that each node of this network can solve small-scale optimization problems and communicate approximate value functions with its neighbors based on a novel multi-sweep communication protocol. In contrast to existing parallelizable optimization algorithms for non-convex optimization, the nodes of the network are neither synchronized nor assign any central entity. None of the nodes needs to know the whole topology of the network, but all nodes know that the network is tree-structured. We discuss conditions under which locally quadratic convergence rates can be achieved. The method is illustrated by running the decentralized asynchronous multi-sweep protocol on a radial AC power network case study.

Suggested Citation

  • Yuning Jiang & Dimitris Kouzoupis & Haoyu Yin & Moritz Diehl & Boris Houska, 2021. "Decentralized Optimization Over Tree Graphs," Journal of Optimization Theory and Applications, Springer, vol. 189(2), pages 384-407, May.
    • Handle: RePEc:spr:joptap:v:189:y:2021:i:2:d:10.1007_s10957-021-01828-9
    DOI: 10.1007/s10957-021-01828-9
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-021-01828-9
    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/s10957-021-01828-9?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.

    References listed on IDEAS

    as
    1. Jacek Gondzio & Andreas Grothey, 2009. "Exploiting structure in parallel implementation of interior point methods for optimization," Computational Management Science, Springer, vol. 6(2), pages 135-160, May.
    2. NESTEROV, Yurii & POLYAK, B.T., 2006. "Cubic regularization of Newton method and its global performance," LIDAM Reprints CORE 1927, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    3. Grune, Lars & Semmler, Willi, 2004. "Using dynamic programming with adaptive grid scheme for optimal control problems in economics," Journal of Economic Dynamics and Control, Elsevier, vol. 28(12), pages 2427-2456, December.
    4. Stephen M. Robinson, 1980. "Strongly Regular Generalized Equations," Mathematics of Operations Research, INFORMS, vol. 5(1), pages 43-62, February.
    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. Andreas Lanz & Gregor Reich & Ole Wilms, 2022. "Adaptive grids for the estimation of dynamic models," Quantitative Marketing and Economics (QME), Springer, vol. 20(2), pages 179-238, June.
    2. M. Durea & R. Strugariu, 2011. "On parametric vector optimization via metric regularity of constraint systems," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 74(3), pages 409-425, December.
    3. Silvia Berra & Alessandro Torraca & Federico Benvenuto & Sara Sommariva, 2024. "Combined Newton-Gradient Method for Constrained Root-Finding in Chemical Reaction Networks," Journal of Optimization Theory and Applications, Springer, vol. 200(1), pages 404-427, January.
    4. Ariizumi, Shumpei & Yamakawa, Yuya & Yamashita, Nobuo, 2024. "Convergence properties of Levenberg–Marquardt methods with generalized regularization terms," Applied Mathematics and Computation, Elsevier, vol. 463(C).
    5. Seonho Park & Seung Hyun Jung & Panos M. Pardalos, 2020. "Combining Stochastic Adaptive Cubic Regularization with Negative Curvature for Nonconvex Optimization," Journal of Optimization Theory and Applications, Springer, vol. 184(3), pages 953-971, March.
    6. Ernst, Ekkehard & Semmler, Willi & Haider, Alexander, 2017. "Debt-deflation, financial market stress and regime change – Evidence from Europe using MRVAR," Journal of Economic Dynamics and Control, Elsevier, vol. 81(C), pages 115-139.
    7. John Stachurski, 2009. "Economic Dynamics: Theory and Computation," MIT Press Books, The MIT Press, edition 1, volume 1, number 0262012774, December.
    8. Fabiana R. Oliveira & Orizon P. Ferreira & Gilson N. Silva, 2019. "Newton’s method with feasible inexact projections for solving constrained generalized equations," Computational Optimization and Applications, Springer, vol. 72(1), pages 159-177, January.
    9. David Brasington & Mika Kato & Willi Semmler, 2010. "Transitioning Out Of Poverty," Metroeconomica, Wiley Blackwell, vol. 61(1), pages 68-95, February.
    10. Nguyen Qui, 2014. "Stability for trust-region methods via generalized differentiation," Journal of Global Optimization, Springer, vol. 59(1), pages 139-164, May.
    11. Stephanie Becker & Lars Grüne & Willi Semmler, 2007. "Comparing accuracy of second-order approximation and dynamic programming," Computational Economics, Springer;Society for Computational Economics, vol. 30(1), pages 65-91, August.
    12. Michael Patriksson & R. Tyrrell Rockafellar, 2003. "Sensitivity Analysis of Aggregated Variational Inequality Problems, with Application to Traffic Equilibria," Transportation Science, INFORMS, vol. 37(1), pages 56-68, February.
    13. Grüne, Lars & Semmler, Willi & Stieler, Marleen, 2015. "Using nonlinear model predictive control for dynamic decision problems in economics," Journal of Economic Dynamics and Control, Elsevier, vol. 60(C), pages 112-133.
    14. Kenji Ueda & Nobuo Yamashita, 2012. "Global Complexity Bound Analysis of the Levenberg–Marquardt Method for Nonsmooth Equations and Its Application to the Nonlinear Complementarity Problem," Journal of Optimization Theory and Applications, Springer, vol. 152(2), pages 450-467, February.
    15. J. V. Outrata, 1999. "Optimality Conditions for a Class of Mathematical Programs with Equilibrium Constraints," Mathematics of Operations Research, INFORMS, vol. 24(3), pages 627-644, August.
    16. Enrico Saltari & Willi Semmler & Giovanni Di Bartolomeo, 2022. "A Nash Equilibrium for Differential Games with Moving-Horizon Strategies," Computational Economics, Springer;Society for Computational Economics, vol. 60(3), pages 1041-1054, October.
    17. Cosmin Petra & Mihai Anitescu, 2012. "A preconditioning technique for Schur complement systems arising in stochastic optimization," Computational Optimization and Applications, Springer, vol. 52(2), pages 315-344, June.
    18. A. L. Dontchev, 1998. "A Proof of the Necessity of Linear Independence Condition and Strong Second-Order Sufficient Optimality Condition for Lipschitzian Stability in Nonlinear Programming," Journal of Optimization Theory and Applications, Springer, vol. 98(2), pages 467-473, August.
    19. B. S. Mordukhovich & M. E. Sarabi, 2016. "Second-Order Analysis of Piecewise Linear Functions with Applications to Optimization and Stability," Journal of Optimization Theory and Applications, Springer, vol. 171(2), pages 504-526, November.
    20. Huynh Van Ngai & Nguyen Huu Tron & Michel Théra, 2014. "Metric Regularity of the Sum of Multifunctions and Applications," Journal of Optimization Theory and Applications, Springer, vol. 160(2), pages 355-390, February.

    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:joptap:v:189:y:2021:i:2:d:10.1007_s10957-021-01828-9. 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: 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.