Answers are grounded in this paper and cite their sources.
In this article, we consider practical predefined-time distributed nonconvex optimization problems for heterogeneous multiagent systems (MASs), where each agent is subject to unknown bounded external disturbances. First, based on the time-base generators (TBGs) and output regulation techniques, we propose a novel algorithm that addresses the practical predefined-time optimization problem in disturbance-free heterogeneous MASs. Subsequently, by introducing an external disturbance observer, we propose a novel robust algorithm. We further show that the disturbed optimization dynamics can be analyzed through the corresponding disturbance-free dynamics with an additional disturbance estimation error term. Using the boundedness theorem of TBGs, we prove that the proposed robust algorithm achieves practical predefined-time distributed optimization even under unknown and bounded external disturbances. In contrast to existing predefined-time approaches that typically rely on strong convexity, the convergence analysis requires M -smoothness rather than strong convexity. For convex costs, the resulting Karush-Kuhn-Tucker (KKT) point is globally optimal, whereas for nonconvex costs a local optimum is obtained under the second-order sufficient condition. Finally, we provide numerical examples.
No takes yet. Share an insight, caveat, or question.
Lin et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: