An Apocalypse-Free First-Order Low-Rank Optimization Algorithm with at Most One Rank Reduction Attempt per Iteration

IF 1.5 2区数学 Q2 MATHEMATICS, APPLIED

SIAM Journal on Matrix Analysis and Applications Pub Date : 2023-09-22 DOI:10.1137/22m1518256

Guillaume Olikier, P.-A. Absil

引用次数: 0

查看原文本刊更多论文

每次迭代最多一次降阶尝试的无启示一阶低秩优化算法

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

SIAM Journal on Matrix Analysis and Applications 数学-应用数学

CiteScore

2.90

自引率

6.70%

发文量

审稿时长

6-12 weeks

期刊介绍： The SIAM Journal on Matrix Analysis and Applications contains research articles in matrix analysis and its applications and papers of interest to the numerical linear algebra community. Applications include such areas as signal processing, systems and control theory, statistics, Markov chains, and mathematical biology. Also contains papers that are of a theoretical nature but have a possible impact on applications.