Distributed convex optimization with coupling constraints over time-varying directed graphs
From MaRDI portal
Publication:1983757
DOI10.3934/jimo.2020061zbMath1476.90342arXiv1805.07916OpenAlexW3012816074MaRDI QIDQ1983757
Chuanye Gu, Bingru Zhang, Jueyou Li
Publication date: 10 September 2021
Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1805.07916
Programming involving graphs or networks (90C35) Convex programming (90C25) Multi-objective and goal programming (90C29)
Related Items (3)
A differentially private distributed optimization method for constrained optimization ⋮ Privacy-preserving dual stochastic push-sum algorithm for distributed constrained optimization ⋮ A privacy-masking learning algorithm for online distributed optimization over time-varying unbalanced digraphs
Cites Work
- Unnamed Item
- A fast dual proximal-gradient method for separable convex optimization with linear coupled constraints
- Distributed stochastic subgradient projection algorithms for convex optimization
- Model-free composite control of flexible manipulators based on adaptive dynamic programming
- Dual decomposition for multi-agent distributed optimization with coupling constraints
- Distributed optimization methods for nonconvex problems with inequality constraints over time-varying networks
- Gradient-free method for nonsmooth distributed optimization
- On Convergence Rate of Distributed Stochastic Gradient Algorithm for Convex Optimization with Inequality Constraints
- Distributed Optimization Over Time-Varying Directed Graphs
- Distributed Constrained Optimization by Consensus-Based Primal-Dual Perturbation Method
- Distributed Recursive Least-Squares: Stability and Performance Analysis
- On the Linear Convergence of the ADMM in Decentralized Consensus Optimization
- Multi-Agent Distributed Optimization via Inexact Consensus ADMM
- Achieving Geometric Convergence for Distributed Optimization Over Time-Varying Graphs
- A Proximal Dual Consensus ADMM Method for Multi-Agent Constrained Optimization
- Distributed Subgradient Methods for Multi-Agent Optimization
- A Distributed ADMM-like Method for Resource Sharing over Time-Varying Networks
- EXTRA: An Exact First-Order Algorithm for Decentralized Consensus Optimization
- 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: Distributed convex optimization with coupling constraints over time-varying directed graphs
