| 2009 |
|---|
| 21 | EE | Michael J. Todd:
Largest dual ellipsoids inscribed in dual cones.
Math. Program. 117(1-2): 425-434 (2009) |
| 2008 |
|---|
| 20 | EE | Andrew P. Bradshaw,
Michael J. Todd,
David S. Taubman:
Active surface modeling at CT resolution limits with micro CT ground truth.
ICIP 2008: 1081-1084 |
| 19 | EE | Michael J. Todd:
Dual versus primal-dual interior-point methods for linear and conic programming.
Math. Program. 111(1-2): 301-313 (2008) |
| 2007 |
|---|
| 18 | EE | Michael J. Todd,
E. Alper Yildirim:
On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids.
Discrete Applied Mathematics 155(13): 1731-1744 (2007) |
| 2003 |
|---|
| 17 | EE | Ronald A. DeVore,
Arieh Iserles,
Michael J. Todd:
Editorial.
Foundations of Computational Mathematics 3(2): 111 (2003) |
| 16 | EE | Reha H. Tütüncü,
K. C. Toh,
Michael J. Todd:
Solving semidefinite-quadratic-linear programs using SDPT3.
Math. Program. 95(2): 189-217 (2003) |
| 2002 |
|---|
| 15 | EE | Yu. E. Nesterov,
Michael J. Todd:
On the Riemannian Geometry Defined by Self-Concordant Barriers and Interior-Point Methods.
Foundations of Computational Mathematics 2(4): 333-361 (2002) |
| 1998 |
|---|
| 14 | | Michael J. Todd,
Yinyu Ye:
Approximate Farkas lemmas and stopping rules for iterative infeasible-point algorithms for linear programming.
Math. Program. 81: 1-21 (1998) |
| 1996 |
|---|
| 13 | | Michael J. Todd:
Potential-reduction methods in mathematical programming.
Math. Program. 76: 3-45 (1996) |
| 1994 |
|---|
| 12 | | Michael J. Todd:
Interior-point algorithms for semi-infinite programming.
Math. Program. 65: 217-245 (1994) |
| 1993 |
|---|
| 11 | | Michael J. Todd,
Yufei Wang:
On Combined Phase 1-Phase 2 Projective Methods for Linear Programming.
Algorithmica 9(1): 64-83 (1993) |
| 10 | | Michael J. Todd:
Combining phase I and phase II in a potential reduction algorithm for linear programming.
Math. Program. 59: 133-150 (1993) |
| 9 | | Leonid Khachiyan,
Michael J. Todd:
On the complexity of approximating the maximal inscribed ellipsoid for a polytope.
Math. Program. 61: 137-159 (1993) |
| 8 | | Michael J. Todd,
Levent Tunçel:
A New Triangulation for Simplicial Algorithms.
SIAM J. Discrete Math. 6(1): 167-180 (1993) |
| 1992 |
|---|
| 7 | | Michael J. Todd:
On Anstreicher's combined phase I-phase II projective algorithm for linear programming.
Math. Program. 55: 1-15 (1992) |
| 6 | | John E. Mitchell,
Michael J. Todd:
Solving combinatorial optimization problems using Karmarkar's algorithm.
Math. Program. 56: 245-284 (1992) |
| 1991 |
|---|
| 5 | | Shinji Mizuno,
Michael J. Todd:
An O(n3L) adaptive path following algorithm for a linear complementarity problem.
Math. Program. 52: 587-595 (1991) |
| 1990 |
|---|
| 4 | | Yinyu Ye,
Michael J. Todd:
Containing and Shrinking Ellipsoids in the Path-Following Algorithm.
Math. Program. 47: 1-9 (1990) |
| 1986 |
|---|
| 3 | | Michael J. Todd,
Bruce P. Burrell:
An Extension of Karmarkar's Algorithm for Linear Programming Using Dual Variables.
Algorithmica 1(4): 409-424 (1986) |
| 1985 |
|---|
| 2 | EE | Michael J. Todd:
Linear and quadratic programming in oriented matroids.
J. Comb. Theory, Ser. B 39(2): 105-133 (1985) |
| 1981 |
|---|
| 1 | | Robert M. Freund,
Michael J. Todd:
A Constructive Proof of Tucker's Combinatorial Lemma.
J. Comb. Theory, Ser. A 30(3): 321-325 (1981) |
