Gradient-tracking-based distributed Nesterov accelerated algorithms for multiple cluster games over time-varying unbalanced digraphs

Cites Work

Distributed convergence to Nash equilibria in two-network zero-sum games
Nash equilibrium seeking for \(N\)-coalition noncooperative games
Solving leaderless multi-cluster games over directed graphs
Continuous-time distributed Nash strategy over switching topologies with gain adaptation
Distributed Optimization Over Time-Varying Directed Graphs
Achieving Geometric Convergence for Distributed Optimization Over Time-Varying Graphs
A Passivity-Based Approach to Nash Equilibrium Seeking Over Networks
Distributed Generalized Nash Equilibrium Seeking in Aggregative Games on Time-Varying Networks
Dual Averaging Push for Distributed Convex Optimization Over Time-Varying Directed Graph
Distributed Heavy-Ball: A Generalization and Acceleration of First-Order Methods With Gradient Tracking
Some methods of speeding up the convergence of iteration methods
Decentralized Optimization Over Time-Varying Directed Graphs With Row and Column-Stochastic Matrices
Push–Pull Gradient Methods for Distributed Optimization in Networks
Zur Theorie der Markoffschen Ketten.
On the linear convergence of distributed Nash equilibrium seeking for multi-cluster games under partial-decision information
Distributed Nash equilibrium computation under round-robin scheduling protocol

This page was built for publication: Gradient-tracking-based distributed Nesterov accelerated algorithms for multiple cluster games over time-varying unbalanced digraphs

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