Individual Regret Bounds for the Distributed Online Alternating Direction Method of Multipliers

DOI10.1109/TAC.2018.2860546zbMATH Open1482.90144OpenAlexW2883913910WikidataQ129463720 ScholiaQ129463720MaRDI QIDQ5223682FDOQ5223682

Authors:

Publication date: 18 July 2019

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

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

Mathematics Subject Classification ID

Convex programming (90C25) Online algorithms; streaming algorithms (68W27) Deterministic network models in operations research (90B10)

Cited In (3)

• Regret and Cumulative Constraint Violation Analysis for Distributed Online Constrained Convex Optimization
• Personalized optimization with user's feedback
• Differentially private distributed online learning over time‐varying digraphs via dual averaging

This page was built for publication: Individual Regret Bounds for the Distributed Online Alternating Direction Method of Multipliers

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