Distributed online convex optimization with multiple coupled constraints: a double accelerated push-pull algorithm

DOI10.1016/J.JFRANKLIN.2023.10.041MaRDI QIDQ6136497zbMATH OpenFDO

Authors Wei Suo, Wenling Li, Yang Liu

Publication date 17 January 2024

Published in Journal of the Franklin Institute (Search for Journal in Brave)

Mathematics Subject Classification ID

Convex programming (90C25)

Recommendations

• An adaptive online learning algorithm for distributed convex optimization with coupled constraints over unbalanced directed graphs
• Distributed convex optimization with coupling constraints over time-varying directed graphs
• Distributed online constrained convex optimization with event-triggered communication
• Online distributed optimization with strongly pseudoconvex-sum cost functions and coupled inequality constraints
• Tracking-ADMM for distributed constraint-coupled optimization

Cites work

• A Proximal Diffusion Strategy for Multiagent Optimization With Sparse Affine Constraints
• A Saddle Point Algorithm for Networked Online Convex Optimization
• A continuous-time consensus algorithm using neurodynamic system for distributed time-varying optimization with inequality constraints
• A decomposition method for large scale MILPs, with performance guarantees and a power system application
• ADD-OPT: Accelerated Distributed Directed Optimization
• Accelerated optimization for machine learning. First-order algorithms. With forewords by Michael I. Jordan, Zongben Xu and Zhi-Quan Luo
• Achieving Geometric Convergence for Distributed Optimization Over Time-Varying Graphs
• An adaptive online learning algorithm for distributed convex optimization with coupled constraints over unbalanced directed graphs
• Continuous-time distributed optimization with strictly pseudoconvex objective functions
• Decentralized Optimization Over Time-Varying Directed Graphs With Row and Column-Stochastic Matrices
• Diffusion LMS for Multitask Problems With Local Linear Equality Constraints
• Distributed Dual Gradient Tracking for Resource Allocation in Unbalanced Networks
• Distributed Heavy-Ball: A Generalization and Acceleration of First-Order Methods With Gradient Tracking
• Distributed Online Optimization With Long-Term Constraints
• Distributed Online Optimization for Multi-Agent Networks With Coupled Inequality Constraints
• Distributed Online Optimization in Dynamic Environments Using Mirror Descent
• Distributed Projection Subgradient Algorithm Over Time-Varying General Unbalanced Directed Graphs
• Distributed optimization with closed convex set for multi-agent networks over directed graphs
• Dual decomposition for multi-agent distributed optimization with coupling constraints
• Online Distributed Optimization With Nonconvex Objective Functions: Sublinearity of First-Order Optimality Condition-Based Regret
• Online Distributed Optimization With Strongly Pseudoconvex-Sum Cost Functions
• Online learning and online convex optimization
• Push–Pull Gradient Methods for Distributed Optimization in Networks

Cited in

(2)

• Online composite optimization with time-varying regularizers
• Distributed online optimization subject to long-term constraints and time-varying topology: an event-triggered and bandit feedback approach

This page was built for publication: Distributed online convex optimization with multiple coupled constraints: a double accelerated push-pull algorithm

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