Distributed Finite-Time Computation of Digraph Parameters: Left-Eigenvector, Out-Degree and Spectrum
From MaRDI portal
Cited in
(11)- Distributed algorithm for social cost minimization with second-order nonlinear dynamics over weight-unbalanced digraphs
- Seeking strategy design for distributed nonsmooth games and its application
- Distributed optimization over directed graphs with row stochasticity and constraint regularity
- A dynamical approach to efficient eigenvalue estimation in general multiagent networks
- Distributed event-triggered generalized Nash equilibrium seeking in multi-coalition noncooperative games with coupling constraints
- Finite-time general function consensus for multi-agent systems over signed digraphs
- Distributed optimisation design for solving the Stein equation with constraints
- Exponential convergence of distributed optimization for heterogeneous linear multi-agent systems over unbalanced digraphs
- Distributed algorithm design for constrained resource allocation problems with high-order multi-agent systems
- Event-triggered distributed optimal coordination of heterogeneous linear MASs over weight-unbalanced digraphs
- Solving a class of nonsmooth resource allocation problems with directed graphs through distributed Lipschitz continuous multi-proximal algorithms
This page was built for publication: Distributed Finite-Time Computation of Digraph Parameters: Left-Eigenvector, Out-Degree and Spectrum
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5358492)
