On strongly quasiconvex functions (part II): proximal point algorithms and open problems
Báo cáo viên: Felipe Lara
Time: 9:00 - 10:00 AM, Date: March 29th, 2023 (Wednesday)
Location: Room 612, building A6, Institute of Mathematics (18 Hoang Quoc Viet, Cau Giay, Hanoi)
Abstract: In this talk, we study the convergence of the proximal point algorithm (PPA henceforth) for the minimization problem of strongly quasiconvex functions and its accelerations as the inertial-relaxed versions as well as its generalization for Bregman distances. Furthermore, we extend this analysis to pseudomonotone equilibrium problems. Moreover, and using the study of the subgradient projection method with the strong subdifferential, we present two extragradient methods for dealing with pseudomonotone equilibrium problems. Finally, we present two open problems; connections between generalized convexity and generalized monotonicity and optimality conditions for the sum of two functions in which one of them is nonsmooth and strongly quasiconvex.
Các seminar cùng chủ đề
- Double-AI in Bibliometric Analysis: Large Language Models meet Optimization at scale
- On Debreu-Koopmans Theorem for Additively Decomposed Quasiconvex Functions and Its Applications
- Scheduling single round robin tournaments with different court types
- Positivity and stability of 2-D positive time-delay systems on time-scales
- Bài toán gán phổ cho hệ điều khiển tuyến tính với hệ số phụ thuộc thời gian
- Virtual Interval Sensing: Toward Safe Bounds for Dynamical Systems
- Báo cáo tiểu luận tổng quan cho luận án tiến sĩ về "Bài toán gán phổ cho hệ điều khiển tuyến tính phụ thuộc thời gian"
- Quỹ đạo tối ưu của tên lửa
- Solving a class of nonconvex quadratic programs by inertial DC algorithms
- Monotonic complementary problem
Tin tức nổi bật
Xem tất cảHội thảo sắp diễn ra
Xem tất cảXuất bản mới
Xem tất cảBài giảng viện
Xem tất cảNgười báo cáo: Claude Sabbah (CNRS, École Polytechnique, Institut Polytechnique de Paris, France)