2017年11月20日 |  English version
网站首页 | 学院一览 | 学院新闻 | 科学研究 | 学科建设 | 师资队伍 | 人才培养 | 学生工作 | 下载专区 | 招考信息
 
Bilevel Polynomial Optimization

 报告题目:Bilevel Polynomial Optimization

报告人:Professor JiawangNie,  University of California, San Diego

报告时间:2017年6月19日(周一)16:00

报告地点:行健楼学术报告室526

邀请人:徐玲玲副教授

摘要:Abstract: A bilevel program is an optimization problem whose constraints involve another optimization problem. This talk discusses bilevel polynomial programs (BPPs), i.e., all the functions are polynomials. We reformulate BPPs equivalently as semi-infinite polynomial programs (SIPPs), using Fritz John conditions and Jacobian representations. Combining the exchange technique and Lasserre type semidefinite relaxations, we propose numerical methods for solving both simple and general BPPs. For simple BPPs, we prove the convergence to global optimal solutions. This is a joint work with Li Wang and Jane Ye.

 

 返回
南京师范大学数学科学学院 版权所有 Copyright © 2009
通讯地址:南京市亚东新城区文苑路1号 南京师范大学数学科学学院 邮政编码:210023
联系电话:025-85898785