Completely positive (CP) matrices have wide applications in combinatorics and statistics. Many NP-hard problems can be formulated as linear optimization problems over the cone of CP matrices. In this talk, we overview the semidefinite relaxation methods for the CP decomposition problem, the CP completion problem and the CP approximation problem. Some other related topics will also be discussed.
范金燕,上海交通大学数学科学学院教授。2002年在中国科学院数学与系统科学研究院获理学博士学位。主要从事非线性最优化的理论和方法研究,在非线性方程组、完全正优化等领域取得了一系列重要成果,出版了专著《非线性方程组数值方法》。现为多个学术期刊的编委。2017年获“第十三届中国青年女科学家奖”,入选科技部中青年科技创新领军人才。