快三赚钱

  • <tr id='oQw3ll'><strong id='oQw3ll'></strong><small id='oQw3ll'></small><button id='oQw3ll'></button><li id='oQw3ll'><noscript id='oQw3ll'><big id='oQw3ll'></big><dt id='oQw3ll'></dt></noscript></li></tr><ol id='oQw3ll'><option id='oQw3ll'><table id='oQw3ll'><blockquote id='oQw3ll'><tbody id='oQw3ll'></tbody></blockquote></table></option></ol><u id='oQw3ll'></u><kbd id='oQw3ll'><kbd id='oQw3ll'></kbd></kbd>

    <code id='oQw3ll'><strong id='oQw3ll'></strong></code>

    <fieldset id='oQw3ll'></fieldset>
          <span id='oQw3ll'></span>

              <ins id='oQw3ll'></ins>
              <acronym id='oQw3ll'><em id='oQw3ll'></em><td id='oQw3ll'><div id='oQw3ll'></div></td></acronym><address id='oQw3ll'><big id='oQw3ll'><big id='oQw3ll'></big><legend id='oQw3ll'></legend></big></address>

              <i id='oQw3ll'><div id='oQw3ll'><ins id='oQw3ll'></ins></div></i>
              <i id='oQw3ll'></i>
            1. <dl id='oQw3ll'></dl>
              1. <blockquote id='oQw3ll'><q id='oQw3ll'><noscript id='oQw3ll'></noscript><dt id='oQw3ll'></dt></q></blockquote><noframes id='oQw3ll'><i id='oQw3ll'></i>

                The developments of inexact proximal point algorithms

                发布者:文明办作者:发布时间:2021-12-20浏览次数:66

                  

                主讲人:韩德仁  北京航空航天〓大学教授

                  

                时间:2021年12月23日19:00

                  

                地点:腾讯会议 746 617 213

                  

                举办单位:数理学院

                  

                主讲人介绍:德仁,教授,博士生导师,现任北京航空航天大学数学科学学院院长、教育部数学类专业☆教指委秘书长。2002年获南京大学计算数学博士学位。从事大规模优化问题、变分不等式问题的数值方法的研究工作,发表多篇学术论文。获中国运筹学会青年运筹学奖,江苏省科技进步二等奖等奖项;主持国家自然科学基金杰出青年基金等多项项目。担任中国运筹学会常务理事、江苏省运筹学会理事长;《数值计算与计算机应用》、《Journal  of the Operations Research Society of China》、《Journal of Global Optimization》编委。  

                  

                内容介绍: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.