Author:
Kojima Masakazu,Shida Masayuki,Shindoh Susumu
Publisher
Springer Science and Business Media LLC
Subject
General Mathematics,Software
Reference34 articles.
1. C. Helmberg, F. Rendl, R.J. Vanderbei, H. Wolkowicz, An interior-point method for semidefinite programming, SIAM Journal on Optimization 6 (1996) 342–361.
2. M. Kojima, S. Shindoh, S. Hara, Interior-point methods for the monotone semidefinite linear complementarity problems, SIAM Journal on Optimization 7 (1997) 86–125.
3. F. Alizadeh, Interior point methods in semidefinite programming with application to combinatorial optimization, SIAM Journal on Optimization 5 (1995) 13–51.
4. F. Alizadeh, J.-P.A. Haeberly, M.L. Overton, Primal-dual interior-point methods for semidefinite programming, Working Paper, 1994.
5. R.M. Freund, Complexity of an Algorithm for Finding an Approximate Solution of a Semidefinite Program with no Regularity Assumption, Technical report OR 302-94, Operations Research Center, MIT press, Cambridge, MA, 1994.
Cited by
82 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献