Publications & Preprints
. (1996).
A primal-dual interior point method whose running time depends only on the constraint matrix. Mathematical Programming, 74, 79–120.
. (1996). . (1995). An accelerated interior point method whose running time depends only on $A$ (extended abstract). In Proceedings of the 26th Symposium on the Theory of Computing (pp. 512–521). ACM Press.
. (1994). . (1994). . (1993). Complexity issues in global optimization: A survey. In Handbook for Global Optimization. Kluwer Academic Publishers.
. (1993). Polynomial time weak approximation algorithms for quadratic programming. In Complexity in Numerical Optimization (pp. 490–500). World Scientific.
. (1993). . (1992). . (1992). On approximation algorithms for concave quadratic programming. In Recent Advances in Global Optimization (pp. 3–18). Princeton University Press.
. (1992). . (1992). . (1991). Nonlinear Optimization: Complexity Issues. Oxford University Press.
. (1991). A note on wavelet bases for two-dimensional surfaces. Department of Computer Science, Cornell University.
. (1990). Proving polynomial-time for sphere-constrained quadratic programming. Department of Computer Science, Cornell University.
. (1990). . (1990). . (1989).