Publications & Preprints

Search
Author Title(Desc) Type Year
A
Moursi, W., Pavlovic, V., & Vavasis, S.. (2023). Accelerated gradient descent: A guaranteed bound for a heuristic restart strategy. Retrieved from https://arxiv.org/abs/2310.07674
Vavasis, S. A., & Ye, Y.. (1994). 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.
Jónsson, G., & Vavasis, S.. (2005). Accurate solution of polynomial equations using Macaulay resultant matrices. Mathematics of Computation, 74, 221-262.
Bobrovnikova, E. Y., & Vavasis, S. A.. (2001). Accurate Solution of Weighted Least Squares by Iterative Methods. SIAM J. Matrix Anal. App., 22, 1153-1174.
Stern, J. M., & Vavasis, S. A.. (1993). Active set methods for problems in column block angular form. Matemática Aplicada e Computacional, 12, 199–226.
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.
Shontz, S., & Vavasis, S.. (2010). Analysis of and workarounds for element reversal for a finite element-based algorithm for warping triangular and tetrahedral meshes. BIT Numerical Mathematics, 50, 863-884.
Lieberherr, K. J., & Vavasis, S. A.. (1982). Analysis of polynomial approximation algorithms for constraint expressions. In Theoretical Computer Science: 6th GI conference, Dortmund (Vol. 145). Springer Verlag.
Vavasis, S. A.. (1992). On approximation algorithms for concave quadratic programming. In Recent Advances in Global Optimization (pp. 3–18). Princeton University Press.
Vavasis, S. A.. (1992). Approximation algorithms for indefinite quadratic programming, 57, 279–311.
Mitchell, S. A., & Vavasis, S.. (1996). 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).
Vavasis, S. A.. (1991). Automatic domain partitioning in three dimensions, 12, 950–970.
Miller, G., Teng, S. - H., Thurston, W., & Vavasis, S.. (1993). Automatic Mesh Partitioning. In Graph Theory and Sparse Matrix Computation. Springer Verlag.
B
Vavasis, S.. (2003). A Bernstein-Bézier Sufficient Condition for Invertibility of Polynomial Mappings.
Vavasis, S. A.. (1993). Black-box complexity of local minimization. SIAM Journal on Optimization, 3, 60–80.
Hsu, H. - W., Lean, M. H., Liu, P. L. - F., & Vavasis, S. A.. (1991). A boundary element method for three-dimensional free surface flow. Xerox.
C
Jiang, T., & Vavasis, S. A.. (2021). Certifying clusters from sum-of-norms clustering. Retrieved from https://arxiv.org/abs/2006.11355
Hough, P., & Vavasis, S.. (1997). Complete orthogonal decomposition for weighted least squares. SIAM J. Matrix Anal. Appl., 18.
Vavasis, S. A.. (1993). Complexity issues in global optimization: A survey. In Handbook for Global Optimization. Kluwer Academic Publishers.
Vavasis, S. A.. (2009). On the complexity of nonnegative matrix factorization. SIAM J. Optim., 20, 1364-1377.

Pages