Selected Recent Talks of John Mitchell

These are uncompressed pdf files. Also available is a list of my papers.

  1. Approaches for two classes of hard optimization problems, February 2008.
  2. Cutting planes and cutting surfaces for hard optimization problems, February 2008.
  3. On the Global Solution of Linear Programs with Linear Complementarity Constraints, with Jing Hu, Jong-Shi Pang, Kristin Bennett and Gautam Kunapuli. Given at INFORMS Annual Meeting, November 4-7, 2007, Seattle, Washington.
  4. Selective Gram-Schmidt orthonormalization for conic cutting surface algorithms, given at ICCOPT II and MOPTA-07, August 13-16, 2007, McMaster University, Hamilton, Ontario, Canada.
  5. Conic Cutting Surface Algorithms, given at ISMP 2006, Rio de Janeiro, July 30 to August 4, 2006. My talk with breaks and without breaks.
  6. Branch-and-price-and-cut on clique partition problems with minimum size requirement, given by Xiaoyun Ji at the IMA Special Workshop: Mixed-Integer Programming, at the University of Minnesota, July 25 - 29, 2005.
  7. Cutting Plane Methods for Conic Programs, given at SIAM 2005 Optimization Conference, Stockholm, May 15-19, 2005.
  8. Minimum weight constrained forest problems, given by Xiaoyun Ji at Optimization Days 2005, Montreal, May 9-11, 2005.
  9. A unifying framework for several cutting plane models for semidefinite programming, given on February 28, 2004, at the Multiscale optimization methods and applications workshop at the University of Florida. See also the draft version (containing some more details) given at RPI on February 18, 2004. A similar talk was given at ICCOPT I.
  10. An Analytic Center Cutting Plane Method in Conic Programming, given at INFORMS Atlanta 2003.
  11. Properties of a Cutting Plane Method for Semidefinite Programming, given at ISMP 03, Copenhagen, August 2003. (Similar talks were given at MOPTA 2003 and INFORMS Atlanta 2003.)
  12. Research summary, given to the math department grad students at RPI, 19 Feb 2003 (pdf file).
  13. A Cutting Plane SDP Method for Maxcut Problems, given at the McMaster Optimization Conference, 2002, Hamilton, Ontario, August 1-3, 2002.
  14. Using Semidefinite Programming to Rebalance a Portfolio in the Presence of Transaction Costs, given at the 7th SIAM Conference on Optimization, Toronto, May 20-23, 2002.
  15. A Linear Programming Approach to Semidefinite Programming Problems, given to the Operations Research area within the Mathematics center at IBM Yorktown Heights, April 9, 2001.
  16. Realignment in the NFL, given at INFORMS 2000, in San Antonio, November 2000. See the strongly related talk on branch-and-cut for the k-way equipartition problem.
  17. "Branch-and-cut for the k-way equipartition problem", given at ISMP2000, Atlanta, August 2000.
  18. "Solving semidefinite programming problems using branch-and-bound", given at EURO XVII, Budapest, July 2000.
  19. "Computational experience with interior point column generation and cutting plane methods", given at SIAM Conference on Optimization, Atlanta, May 1999.
  20. "A Comparison of Methods for Solving MAXSAT Problems," given at INFORMS Seattle conference, October 1998. This talk considers three methods: branch-and-cut, an extension of the classic logic approach of Davis-Putnam-Loveland, and a semidefinite programming approach. Joint work with Steve Joy and Brian Borchers. (124720 bytes.)
  21. "A Homogeneous Self-Dual Interior Point Cutting Plane Method," given at INFORMS Seattle conference, October 1998. This talk contains both theoretical and computational results. It is joint work with Erling Andersen, Kees Roos, and Tamas Terlaky. (144863 bytes.)
  22. "Solving large sparse MAXCUT problems using an interior point cutting plane algorithm," given at INFORMS Seattle conference, October 1998. The MAXCUT instances require finding the ground state of an Ising spin glass. This talk supersedes similar ones given at Combinatorial Optimization '98, Brussels, Belgium, April 15-17, 1998, and at SOR 97, Friedrich-Schiller-Universitat Jena, Germany, September 3-5, 1997. (144863 bytes.)
  23. "The computational performance of interior point cutting plane algorithms for integer programming problems," given at HPOPT98, Rotterdam, The Netherlands, June 17-19, 1998. This talk considers using interior point methods to solve linear ordering problems and MAXCUT problems. It supersedes similar talks given at the Mathematical Programming Symposium, Lausanne, Switzerland, August 24-29, 1997, and at the Workshop on High Performance Optimization Techniques, Erasmus University, Rotterdam, August 20-22, 1997. Joint work with Brian Borchers. (179651 bytes.)
  24. "Cutting plane and column generation methods using interior point methods," given at Delft University of Technology, 25 November 1997. This is a survey talk. (271318 bytes.)
  25. "A Long Step Cutting Plane Algorithm that uses the Volumetric Center," given at Mathematical Programming Symposium, Lausanne, Switzerland, August 24-29, 1997. Joint work with Srini Ramaswamy. (110821 bytes.)
  26. "Solving Mixed Integer Nonlinear Programming Problems Using an Interior Point Method," given at Workshop on High Performance Optimization Techniques, Erasmus University, Rotterdam, August 20-22, 1997. Joint work with Eva Lee. (77319 bytes.)
RPI Math
Back to John Mitchell's homepage