A local-minimization-free zero-gradient-sum algorithm for distributed optimization (Q6049102)
From MaRDI portal
scientific article; zbMATH DE number 7738572
Language | Label | Description | Also known as |
---|---|---|---|
English | A local-minimization-free zero-gradient-sum algorithm for distributed optimization |
scientific article; zbMATH DE number 7738572 |
Statements
A local-minimization-free zero-gradient-sum algorithm for distributed optimization (English)
0 references
15 September 2023
0 references
The classical zero-gradient-sum (ZGS) algorithms for distributed optimization require restrictions on the initial conditions or minimization of local cost functions. This paper proposes a sliding mode-based ZGS algorithm that is free of both initial condition restriction and local minimization. Specifically, a sliding manifold is involved to ensure that the sum of local gradients goes to zero within a fixed time under any initial value. Then, a distributed protocol based on the sliding mode is presented to achieve global optimal consensus in a fixed time. The designed sliding mode method can be seamlessly integrated into many existing ZGS-based schemes.
0 references
distributed convex optimization
0 references
consensus
0 references
multi-agent systems
0 references
fixed-time convergence
0 references
sliding mode control
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references