These are uncompressed pdf files.
Also available is a list of my papers.
 Quadratic programs with complementarity
constraints,
ISMP 2012,
Berlin, August 2012.
 Tightening relaxations of LPCCs,
April 2010.
 Linear programs with complementarity
constraints: algorithms and applications,
plenary talk at the
Second
Waterloo Engineering Optimization Day,
March 31, 2010.
 TutORial: Cutting planes, cutting surfaces,
and subgradient methods,
given at
INFORMS San Diego,
October 2009.
See also the
accompanying
paper.
 An LPCC approach to indefinite quadratic
programs,
with Jing Hu and
JongShi
Pang.
Given at
ISMP 2009
in Chicago, August 2009.
 Mathematical programming applications of
linear programs with complementarity constraints,
with Jing Hu and
JongShi
Pang.
Given at
INFORMS Annual Meeting,
Washington DC, October 2008.
 Active set algorithms for conic programming.
Joint with Kartik Sivaramakrishnan.
Given at the
SIAM Conference on
Optimization, May 2008, Boston.
 Approaches for two classes of hard
optimization problems, February 2008.
 Cutting planes and cutting surfaces
for hard optimization problems, February 2008.

On the Global Solution of Linear Programs with
Linear Complementarity Constraints,
with Jing Hu,
JongShi
Pang,
Kristin Bennett
and
Gautam Kunapuli.
Given at
INFORMS Annual Meeting,
November 47, 2007, Seattle, Washington.

Selective GramSchmidt orthonormalization
for conic cutting surface algorithms,
given at
ICCOPT II
and MOPTA07,
August 1316, 2007, McMaster University, Hamilton, Ontario, Canada.

Conic Cutting Surface Algorithms,
would have been given at
ISMP 2006,
Rio de Janeiro, July 30 to August 4, 2006,
if not for Varig's help.
My talk with breaks
and
without breaks.

Branchandpriceandcut
on clique partition problems with minimum size requirement,
given by Xiaoyun Ji at the
IMA
Special Workshop: MixedInteger Programming,
at the University of Minnesota, July 25  29, 2005.

Cutting Plane Methods for Conic Programs,
given at
SIAM 2005 Optimization
Conference, Stockholm, May 1519, 2005.

Minimum weight constrained forest problems,
given by Xiaoyun Ji at
Optimization Days 2005,
Montreal, May 911, 2005.

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.

An Analytic Center Cutting Plane Method in
Conic Programming,
given at
INFORMS Atlanta 2003.

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.)

Research summary,
given to the math department grad students at RPI,
19 Feb 2003 (pdf file).

A Cutting Plane SDP Method for Maxcut Problems,
given at the
McMaster Optimization Conference,
2002, Hamilton, Ontario, August 13, 2002.

Using Semidefinite Programming to Rebalance
a Portfolio in the Presence of Transaction Costs,
given at the
7th SIAM Conference
on Optimization, Toronto, May 2023, 2002.

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.

Realignment in the NFL, given at INFORMS 2000, in San Antonio,
November 2000. See the strongly related talk on branchandcut
for the kway equipartition problem.

"Branchandcut
for the kway equipartition problem",
given at
ISMP2000,
Atlanta, August 2000.

"Solving
semidefinite programming problems using branchandbound",
given at
EURO XVII,
Budapest, July 2000.

"Computational experience with interior point column generation and
cutting plane methods",
given at
SIAM Conference on Optimization,
Atlanta, May 1999.

"A Comparison of Methods for Solving MAXSAT Problems,"
given at
INFORMS Seattle
conference, October 1998.
This talk considers three methods: branchandcut,
an extension of the classic logic approach of DavisPutnamLoveland,
and a semidefinite programming approach.
Joint work with
Steve Joy
and Brian Borchers.
(124720 bytes.)

"A Homogeneous SelfDual 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.)

"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 1517, 1998,
and at
SOR 97,
FriedrichSchillerUniversitat Jena, Germany, September 35, 1997.
(144863 bytes.)

"The computational performance of interior point cutting plane
algorithms for integer programming problems,"
given at
HPOPT98,
Rotterdam, The Netherlands, June 1719, 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 2429,
1997,
and at the
Workshop on
High Performance Optimization Techniques,
Erasmus University, Rotterdam, August 2022, 1997.
Joint work with
Brian Borchers.
(179651 bytes.)

"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.)

"A Long Step
Cutting Plane Algorithm that uses the Volumetric Center," given at
Mathematical Programming Symposium, Lausanne, Switzerland, August 2429,
1997.
Joint work with
Srini Ramaswamy.
(110821 bytes.)

"Solving Mixed Integer Nonlinear
Programming Problems Using an Interior Point Method,"
given at
Workshop on
High Performance Optimization Techniques,
Erasmus University, Rotterdam, August 2022, 1997.
Joint work with
Eva Lee.
(77319 bytes.)
RPI Math
Back to John Mitchell's homepage