Research and Publications


My research is in convex, and integer programming. A few subjects that I especially like are listed below.

Convex Programming

I have developed a theory on the ``Facial Structure of Conic Linear Programs'', which generalizes the known theory on facial structure, basic solutions, nondegeneracy, and strict complementarity in linear programming.
Many known results on the geometry of convex programs fit into this framework as special cases, and some new ones can be derived from it. See the paper and a talk .  

I gave a new, surprisingly simple condition for a classical problem in convex analysis: the closedness of the linear image of a closed convex cone.
See the paper.  This result implies that all "badly behaved semidefinite programs look the same". The paper is forthcoming; in the meantime, see the talks .

Integer Programming

On a reformulation technique for general integer programs that makes many hard instances easy, see a talk , and a paper .

Applications of Optimization

With coauthors Burcu Aydin, Haonan Wang, Liz Bullitt, and Steve Marron, we developed a methodology to compute principal components in trees.
A mention of this work in the journal La Recherche.  
With this work, student Burcu Aydin won the interactive session at the INFORMS annual meeting in Fall 2008 in Washington DC

Publications

Convex Programming

Integer Programming

Applications of Optimization

Some Talks: