Publications & Preprints
Semidefinite Programming Based Preconditioning for More Robust Near-Separable Nonnegative Matrix Factorization. SIAM J. Optim., 25, 677-698.
. (2015). Fast and Robust Recursive Algorithms for Separable Nonnegative Matrix Factorization. IEEE Trans. Pattern Analysis and Machine Intelligence, 36, 698-714.
. (2013). . (1989).
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). A Primal-Dual Frank-Wolfe Algorithm for Linear Programming. Retrieved from https://arxiv.org/abs/2402.18514
. (2024). . (1997). An iterative method for solving complex-symmetric systems arising in electrical power modeling. SIAM J. Matrix Analysis App., 26, 1150-1178.
. (2005). Preconditioning complex-symmetric layered systems arising in electrical power modeling. In Proceedings of the Copper Mountain Conference on Iterative Methods.
. (1998). . (1991). . (10040).
Range of the displacement operator of PDHG with applications to quadratic and conic programming. Retrieved from https://arxiv.org/abs/2309.15009
. (2023). Re-embedding data to strengthen recovery guarantees of clustering. Retrieved from https://arxiv.org/abs/2301.10901
. (2023). . (2021). Recovery of a mixture of Gaussians by sum-of-norms clustering. Journal of Machine Learning Research, 21(225), 1-16. Retrieved from https://jmlr.org/papers/volume21/19-218/19-218.pdf
. (2020). Accurate solution of polynomial equations using Macaulay resultant matrices. Mathematics of Computation, 74, 221-262.
. (2005). . (2005). Nonlinear conjugate gradient for smooth convex functions. Mathematical Programming - Computation. Retrieved from https://arxiv.org/pdf/2111.11613.pdf
. (Accepted). IMRO: A Proximal Quasi-Newton Method for Solving $\ell_1$-Regularized Least Squares Problems. SIAM J. Optimiz, 27, 583-615.
. (2017). . (2017). . (2016).