聯絡我們 網站地圖 中央大學
 
 
   
     
 
主  題
Semidefinite programming method on various problems  
 
 
 
時  間
2017-12-21 下午 3:30~5:00  
 
 
 
地  點
鴻經館 107 室  
 
 
 
主 講 者
俞韋亘博士 (Computational and Experimental Research in Mathematics, Brown University)  
 
 
 
內  容
Abstract:
I will talk about various combinatorics problems which can be tackled by semidefinite programming (SDP) method. In particular, phase retrieval and compressive sensing problems can be discussed by SDP. Especially, I will discuss details about using symbolic semidefinite programming method to prove Musin Conjecture which is a classical problem in discrete geometry. Almost every dimension about maximum spherical two-distance sets problems is solved.
 
   
 
附  件
 
 
 
   
 
演講相關連結
 
近期演講
106 上學期演講
105 下學期演講
105 上學期演講
104 下學期演講
104 上學期演講

 

 

 

 

 

 

       
 
Copyright © 2006 NCU Department of Mathematics All Rights Reserved. ~ 為求最好效果,建議以IE4.0以上之版本,1024*768 解析度瀏覽 ~ 網站建置於2005年12月 ~