论文信息 - Information Geometric Analysis of a Interior-Point Method for Semidefinite Programming - 字舞流文

Information Geometric Analysis of a Interior-Point Method for Semidefinite Programming

[1] E. Yaz. Linear Matrix Inequalities In System And Control Theory , 1998, Proceedings of the IEEE.

[2] S. Amari,et al. Dualistic differential geometry of positive definite matrices and its applications to related problems , 1996 .

[3] S. Amari,et al. Gradient systems in view of information geometry , 1995 .

[4] Yurii Nesterov,et al. Interior-point polynomial algorithms in convex programming , 1994, Siam studies in applied mathematics.

[5] Salvatore D. Morgera,et al. The role of abstract algebra in structured estimation theory , 1992, IEEE Trans. Inf. Theory.

[6] Masao Iri,et al. Integrability of vector and multivector fields associated with interior point methods for linear programming , 1991, Math. Program..

[7] R. Brockett. Dynamical systems that sort lists, diagonalize matrices, and solve linear programming problems , 1991 .

[8] Kunio Tanabe,et al. Centered newton method for mathematical programming , 1988 .