Numerical methods for solving some matrix feasibility problems

Abstract

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… (More)
DOI: 10.1007/s11075-016-0155-2

Topics

4 Figures and Tables

Slides referencing similar topics