Michael Jeremy Todd

from Wikipedia, the free encyclopedia

Michael Jeremy Todd (born August 14, 1947 in Chelmsford ) is a British mathematician who deals with optimization and operations research .

Michael Todd, Oberwolfach 2005

Todd received his bachelor's degree from Cambridge University in 1968 and his doctorate in Administrative Science (Abstract complementary pivot theory) from Yale University in 1972 . In 1971 he became a Lecturer and then Assistant Professor at the University of Ottawa and in 1973 Assistant Professor and later Professor of Operations Research and Industrial Engineering at Cornell University . Since 1988 he has been a Leon C. Welch Professor .

He deals with algorithms for linear programming and convex optimization , especially semidefinite programming . He conducted research on homotopy methods, interior point methods , probabilistic analysis of pivot methods and the extension of complementary pivot methods to oriented matroids .

In 1988 he received the George B. Dantzig Prize and in 2003 the John von Neumann Theory Prize . In 1980/81 he was a Guggenheim Fellow and from 1981 to 1985 a Sloan Fellow .

He was the editor of Mathematical Programming.

Fonts

  • The computation of fixed points and applications, Lecture Notes in Economics and Mathematical Systems, Springer Verlag 1976
  • with KC Toh, RH Tütüncü: SDPT3 — a MATLAB software package for semidefinite programming, version 1.3, Optimization Methods and Software, Volume 11, 1999, 545-581
  • with KC Toh, RH Tütüncü: Solving semidefinite-quadratic-linear programs using SDPT3, Mathematical Programming, Volume 95, 2003, 189-217
  • with Yurii Nesterov : Self-scaled barriers and interior-point methods for convex programming, Mathematics and Operations Research, Volume 22, 1997, 1-42
  • with Y. Nesterov: Primal-dual interior-point methods for self-scaled cones, SIAM J. Optimization, Volume 8, 1998, 324-364
  • Semidefinite Optimization, Acta Numerica, Volume 10, 2001, 515-560
  • with RG Bland, D. Goldfarb: The ellipsoid method: a survey, Operations Research, Volume 29, 1981, pp. 1039-1091
  • with Shinji Mizuni, Yinyu Ye: On adaptive-step primal-dual interior-point algorithms for linear programming, Mathematics of Operations Research, Volume 18, 1993, pp. 964-981
  • with D. Goldfarb: Linear Programming, in Handbooks in Operations Research and Management Science, Volume 1, 1989, pp. 73-170
  • The many facets of linear programming, Mathematical Programming, Volume 91, 2002, 417-436
  • with JE Mitchell: Solving combinatorial optimization problems using Karmarkar's algorithm, Mathematical Programming, Volume 56, 1992, pp. 245-284
  • Editor with George Nemhauser , AHG Rinnooy Kan : Optimization, North Holland 1989
  • Editor with Jeffrey Lagarias : Mathematical developments arising from linear programming: proceedings of a joint summer research conference held at Bowdoin College, June 25-July 1, 1988, American Mathematical Society 1990

Web links

Individual evidence

  1. Life data according to American Men and Women of Science , Thomson Gale 2004