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

秩一黎曼子空间下降法用于非线性矩阵方程

Rank-one Riemannian Subspace Descent for Nonlinear Matrix Equations

Yogesh Darmwal, Ketan Rajawat

AI总结:

本文提出了一种秩一黎曼子空间下降算法,用于高效求解高维稠密对称正定约束的非线性矩阵方程。

摘要:

我们提出了一种秩一黎曼子空间下降算法,用于计算出现在控制理论、动态规划和随机滤波中的非线性矩阵方程的对称正定(SPD)解。对于大小为n×n的解矩阵,标准稠密矩阵方程的解法通常每迭代一次需要O(n³)的计算成本,而高效的O(n²)方法要么依赖于稀疏性或低秩解,要么迭代次数增长缓慢。所提出的方法通过更新变换后的黎曼梯度的主导特征分量来更新,该分量通过最多O(log(n))次幂迭代确定。更新结构还使在许多情况下能够以最小的额外成本精确选择步长。对于由标准矩阵运算组成的目标函数,每次迭代仅需使用矩阵-向量乘积即可实现,从而获得O(n²)的算术计算成本。我们在标准光滑性假设下证明了O(n)次迭代的界限,且在黎曼流形强凸性下有改进的界限。在大规模CARE、DARE和其他非线性矩阵方程上的数值实验表明,所提出的方法能够解决那些比较求解器,包括MATLAB的icare、保持结构的倍增法和子空间下降基线方法无法返回解的实例(在我们的测试中,n达到10,000)。这些结果表明,秩一流形更新为高维和稠密SPD约束矩阵方程提供了一种实用的方法。MATLAB代码实现已在GitHub上公开:https://github.com/yogeshd-iitk/nonlinear_matrix_equation_R1RSD

英文摘要:

We propose a rank-one Riemannian subspace descent algorithm for computing symmetric positive definite (SPD) solutions to nonlinear matrix equations arising in control theory, dynamic programming, and stochastic filtering. For solution matrices of size $n\times n$, standard approaches for dense matrix equations typically incur $\mathcal{O}(n^3)$ cost per-iteration, while the efficient $\mathcal{O}(n^2)$ methods either rely on sparsity or low-rank solutions, or have iteration counts that scale poorly. The proposed method entails updating along the dominant eigen-component of a transformed Riemannian gradient, identified using at most $\mathcal{O}(\log(n))$ power iterations. The update structure also enables exact step-size selection in many cases at minimal additional cost. For objectives defined as compositions of standard matrix operations, each iteration can be implemented using only matrix--vector products, yielding $\mathcal{O}(n^2)$ arithmetic cost. We prove an $\mathcal{O}(n)$ iteration bound under standard smoothness assumptions, with improved bounds under geodesic strong convexity. Numerical experiments on large-scale CARE, DARE, and other nonlinear matrix equations show that the proposed algorithm solves instances (up to $n=10{,}000$ in our tests) for which the compared solvers, including MATLAB's \texttt{icare}, structure-preserving doubling, and subspace-descent baselines fail to return a solution. These results demonstrate that rank-one manifold updates provide a practical approach for high-dimensional and dense SPD-constrained matrix equations. MATLAB code implementation is publicly available on GitHub : \href{https://github.com/yogeshd-iitk/nonlinear_matrix_equation_R1RSD}{\textcolor{blue}{https://github.com/yogeshd-iitk/nonlinear\_matrix \_equation\_R1RSD}}

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

↑