由超图拉普拉斯算子控制的演化方程的最优控制问题
Optimal control problem of evolution equation governed by hypergraph Laplacian
AI总结:
本文研究由超图拉普拉斯算子控制的微分包含的最优控制问题,通过团展开近似算子克服多值性困难,建立近似问题的最优性条件并讨论其向原问题的收敛性。
摘要:
本文考虑一个由超图拉普拉斯算子控制的常微分包含的最优控制问题,该算子被定义为一个凸函数的次微分,因此是一个集值算子。通过使用先前研究中建立的先验估计方法,我们可以确保对于合适的代价函数最优控制的存在性。然而,由于超图拉普拉斯算子的多值性,推导该问题的必要最优性条件似乎较为困难。为应对这一困难,我们基于超图的近似方法(即所谓的“团展开”)引入一个近似算子。我们首先考虑具有超图拉普拉斯算子团展开的近似问题的最优性条件,然后讨论其向原问题的收敛性。在附录中,我们陈述了超图拉普拉斯算子团展开的一些基本性质,以供未来工作使用。
英文摘要:
In this paper, we consider an optimal control problem of an ordinary differential inclusion governed by the hypergraph Laplacian, which is defined as a subdifferential of a convex function and then is a set-valued operator. We can assure the existence of optimal control for a suitable cost function by using methods of a priori estimates established in the previous studies. However, due to the multivaluedness of the hypergraph Laplacian, it seems to be difficult to derive the necessary optimality condition for this problem. To cope with this difficulty, we introduce an approximation operator based on the approximation method of the hypergraph, so-called ``clique expansion.'' We first consider the optimality condition of the approximation problem with the clique expansion of the hypergraph Laplacian and next discuss the convergence to the original problem. In appendix, we state some basic properties of the clique expansion of the hypergraph Laplacian for future works.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。