Semidefinite Programming:
Applications, Duality, and Interior-Point Methods.
INFORMS, Seattle, October
1998. ps file,
pdf file.
Sensitivity analysis in linear programming and semidefinite
programming using interior-point methods.
Institute of Statistical Mathematics, Tokyo, Japan, and
Oberwolfach, Germany, January 2000.
ps file,
pdf file.
Sensitivity analysis in semidefinite
programming using interior-point methods.
SIAM National Meeting, Puerto Rico, July 2000.
ps file,
pdf file.
The many facets of linear programming.
Plenary lecture at the 17th International Symposium
on Mathematical Programming, Atlanta, August 2000.
ps file,
pdf file.
Boris Polyak's talk on the history of mathematical programming in
the USSR.
Plenary lecture at the 17th International Symposium
on Mathematical Programming, Atlanta, August 2000.
ps file,
pdf file.
Detecting infeasibility in infeasible-interior-point methods for
optimization.
Plenary lecture at the Foundations of Computational Mathematics
Conference, Minneapolis, August 2002.
ps file,
pdf file.
Conic programming.
Summer School lecture at ICCOPT I, Troy, August 2004.
ps file, pdf file.
Largest dual ellipsoids inscribed in dual cones.
FoCM Conference, Santander, July 2005.
ps file, pdf file.
Inexact primal-dual path-following algorithms for certain
quadratic SDPs.
IMS Workshop on Semidefinite Programming, January 2006.
ps file, pdf file.
On minimum-volume ellpsoids: from John and Kiefer-Wolfowitz to
Khachiyan and Nesterov-Nemirovski.
Abel Symposium, Alesund, May 2006.
pdf file.
Leonid Khachiyan's contributions to mathematical programming
beyond LP \in P.
19th International Symposium
on Mathematical Programming,
Rio de Janeiro, August 2006.
pdf file.
Minimum volume ellipsoids: applications, duality, and applications.
6th International Congress on Industrial and Applied Mathematics,
Zurich, July 2007.
pdf file.
Conic optimization: interior-point methods and beyond.
Optimization2007, Porto, July 2007.
pdf file.