1. K.S. Al-Sultan, “Nearest point problems: Theory and algorithms,” Ph.D. Dissertation, University of Michigan (Ann Arbor, MI, 1990).
2. K.S. Al-Sultan and K.G. Murty, “Nearest points in nonsimplicial cones and LCPs with PSD symmetric matrices,” in: S. Kumar, ed.,Recent Developments in Mathematical Programming, Australian Society for O.R. special publication (Gordon & Breach, Camberwell, Vic., Australia, 1991).
3. M.S. Bazaraa and C.M. Shetty,Nonlinear Programming: Theory and Algorithms (Wiley, New York, 1979).
4. S.Y. Chang and K.G. Murty, “The steepest descent gravitational method for linear programming,”Discrete Applied Mathematics 25 (1989) 211–239.
5. M.B. Daya and C.M. Shetty, “Polynomial barrier function algorithms for convex quadratic programming,”Arabian Journal for Science and Engineering 15 (1990) 658–670.