本文讨论矩阵不等式CXD≥E约束下矩阵方程AY=B的双对称解,即给定矩阵A,B,C,D和E,求双对称矩阵X,使得AX=B和CXD≥E,其中CXD2E表示矩阵CXD—E非负.本文将问题转化为矩阵不等式最小非负偏差问题,利用极分解理论给出了求其解的迭代方法,并结合相关矩阵理论说明算法的收敛性.最后给出数值算例验证算法的有效性.
We consider the bisymmetric solution of the matrix equation AX = B over linear in- equality CXD ≥ E constraint. That is, given matrices A, B, C, D and E, find a bisymmetric matrix X such that AX -- B and C X D ≥ E, where C X D ≥ E means that matrix C X D - E nonnegative. We transform the problem into a matrix inequality smallest nonnegative de- viation problem, and then combined with the polar decomposition theory, we propose an iterative method for solving this transformed problem. The convergence analysis of the pro- posed method are given and numerical experiments are proposed to show that the iterative method is feasible and effective.