Todd Munson is working on utilizing constrained nonlinear optimization techniques to compute mountain passes, critical points where the Hessian has exactly one negative eigenvalue. Mountain passes are of interest, for example, in computational chemistry where they correspond to transition states for chemical reactions. He has also been working with on an application of optimization to the r-refinement problem, a large nonlinear, nonconvex optimization problem that can cause grief for many general-purpose methods.
Munson's past work includes several generalized Newton methods for solving complementarity problems. PATH is based on the normal map formulation of complementarity problems. At each iteration, a linear complementarity problem is solved to calculate a direction. The code is globalized by using the Fischer-Burmeister merit function. The method is enhanced with preprocessing techniques that remove variables and constraints from the given problem, and uncover polyhedral variational inequality structure; nonmontone search criteria; and crashing methods to identify good active sets. Parallel versions of the semismooth methods that he wrote are available in TAO, the Toolkit for Advanced Optimization.
Finally, he has worked on special-purpose algorithms for solving support vector machine and mesh shape-quality optimization problems. The structure of the linear support vector machine problem enabled MCS staff to write tailored linear algebra in interior-point and semismooth algorithms so that they can solve extremely large instances (on the order of 60-100 million degrees of freedom).
Munson received his Ph.D. from the University of Wisconsin-Madison in 2000. He is a Senior Fellow in the Computation Institute and a past Givens Research Associate. He holds memberships in the Institute for Operations Research and the Management Sciences, the Mathematical Programming Society and the Society for Industrial and Applied Mathematics.
He is a Kavli Frontiers Fellow.
- Algorithms for numerical optimization and equilibrium problems
- Applications of mathematical programming
- Llinear algebra for large sparse systems