Distributed online convex optimization with multiple coupled constraints: a double accelerated push-pull algorithm
From MaRDI portal
Publication:6136497
DOI10.1016/j.jfranklin.2023.10.041MaRDI QIDQ6136497
Wen-Ling Li, Wei Suo, Unnamed Author, Yang Liu
Publication date: 17 January 2024
Published in: Journal of the Franklin Institute (Search for Journal in Brave)
Cites Work
- A decomposition method for large scale MILPs, with performance guarantees and a power system application
- Dual decomposition for multi-agent distributed optimization with coupling constraints
- Distributed optimization with closed convex set for multi-agent networks over directed graphs
- A continuous-time consensus algorithm using neurodynamic system for distributed time-varying optimization with inequality constraints
- Continuous-time distributed optimization with strictly pseudoconvex objective functions
- An adaptive online learning algorithm for distributed convex optimization with coupled constraints over unbalanced directed graphs
- Online Learning and Online Convex Optimization
- Distributed Online Optimization in Dynamic Environments Using Mirror Descent
- A Saddle Point Algorithm for Networked Online Convex Optimization
- Achieving Geometric Convergence for Distributed Optimization Over Time-Varying Graphs
- Diffusion LMS for Multitask Problems With Local Linear Equality Constraints
- Distributed Projection Subgradient Algorithm Over Time-Varying General Unbalanced Directed Graphs
- Distributed Online Optimization for Multi-Agent Networks With Coupled Inequality Constraints
- Accelerated Optimization for Machine Learning
- Distributed Online Optimization With Long-Term Constraints
- Online Distributed Optimization With Nonconvex Objective Functions: Sublinearity of First-Order Optimality Condition-Based Regret
- Distributed Dual Gradient Tracking for Resource Allocation in Unbalanced Networks
- Distributed Heavy-Ball: A Generalization and Acceleration of First-Order Methods With Gradient Tracking
- Online Distributed Optimization With Strongly Pseudoconvex-Sum Cost Functions
- ADD-OPT: Accelerated Distributed Directed Optimization
- A Proximal Diffusion Strategy for Multiagent Optimization With Sparse Affine Constraints
- Decentralized Optimization Over Time-Varying Directed Graphs With Row and Column-Stochastic Matrices
- Push–Pull Gradient Methods for Distributed Optimization in Networks
This page was built for publication: Distributed online convex optimization with multiple coupled constraints: a double accelerated push-pull algorithm