不确定性下最优控制问题的拟蒙特卡罗方法
A quasi-Monte Carlo Method for an Optimal Control Problem Under Uncertainty
摘要:
研究了一类不确定性条件下的最优控制问题,其中目标函数是一个随机系数椭圆型偏微分方程的解,由一个控制函数控制。将最优化问题的鲁棒性表述为随机变量上的高维积分问题。众所周知,使用蒙特卡罗方法进行这种高维数值积分具有非常慢的收敛速度;同时,通过使用稀疏网格求积可以潜在地获得更快的收敛速率,但是由于涉及负的求积权重,这些导致非凸的离散化系统。在本文中,我们分析,而不是一个拟蒙特卡罗方法,它保留了理想的凸性结构的系统,并具有更快的收敛速度相比,普通的蒙特卡罗方法的应用。特别是,我们表明,在温和的假设下,输入随机场的衰减,通过使用一个专门设计的,随机移位的秩-1格求积规则获得的误差率基本上是成反比的正交节点的数量。详细推导了问题的总离散化误差,包括维数截断误差、有限元离散化误差和拟蒙特卡罗方法求积误差。我们评估的理论研究结果在数值实验。
英文摘要:
We study an optimal control problem under uncertainty, where the target function is the solution of an elliptic partial differential equation with random coefficients, steered by a control function. The robust formulation of the optimization problem is stated as a high-dimensional integration problem over the stochastic variables. It is well known that carrying out a high-dimensional numerical integration of this kind using a Monte Carlo method has a notoriously slow convergence rate; meanwhile, a faster rate of convergence can potentially be obtained by using sparse grid quadratures, but these lead to discretized systems that are non-convex due to the involvement of negative quadrature weights. In this paper, we analyze instead the application of a quasi-Monte Carlo method, which retains the desirable convexity structure of the system and has a faster convergence rate compared to ordinary Monte Carlo methods. In particular, we show that under moderate assumptions on the decay of the input random field, the error rate obtained by using a specially designed, randomly shifted rank-1 lattice quadrature rule is essentially inversely proportional to the number of quadrature nodes. The overall discretization error of the problem, consisting of the dimension truncation error, finite element discretization error and quasi-Monte Carlo quadrature error, is derived in detail. We assess the theoretical findings in numerical experiments.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。