Publications & Preprints

Search
Author Title Type [ Year(Asc)]
2020
Majmudar, J. , & Vavasis, S. . (2020). Provable overlapping community detection in weighted graphs. In Neural Information Processing Systems (NeurIPS) (Vol. 2020). Retrieved from https://proceedings.neurips.cc/paper/2020
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
Vavasis, S. , Papoulia, K. , & M. Hirmand, R. . (2020). Second-order cone interior-point method for quasistatic and moderate dynamic cohesive fracture. Comput. Meth. Appl. Mech. Engr., 358, 112633. Retrieved from https://arxiv.org/abs/1909.10641
Jiang, T. , Vavasis, S. , & Zhai., C. W. . (2020). 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
2019
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).
Paquette, C. , & Vavasis, S. . (2019). Potential-based analyses of first-order methods for constrained and composite optimization.
2018
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.
Vavasis, S. , Papoulia, K. , & Hirmand, M. . (2018). Second-order cone interior-point method for quasistatic and moderate dynamic cohesive fracture.
2015
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
Gillis, N. , & Vavasis, S. A. . (2015). Semidefinite Programming Based Preconditioning for More Robust Near-Separable Nonnegative Matrix Factorization. SIAM J. Optim., 25, 677-698.
2014
Ames, B. P. W. , & Vavasis, S. A. . (2014). Convex optimization for the planted k-disjoint-clique problem. Math. Progr., 143, 299-337.
2013
Elkin, L. , Pong, T. Kei, & Vavasis, S. . (2013). Convex relaxation for finding planted influential nodes in a social network.
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.
Vavasis, S. . (2013). Some notes on applying computational divided differencing in optimization.
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.

Pages