Journal Articles for Presentations/Projects

1. A.M Al-Fahed, G.E. Stavroulakis, and P.D. Panagiotopoulos, "A linear complementarity approach to frictionless gripper", International Journal of Robotic Research", 11 (192) 112--122.
2. E.D. Andersen and K.D. Andersen, "Presolving in linear programming" Mathematical Programming, 71 (1995) 221--245.
3. K.P. Bennett and O.L Mangasarian, "Serial and parallel multicategory discrimination", SIAM Journal on Optimization, 4 (1994) 722--734.
4. E.A. Boyd, "Resolving degeneracy in combinatorial linear programs: steepest edge, steepest ascent, and parametric ascent", Mathematical Programming, 68 (1995), 155-168.
5. C. Chen and O.L. Mangasarian, "Smoothing methods for convex inequalities and linear complementarity problems", Mathematical Programming, 71 (1995) 51--69.
6. B. de Chutter, B. de Moor, "The extended linear complementarity problem", Mathematical Programming, 71 (1995) 289--325.
7. R. Entriken, "Parallel decomposition: results for staircase linear programs", SIAM Journal on Optimization, 6 (1996) 961--977.
8. J.J. Forrest and D. Goldfarb, "Steepest--edge simplex algorithms for linear programming", Mathematical Programming 57 (1992) 341--374.
9. A. Fischer and C. Kanzow, "On finite termination of an iterative method for linear complementarity problems", Mathematical Programming , 74 (1996) 279--292.
10. R.M. Freund, "A potential reduction algorithm with user specified phase I--phase II balance for solving a linear program from an infeasible warm start", SIAM Journal on Optimization, 5 (1995) 247--268.
11. M.S. Gowda, "On the extended linear complementarity problem", Mathematical Programming, 72 (1996) 33--50.
12. H.J. Greenberg, "Rim sensitivity analysis from an interior solution", Technical Report CCM No. 86, Center for Computational Mathematics, Mathematics Department, University of Colorado at Denver, Denver, CO, 1996.
13. L. Kaufman, G. S. Sylvester, and M.H. Wright, "Structured linear least-squares problems in system identification and separable nonlinear data fitting", SIAM Journal on Optimization
14. C. Kanzow, "Global convergence properties of some iterative methods for linear complementarity problems", SIAM Journal on Optimization 6 (1996) 326--341.
15. O.L. Mangasarian and J.S. Pang, "The extended linear complementarity problem", SIAM Journal on Matrix Analysis 16 (1994).
16. M.P. McKenna, J.P. Mesirov, and S.A. Zenios,"Data parallel quadratic programming on box-constrained problems", SIAM Journal on Optimization
17. K.T. Medhi, "A two-stage successive overrelaxation algorithm for solving the symmetric linear complementarity problem", Mathematical Programming, 65 (1994), 365--380.
18. J>J> More and G. Toraldo, "On the solution of large quadratic programming problems with bound constraints", SIAM journal on optimization 1 (1991) 93--113.
19. W. Murray and M.H. Wright, "Line search procedures for the logarithmic barrier function", SIAM Journal on Optimization, 4 (1994) 229--246.
20. J. Renegar, "Incorporating condition measures into the complexity theory of linear programming", SIAM Journal on Optimization, 5 (1995) 506--524.
21. J.R. Vera, "Ill-posedness and the complexity of deciding existence of solutions to linear programs", SIAM Journal on Optimization, 6 (1996) 549--569.
22. S. Wright, "Stability of linear equations solvers in interior-point methods", SIAM Journal on Matrix Analysis and Applications, 16 (1995) 1287--1307.
23. S. Wright and Y. Zhang, "A superquadratic infeasible-interior-point method for linear complementarity problems", Mathematical Programming, 73 (1996) 269--289.
24. Y. Zhang, "On the convergence of a class of infeasible interior point methods for the horizontal linear complementarity problem", SIAM Journal on Optimization, 4 (1994) 208--227.