Extension of primal-dual interior point algorithms to symmetric cones
暂无分享,去创建一个
[1] Renato D. C. Monteiro,et al. Polynomial Convergence of Primal-Dual Algorithms for Semidefinite Programming Based on the Monteiro and Zhang Family of Directions , 1998, SIAM J. Optim..
[2] P. Tseng. Search directions and convergence analysis of some infeasibnle path-following methods for the monoton semi-definite lcp ∗ , 1998 .
[3] M. Kojima,et al. A primal-dual interior point algorithm for linear programming , 1988 .
[4] Kim-Chuan Toh,et al. On the Nesterov-Todd Direction in Semidefinite Programming , 1998, SIAM J. Optim..
[5] L. Faybusovich. A Jordan-algebraic approach to potential-reduction algorithms , 2002 .
[6] Shinji Hara,et al. Interior Point Methods for the Monotone Linear Complementarity Problem in Symmetric Matrices , 1995 .
[7] Michael J. Todd,et al. Primal-Dual Interior-Point Methods for Self-Scaled Cones , 1998, SIAM J. Optim..
[8] Farid Alizadeh,et al. Symmetric Cones, Potential Reduction Methods and Word-by-Word Extensions , 2000 .
[9] Mauricio G. C. Resende,et al. A Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and Its Power Series Extension , 1990, Math. Oper. Res..
[10] Farid Alizadeh,et al. Associative and Jordan Algebras, and Polynomial Time Interior-Point Algorithms for Symmetric Cones , 2001, Math. Oper. Res..
[11] Robert J. Vanderbei,et al. An Interior-Point Method for Semidefinite Programming , 1996, SIAM J. Optim..
[12] F. Alizadeh,et al. Optimization with Semidefinite, Quadratic and Linear Constraints , 1997 .
[13] Michael J. Todd,et al. Self-Scaled Barriers and Interior-Point Methods for Convex Programming , 1997, Math. Oper. Res..
[14] L. Faybusovich. Linear systems in Jordan algebras and primal-dual interior-point algorithms , 1997 .
[15] Donald Goldfarb,et al. Second-order cone programming , 2003, Math. Program..
[16] L. Faybusovich. Euclidean Jordan Algebras and Interior-point Algorithms , 1997 .
[17] Farid Alizadeh,et al. Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization , 1995, SIAM J. Optim..
[18] T. Tsuchiya. A Convergence Analysis of the Scaling-invariant Primal-dual Path-following Algorithms for Second-ord , 1998 .
[19] Katya Scheinberg,et al. Extension of Karmarkar's algorithm onto convex quadratically constrained quadratic problems , 1996, Math. Program..
[20] Michael L. Overton,et al. Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results , 1998, SIAM J. Optim..
[21] Yin Zhang,et al. On Extending Some Primal-Dual Interior-Point Algorithms From Linear Programming to Semidefinite Programming , 1998, SIAM J. Optim..
[22] Takashi Tsuchiya,et al. Polynomial Convergence of a New Family of Primal-Dual Algorithms for Semidefinite Programming , 1999, SIAM J. Optim..
[23] Takashi Tsuchiya,et al. Polynomial convergence of primal-dual algorithms for the second-order cone program based on the MZ-family of directions , 2000, Math. Program..
[24] T. Tsuchiya. A Polynomial Primal-Dual Path-Following Algorithm for Second-order Cone Programming , 1997 .
[25] Charles R. Johnson,et al. Topics in Matrix Analysis , 1991 .