Suppr超能文献

有向网络最小费用控制的边界约束。

Boundary Constraints for Minimum Cost Control of Directed Networks.

出版信息

IEEE Trans Cybern. 2017 Dec;47(12):4196-4207. doi: 10.1109/TCYB.2016.2602358. Epub 2016 Sep 12.

Abstract

Controlling directed networks with minimum cost has become an emerging branch in the areas of complex networks and control recently. In this paper, we focus on this minimum cost control problem subject to two types of boundary constraints, namely, trace boundary constraint and orthonormal boundary constraint on the input matrices. First, the minimum cost control problem is formulated as an optimization model for each type of boundary constraint. Next, two iterative algorithms, named as trace-constraint-based projected gradient method and orthonormal-constraint-based projected gradient method, are proposed to solve the optimal problem, respectively. Then, convergence properties of both algorithms are established. Finally, extensive simulation results show the effectiveness of our methods based on detailed comparisons between the two boundary conditions. We believe the results reveal some interesting physical insights for the optimal control of directed networks.

摘要

近年来,用最小成本控制有向网络已成为复杂网络和控制领域的一个新兴分支。本文主要研究了两种边界约束条件下的最小成本控制问题,即输入矩阵的迹边界约束和正交边界约束。首先,针对每种边界约束条件,将最小成本控制问题建模为一个优化模型。其次,分别提出了基于迹约束的投影梯度法和基于正交约束的投影梯度法这两种迭代算法来求解最优问题。然后,建立了这两种算法的收敛性。最后,通过对两种边界条件的详细比较,展示了我们的方法的有效性。我们相信,这些结果为有向网络的最优控制提供了一些有趣的物理见解。

文献检索

告别复杂PubMed语法,用中文像聊天一样搜索,搜遍4000万医学文献。AI智能推荐,让科研检索更轻松。

立即免费搜索

文件翻译

保留排版,准确专业,支持PDF/Word/PPT等文件格式,支持 12+语言互译。

免费翻译文档

深度研究

AI帮你快速写综述,25分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验