The Split Feasibility Problem with Polynomials
副标题：
时间：2017-12-14 来源：数学机械化重点实验室
题目： The Split Feasibility Problem with Polynomials
报告人： Jiawang Nie (Professor of University of California, San Diego)
时间地点： 2017.12.20 15:00pm N420
摘要： This talk discusses the split feasibility problem with polynomials. The sets are semi-algebraic, defined by polynomial inequalities. They can be either convex or nonconvex, either feasible or infeasible. We give semidefinite relaxations for representing the intersection of the sets. Properties of the semidefinite relaxations are studied. Based on that, a semidefinite relaxation algorithm is given for solving the split feasibility problem. Under a general condition, we prove that: if the split feasibility problem is feasible, we can get a feasible point; if it is infeasible, we can obtain a certificate for the infeasibility. This is a joint work with Jinling Zhao.
