一、报告题目：Resolvent methods for convex feasibility problems
二、报告人：秦小龙 教授
三、时 间：2024年5月20日(周一) 上午 10:00-11:00
四、报告地点：闻理园A4-305
报告摘要：In this talk, we present some classical results and recent developments on mean-valued and projection-based iterative algorithms, such as, Krasnosel'skiĭ-Mann method, anchored methods, and CQ methods for some convex feasibility problems, such as variational inequality problems, equilibrium problems, inclusion problems, and so on. Some weak and strong convergence theorems of solutions are established in the framework of Hilbert/Banach spaces. Some applications are also considered to support the new algorithms.
报告人简介：秦小龙，教授，博士生导师，主要从事非线性分析，最优化理论与应用的研究。近年来已在SICON, IEEE TETCI, ESAIM-cocv, COAP, JSC, AMO, SVVA等国际学术刊物发表论文一百余篇，出版专著一本，获省自然科学奖三等奖一项(排名第一)，科睿唯安同行审阅奖两项(数学和跨学科)，<J. Global Optim.>最佳论文奖一项 (Best Paper Award)，<数学物理学报.>最佳论文奖一项，并担任多个本领域国际期刊编委工作。
欢迎广大师生参加！联系人：胡燕波
