First-order methods for packing/covering semidefinite programs. In this project, we have extended Nesterov's first-order method to semidefinite packing and covering programs. Collaborators on this work include G. Iyengar, A. Mills and C. Stein. Papers for this project can be found here and here. Slides from a talk I gave at MOPTA 2010 can be found here. Code and data generators for the packing method extended to the Sparse PCA can be found here.
Resource planning for Magnetic Resonance Imaging. We investigate algorithms and patient data in order to help determine when additional resources for a radiology department are required to meet patient needs. Here are the slides from a talk I gave at MAPSP 2009. Here is the paper we submitted. This is joint work with L. Leemis, G. Phillips, A. Carpenter, and Alan Papir.
Determining airline routes with less delay. We use data analysis on several years of flight data combined with network optimization techniques to design algorithms that find flight routes with a low probability of delay. Here is our poster from Data Expo 2009 at JSM, which was awarded honorable distinction. Here is the conference version of the paper we wrote. The journal version has been accepted by the Journal of Computational Graphical Statistics. This is joint work with T. Dey and P. Steele.
Developing fast algorithms to solve MAXCUT. We use a combination of approximation algorithms and non-linear programming techniques to develop different algorithms to solve the MAXCUT problem. This is joint work with M. Lewis, A. Powell and R. Taylor.