Seminar第2270讲 Primal-Dual Splitting Methods Constructed Based on Convex Combination

创建时间:  2022/08/21  谭福平   浏览次数:   返回

报告题目 (Title):Primal-Dual Splitting Methods Constructed Based on Convex Combination

报告人 (Speaker):杨俊锋 教授(南京大学)

报告时间 (Time):2022 年8月25日 (周四) 13:00

报告地点 (Place):腾讯会议: 717-281-422

邀请人(Inviter):周安娃


报告摘要:Recently, we have proposed using convex combination technique to construct new primal-dual full splitting algorithms for solving some structured convex optimization problems. In this talk, I will review the proposed algorithms and their convergence properties. A connection to the primal-dual algorithm of Chambolle and Pock will also be given.

上一条:Seminar第2271讲 广义分数阶微积分最新进展

下一条:Seminar 第2269讲 低秩正交张量逼近的收敛性分析

  版权所有 © 上海大学   沪ICP备09014157   沪公网安备31009102000049号  地址:上海市宝山区上大路99号    邮编:200444   电话查询
 技术支持:上海大学信息化工作办公室   联系我们