微分包含
数学优化
数学
最优化问题
趋同(经济学)
次梯度方法
李雅普诺夫函数
李普希茨连续性
计算机科学
功率流
人工神经网络
国家(计算机科学)
凸函数
班级(哲学)
凸优化
不变(物理)
拉格朗日乘数
流量网络
功能(生物学)
可微函数
最优控制
约束优化
简单(哲学)
反演(地质)
作者
Jingxin Liu,Shuwen Liu,Yingxu Wang,Jun Peng,Xinhao Liao,Chunhong Du,Hangjun Che,Jin-song Dong
标识
DOI:10.1109/tai.2026.3675069
摘要
In this paper, we propose a projection-type neuro-dynamic approach for solving a class of nonsmooth constrained distributed optimization problems with interval-valued local objective functions over a network of vertices. We introduce the concept of generalized-Hukuhara subgradient (gH-subgradient) and differential inclusion system in the algorithm framework, aiming to cope with the confusion that objective functions may not be gH-differentiable, and further deriving the efficiency condition of the solution of the problem by empolying the geometry relationship between the gH-subgradient and the normal cone. The boundedness and convergence of the state solution of the proposed neurodynamic algorithm are provable, and the conclusion that the state outputs of all vertices reach consensus on the efficient solution of the problem can be guaranteed by Lyapunov function method and Byrnes-Martin integral invariant principle. The designed neurodynamic model is simple in structure, avoids the calculation of matrix inversion and the introduction of Lagrange multipliers, and is suitable for solving general distributed optimization problems with interval-valued functions and constraints. Finally, the simulation applications of network utility, power flow balancing and gas transportation show the viability of the proposed algorithm.
科研通智能强力驱动
Strongly Powered by AbleSci AI