A. Ben-Tal and A Nemirovski. Lectures on Modern Convex Optimization: Analysis, Algorithms, and Engineering Applications. MPS/SIAM Series on Optimization. SIAM, 2001.
E. D. Andersen, J. Gondzio, Cs. Meszaros and X. Xu. Implementation of interior point methods for large scale linear programming.
In Interior-point methods of mathematical programming. T. Terlaky, editor(s).Kluwer Academic Publishers,
R. K. Ahuja, T. L. Magnanti and J. B. Orlin. Network flows.
In Optimization. G. L. Nemhauser, A. H. G. Rinnooy Kan and M. J. Todd, editor(s).North Holland, Amsterdam,
M. S. Lobo, M. Fazel, and S. Boyd. Portfolio optimization with linear and fixed transaction costs. 2005.
To appear in Annals of Operations Research. http://www.cds.caltech.edu/~maryam/portfolio.html.
E. D. Andersen and Y. Ye. A computational study of the homogeneous algorithm for large-scale convex optimization. Computational Optimization and Applications 10:243--269, 1998.
J. L. Kenningon and K. R. Lewis. Generalized networks: The theory of preprocessing and an emperical analysis. INFORMS Journal on Computing 16(2):162--173, 2004.
E. D. Andersen, C. Roos and T. Terlaky. On implementing a primal-dual interior-point method for conic quadratic optimization. Math. Programming 95(2), February 2003.