1. D.S. Atkinson and P.M. Vaidya, “A scaling technique for finding the weighted analytic center of a polytope,”Mathematical Programming 57 (1992) 163–192.
2. D.S. Atkinson and P.M. Vaidya, “Minimizing weighted self-concordant logarithmic barrier functions by scaling,” Preprint, Department of Mathematics, University of Illinois at Urbana-Champaign, Urbana, IL, 1992.
3. Working paper;O. Bahn,1991
4. D. Coppersmith and S. Winograd, “Matrix multiplication via arithmetic progressions,” in:Proceedings of the 19th Annual ACM Symposium on Theory of Computing (Association for Computing Machinery, New York, 1987) pp. 1–6.
5. D. den Hertog, “Interior point approach to linear, quadratic and convex programming: algorithms and complexity,” Ph.D. Thesis, Delft University of Technology, Delft, The Netherlands, 1992.