Publications & Preprints

Search
[ Author(Desc)] Title Type Year
A
Ames, B. P. W. , & Vavasis, S. A. . (2014). Convex optimization for the planted k-disjoint-clique problem. Math. Progr., 143, 299-337.
Ames, B. , & Vavasis, S. . (2011). Nuclear norm minimization for the planted clique and biclique problems. Mathematical Programming, 129, 69-89.
B
Baghal, S. , Paquette, C. , & Vavasis, S. . (2020). A termination criterion for stochastic gradient descent for binary classification. Retrieved from https://arxiv.org/abs/2003.10312
Biggs, M. , Ghodsi, A. , & Vavasis, S. A. . (2008). Nonnegative matrix factorization via rank-one downdating. In Proceedings of the 2008 International Conference on Machine Learning.
Bobrovnikova, E. Y. , & Vavasis, S. A. . (2001). Accurate Solution of Weighted Least Squares by Iterative Methods. SIAM J. Matrix Anal. App., 22, 1153-1174.
Bobrovnikova, E. , & Vavasis, S. . (2000). A Norm Bound for Projections with Complex Weights. Linear Algebra and its Applications, 307, 69-75.
Boman, E. , Hendrickson, B. , & Vavasis, S. . (2008). Solving Elliptic Finite Element Systems in Near-Linear Time with Support Preconditioners. SIAM J. Numer. Anal., 46, 3264-3284.
Bond, D. M. , & Vavasis, S. A. . (1994). Fast Wavelet Transforms for Matrices Arising from Boundary Element Methods. Cornell Theory Center, Cornell University.
Bond, D. M. , & Vavasis, S. A. . (1992). Multigrid for mixed boundary integral equations. In Proc. 1992 Copper Mountain Conference on Iterative Methods.
D
Doan, X. Vinh, & Vavasis, S. A. . (2022). Low-rank matrix recovery with Ky Fan 2-k-norm. Journal of Global Optimization, 82, 727-751. Retrieved from https://link.springer.com/article/10.1007/s10898-021-01031-0
Doan, X. V. , & Vavasis, S. . (2019). Low-rank matrix recovery with Ky Fan 2-k-norm. In Optimization of Complex Systems: Theory, Models and Applications (pp. 310-319).
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.
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. , Toh, K. - C. , & Vavasis, S. . (2013). A proximal point algorithm for sequential feature extraction applications. SIAM J. Sci. Comput., A517-A540.
Driscoll, T. A. , & Vavasis, S. A. . (1998). Numerical conformal mapping using cross-ratios and Delaunay triangulation. SIAM J. Sci. Comput., 19, 1783-1803.
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
E
Elkin, L. , Pong, T. Kei, & Vavasis, S. . (2013). Convex relaxation for finding planted influential nodes in a social network.
G
Ganguly, P. , Vavasis, S. , & Papoulia, K. . (2006). An algorithm for two-dimensional mesh generation based on the pinwheel tiling. SIAM J. Scientific Computing, 28, 1533-1562.
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.
Gillis, N. , & Vavasis, S. A. . (2015). Semidefinite Programming Based Preconditioning for More Robust Near-Separable Nonnegative Matrix Factorization. SIAM J. Optim., 25, 677-698.

Pages