主講人：韓德仁  北京航空航天大學(xué)教授

時(shí)間：2021年12月23日19：00

地點(diǎn)：騰訊會(huì)議 746 617 213

舉辦單位：數(shù)理學(xué)院

主講人介紹：德仁，教授，博士生導(dǎo)師，現(xiàn)任北京航空航天大學(xué)數(shù)學(xué)科學(xué)學(xué)院院長(zhǎng)、教育部數(shù)學(xué)類(lèi)專(zhuān)業(yè)教指委秘書(shū)長(zhǎng)。2002年獲南京大學(xué)計(jì)算數(shù)學(xué)博士學(xué)位。從事大規(guī)模優(yōu)化問(wèn)題、變分不等式問(wèn)題的數(shù)值方法的研究工作，發(fā)表多篇學(xué)術(shù)論文。獲中國(guó)運(yùn)籌學(xué)會(huì)青年運(yùn)籌學(xué)獎(jiǎng)，江蘇省科技進(jìn)步二等獎(jiǎng)等獎(jiǎng)項(xiàng);主持國(guó)家自然科學(xué)基金杰出青年基金等多項(xiàng)項(xiàng)目。擔(dān)任中國(guó)運(yùn)籌學(xué)會(huì)常務(wù)理事、江蘇省運(yùn)籌學(xué)會(huì)理事長(zhǎng)；《數(shù)值計(jì)算與計(jì)算機(jī)應(yīng)用》、《Journal  of the Operations Research Society of China》、《Journal of Global Optimization》編委。  

內(nèi)容介紹：The problem of finding a zero point of a maximal monotone operator plays a  central role in modeling many application problems arising from various fields,  and the proximal point algorithm (PPA) is among the fundamental algorithms for  solving the zero-finding problem. PPA not only provides a very general framework  of analyzing convergence and rate of convergence of many algorithms, but also  can be very efficient in solving some structured problems. In this talk, I give  a review on the developments of inexact PPA with various accurate criteria.