Seminar第3017讲 非凸约束优化问题的随机逼近算法

创建时间:  2026/04/09  谭福平   浏览次数:   返回

报告题目 (Title):Stochastic approximation methods for nonconvex constrained optimization (非凸约束优化问题的随机逼近算法)

报告人(Speaker):王晓 教授(中山大学)

报告时间 (Time):2026年4月11日 (周六) 15:00

报告地点 (Place):校本部F309

邀请人 (Inviter):徐姿 教授


报告摘要:Nonconvex constrained optimization is a vital research area within the optimization community, encompassing a wide range of applications across various fields. However, addressing nonconvex constrained optimization presents significant challenges due to the large-scale data and inherent uncertainties as well as potentially nonconvex functional constraints in optimization models. In this talk, I will report our recent progress on stochastic approximation methods for nonconvex constrained optimization that include established complexity bounds and/or convergence properties.

上一条:Seminar第 3018 讲 数学与希望

下一条:Seminar第3016讲 探索基于学习的数学优化算法与理论

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