Forgetting-factor regrets for distributed second-order online optimisation

DOI10.1080/00207179.2026.2679224MaRDI QIDQ7318405zbMATH OpenFDO

Authors Jianjun Li, Lipo Mo, Jingyi Li

Publication date 24 August 2026

Published in International Journal of Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207179.2026.2679224

Mathematics Subject Classification ID

Distributed algorithms (68W15) Multi-agent systems (93A16) Networked control (93B70)

Cites work

• A Distributed Newton Method for Network Utility Maximization–I: Algorithm
• A Primal-Dual Quasi-Newton Method for Exact Consensus Optimization
• Decentralized Quasi-Newton Methods
• Distributed algebraic connectivity estimation for undirected graphs with upper and lower bounds
• Distributed Mirror Descent for Online Composite Optimization
• Distributed Newton Method for Large-Scale Consensus Optimization
• Distributed Online Optimization in Dynamic Environments Using Mirror Descent
• Distributed stochastic subgradient projection algorithms for convex optimization
• Dual Averaging for Distributed Optimization: Convergence Analysis and Network Scaling
• Fast linear iterations for distributed averaging
• Forgetting-factor regrets for online convex optimization
• Newton-like method with diagonal correction for distributed optimization
• Non-asymptotic superlinear convergence of standard quasi-Newton methods
• Non-negative matrices and Markov chains.

This page was built for publication: Forgetting-factor regrets for distributed second-order online optimisation

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