Journal of Jilin University Science Edition ›› 2019, Vol. 57 ›› Issue (5): 1127-1130.

Previous Articles     Next Articles

Convergence of E-MS Algorithm

XU Pingfeng, CHEN Ting, SHANG Laixu   

  1. School of Mathematics and Statistics, Changchun University of Technology, Changchun 130012, China
  • Received:2018-10-22 Online:2019-09-26 Published:2019-09-19
  • Contact: XU Pingfeng E-mail:xupf_stat@126.com

Abstract: We considered the convergence of EMS algorithm. Firstly, we gave a necessary condition for the minimum point of observed generalized information criterion (GIC). Secondly, under the conditions of finiteness of model space, compactness of parameter space, continuity of Q function, we proved that it was necessary for the limit points of the sequence generated by EMS algorithm to satisfy the minimum points of observed GIC, which was a supplement to the global convergence of EMS algorithm. Thirdly, we gave an example of Gaussian graphical model which satisfied the necessary condition, but did not satisfy conditions for global convergence. Finally, we proved the global convergence of E-MS algorithm.

Key words: missing data, model selection, observed GIC, E-MS algorithm

CLC Number: 

  • O212.1