1. Sonnevend, G., New Algorithms in Convex Programming Based on a Notion of Center for Systems of Analytic Inequalities and on Rational Expecta-tions, Trends in Mathematical Optimization, Edited by K. H. Hoffmann, J. B. Hirriart-Urruty, C. Lemar ´echal, and J. Zowe, International Series of Numerical Mathematics, Birkh ¨auser Verlag, Basel, Switzerland, Vol. 84, pp. 311?327, 1986.
2. Gof n, J. L., Luo, Z. Q., and Ye, Y., Complex Analysis of an Interior Cutting-Plane Method for Convex Feasibility Problems, SIAM Journal on Optimization, Vol. 6, pp. 638?652, 1996.
3. Gof n, J. L., and Vial, J. P., Shallow, Deep, and Very Deep Cuts in the Analytic Center Cutting-Plane Method, Mathematical Programming, Vol. 84, pp. 89?103, 1999.
4. Nesterov, Y., Cutting-Plane Algorithms from Analytic Centers: Ef ciency Estimates, Mathematical Programming, Vol. 69, pp. 149?176, 1995.
5. Ye, Y., Interior-Point Algorithm: Theory and Analysis. John Wiley and Sons, New York, NY, 1997.