Publications & Preprints
Nonlinear Optimization: Complexity Issues. Oxford University Press.
. (1991). Low-rank matrix recovery with Ky Fan 2-k-norm. In Optimization of Complex Systems: Theory, Models and Applications (pp. 310-319).
. (2019). Convex Optimization. In Algorithms and Theory of Computation Handbook. CRC Press.
. (1999). On the relationship between layered least squares and affine scaling steps. In Lectures in Applied Mathematics, volume 32. American Mathematical Society.
. (1996). Automatic Mesh Partitioning. In Graph Theory and Sparse Matrix Computation. Springer Verlag.
. (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). On approximation algorithms for concave quadratic programming. In Recent Advances in Global Optimization (pp. 3–18). Princeton University Press.
. (1992). Analysis of polynomial approximation algorithms for constraint expressions. In Theoretical Computer Science: 6th GI conference, Dortmund (Vol. 145). Springer Verlag.
. (1982). Provable overlapping community detection in weighted graphs. In Neural Information Processing Systems (NeurIPS) (Vol. 2020). Retrieved from https://proceedings.neurips.cc/paper/2020
. (2020). A log-barrier method for mesh quality improvement. In Proceedings of 20th International Meshing Roundtable (pp. 329-346). Springer.
. (2012). Nonnegative matrix factorization via rank-one downdating. In Proceedings of the 2008 International Conference on Machine Learning.
. (2008). Preconditioning complex-symmetric layered systems arising in electrical power modeling. In Proceedings of the Copper Mountain Conference on Iterative Methods.
. (1998). An aspect ratio bound for triangulating a $d$-grid cut by a hyperplane (extended abstract). In Proc. 12th ACM Symposium on Computational Geometry (pp. 48-57).
. (1996). 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). Multigrid for mixed boundary integral equations. In Proc. 1992 Copper Mountain Conference on Iterative Methods.
. (1992). Quality mesh generation in three dimensions. In Proceedings of the ACM Computational Geometry Conference (pp. 212–221).
. (1992). A unified geometric approach to graph separators. In Proceedings of the Symposium on Foundations of Computer Science (pp. 538–547).
. (1991). Density graphs and separators. In Proc. SIAM-ACM Symposium on Discrete Algorithms.
. (1991). Exponential lower bounds for finding Brouwer fixed points. In Proceedings 28th Symposium on Foundations of Computer Science (p. 401–-410). IEEE Computer Society Press.
. (1987).