The following pages link to Stephen A. Vavasis (Q687093):
Displaying 50 items.
- (Q494339) (redirect page) (← links)
- Extreme point inequalities and geometry of the rank sparsity ball (Q494341) (← links)
- Analysis of and workarounds for element reversal for a finite element-based algorithm for warping triangular and tetrahedral meshes (Q616165) (← links)
- Approximation algorithms for indefinite quadratic programming (Q687094) (← links)
- Open questions in complexity theory for numerical optimization (Q687097) (← links)
- Nuclear norm minimization for the planted clique and biclique problems (Q717132) (← links)
- Exponential lower bounds for finding Brouwer fixed points (Q911230) (← links)
- Quadratic programming with one negative eigenvalue is NP-hard (Q1177910) (← links)
- Local minima for indefinite quadratic knapsack problems (Q1186274) (← links)
- Active set methods for problems in column block angular form (Q1328469) (← links)
- A primal-dual interior point method whose running time depends only on the constraint matrix (Q1352307) (← links)
- Identifying an optimal basis in linear programming (Q1915926) (← links)
- Condition numbers for polyhedra with real number data (Q1924613) (← links)
- A norm bound for projections with complex weights (Q1973918) (← links)
- Second-order cone interior-point method for quasistatic and moderate dynamic cohesive fracture (Q1989097) (← links)
- Low-rank matrix recovery with Ky Fan 2-\(k\)-norm (Q2124796) (← links)
- On the solution of concave knapsack problems (Q2276878) (← links)
- Convex optimization for the planted \(k\)-disjoint-clique problem (Q2436653) (← links)
- Quadratic programming is in NP (Q2640441) (← links)
- Accurate Solution of Weighted Least Squares by Iterative Methods (Q2719191) (← links)
- (Q2743981) (← links)
- An accelerated interior point method whose running time depends only on A (extended abstract) (Q2817643) (← links)
- A Condition Number Analysis of an Algorithm for Solving a System of Polynomial Equations with One Degree of Freedom (Q3095068) (← links)
- Nested Dissection for Sparse Nullspace Bases (Q3136547) (← links)
- (Q3137900) (← links)
- (Q3138969) (← links)
- Automatic Domain Partitioning in Three Dimensions (Q3349919) (← links)
- Spatial convergence of crack nucleation using a cohesive finite-element model on a pinwheel-based mesh (Q3440529) (← links)
- On the Complexity of Nonnegative Matrix Factorization (Q3586139) (← links)
- A Condition Number Analysis of a Line-Surface Intersection Algorithm (Q3617203) (← links)
- Solving Elliptic Finite Element Systems in Near-Linear Time with Support Preconditioners (Q3654409) (← links)
- (Q3959417) (← links)
- Preconditioning for Boundary Integral Equations (Q4016802) (← links)
- Numerical Conformal Mapping Using Cross-Ratios and Delaunay Triangulation (Q4210384) (← links)
- (Q4288580) (← links)
- Stable Numerical Algorithms for Equilibrium Systems (Q4313368) (← links)
- Complete Orthogonal Decomposition for Weighted Least Squares (Q4337387) (← links)
- Separators for sphere-packings and nearest neighbor graphs (Q4371696) (← links)
- Geometric Separators for Finite-Element Meshes (Q4389247) (← links)
- Time continuity in cohesive finite element modeling (Q4446802) (← links)
- (Q4496017) (← links)
- Solving Polynomials with Small Leading Coefficients (Q4651001) (← links)
- Black-Box Complexity of Local Minimization (Q4697309) (← links)
- (Q4717969) (← links)
- Gaussian Elimination with Pivoting is P-Complete (Q4729237) (← links)
- Accurate solution of polynomial equations using Macaulay resultant matrices (Q4821046) (← links)
- (Q4833803) (← links)
- Stable Finite Elements for Problems with Wild Coefficients (Q4887027) (← links)
- A Proximal Point Algorithm for Sequential Feature Extraction Applications (Q4917147) (← links)
- Quality Mesh Generation in Higher Dimensions (Q4943874) (← links)
