题 目：A Parallelizable Algorithm for Orthogonally Constrained Optimization Problems
报 告 人：中科院数学与系统科学研究院 刘歆 研究员
时 间：2018年3月8日 下午4:00
地 点：数学楼一楼报告厅
摘 要：To construct a parallel approach for solving orthogonally constrained optimization problems is usually regarded as an extremely difficult mission, due to the low scalability of orthogonalization procedure. In this talk, we propose an infeasible algorithm for solving optimization problems with orthogonality constraints, in which orthogonalization is no longer needed at each iteration, and hence the algorithm can be parallelized. We also establish a global subsequence
