Resilient penalty function method for distributed constrained optimization under Byzantine attack
From MaRDI portal
Publication:6118884
DOI10.1016/j.ins.2022.02.055OpenAlexW4214881548MaRDI QIDQ6118884
Chentao Xu, Qingshan Liu, Tingwen Huang
Publication date: 28 February 2024
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2022.02.055
Cites Work
- Privacy preserving distributed optimization using homomorphic encryption
- A consensus algorithm based on collective neurodynamic system for distributed optimization with linear and bound constraints
- Secure impulsive synchronization control of multi-agent systems under deception attacks
- Distributed Nash equilibrium computation in aggregative games: an event-triggered algorithm
- Privacy-preserving mixed set operations
- Differentially private distributed optimization for multi-agent systems via the augmented Lagrangian algorithm
- Passivity-Based Distributed Optimization With Communication Delays Using PI Consensus Algorithm
- Distributed Optimization Under Adversarial Nodes
- Data Encoding for Byzantine-Resilient Distributed Optimization
- Distributed Proximal Algorithms for Multiagent Optimization With Coupled Inequality Constraints
- Secure and Privacy-Preserving Consensus
- Adaptive Exact Penalty Design for Constrained Distributed Optimization
- Balancing Communication and Computation in Distributed Optimization
- Distributed Generator Coordination for Initialization and Anytime Optimization in Economic Dispatch
- Resilient Distributed Optimization Algorithm Against Adversarial Attacks
- Resilient Primal–Dual Optimization Algorithms for Distributed Resource Allocation
- Resilient consensus‐based distributed optimization under deception attacks
This page was built for publication: Resilient penalty function method for distributed constrained optimization under Byzantine attack
