Publications & Preprints

Search
Author [ Title(Desc)] Type Year
C
Gillis, N. , & Vavasis, S. A. . (2018). On the Complexity of Robust PCA and l1-Norm Low-Rank Matrix Approximation. Mathematics of Operations Research, 43, 1072-1084.
Tunçel, L. , Vavasis, S. A. , & Xu, J. . (2023). Computational complexity of decomposing a symmetric matrix as a sum of positive semidefinite and diagonal matrices. Foundations of Computational Mathematics, 2023, 1-47. Retrieved from https://arxiv.org/abs/2209.05678
Srijuntongsiri, G. , & Vavasis, S. A. . (2008). A Condition Number Analysis of a Line-Surface Intersection Algorithm. SIAM J. Sci. Comput., 30, 1064-1081.
Srijuntongsiri, G. , & Vavasis, S. A. . (2007). A Condition Number Analysis of a Surface-Surface Intersection Algorithm.
Srijuntongsiri, G. , & Vavasis, S. . (2011). A condition number analysis of an algorithm for solving a system of polynomial equations with one degree of freedom. SIAM J. Sci. Comput., 33, 433-454.
Vavasis, S. A. , & Ye, Y. . (1995). Condition Numbers for Polyhedra with Real Number Data. Operations Research Letters, 17, 209-214.
Vavasis, S. . (2006). A conjecture that the roots of a univariate polynomial lie in a union of annuli.
Vavasis, S. A. . (1999). Convex Optimization. In Algorithms and Theory of Computation Handbook. CRC Press.
Ames, B. P. W. , & Vavasis, S. A. . (2014). Convex optimization for the planted k-disjoint-clique problem. Math. Progr., 143, 299-337.
Elkin, L. , Pong, T. Kei, & Vavasis, S. . (2013). Convex relaxation for finding planted influential nodes in a social network.
D
Miller, G. L. , & Vavasis, S. A. . (1991). Density graphs and separators. In Proc. SIAM-ACM Symposium on Discrete Algorithms.
Karimi, S. , & Vavasis, S. . (2012). Detecting and correcting loss of independence in nonlinear conjugate gradient.
E
Hirsch, M. D. , Papadimitriou, C. H. , & Vavasis, S. A. . (1989). Exponential lower bounds for finding Brouwer fixed points. Journal of Complexity, 5, 379–416.
Hirsch, M. D. , & Vavasis, S. A. . (1987). Exponential lower bounds for finding Brouwer fixed points. In Proceedings 28th Symposium on Foundations of Computer Science (p. 401–-410). IEEE Computer Society Press.
Drusvyatskiy, D. , Vavasis, S. A. , & Wolkowicz, H. . (2015). Extreme point inequalities and geometry of the rank sparsity ball. Mathematical Programming, 152, 521–544. Aug. doi:10.1007/s10107-014-0795-8
F
Gillis, N. , & Vavasis, S. A. . (2013). Fast and Robust Recursive Algorithms for Separable Nonnegative Matrix Factorization. IEEE Trans. Pattern Analysis and Machine Intelligence, 36, 698-714.
Bond, D. M. , & Vavasis, S. A. . (1994). Fast Wavelet Transforms for Matrices Arising from Boundary Element Methods. Cornell Theory Center, Cornell University.
Doan, X. V. , & Vavasis, S. . (2013). Finding approximately rank-one submatrices with the nuclear norm and $\ell_1$ norm. SIAM J. Optimiz., 23, 2502-2540.
Doan, X. V. , & Vavasis, S. . (2016). Finding the largest low-rank clusters with Ky Fan 2-k-norm and l1-norm. SIAM J. Optim., 26, 274-312.
Srijuntongsiri, G. , & Vavasis, S. . (2004). A Fully Sparse Implementation of a Primal- Dual Interior-Point Potential Reduction Method for Semidefinite Programming.

Pages