学术报告报告题目：Efficient Computational Approaches applying to Several Optimization Problems in Smart Grid
报 告 人：黄廷文 教授(美国德州农工大学卡塔尔分校)
报告时间：2019年7月17日(星期三)上午10:00-11:00
报告地点：4号楼4318室
邀 请 人：杨启贵 教授
欢迎广大师生前往！
数学学院
2019年7月15日
报告摘要：
Efficient computational approaches to game theoretic model, large scale optimization problem would be introduced to solving challenging problems. In a smart grid context, a demand response strategy of electric vehicle charging is modeled by a stochastic game. Moreover, a two-stage stochastic game theoretical model is proposed for energy trading problem in a multi-energy microgrid system. In this work, the risk measurement technique, conditional value at risk(CVaR), is harnessed to estimate the overload risk during the peak hour and the overbidding risk while distributed alternating direction method of multipliers (ADMM) is accelerated by Nesterov gradient method to solve two game models. In addition, for a large scale economic dispatch problem, different distributed optimization algorithms are developed.
报告人简介：
Tingwen Huang is a Professor at Texas A&M University at Qatar， an IEEE Fellow. He received his B.S. degree from Southwest Normal University (now Southwest University), China, 1990, his M.S. degree from Sichuan University, China, 1993, and his Ph.D. degree from Texas A&M University, College Station, Texas, 2002. After graduated from Texas A&M University, he worked as a Visiting Assistant Professor there. Then he joined Texas A&M University at Qatar (TAMUQ) as an Assistant Professor in August 2003, then he was promoted to Professor in 2013. Dr. Huang’s research areas include neural networks, chaotic dynamical systems, complex networks, optimization and control. His 400+ journal publications in these areas including 140+ IEEE Transactions, and 50+ international conference papers including IJCAI. He was name the 2018 Highly Cited Researcher by Clarivate Analytics (formerly Thomson Reuters). One of his research project was awarded the Best Research Project by Qatar National Research Fund in 2015.