报告时间：2013年12月11日，14:00—
报告人：陶敏博士
报告人单位：bat365在线官网入口
报告地点：仙林校区教2-501
报告题目：Splitting Algorithms for Separate Convex Programming(求解可分凸规划的分裂算法）
内容简介：We propose some splitting methods for solving a separable convex minimization problem with linear constraints, where the objective function is expressed as the sum of $m$ individual functions without coupled variables. These new methods belong to operator splitting methods since it treat the individual functions in the objective separately, and it outperform some existing methods as its convergence can be guaranteed without any further correction step. Numerical efficiency of this new method is illustrated by some applications in image processing and video processing.