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

Frobenius 范数下复变量矩阵优化问题的低复杂度迭代方法

Low-Complexity Iterative Methods for Complex-Variable Matrix Optimization Problems in Frobenius Norm

Sai Wang, Yi Gong

AI总结:

本文研究 Frobenius 范数下复变量矩阵优化问题的迭代求解方法,证明梯度下降法在复数域无约束问题中可行,并采用投影梯度下降法降低计算复杂度,理论分析与实验均验证了其良好的收敛性。

摘要:

Frobenius 范数下的复变量矩阵优化问题(CMOPs)在应用数学和工程应用的诸多领域中均有出现。本文重点研究通过迭代方法求解 CMOPs。对于无约束 CMOPs,我们证明了梯度下降(GD)方法在复数域中是可行的。进一步,为降低计算复杂度,采用投影梯度下降(PGD)方法求解约束 CMOPs。理论分析表明,PGD 方法在复数域中保持良好的收敛性。实验结果很好地支持了理论分析。

英文摘要:

Complex-variable matrix optimization problems (CMOPs) in Frobenius norm emerge in many areas of applied mathematics and engineering applications. In this letter, we focus on solving CMOPs by iterative methods. For unconstrained CMOPs, we prove that the gradient descent (GD) method is feasible in the complex domain. Further, in view of reducing the computation complexity, constrained CMOPs are solved by a projection gradient descent (PGD) method. The theoretical analysis shows that the PGD method maintains a good convergence in the complex domain. Experiment results well support the theoretical analysis.

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

↑