摘要
给出了求解正交非均衡Procrustes问题的MM方法并分析了收敛性.为了克服算法迭代次数多和计算结果依赖初始迭代点的困难,设计了特殊的初始点选取策略,并使用了拟牛顿加速及Nesterov加速技巧。数值结果显示,在一定情形下,提出的算法相比已有方法有优势.
The MM method for solving the orthogonal unbalanced Procrustes problem is given and the convergence is analyzed.Generally the MM method converges slowly and the computed results relies on the initial point.some special initial point selection strategies are designed.Furthermore the quasi-Newton acceleration and Nesterov acceleration techniques are used.Numerical results demonstrate that the proposed algorithm has advantages over the existing methods under certain circumstances.
作者
钱振语
刘新国
Qian Zhenyu;Liu Xinguo(School of Mathematical Science,Ocean University of China,QingDao 266100,China)
出处
《数值计算与计算机应用》
2020年第4期297-305,共9页
Journal on Numerical Methods and Computer Applications
基金
国家自然科学基金(11871444)部分资助。