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.
Tensor norm and maximal singular vectors of non-negative tensors - a Perron-Frobenius theorem, a Collatz-Wielandt characterization and a generalized power method
Low-rank approximation in the Frobenius norm by column and row subset selection
矩阵$A$的CUR近似是特定类型的低秩近似$A \approx C U R$,其中$C$和$R$分别由$A$的列和行组成。获得这种近似的一种方法是将列子集选择应用于$A$和$A^T$。在这项工作中,我们描述了一个强大的数值和更快的变形列子集选择算法提出的Deshpande和Rademacher,这保证了误差接近Frobenius范数的最佳逼近误差。对于交叉近似,其中$U$需要是由$C$和$R$的交集描述的$A$的子矩阵的逆,我们得到一个新的算法,其误差界保持在最佳秩的因子$k + 1$内- $k$近似误差在Frobenius范数。据我们所知,这是第一个确定性的多项式时间算法,这个因素是有界的多项式在$k$。我们的推导和分析的算法是基于去随机化Zamarashkin和Osinsky最近存在的结果。为了说明我们的新的列子集选择算法的多功能性,低多线性秩张量近似的扩展。