Online Distributed Optimization With Nonconvex Objective Functions: Sublinearity of First-Order Optimality Condition-Based Regret

DOI10.1109/TAC.2021.3091096MaRDI QIDQ5092205zbMATH OpenOpenAlexFDO

Authors Kaihong Lu, Long Wang

Publication date 28 July 2022

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

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

Mathematics Subject Classification ID

Systems theory; control (93-XX)

Cited in

(8)

• Distributed online convex optimization with multiple coupled constraints: a double accelerated push-pull algorithm
• Gradient-free algorithms for distributed online convex optimization
• Regret and Cumulative Constraint Violation Analysis for Distributed Online Constrained Convex Optimization
• Online Distributed Optimization With Strongly Pseudoconvex-Sum Cost Functions
• Regrets of proximal method of multipliers for online non-convex optimization with long term constraints
• Online distributed nonconvex optimization with stochastic objective functions: high probability bound analysis of dynamic regrets
• Distributed strategies for mixed equilibrium problems: continuous-time theoretical approaches
• Distributed online optimisation in unknown dynamic environment

This page was built for publication: Online Distributed Optimization With Nonconvex Objective Functions: Sublinearity of First-Order Optimality Condition-Based Regret

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