数学系 Seminar 第 2040 期
数学系“60周年”系庆系列报告
报告主题：Iterative algorithm for solving a class of convex feasibility problem
报告人：段雪峰 教授 （桂林电子科技大学）
报告时间：2020年11月3日（周二） 10:00
会议地址：G507
主办部门：理学院数学系
报告摘要：In this talk, we consider a class of convex feasibility problem, which arises in quantum computation. Based on the matrix equation theory, the feasible sets are characterized by exploiting the special structure of the linear constraints, and its analytic expression is given. By making use of the nice structure properties and the KKT condition, we derive the projection formulas of a matrix onto the feasible sets. The relaxed alternating projection method is designed to solve the convex feasibility problem. Numerical experiments show that the new method is feasible and effective.
欢迎教师、学生参加！
