講題：Algorithms and Convergence Theorems for The Split DC Program

時間：05/15(二)下午 13:30

地點：南大校區推廣大樓9407教室

摘要：In this study, we consider split minimization problems for difference of convex functions, i.e., split DC programming problems (SDCP). Notably, the (SDCP) problem is a generalized DC programming problem. To study this problem, we present an extra-gradient linearized algorithm, Tseng's linearized algorithm, and hybrid algorithm based on the convex analysis approach. We also establish related convergence theorems for the proposed algorithms under suitable conditions.

＜＜歡迎老師、同學踴躍參與！！＞＞