arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1811.07409math.OC
收藏

基于最优H2矩匹配的线性系(非)凸优化模型降阶

Optimal H2 moment matching-based model reduction for linear systems by (non)convex optimization

I. Necoara, T. C. Ionescu

摘要:

在本文中,我们计算家庭的降阶模型,匹配一个规定的一组时刻的高维线性定常系统。首先,我们完全参数化模型的插值点和自由参数,然后我们固定的插值点集和参数化模型只在自由参数。基于这两种参数化方法,以误差逼近的H ~ 2-范数为目标函数,导出了非凸最优化问题,即,我们寻找最佳的自由参数,甚至插值点,以确定近似模型产生最小的H2-范数误差。此外,我们提供了必要的一阶最优性条件,这些最优化问题给出明确的可控性和可观性Gramian的最小实现的误差系统。利用这些最优性条件,我们提出了求解相应最优化问题的梯度型方法,并给出了收敛性的数学保证。我们还推导出这些问题的凸SDP松弛和分析时,凸松弛是准确的。我们数值说明了我们的结果在几个测试例子的效率。

英文摘要:

In this paper we compute families of reduced order models that match a prescribed set of moments of a highly dimensional linear time-invariant system. First, we fully parametrize the models in the interpolation points and in the free parameters, and then we fix the set of interpolation points and parametrize the models only in the free parameters. Based on these two parametrizations and using as objective function the H2-norm of the error approximation we derive non-convex optimization problems, i.e., we search for the optimal free parameters and even the interpolation points to determine the approximation model yielding the minimal H2-norm error. Further, we provide the necessary first-order optimality conditions for these optimization problems given explicitly in terms of the controllability and the observability Gramians of a minimal realization of the error system. Using the optimality conditions, we propose gradient type methods for solving the corresponding optimization problems, with mathematical guarantees on their convergence. We also derive convex SDP relaxations for these problems and analyze when the convex relaxations are exact. We illustrate numerically the efficiency of our results on several test examples.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑