1. A randomization scheme for speeding up algorithms for linear and convex quadratic programming problems with a high constraints-to-variables ratio;Adler;Math. Programming,1993
2. P.K. Aggarwal, R. Poreddy, K.R. Varadarajan, H. Yu, Practical methods for shape fitting and kinetic data structures using core sets, in: Proceedings of the 20th Annual ACM Symposium on Computational Geometry, 2004, pp. 263–272.
3. D.S. Ahipasaoglu, P. Sun, M.J. Todd, Linear convergence of a modified Frank–Wolfe algorithm for computing minimum volume enclosing ellipsoids, Technical Report TR 1452, School of Operations Research and Industrial Engineering, Cornell University, Ithaca, New York, 2006.
4. Improved complexity for maximum volume inscribed ellipsoids;Anstreicher;SIAM J. Optim.,2003
5. Sequences converging to D-optimal designs of experiments;Atwood;Ann. Statist.,1973