Favorite links
U. Waterloo
Workshops and conferences

Housholder Symposium
XVIII, June 1217, 2011, Tahoe City, California.

Fields
workshop on optimization, Sept. 2629, 2011,
Toronto, ON.

SIAM Conference on
Algebraic Geometry, Oct 69, 2011, Raleigh, North Carolina.

Fields workshop on symbolicnumeric computation,
November 1619, 2011, Waterloo, ON.

International Symposium on Mathematical
Programming, 2012 August 1924, Berlin, featuring two
invited minisymposia (see
here and
here)
on firstderivative and interior
methods in convex optimization.

Workshop on LargeScale Conic Optimization, 2012 November 1923,
Institute for Mathematical Sciences, National
University of Singapore.

Sparse
Representations of Functions: Analytic and Computational
aspects, 2012 December 1014, DFG Research Centre Matheon, Technical
University of Berlin.

Workshop
on Numerical Linear Algebra and Optimization (in honor of Michael Overton)
2013 August 89, University of British Columbia, Vancouver.

ERCIM 2013
(Computational and Methodological Statistics), London,
2013 December 1416.
Professional societies:
Research supported by:

Professor (PhD, Stanford, 1989)
Department of Combinatorics & Optimization
MC 6304
University of Waterloo
200 University Avenue W.
Waterloo, ON N2L 3G1
Canada
email: vavasis@math.uwaterloo.ca
phone: +15198884567 ext. 32130
fax: +15197255441
NOTE: I am on sabbatical leave until about 2014 July 15 and am checking Waterloo voicemail
only infrequently. It is best to reach me by email.
Courses
I also taught a course on compressive sensing in W'09 and wrote some
lecture
notes and exercises on compressive sensing.
Research and Publications
My research interests are
continuous
optimization
and numerical
analysis.
More specifically,
I am interested in:

Complexity issues in continuous optimization,

Convex optimization and its application to data mining,

Efficient algorithms for optimization, and

Linear algebra problems arising in optimization.
I have also in the past been interested in
geometric problems arising in scientific computing
and numerical linear algebra arising in differential equations.
I have a few recent manuscripts available online:

S. Vavasis and Y. Ye, ``A primal dual accelerated interior
point method whose running time depends only on A''
(compressed postscript, 170k).
Final version appeared in Math. Progr. 74 (1996) 79120.

P. Hough and S. Vavasis, ``Complete orthogonal decomposition
for weighted least squares''
(gzip'd
postscript, 84k;
plain
postscript, 330k). Final version appeared in SIAM J. Matrix Anal. Appl.,
18 (1997) 369392.

S. Mitchell
and S. Vavasis, ``An aspect ratio bound for triangulating a dgrid
cut by a hyperplane''
(compressed
postscript, 118k;
plain
postscript, 339k). Extended abstract appeared in Proc. 1996
Symp. Comput. Geom., ACM Press, 4857.
 T.
Driscoll and S. Vavasis,
``Numerical conformal mapping using crossratios and Delaunay triangulation''
(gzip'd postscript, 139k;
plain
postscript, 395k).
Final version appeared in
SIAM J. Sci. Comp. 19 (1998) 17831803.

S. Mitchell
and S. Vavasis, ``Quality Mesh Generation in Higher Dimensions''
(gzip'd
postscript, 130k;
plain
postscript, 388k). Final version appeared in SIAM J. Comput.
29 (2000) 13341370.

E. Bobrovnikova and S. Vavasis,
``Accurate Solution of Weighted Least Squares by Iterative Methods''
(gzip'd postscript, 105k;
plain
postscript, 349k). Final version appeared SIAM J. Matrix An. App
22 (2001) 11531174.

E. Bobrovnikova and S. Vavasis,
``A Norm Bound for Projections with Complex Weights''
(gzip'd
postscript, 106k;
plain
postscript, 215k). Final version appeared Linear Alg. Appl.
307 (2000) 6975.

V. Howle
and S. Vavasis,
``Preconditioning complexsymmetric layered systems arising
in electric power modeling''
(gzip'd
postscript, 42k;
plain
postscript, 156k).

S. Vavasis, ``A note on efficient computation of the gradient in semidefinite
programming''
(gzip'd
postscript, 99k;
plain
postscript, 196k).

G. Jónsson
and S. Vavasis, ``Solving polynomials with small leading
coefficients''
(gzip'd
postscript, 100k;
plain
postscript, 290k). Final version appeared: SIAM J. Matrix Analysis App., 26 (2005) 400414.

V. Howle and S.
Vavasis, ``An iterative method for solving complexsymmetric systems arising
in electric power modeling''
(gzip'd
postscript, 123k;
plain
postscript, 343k). Final version appeared:
SIAM J. Matrix Analysis App.,
26 (2005) 11501178

G. Jónsson
and S. Vavasis, ``Accurate solution of polynomial equations using Macaulay
resultant matrices''
(gzip'd
postscript, 284k;
plain
postscript, 689k). Final version appeared:
Mathematics of Computation,
74 (2005) 221262

S. Vavasis, ``A BernsteinBezier sufficient condition for invertibility
of polynomial mapping functions'' (revised 3 Nov 2001)
(gzip'd
postscript, 100k;
plain
postscript, 200k).

K.
Papoulia and S. Vavasis, ``Time continuity in cohesive finite element
modeling'' (pdf, 319k).
Final version appeared:
International Journal for Numerical Methods in Engineering
58(5) 679701, 2003.

P. Ganguly, S. Vavasis and K.
Papoulia,
``An algorithm for twodimensional mesh generation based on the
pinwheel tiling''
(pdf,
289k) SIAM J. Scientific Comput., 28 (2006) 15331562.

E. Boman,
B. Hendrickson,
and S. Vavasis,
``Solving Elliptic Finite Element Systems in NearLinear Time
with Support Preconditioners''
(Arxiv link),
SIAM J. Numer. Anal. 46 (2008) 32643284.

K.
Papoulia,
S. Vavasis and P. Ganguly, Spatial convergence of crack nucleation
using a cohesive finite element model on a pinwheelbased mesh,
International J. Numer. Meth. Eng. (pdf, 291k), 67(2006) 116.

ChinHang Sam,
K.
Papoulia,
Stephen Vavasis, Obtaining initially rigid cohesive finite element models that are temporally convergent,
Engineering Fracture Mechanics, 72 (2005) 22472267.
(pdf, 310k)

S. Shontz and
S. Vavasis,
``A linear weighted laplacian smoothing framework for warping tetrahedral meshes''
(arxiv link)
Analysis of and workarounds for element reversal for a finite
elementbased algorithm for warping triangular and tetrahedral meshes,
BIT Numerical Mathematics, Volume 50 (2010), Issue 4, 863884.

Gun Srijuntongsiri and S. Vavasis,
A Fully Sparse Implementation of a PrimalDual InteriorPoint Potential Reduction Method for Semidefinite Programming,
submitted to SIAM Journal on Optimization
(arxiv link)

S. Vavasis,
A conjecture that the roots of a univariate polynomial lie in a union
of annuli
(arxiv link)

Gun Srijuntongsiri and
S. Vavasis,
A condition number analysis of a linesurface intersection algorithm
(arxiv link).
SIAM J. Sci. Comput 30 (2008) 10641081.

S. Shontz and
S. Vavasis,
``A robust solution procedure for hyperelastic solids with
large boundary deformation''
(arxiv link).
Final version appeared in Engineering with COmputers, posted on
line 2011June11, print edition to appear.

Gun Srijuntongsiri and S. Vavasis,
Properties of polynomial bases used in linesurface
intersection algorithm
(arxiv link)

S. Vavasis,
On the complexity of nonnegative matrix factorization
(arxiv link).
Final version appeared, SIAM J. Optim. Volume 20, Issue 3, pp. 13641377 (2009).

Gun Srijuntongsiri and
S. Vavasis,
A condition number analysis of a surfacesurface intersection algorithm
(arxiv link)

M. Biggs, A. Ghodsi and S. Vavasis, Nonnegative matrix factorization
via rankone downdate,
preliminary journal version from
arxiv.org, ICML 2008
conference
version.

B. Ames and S. Vavasis,
Nuclear norm minimization for the planted clique and biclique problems
(arxiv link;
published paper.)

B. Ames and S. Vavasis,
Convex relaxation for the planted kdisjointclique problem
(arxiv link)

X.
V. Doan and S. Vavasis,
Finding approximately rankone submatrices with the nuclear
norm and l_{1} norm
(arxiv link).
Unpublished proof of NPhardness of LAROS problem.

X.
V. Doan,
K.C. Toh and S. Vavasis,
A proximal point algorithm for sequential feature
extraction applications
(arxiv link)

S. Karimi and S. Vavasis,
Detecting and correcting loss of independence in nonlinear
conjugate gradient (arxiv link)
(previously "Conjugate gradient with subspace
optimization").

N. Gillis
and S. Vavasis,
Fast and Robust Recursive Algorithms for Separable Nonnegative Matrix Factorization (arxiv link).

S. Sastry, S. Shontz, and S. Vavasis, A logbarrier method for mesh quality
improvement and untangling, Final version appeared in Engineering with Computers,
Nov 2012 (Springer Link web publication). Preliminary version appeared in
Proceedings of the 2011 International Meshing Roundtable.

L. Elkin,
Ting Kei Pong and S. Vavasis,
Convex relaxation for finding planted influential nodes
in a social network
(arxiv link).

S. Vavasis, Some notes on applying computational divided differencing
in optimization
(arxiv link).

N. Gillis
and S. Vavasis
Semidefinite programming based preconditioning
for more robust nearseparable nonnegative matrix factorization
(arxiv link).
The QMG package
I have written a software package called QMG for mesh generation for
the finite element method in three dimensions. QMG
is available on an opensource basis by anonymous ftp.
With QMG you can construct 3D geometric objects with very
complicated topology (holes, internal boundaries, etc.) and
automatically create an unstructured
tetrahedral mesh for them.
(The mesh generator is based on algorithmic work by Scott Mitchell and me.)
You can also solve an elliptic boundary
value problem (div (c*grad u)=f) on your domain. The package is
written in C++ and Matlab and is distributed
for free at the sourcecode level (anonymous ftp distribution
began 5/5/95). It runs under Matlab and Tcl/Tk.
QMG 2.0 was released on 3 September 1999. The principal new feature in
QMG 2.0 (compared to QMG 1.1) is its ability to handle curved boundaries.
Please
see the online documentation.
