1. N. K. Adler, M. Resende, and G. Veiga,An implementation of karmarkar’s algorithm for linear programming, Mathematical Programming, 44 (1989).
2. MA. Branch, TF. Coleman, and Y. Li,A subspace, interior and conjugate gradient method for large-scale bound-constrained minimization, Tech. Report TR95-1525, Computer Science Department, Cornell University, 1995.
3. R. Byrd, R. Schnabel, and G. Shultz,Parallel quasi-Newton methods for unconstrained optimization, tech. report, Department of Computer Science, University of Colorado, 1988.
4. R. H. Byrd, J. C. Gilbert, and J. Nocedal,A trust region method based on interior point techniques for nonlinear programming, Tech. Report OTC96/02, Optimization Technology Center, Northwestern University, 1996.
5. Y. C. Chen, DJ. Houck, JM. Liu, M. Meketon, RJVL. Slutsman, and P. Wang,The AR&T KORBX System, AT&T Tecnnical Journal, (1989).