Publications & Preprints

Search
[ Author(Desc)] Title Type Year
V
Vavasis, S. A. . (1996). Stable finite elements for problems with wild coefficients. SIAM J. Numer. Anal., 33, 890–916.
Vavasis, S. A. , & Ye, Y. . (1996). Identifying an Optimal Basis in Linear Programming. Annals of Operations Research, 62, 565–572.
Vavasis, S. A. , & Ye, Y. . (1996). A primal-dual interior point method whose running time depends only on the constraint matrix. Mathematical Programming, 74, 79–120.
Vavasis, S. A. , & Ye, Y. . (1995). Condition Numbers for Polyhedra with Real Number Data. Operations Research Letters, 17, 209-214.
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.
Vavasis, S. A. . (1994). Stable numerical algorithms for equilibrium systems. SIAM J. Matrix Anal. Appl, 15, 1108–1131.
Vavasis, S. A. . (1993). Black-box complexity of local minimization. SIAM Journal on Optimization, 3, 60–80.
Vavasis, S. A. . (1993). Complexity issues in global optimization: A survey. In Handbook for Global Optimization. Kluwer Academic Publishers.
Vavasis, S. A. . (1993). Polynomial time weak approximation algorithms for quadratic programming. In Complexity in Numerical Optimization (pp. 490–500). World Scientific.
Vavasis, S. A. . (1992). Local minima for indefinite quadratic knapsack problems. matpro, 54, 127–153.
Vavasis, S. A. . (1992). Preconditioners for boundary integral equations, 13, 905–925.
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.
Vavasis, S. A. . (1991). Automatic domain partitioning in three dimensions, 12, 950–970.
Vavasis, S. A. . (1991). Nonlinear Optimization: Complexity Issues. Oxford University Press.
Vavasis, S. A. . (1990). A note on wavelet bases for two-dimensional surfaces. Department of Computer Science, Cornell University.
Vavasis, S. A. , & Zippel, R. . (1990). Proving polynomial-time for sphere-constrained quadratic programming. Department of Computer Science, Cornell University.
Vavasis, S. A. . (1990). Quadratic programming is in NP. Information Processing Letters, 36, 73–77.
Vavasis, S. A. . (1989). Gaussian elimination with pivoting is P-complete. SIAM Journal on Discrete Mathematics, 2, 412–423.

Pages