Similarity and other spectral relations for symmetric cones
暂无分享,去创建一个
[1] J. Neumann,et al. On an Algebraic generalization of the quantum mechanical formalism , 1934 .
[2] M. Koecher,et al. Positivitatsbereiche Im R n , 1957 .
[3] R. Gilmore,et al. Lie Groups, Lie Algebras, and Some of Their Applications , 1974 .
[4] T. Andô. Concavity of certain maps on positive definite matrices and applications to Hadamard products , 1979 .
[5] David W. Lewis,et al. Matrix theory , 1991 .
[6] Nimrod Megiddo,et al. A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems , 1991, Lecture Notes in Computer Science.
[7] Shuzhong Zhang,et al. Symmetric primal-dual path-following algorithms for semidefinite programming , 1999 .
[8] Shuzhong Zhang,et al. Polynomial primal-dual cone affine scaling for semidefinite programming , 1999 .
[9] Kim-Chuan Toh,et al. SDPT3 -- A Matlab Software Package for Semidefinite Programming , 1996 .
[10] Osman Güler,et al. Barrier Functions in Interior Point Methods , 1996, Math. Oper. Res..
[11] H. Upmeier. ANALYSIS ON SYMMETRIC CONES (Oxford Mathematical Monographs) , 1996 .
[12] Michael J. Todd,et al. Self-Scaled Barriers and Interior-Point Methods for Convex Programming , 1997, Math. Oper. Res..
[13] L. Faybusovich. Linear systems in Jordan algebras and primal-dual interior-point algorithms , 1997 .
[14] Renato D. C. Monteiro,et al. Primal-Dual Path-Following Algorithms for Semidefinite Programming , 1997, SIAM J. Optim..
[15] L. Faybusovich. Euclidean Jordan Algebras and Interior-point Algorithms , 1997 .
[16] Yinyu Ye,et al. An Efficient Algorithm for Minimizing a Sum of Euclidean Norms with Applications , 1997, SIAM J. Optim..
[17] Michael L. Overton,et al. Complementarity and nondegeneracy in semidefinite programming , 1997, Math. Program..
[18] Michael L. Overton,et al. Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results , 1998, SIAM J. Optim..
[19] Levent Tunçel,et al. Characterization of the barrier parameter of homogeneous convex cones , 1998, Math. Program..
[20] Michael J. Todd,et al. Primal-Dual Interior-Point Methods for Self-Scaled Cones , 1998, SIAM J. Optim..
[21] Levent Tunçel,et al. Primal-Dual Symmetry and Scale Invariance of Interior-Point Algorithms for Convex Optimization , 1998, Math. Oper. Res..
[22] F. Alizadeh,et al. Associative Algebras, Symmetric Cones and Polynomial Time Interior Point Algorithms , 1998 .
[23] T. Tsuchiya. A Convergence Analysis of the Scaling-invariant Primal-dual Path-following Algorithms for Second-ord , 1998 .
[24] Kim-Chuan Toh,et al. On the Nesterov-Todd Direction in Semidefinite Programming , 1998, SIAM J. Optim..
[25] Jos F. Sturm,et al. A Matlab toolbox for optimization over symmetric cones , 1999 .
[26] L. Faybusovich. A Jordan-algebraic approach to potential-reduction algorithms , 2002 .