-->
Seminar No.1334 Local versus global conditions in polynomial optimization

Created Date 9/18/2016 福平   View Numbers  66 Return    
字号:   
 

Topic:Local versus global conditions in polynomial optimization
Speaker:Prof. Jiawang Nie (The University California, San Diego)
Time:2016-9-20(Tuesday)14:00
Place:G507


Abstarct: This talk compares local and global conditions for polynomial optimization problems. First, we review the classical local optimality conditions: constraint qualification, strict complementarity and second order sufficiency conditions. We show that they are always satisfied, except a zero measure set of input data. Second, we review global optimality conditions that are expressed by sum-of-squares type representations. We show that if the above classical local optimality conditions hold, then the sum-of-squares type global optimality conditions must be satisfied. Third, we review Lasserre's hierarchy for solving polynomial optimization, and show that it always has finite convergence, except a zero measure set of input data.

 


CopyRight © Shanghai University    沪ICP备09014157   Address : 99 Shangda Road, BaoShan District, Shanghai.(traffic)   Zip Code : 200444   Tel.
Technical Support : Information Technology Office of Shanghai University   Contact Us