1. K.M. Anstreicher, “On Vaidya's volumetric cutting plane method for convex programming,” Tech. Report, Dept. of Management Sciences, Univ. of Iowa, Iowa City, IA, September 1994.
2. D.S. Atkinson and P.M. Vaidya, “A cutting plane algorithm for convex programming that uses analytic centers,” Math. Programming, vol. 69, pp. 1–43, 1995.
3. O. Bahn, J.-L. Goffin, J.-Ph. Vial, and O.du Merle, “Implementation and behavior of an interior point cutting plane algorithm for convex programming: An application to geometric programming,” Discrete Appl. Math., vol. 49, pp. 3–23, 1993.
4. O. Bahn, O.du Merle, J.-L. Goffin, and J.-Ph. Vial, “A cutting plane method from analytic centers for stochastic programming,” Math Programming, vol. 69, pp. 45–73, 1995.
5. J.-L. Goffin, “Using the primal dual infeasible newton method in the analytic center method for problems defined by deep cutting planes,” Tech. Report, Faculty of Management, McGill Univ., Montreal, Quebec, September 1994.