腾讯会议：507 103 480
邀请人：徐玲玲副教授
报告摘要： 想象一个含有300亿份文件，却没有集中管理机构和馆员的图书馆，而且任何人都可以在任何时间添加新的文件而不需要通知其他人。一方面你可以确定，这庞大的文件堆中有一份文件含有对你至关重要的信息，而另一方面，你又像我们中的大多数人那样没有耐心，想要在几秒钟之内就找到这条信息。你有什么办法呢？摆在你面前的这个难题看起来似乎无法解决。而这个文件堆跟万维网（World Wide Web）其实相差无几，后者就是一个超大的、高度混乱的以各种形式存放的文件堆。当然，从万维网中找信息我们有办法解决，因为我们对搜索引擎非常熟悉。报告将介绍谷歌的网页排序算法（PageRank Algorithm），以及它如何从300亿份网页中找到与你的搜索条件匹配的结果。
报告人简介：Guoyong Gu received his Bachelor's Degree from Nanjing University in 2003. After that, he was accepted into the graduate school under the guidance of Prof. B. He. In 2005, Guoyong Gu began to pursue his Ph.D degree under the supervision of Prof. C. Roos, and got his Ph.D. from TUDelft in 2009. From Sept. 2014 till Sept. 2015, Guoyong Gu was a postdoc in UCLouvain with Prof. Nesterov as supervisor. Currently, Guoyong Gu is an associate professor in the Department of Mathematics, Nanjing University. His research foucus on interior-point methods，first-order methods and variational inequalities.