arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2610.41331math.OC
收藏

保区域加速梯度法用于测地凸优化

Region-Preserving Accelerated Gradient Methods for Geodesically Convex Optimization

National Institute of Informatics (NII)(信息处理学会);The Graduate University for Advanced Studies (SOKENDAI)(高级研究大学院大学)

Derun Zhou

AI总结:

针对黎曼流形上的测地凸优化,提出保区域的加速梯度法,无需预先假设迭代点区域,可处理正负曲率,获加速收敛速率且无需重启。

摘要:

加速黎曼优化方法通常需要先验假设,即其迭代点保持在满足几何界的区域内。针对具有局部有界截面曲率的黎曼流形上的光滑测地凸优化问题,我们提出了一种参数化惯性动力系统和显式加速梯度法。我们的设定允许正曲率和负曲率,无需环境流形的完备性。从曲率修正的连续模型出发,我们通过消除李雅普诺夫能量差中的不定交叉项构造离散更新,并推导固定步长的可验证条件。所得能量分析确保初始测地球的保真性,无需预先假设迭代点包含其中。我们进一步为测地凸和强测地凸目标建立加速收敛速率,无需重启。

英文摘要:

Accelerated Riemannian optimization methods often require a priori assumptions that their iterates remain in a region where geometric bounds hold. We develop a parameterized inertial dynamical system and an explicit accelerated gradient method for smooth geodesically convex optimization on Riemannian manifolds with locally bounded sectional curvature. Our setting allows both positive and negative curvature without requiring completeness of the ambient manifold. Starting from a curvature-corrected continuous model, we construct the discrete updates by eliminating indefinite cross terms in the Lyapunov energy difference and derive verifiable conditions for a fixed step size. The resulting energy analysis establishes preservation of the initial geodesic ball without assuming iterate containment in advance. We further establish accelerated convergence rates for both geodesically convex and strongly geodesically convex objectives, without requiring restarts.

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

↑