大规模和全局化最大化到不稳定性的距离
Large-Scale and Global Maximization of the Distance to Instability
AI总结:
本文研究了如何最大化矩阵到不稳定性的距离,提出了一种全局收敛算法和子空间框架,以处理大矩阵问题,实现快速收敛。
摘要:
矩阵到不稳定性的距离越大,其在不确定性下的稳定性越强,暂态行为也越不严重。受此启发,本文考虑了依赖多个参数的矩阵到不稳定性的最大化问题,这是一个非凸优化问题,可能非光滑。第一部分提出了一种全局收敛算法,适用于小矩阵和少量参数的情况。第二部分针对大规模矩阵问题,设计了子空间框架,大幅减少矩阵规模。通过子空间的增长证明了全局收敛性,并在子空间维度上实现了超线性收敛率。
英文摘要:
The larger the distance to instability from a matrix is, the more robustly stable the associated autonomous dynamical system is in the presence of uncertainties and typically the less severe transient behavior its solution exhibits. Motivated by these issues, we consider the maximization of the distance to instability of a matrix dependent on several parameters, a nonconvex optimization problem that is likely to be nonsmooth. In the first part we propose a globally convergent algorithm when the matrix is of small size and depends on a few parameters. In the second part we deal with the problems involving large matrices. We tailor a subspace framework that reduces the size of the matrix drastically. The strength of the tailored subspace framework is proven with a global convergence result as the subspaces grow and a superlinear rate-of-convergence result with respect to the subspace dimension.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。