文字
缩放
增大字体
减小字体
Dr.Minh N. Dao,CARMA, University of Newcastle:Proximal Algorithms and Their Applications

([西财澳门新濠天地会员登录] 发布于 :2019-04-12 )

光华讲坛——社会名流与企业家论坛第5280期

 

主题:Proximal Algorithms and Their Applications

主讲人:Dr.Minh N. Dao (CARMA, University of Newcastle)

主持人:经济数学学院 孟开文副教授

地点:澳门新濠天地娱乐网站_新濠天地娱乐送20彩金_澳门新濠天地会员登录【正宗品牌】柳林校区通博楼B412会议室

主办单位:经济数学学院 科研处

 

报告人简介:

Dr. Minh N. Dao received the Ph.D. degree in applied mathematics from the University of Toulouse, France in 2014. He was a Lecturer at Hanoi National University of Education, Vietnam from 2004 to 2010, a Lecturer and Research Assistant at National Institute of Applied Sciences (INSA) in Toulouse, France from 2013 to 2014, and a Postdoctoral Fellow at The University of British Columbia, Canada from 2014 to 2016. 

 

He is currently a Research Associate in the Priority Research Centre for Computer-Assisted Research Mathematics and its Applications (CARMA) at The University of Newcastle, Australia. His research interests include nonlinear optimization, nonsmooth analysis, iterative methods, monotone operator theory, control theory, and operations research. In 2017, he received the Annual Best Paper Award from the Journal of Global Optimization.

 

主要内容:

Proximal algorithms are iterative optimization algorithms that split complex problems into a series of simpler subproblems. They rely on evaluating proximity operators -- a natural extension of the notion of projection operators. Due to their simplicity and flexibility, these algorithms have been applied to a wide range of feasibility and optimization problems arising in signal and image processing, operations research, data science, and machine learning. In this talk, we report our recent progress in understanding the behavior of proximal algorithms including projection algorithms, the proximal point algorithm, forward--backward splitting, and Douglas--Rachford splitting. In particular, we provide new results on the rate of convergence in the possibly nonconvex setting. 

 

主题I:

Analysis of proximal algorithms for feasibility and optimization problems: Part I

时间:2019年4月17日(星期三)下午3:30-5:30

 

主题II:

Analysis of proximal algorithms for feasibility and optimization problems: Part II

时间:2019年4月18日(星期四)上午9:30-11:30

 

主题II:

Analysis of proximal algorithms for feasibility and optimization problems: Part III

时间:2019年4月29日(星期一)上午9:30-11:30

 

 

 

 

☆该澳门新濠天地会员登录已被浏览: 次★

打印本文】 【关闭窗口