Publisher
Springer International Publishing
Reference40 articles.
1. I. Adler, M. G. C. Resende, G. Veiga, and N. Karmarkar. An implementation of Karmarkar’s algorithm for linear programming. Mathematical programming, 44: 297–335, 1989.
2. E. R. Barnes. A variation on Karmarkar’s algorithm for solving linear programming problems. Mathematical Programming, 36: 174–182, 1986.
3. D. P. Bertsekas. Convex Optimization Theory. Athena Scientific, Belmont, 2009.
4. J. F. Bonnans, J. C. Gilbert, C. Lemarchal, and C. A. Sagastizabal. Numerical optimization. Springer, Berlin, 2003.
5. S. Boyd and L. Vandenberghe. Convex optimization. Cambridge University Press, New York, 2009.