江苏省应用数学（williamhill威廉希尔官网）中心系列学术报告
报告题目：Finding Cheeger cuts via 1-Laplacian of graphs
报告人：朱炜教授
报告时间：2024年6月13日（周四）上午9:00-10:00
报告地点：英国威廉希尔唯一官网A302
主持人：杨文莉
报告摘要：Finding Cheeger cuts of graphs is an NP-hard problem, and one often resorts to approximate solutions. In the literature, spectral graph theory provides the most popular approaches for obtaining such approximate solutions. Recently, Prof. K.C. Chang introduced a novel nonlinear spectral graph theory and proved that the seek of Cheeger cuts is equivalent to solving a constrained optimization problem. However, this resulting optimization problem is also very challenging as it involves a non-differentiable function over a non-convex set that is composed of simplex cells of different dimensions. In this talk, we will discuss an ADMM algorithm for solving this optimization problem and provide some convergence analysis. Experimental results will be presented for typical graphs, including Petersen's graph and Cockroach graphs, the well-known Zachary karate club graph, and some preliminary applications in material sciences.
报告人简介：Zhu Wei received the B.S. degree in mathematics from Tsinghua University in 1994, the M.S. degree in mathematics from Peking University in 1999, and the Ph.D. degree in applied mathematics from UCLA in 2004. He is currently a professor in the Department of Mathematics at the University of Alabama, Tuscaloosa. His research interests include PDE methods for image processing and data sciences.