Halpern-Type Accelerated and Splitting Algorithms for Monotone Inclusions (cont.)
Người báo cáo: Trần Đình Quốc ( The University of North Carolina at Chapel Hill)

Thời gian: 9h00, thứ 4 ngày 3/11/2021 theo hình thức trực tuyến.

Link seminar:


Tóm tắt: In this talk, we will present some new accelerated methods to approximate a zero point for a class of monotone equations and inclusions using Halpern-type fixed-point iterations. These algorithms are different from Nesterov's accelerated methods, but still achieve optimal convergence rates in certain settings. We will start with an accelerated Popov's method, and then develop three new variants of Douglas-Rachford splitting algorithms. We will also discuss two applications of these methods to convex-concave minimax problems, and alternating direction method of multipliers (ADMM), respectively.

Trở lại