A class of distributed optimization methods with event-triggered communication

DOI10.1007/s10589-013-9609-9zbMath1329.90107OpenAlexW1969916294MaRDI QIDQ404510

Michael Ulbrich, Sebastian Albrecht, Martin Meinel

Publication date: 4 September 2014

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10589-013-9609-9

zbMATH Keywords

convex optimizationnon-differentiable optimizationdual decompositiondistributed optimizationDC-OPF problemdistributed regularizationevent-triggered communicationIEEE test caseslocal communication

Mathematics Subject Classification ID

Convex programming (90C25)

Related Items

On linear convergence of a distributed dual gradient algorithm for linearly constrained separable convex problems ⋮ Adaptive quadratic optimisation with application to kinematic control of redundant robot manipulators ⋮ Event-triggered primal-dual design with linear convergence for distributed nonstrongly convex optimization

Uses Software

• Ipopt
• pstca

Cites Work

• Unnamed Item
• Unnamed Item
• Smooth minimization of non-smooth functions
• On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
• Distributed Optimization and Games: A Tutorial Overview
• Application of the catastrophe theory in ascertainment of vertical bearing capacity of single pile
• Application of a Smoothing Technique to Decomposition in Convex Optimization
• Asynchronous Distributed Optimization With Event-Driven Communication
• Alternative Distributed Algorithms for Network Utility Maximization: Framework and Applications