报告主题：The CP-matrix Completion Problem
报告人：范金燕 教授（上海交通大学）
报告时间：2016年11月4日（周五）9:00
报告地点：校本部G507
邀请人：王卿文教授
主办部门：8455新葡萄场网站数学系
Abstract:A symmetric matrix $C$ is completely positive (CP) if there exists an entrywise nonnegative matrix $B$ such that $C=BB^T$. The CP-completion problem is to study whether we can assign values to the missing entries of a partial matrix (i.e., a matrix having unknown entries) such that the completed matrix is completely positive. We propose a semidefinite algorithm for solving general CP-completion problems, and study its properties. When all the diagonal entries are given, the algorithm can give a certificate if a partial matrix is not CP-completable, and it almost always gives a CP-completion if it is CP-completable. When diagonal entries are partially given, similar properties hold. Computational experiments are also presented to show how CP-completion problems can be solved.
欢迎教师、学生参加 ！
