Publications & Preprints

Search
[ Author(Desc)] Title Type Year
S
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.
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. A. . (2007). Properties of polynomial bases used in line-surface intersection algorithm.
Srijuntongsiri, G. , & Vavasis, S. . (2004). A Fully Sparse Implementation of a Primal- Dual Interior-Point Potential Reduction Method for Semidefinite Programming.
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.
Stern, J. M. , & Vavasis, S. A. . (1993). Nested dissection for sparse nullspace bases. simax, 14, 766–775.
T
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
V
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
Vavasis, S. , Papoulia, K. , & Hirmand, M. . (2018). Second-order cone interior-point method for quasistatic and moderate dynamic cohesive fracture.
Vavasis, S. . (2013). Some notes on applying computational divided differencing in optimization.
Vavasis, S. A. . (2009). On the complexity of nonnegative matrix factorization. SIAM J. Optim., 20, 1364-1377.
Vavasis, S. A. . (2008). A new secant method for unconstrained optimization.
Vavasis, S. . (2006). A conjecture that the roots of a univariate polynomial lie in a union of annuli.
Vavasis, S. . (2003). A Bernstein-Bézier Sufficient Condition for Invertibility of Polynomial Mappings.
Vavasis, S. A. . (1999). Convex Optimization. In Algorithms and Theory of Computation Handbook. CRC Press.
Vavasis, S. . (1999). A note on efficient computation of the gradient in semidefinite programming.
Vavasis, S. A. . (1996). QMG: Software for finite-element mesh generation.
Vavasis, S. A. , & Ye, Y. . (1996). On the relationship between layered least squares and affine scaling steps. In Lectures in Applied Mathematics, volume 32. American Mathematical Society.
Vavasis, S. A. . (1996). Stable finite elements for problems with wild coefficients. SIAM J. Numer. Anal., 33, 890–916.

Pages