Distributed constrained optimization algorithms with linear convergence rate over time-varying unbalanced graphs
From MaRDI portal
Publication:6537301
Recommendations
- Distributed discrete-time convex optimization with nonidentical local constraints over time-varying unbalanced directed graphs
- A distributed accelerated optimization algorithm over time‐varying directed graphs with uncoordinated step‐sizes
- Distributed optimization for multi-agent system over unbalanced graphs with linear convergence rate.
Cites work
- A Multi-Agent System With a Proportional-Integral Protocol for Distributed Constrained Optimization
- A Second-Order Multi-Agent Network for Bound-Constrained Distributed Optimization
- Achieving Geometric Convergence for Distributed Optimization Over Time-Varying Graphs
- Constrained Consensus and Optimization in Multi-Agent Networks
- Decentralized Optimization Over Time-Varying Directed Graphs With Row and Column-Stochastic Matrices
- Distributed constrained optimal consensus of multi-agent systems
- Distributed Continuous-Time Convex Optimization on Weight-Balanced Digraphs
- Distributed Continuous-Time Optimization: Nonuniform Gradient Gains, Finite-Time Convergence, and Convex Constraint Set
- Distributed convex optimization via continuous-time coordination algorithms with discrete-time communication
- Distributed Discrete-Time Algorithms for Convex Optimization With General Local Constraints on Weight-Unbalanced Digraph
- Distributed discrete-time convex optimization with nonidentical local constraints over time-varying unbalanced directed graphs
- Distributed optimization over directed graphs with row stochasticity and constraint regularity
- Distributed Optimization Over Time-Varying Directed Graphs
- Distributed Subgradient Methods for Multi-Agent Optimization
- Distributed Subgradient Projection Algorithm Over Directed Graphs
- Dual Averaging Push for Distributed Convex Optimization Over Time-Varying Directed Graph
- Exponential convergence of distributed primal-dual convex optimization algorithm without strong convexity
- Harnessing Smoothness to Accelerate Distributed Optimization
- scientific article; zbMATH DE number 1818892 (Why is no real title available?)
- Linear Convergence in Optimization Over Directed Graphs With Row-Stochastic Matrices
- On Distributed Convex Optimization Under Inequality and Equality Constraints
- On the Learning Behavior of Adaptive Networks—Part I: Transient Analysis
- On the Learning Behavior of Adaptive Networks—Part II: Performance Analysis
- Push–Pull Gradient Methods for Distributed Optimization in Networks
- Reaching an Optimal Consensus: Dynamical Systems That Compute Intersections of Convex Sets
- Second-order guarantees of distributed gradient algorithms
- Variance-Reduced Decentralized Stochastic Optimization With Accelerated Convergence
Cited in
(5)- A fixed step distributed proximal gradient push‐pull algorithm based on integral quadratic constraint
- Distributed stochastic optimization algorithm with non-consistent constraints in time-varying unbalanced networks
- Distributed stochastic constrained optimization with constant step-sizes via saddle-point dynamics
- Fully distributed bounded output consensus for heterogeneous multi-agent systems with communication link faults and actuator faults under double dynamic event-triggered mechanisms
- Byzantine-robust distributed vertical learning over time-varying networks
This page was built for publication: Distributed constrained optimization algorithms with linear convergence rate over time-varying unbalanced graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6537301)