Subject
Computational Mathematics
Reference14 articles.
1. Yu. E. Nesterov and A. S. Nemirovski, Interior Point Polynomial Algorithms in Convex Programming (SIAM, Philadelphia, 1994).
2. F. Alizadeh, “Interior point methods in semidefinite programming with applications to combinatorial optimization,” SIAM J. Optim. 5 (1), 13–51 (1995).
3. L. Vandenberghe and S. Boyd, “Semidefinite programming,” SIAM Rev. 38 (1), 49–95 (1996).
4. M. J. Todd, “Semidefnite optimization,” Acta Numer. 10, 515-560 (2001).
5. Handbook of Semidefinite Programming, Ed. by H. Wolkowicz, R. Saigal, and L. Vandenberghe (Kluwer, Boston, Dordrecht, 2000).
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献