Distributed algorithm for resource allocation problems under persistent attacks
From MaRDI portal
Recommendations
- Stability analysis of distributed convex optimization under persistent attacks: a hybrid systems approach
- Distributed algorithm for robust resource allocation with polyhedral uncertain allocation parameters
- Distributed resource allocation of second-order multiagent systems with exogenous disturbances
- Distributed optimal in-network resource allocation algorithm design via a control theoretic approach
- Distributed resource allocation via multi-agent systems under time-varying networks
Cites work
- A framework for a class of hybrid extremum seeking controllers with dynamic inclusions
- An <formula formulatype="inline"><tex Notation="TeX">$O(1/k)$</tex> </formula> Gradient Method for Network Resource Allocation Problems
- Decentralized Resource Allocation in Dynamic Networks of Agents
- Distributed Generator Coordination for Initialization and Anytime Optimization in Economic Dispatch
- Distributed Optimization Under Adversarial Nodes
- Distributed convex optimization via continuous-time coordination algorithms with discrete-time communication
- Distributed gradient algorithm for constrained optimization with application to load sharing in power systems
- Distributed optimization for multi-agent systems with constraints set and communication time-delay over a directed graph
- Distributed sub-optimal resource allocation over weight-balanced graph via singular perturbation
- Hybrid dynamical systems. Modeling, stability, and robustness
- Initialization-free distributed algorithms for optimal resource allocation with feasibility constraints and application to economic dispatch of power systems
- Initialization-free distributed coordination for economic dispatch under varying loads and generator commitment
- Input-to-State Stabilizing Control Under Denial-of-Service
- Optimal scaling of a gradient method for distributed resource allocation
- Resilient control under denial-of-service: robust design
- Smooth Lyapunov Functions for Hybrid Systems Part II: (Pre)Asymptotically Stable Compact Sets
- Synchronization of complex dynamical networks under recoverable attacks
- \(L_2\)-gain analysis for systems with interval time-varying delay based on the switching technique
Cited in
(10)- An accelerated exact distributed first-order algorithm for optimization over directed networks
- Consensus-based distributed fixed-time optimization for a class of resource allocation problems
- Distributed Nash equilibrium seeking of aggregative games under networked attacks
- A distributed extremum seeking based resource allocation algorithm over switching networks
- Stability analysis of distributed convex optimization under persistent attacks: a hybrid systems approach
- Decentralized proximal splitting algorithms for composite constrained convex optimization
- An event-triggering algorithm for decentralized stochastic optimization over networks
- Resilient algorithm for distributed resource allocation under false data injection attacks
- Distributed safe resource allocation using barrier functions
- Resilient distributed economic dispatch of smart grids under deception attacks
This page was built for publication: Distributed algorithm for resource allocation problems under persistent attacks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q776086)
