An adaptive online learning algorithm for distributed convex optimization with coupled constraints over unbalanced directed graphs
From MaRDI portal
Publication:2318770
DOI10.1016/j.jfranklin.2019.06.026zbMath1418.93117OpenAlexW2954745361WikidataQ127553163 ScholiaQ127553163MaRDI QIDQ2318770
Jueyou Li, Chuanye Gu, Zhi-You Wu
Publication date: 16 August 2019
Published in: Journal of the Franklin Institute (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jfranklin.2019.06.026
Applications of graph theory (05C90) Convex programming (90C25) Adaptive control/observation systems (93C40) Online algorithms; streaming algorithms (68W27)
Related Items (8)
An adaptive penalty-like continuous-time algorithm to constrained distributed convex optimization ⋮ Distributed online bandit linear regressions with differential privacy ⋮ Distributed online convex optimization with multiple coupled constraints: a double accelerated push-pull algorithm ⋮ ET-PDA: an event-triggered parameter distributed accelerated algorithm for economic dispatch problems ⋮ Privacy-preserving dual stochastic push-sum algorithm for distributed constrained optimization ⋮ Cooperative convex optimization with subgradient delays using push-sum distributed dual averaging ⋮ A convex approach to trajectory optimization for boost back of vertical take-off/vertical landing reusable launch vehicles ⋮ A subgradient-based continuous-time algorithm for constrained distributed quadratic programming
Cites Work
- Primal recovery from consensus-based dual decomposition for distributed convex optimization
- A decomposition method for large scale MILPs, with performance guarantees and a power system application
- A fast dual proximal-gradient method for separable convex optimization with linear coupled constraints
- Distributed stochastic subgradient projection algorithms for convex optimization
- Logarithmic regret algorithms for online convex optimization
- Dual decomposition for multi-agent distributed optimization with coupling constraints
- On linear convergence of a distributed dual gradient algorithm for linearly constrained separable convex problems
- Exponential convergence of distributed primal-dual convex optimization algorithm without strong convexity
- Stochastic Gradient-Push for Strongly Convex Functions on Time-Varying Directed Graphs
- Online Distributed Convex Optimization on Dynamic Networks
- Distributed Optimization Over Time-Varying Directed Graphs
- Regression Methods for Stochastic Control Problems and Their Convergence Analysis
- Online Learning and Online Convex Optimization
- Stochastic Dual Averaging for Decentralized Online Optimization on Time-Varying Communication Graphs
- An Adaptive Projected Subgradient Approach to Learning in Diffusion Networks
- Distributed Projection Subgradient Algorithm Over Time-Varying General Unbalanced Directed Graphs
- Distributed Subgradient Methods for Multi-Agent Optimization
- Distributed Parameter Estimation in Sensor Networks: Nonlinear Observation Models and Imperfect Communication
- A Distributed Numerical Approach to Interference Alignment and Applications to Wireless Interference Networks
- On Distributed Convex Optimization Under Inequality and Equality Constraints
- Dual Averaging for Distributed Optimization: Convergence Analysis and Network Scaling
- An <formula formulatype="inline"><tex Notation="TeX">$O(1/k)$</tex> </formula> Gradient Method for Network Resource Allocation Problems
This page was built for publication: An adaptive online learning algorithm for distributed convex optimization with coupled constraints over unbalanced directed graphs
