報(bào)告人：Prof. Lai Mingjun

講座時(shí)間：2015年6月23日上午9:00-10:00

講座地點(diǎn)：犀浦校區(qū)X2511

 主講人簡(jiǎn)介：

Lai Mingjun is a professor at Department of mathematics, University of Georgia(USA). He received his Ph.D. from Texas A&M University (USA) in 1989. His research interests are mainly on Approximation Theory, Compressed Sensing, Computational Optimization, Computer Aided Geometric Design, Mathematical Image Analysis, Multivariate Splines, Numerical Analysis, Numerical Solution of Partial Differential Equations, Wavelet and Frame Analysis. He has authored more than 120 scientific research articles in indexed journals, refereed conferences and books. He currently serves as an associate editorfor Journal of Applied and Computational Harmonic Analysis.

  講座內(nèi)容簡(jiǎn)介：

Title:Rank-One Matrix Pursuit for Matrix Completion and Its Extension（關(guān)于矩陣填充的秩為1的矩陣追蹤算法及其擴(kuò)展）

Abstract:Matrix completion has been studied for about 10 years. I will explain several approaches to complete a matrix, in particular, the rank-one matrix pursuit algorithm and its economic version in detail. The algorithm is scaleable, of linear convergence, and has constant storage complexity.

Extensive numerical experiments show that our algorithm has the same accurate as the best approach while it is much efficient. Linear convergence will be explained in more detail. Then we extend the algorithm to deal with tensor completion. 

主辦：研究生院

                          承辦：kaiyun開云官方網(wǎng)站