Distributed discrete-time convex optimization with nonidentical local constraints over time-varying unbalanced directed graphs
From MaRDI portal
Publication:2665704
DOI10.1016/j.automatica.2021.109899zbMath1478.93258OpenAlexW3198532493MaRDI QIDQ2665704
Wei Xing Zheng, Wenwu Yu, Hongzhe Liu, Ya-Nan Zhu
Publication date: 19 November 2021
Published in: Automatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.automatica.2021.109899
constrained optimizationdistributed discrete-time algorithmpush-sum frameworktime-varying unbalanced directed topologies
Related Items (2)
Two-timescale recurrent neural networks for distributed minimax optimization ⋮ An event-triggered collaborative neurodynamic approach to distributed global optimization
Uses Software
Cites Work
- Distributed constrained optimal consensus of multi-agent systems
- Primal-dual algorithm for distributed constrained optimization
- Distributed convex optimization via continuous-time coordination algorithms with discrete-time communication
- Distributed optimization over directed graphs with row stochasticity and constraint regularity
- Exponential convergence of distributed primal-dual convex optimization algorithm without strong convexity
- Stochastic Gradient-Push for Strongly Convex Functions on Time-Varying Directed Graphs
- A Second-Order Multi-Agent Network for Bound-Constrained Distributed Optimization
- Distributed Optimization Over Time-Varying Directed Graphs
- Distributed Continuous-Time Convex Optimization on Weight-Balanced Digraphs
- Linear Convergence in Optimization Over Directed Graphs With Row-Stochastic Matrices
- D-ADMM: A Communication-Efficient Distributed Algorithm for Separable Optimization
- On the Linear Convergence of the ADMM in Decentralized Consensus Optimization
- Constrained Consensus Algorithms With Fixed Step Size for Distributed Convex Optimization Over Multiagent Networks
- Achieving Geometric Convergence for Distributed Optimization Over Time-Varying Graphs
- Distributed Projection Subgradient Algorithm Over Time-Varying General Unbalanced Directed Graphs
- Harnessing Smoothness to Accelerate Distributed Optimization
- Distributed Subgradient Methods for Multi-Agent Optimization
- Constrained Consensus and Optimization in Multi-Agent Networks
- Fenchel Dual Gradient Methods for Distributed Convex Optimization Over Time-Varying Networks
- Distributed Continuous-Time and Discrete-Time Optimization With Nonuniform Unbounded Convex Constraint Sets and Nonuniform Stepsizes
- Continuous-Time Distributed Subgradient Algorithm for Convex Optimization With General Constraints
- Distributed Continuous-Time Optimization: Nonuniform Gradient Gains, Finite-Time Convergence, and Convex Constraint Set
- On Distributed Convex Optimization Under Inequality and Equality Constraints
- Quantized Subgradient Algorithm and Data-Rate Analysis for Distributed Optimization
- A Multi-Agent System With a Proportional-Integral Protocol for Distributed Constrained Optimization
- The method of projections for finding the common point of convex sets
- Decentralized Optimization Over Time-Varying Directed Graphs With Row and Column-Stochastic Matrices
This page was built for publication: Distributed discrete-time convex optimization with nonidentical local constraints over time-varying unbalanced directed graphs
