主 讲 人：朱文兴教授
报告题目：Generalized Augmented Lagrangian and Its Applications to VLSI Global Placement
时 间：2019年1月7日下午3点半
地 点：开元校区工科四号楼637会议室
主办单位：科技处、数学与统计学院
摘 要：
Global placement dominates the circuit placement process in its solution quality and efficiency. With increasing design complexity and various design constraints, it is desirable to develop an efficient, high-quality global placement algorithm for modern large-scale circuit designs. In this paper, we first analyze the properties of four nonlinear optimization methods (the quadratic penalty method, the Lagrange multiplier method, and two augmented Lagrangian methods) for global placement, and then develop a generalized augmented Lagrangian method to solve this problem. Our proposed method preserves the advantages of the quadratic penalty method and the augmented Lagrangian method, and provides a smooth progress from the quadratic penalty method to the augmented Lagrangian method. We prove that the proposed generalized augmented Lagrangian method is globally convergent for the original global placement problem, even with different constraints. Compared with the other four popular optimization methods, experimental results show that our method achieves the best quality and is robust for handling different objectives. In particular, our generalized augmented Lagrangian formulation is theoretically sound and can solve generic large-scale constrained nonlinear optimization problems, which are widely used in many fields.
主讲人简介：
朱文兴，福州大学离散数学与理论计算机科学研究中心教授、博士生导师，1996年博士毕业于上海大学数学系，现为福州大学“嘉锡学者”特聘教授，福建省“双百”特支计划人选。朱文兴教授主要从事优化理论与算法、超大规模集成电路设计自动化的算法研究，主持承担了多项国家自然科学基金项目，在INFORMS Journal on Computing、IEEE Transactions on Computers、IEEE Transactions on CAD和SIAM Journal on Discrete Mathematics等国内外重要学术期刊和国际专业顶尖学术会议发表了系列研究论文。教学成果获2009年国家教学成果二等奖；研究成果获2013年福建省科学技术奖(自然科学奖）三等奖；2017年获电子设计自动化国际顶尖学术会议DAC’2017最佳论文奖，系该会54年来中国大陆首次以第一单位获DAC最佳论文奖；2017年获集成电路计算机辅助设计国际顶尖学术会议ICCAD'2017学术竞赛冠军，系中国大陆在国际权威集成电路设计竞赛中首次获得冠军；2018年获集成电路计算机辅助设计国际顶尖学术会议ICCAD’2018最佳论文提名奖；2018年再次获得ICCAD’2018学术竞赛冠军。
欢迎广大师生踊跃参加！
