核范数和谱范数下广义Sylvester方程最小二乘问题的有效算法  

AN EFFICIENT METHOD FOR SOLVING GENERALIZED SYLVERSTER EQUATION MINIMIZATION PROBLEM UNDER THE NUCLEAR AND SPECTRAL NORM

作　　者：李姣芬[1] 宋丹丹[1] 李涛[1] 黎稳[2] 

机构地区：[1]桂林电子科技大学数学与计算科学学院,广西高校数据分析与计算重点实验室,桂林541004 [2]华南师范大学数学科学学院,广州510631

出　　处：《计算数学》2017年第2期129-150,共22页Mathematica Numerica Sinica

基　　金：国家自然科学基金资助项目(11561015,11671158);广西自然科学基金资助项目(2016GXNSFAA380074,2016GXNSFFA380009)

摘　　要：本文从数值角度讨论Schatten q-范数下的广义Sylvester方程约束最小二乘问题min x∈s‖N∑i=1A_iXB_i—C‖_q,其中S为闭凸约束集合,Schatten q-范数定义为‖M‖_q^q=∑_(i=1)~nσ_i^q(M),其中σ_i(M)为M∈R^(n×n)的奇异值.该问题的几类特殊情形在图像处理、控制论等领域有广泛的应用.q=2即Frobenius范数下该问题已被充分研究,故本文着重讨论q=1,+∞,即核范数和谱范数下该问题的数值求解.采用的数值方法是非精确标准容易执行的部分非精确交替方向法,并结合奇异值阈值算法,Moreau-Yosida正则化算法,谱投影算法和LSQR算法等求解相应子问题.给出算法的收敛性证明,并用数值算例验证其高效可行性.In this paper,we are concerned with the following generalized Sylvester equation least squares problem of the form X∈S^min‖∑i=1^N AiXBi-C‖q, where ‖.‖ stands for the Schatten q-norm, which defined as ‖M‖q^q=∑i=1^nσi^q（M） and σi（M）（i = 1,... ,n） be the singular values of M∈R^n×n,S be the closed convex set. Some special types of this problem can be applied in image processing and control theory. An inexact version of alternating direction method （ADM） with truly implementable inexactness criteria is proposed for solving this problem under the nuclear norm and spectrum norm, namely q = 1, ＋∞, combining with the Singular Value Threshold algorithm, Moreau-Yosida regularization algorithm, Spectral Projection algorithm and LSQR algorithm to deal with the generated subproblems. Numerical experiments are performed to illustrate the feasibility and efficiency of the proposed algorithm with randomly generated data.

关 键 词：Schatten q-范数 谱范数 核范数 广义Sylvester方程 非精确交替方向法 

分 类 号：O241.5[理学—计算数学]