Fixed-Time Distributed Strategy for Constrained Optimization

doi:10.1109/TAC.2025.3624904

Fixed-Time Distributed Strategy for Constrained Optimization

2025-10-23

0

PRE

AI

DOI：10.1109/TAC.2025.3624904

Original

Original request for help

Save

Abstract

En 中文

This article focuses on the distributed strategy synthesis to tackle the collaborative optimization problem subject to general set constraints in fixed time. Distinct from the traditional collaborative optimization problem that requires local value functions and their sum being convex, no convexity requirement is essential herein. Besides, the underlying communication network is switching. By bringing in appropriate auxiliary mechanism, a fixed-time distributed optimization strategy is synthesized first. Then, under the assumptions that the sum of the local value functions is gradient dominated and the communication topology keeps connected, it is demonstrated that the synthesized distributed strategy in terms of proper parameter criteria is capable of calculating the expected optimal solution to the studied constrained optimization problem in initialization-free fixed time. Finally, examples are simulated to confirm the theoretical results.

Keywords:

Constrained optimization

distributed strategy

fixed-time convergence

nonconvexity

Fixed-Time Distributed Strategy for Constrained Optimization

Abstract

Journal

Organization