Stephen A. Vavasis

According to our database1, Stephen A. Vavasis authored at least 80 papers between 1983 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
Second-order cone interior-point method for quasistatic and moderate dynamic cohesive fracture.
CoRR, 2019

Recovery of a mixture of Gaussians by sum-of-norms clustering.
CoRR, 2019

Low-Rank Matrix Recovery with Ky Fan 2-k-Norm.
Proceedings of the Optimization of Complex Systems: Theory, 2019

2018
On the Complexity of Robust PCA and ℓ1-Norm Low-Rank Matrix Approximation.
Math. Oper. Res., 2018

2017
IMRO: A Proximal Quasi-Newton Method for Solving ℓ1-Regularized Least Squares Problems.
SIAM Journal on Optimization, 2017

2016
Finding the Largest Low-Rank Clusters With Ky Fan 2-k-Norm and ℓ1-Norm.
SIAM Journal on Optimization, 2016

2015
Semidefinite Programming Based Preconditioning for More Robust Near-Separable Nonnegative Matrix Factorization.
SIAM Journal on Optimization, 2015

Extreme point inequalities and geometry of the rank sparsity ball.
Math. Program., 2015

On the Complexity of Robust PCA and ℓ1-norm Low-Rank Matrix Approximation.
CoRR, 2015

2014
Fast and Robust Recursive Algorithmsfor Separable Nonnegative Matrix Factorization.
IEEE Trans. Pattern Anal. Mach. Intell., 2014

Convex optimization for the planted k-disjoint-clique problem.
Math. Program., 2014

A log-barrier method for mesh quality improvement and untangling.
Eng. Comput. (Lond.), 2014

Proceedings of the second "international Traveling Workshop on Interactions between Sparse models and Technology" (iTWIST'14).
CoRR, 2014

2013
A Proximal Point Algorithm for Sequential Feature Extraction Applications.
SIAM J. Scientific Computing, 2013

Finding Approximately Rank-One Submatrices with the Nuclear Norm and 퓁1-Norm.
SIAM Journal on Optimization, 2013

Some notes on applying computational divided differencing in optimization.
CoRR, 2013

Semidefinite Programming Based Preconditioning for More Robust Near-Separable Nonnegative Matrix Factorization.
CoRR, 2013

Convex relaxation for finding planted influential nodes in a social network.
CoRR, 2013

2012
A robust solution procedure for hyperelastic solids with large boundary deformation.
Eng. Comput. (Lond.), 2012

Fast and Robust Recursive Algorithms for Separable Nonnegative Matrix Factorization
CoRR, 2012

2011
A Condition Number Analysis of an Algorithm for Solving a System of Polynomial Equations with One Degree of Freedom.
SIAM J. Scientific Computing, 2011

Nuclear norm minimization for the planted clique and biclique problems.
Math. Program., 2011

A Log-Barrier Method for Mesh Quality Improvement.
Proceedings of the 20th International Meshing Roundtable, 2011

2010
Convex optimization for the planted k-disjoint-clique problem
CoRR, 2010

2009
Complexity Theory: Quadratic Programming.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Complexity Theory.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

On the Complexity of Nonnegative Matrix Factorization.
SIAM Journal on Optimization, 2009

Nuclear norm minimization for the planted clique and biclique problems
CoRR, 2009

Properties of Polynomial Bases Used in a Line-Surface Intersection Algorithm.
Proceedings of the Parallel Processing and Applied Mathematics, 2009

2008
A Condition Number Analysis of a Line-Surface Intersection Algorithm.
SIAM J. Scientific Computing, 2008

Solving Elliptic Finite Element Systems in Near-Linear Time with Support Preconditioners.
SIAM J. Numerical Analysis, 2008

Nonnegative Matrix Factorization via Rank-One Downdate
CoRR, 2008

Nonnegative matrix factorization via rank-one downdate.
Proceedings of the Machine Learning, 2008

2007
A Condition Number Analysis of a Surface-Surface Intersection Algorithm
CoRR, 2007

On the complexity of nonnegative matrix factorization
CoRR, 2007

Properties of polynomial bases used in a line-surface intersection algorithm
CoRR, 2007

2006
An Algorithm for Two-Dimensional Mesh Generation Based on the Pinwheel Tiling.
SIAM J. Scientific Computing, 2006

A Robust Solution Procedure for Hyperelastic Solids with Large Boundary Deformation
CoRR, 2006

A Condition Number Analysis of a Line-Surface Intersection Algorithm
CoRR, 2006

2005
An Iterative Method for Solving Complex-Symmetric Systems Arising in Electrical Power Modeling.
SIAM J. Matrix Analysis Applications, 2005

Accurate solution of polynomial equations using Macaulay resultant matrices.
Math. Comput., 2005

2004
Solving Polynomials with Small Leading Coefficients.
SIAM J. Matrix Analysis Applications, 2004

A linear weighted laplacian smoothing framework for warping tetrahedral meshes
CoRR, 2004

Solving Elliptic Finite Element Systems in Near-Linear Time with Support Preconditioners
CoRR, 2004

An algorithm for two-dimensional mesh generation based on the pinwheel tiling
CoRR, 2004

A Fully Sparse Implementation of a Primal-Dual Interior-Point Potential Reduction Method for Semidefinite Programming
CoRR, 2004

An Algorithm for Two-Dimensional Mesh Generation Based on the Pinwheel Tiling.
Proceedings of the 13th International Meshing Roundtable, 2004

2003
A Bernstein-Bezier Sufficient Condition for Invertibility of Polynomial Mapping Functions
CoRR, 2003

A Mesh Warping Algorithm Based on Weighted Laplacian Smoothing.
Proceedings of the 12th International Meshing Roundtable, 2003


2002
A Concise Representation of Geometry Suitable for Mesh Generation.
Proceedings of the 11th International Meshing Roundtable, 2002

2001
Accurate Solution of Weighted Least Squares by Iterative Methods.
SIAM J. Matrix Analysis Applications, 2001

2000
Quality Mesh Generation in Higher Dimensions.
SIAM J. Comput., 2000

Parallel FEM Simulation of Crack Propagation - Challenges, Status, and Perspectives.
Proceedings of the Parallel and Distributed Processing, 2000

1998
Geometric Separators for Finite-Element Meshes.
SIAM J. Scientific Computing, 1998

Numerical Conformal Mapping Using Cross-Ratios and Delaunay Triangulation.
SIAM J. Scientific Computing, 1998

1997
Separators for sphere-packings and nearest neighbor graphs.
J. ACM, 1997

1996
A primal-dual interior point method whose running time depends only on the constraint matrix.
Math. Program., 1996

Identifying an optimal basis in linear programming.
Annals OR, 1996

An Aspect Ratio Bound for Triangulating a d-Grid Cut by a Hyperplane (Extended Abstract).
Proceedings of the Twelfth Annual Symposium on Computational Geometry, 1996

1995
Condition numbers for polyhedra with real number data.
Oper. Res. Lett., 1995

Book review.
J. Global Optimization, 1995

1994
Software section.
J. Global Optimization, 1994

An accelerated interior point method whose running time depends only on A (extended abstract).
Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 1994

1993
Black-Box Complexity of Local Minimization.
SIAM Journal on Optimization, 1993

1992
Preconditioning for Boundary Integral Equations.
SIAM J. Matrix Analysis Applications, 1992

Approximation algorithms for indefinite quadratic programming.
Math. Program., 1992

Local minima for indefinite quadratic knapsack problems.
Math. Program., 1992

Open questions in complexity theory for numerical optimization.
Math. Program., 1992

Quality Mesh Generation in Three Dimensions.
Proceedings of the Eighth Annual Symposium on Computational Geometry, 1992

1991
Automatic Domain Partitioning in Three Dimensions.
SIAM J. Scientific Computing, 1991

On the solution of concave knapsack problems.
Math. Program., 1991

Quadratic programming with one negative eigenvalue is NP-hard.
J. Global Optimization, 1991

Density Graphs and Separators.
Proceedings of the Second Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1991

A Unified Geometric Approach to Graph Separators
Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991

1990
Quadratic Programming is in NP.
Inf. Process. Lett., 1990

1989
Gaussian Elimination with Pivoting is P-Complete.
SIAM J. Discrete Math., 1989

Exponential lower bounds for finding Brouwer fix points.
J. Complexity, 1989

1987
Exponential Lower Bounds for Finding Brouwer Fixed Points (Extended Abstract)
Proceedings of the 28th Annual Symposium on Foundations of Computer Science, 1987

1983
Analysis of polynomial approximation algorithms for constraint expressions.
Proceedings of the Theoretical Computer Science, 1983


  Loading...