A Bregman Splitting Scheme for Distributed Optimization Over Networks

DOI10.1109/TAC.2018.2805260MaRDI QIDQ4559525zbMATH OpenOpenAlexFDO

Authors Jin-Ming Xu, Shanying Zhu, Lihua Xie, Yeng Chai Soh

Publication date 4 December 2018

Published in IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tac.2018.2805260

Mathematics Subject Classification ID

Iterative procedures involving nonlinear operators (47J25) Numerical mathematical programming methods (65K05) Stochastic network models in operations research (90B15) Convex programming (90C25)

Cited in

(7)

• A distributed Bregman forward-backward algorithm for a class of Nash equilibrium problems
• Distributed least squares solver for network linear equations
• A unitary distributed subgradient method for multi-agent optimization with different coupling sources
• Distributed finite-time optimisation of multi-agent systems with unknown high-frequency gain signs under switching digraphs
• Distributed robust optimization with coupled constraints via Tseng's splitting method
• Distributed event-triggered algorithm for convex optimization with coupled constraints
• Distributed convex optimization based on zero-gradient-sum algorithm under switching topology

This page was built for publication: A Bregman Splitting Scheme for Distributed Optimization Over Networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4559525)