Publisher
Springer Science and Business Media LLC
Subject
General Mathematics,Software
Reference32 articles.
1. Alfakih A.Y., Khandani A. and Wolkowicz H. (1999). Solving Euclidean distance matrix completion problems via semidefinite programming. Comput. Optim. Appl. 12: 13–30
2. Alizadeh F., Haeberly J.-P.A. and Overton M.L. (1997). Complementarity and nondegeneracy in semidefinite programming.. Math. Program. 77: 111–128
3. Alizadeh F., Haeberly J.-P.A. and Overton M.L. (1998). Primal–dual interior-point methods for semidefinite programming: convergence results, stability and numerical results. SIAM J. Optim. 8: 746–768
4. Anjos, M.F., Higham, N.J., Takouda, P.L., Wolkowicz, H.: A semidefinite programming approach for the nearest correlation matrix problem. Research Report, Department of Combinatorics and Optimization, University of Waterloo (2003)
5. Benzi, M., Golub, G.H., Liesen, J.: Numerical solution of saddle point problems. Acta Numer. 1–137 (2005)
Cited by
77 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献