Numerical methods for solving some matrix feasibility problems

被引：0
|
作者：
Xue-Feng Duan
Chun-Mei Li
Jiao-Fen Li
Yong Ding
机构：
[1] Guilin University of Electronic Technology,College of Mathematics and Computational Science, Guangxi Colleges and Universities, Key Laboratory of Data Analysis and Computation
[2] Guilin University of Electronic Technology,Guangxi Key Laboratory of Cryptography and Information Security
来源：
Numerical Algorithms | 2017年 / 74卷
关键词：
Matrix feasibility problem; Quantum information science; Projection formula; Numerical method; 65F30; 65K05; 15B48; 81P68;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
In this paper, we design two numerical methods for solving some matrix feasibility problems, which arise in the quantum information science. By making use of the structured properties of linear constraints and the minimization theorem of symmetric matrix on manifold, the projection formulas of a matrix onto the feasible sets are given, and then the relaxed alternating projection algorithm and alternating projection algorithm on manifolds are designed to solve these problems. Numerical examples show that the new methods are feasible and effective.
引用
收藏
页码：461 / 479
页数：18
相关论文
共 50 条
12345