Michael J. Todd

91 papers B 1Journal 87Unranked 1
YearRankTypeTitle / Venue / Authors
2024 J jnl
An Oblivious Ellipsoid Algorithm for Solving a System of (In)Feasible Linear Inequalities.
Math. Oper. Res.
Jourdain B. Lamperski, Robert M. Freund, Michael J. Todd
2018 J jnl
On max-k-sums.
Math. Program.
Michael J. Todd
2016 J jnl
Computation, Multiplicity, and Comparative Statics of Cournot Equilibria in Integers.
Math. Oper. Res.
Michael J. Todd
2016 — book
Minimum volume ellipsoids - theory and algorithms.
Michael J. Todd
2014 J jnl
An Improved Kalai-Kleitman Bound for the Diameter of a Polyhedron.
SIAM J. Discret. Math.
Michael J. Todd
2013 J jnl
A modified Frank-Wolfe algorithm for computing minimum-area enclosing ellipsoidal cylinders: Theory and algorithms.
Comput. Geom.
Selin Damla Ahipasaoglu, Michael J. Todd
2013 J jnl
Augmented Active Surface Model for the Recovery of Small Structures in CT.
IEEE Trans. Image Process.
Andrew Philip Bradshaw, David S. Taubman, Michael J. Todd, John S. Magnussen, G. Michael Halmagyi
2012 J jnl
A robust robust optimization result.
Oper. Res. Lett.
Martina Gancarova, Michael J. Todd
2010 — conf
Proportional Response as Iterated Cobb-Douglas.
Equilibrium Computation
Michael J. Todd
2009 J jnl
Largest dual ellipsoids inscribed in dual cones.
Math. Program.
Michael J. Todd
2008 B conf
Active surface modeling at CT resolution limits with micro CT ground truth.
ICIP
Andrew Philip Bradshaw, Michael J. Todd, David S. Taubman
2008 J jnl
Dual versus primal-dual interior-point methods for linear and conic programming.
Math. Program.
Michael J. Todd
2008 J jnl
Linear convergence of a modified Frank-Wolfe algorithm for computing minimum-volume enclosing ellipsoids.
Optim. Methods Softw.
Selin Damla Ahipasaoglu, Peng Sun, Michael J. Todd
2007 J jnl
On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids.
Discret. Appl. Math.
Michael J. Todd, E. Alper Yildirim
2004 — ch.
Mathematical programming.
Handbook of Discrete and Computational Geometry, 2nd Ed.
Michael J. Todd
2003 J jnl
Editorial.
Found. Comput. Math.
Ronald A. DeVore, Arieh Iserles, Michael J. Todd
2003 J jnl
Solving semidefinite-quadratic-linear programs using SDPT3.
Math. Program.
Reha H. Tütüncü, Kim-Chuan Toh, Michael J. Todd
2002 J jnl
An Interior-Point Approach to Sensitivity Analysis in Degenerate Linear Programs.
SIAM J. Optim.
E. Alper Yildirim, Michael J. Todd
2002 J jnl
On the Riemannian Geometry Defined by Self-Concordant Barriers and Interior-Point Methods.
Found. Comput. Math.
Yurii E. Nesterov, Michael J. Todd
2002 J jnl
The many facets of linear programming.
Math. Program.
Michael J. Todd
2001 J jnl
Characterizations, bounds, and probabilistic analysis of two complexity measures for linear programming problems.
Math. Program.
Michael J. Todd, Levent Tunçel, Yinyu Ye
2001 J jnl
On two homogeneous self-dual approaches to linear programming and its extensions.
Math. Program.
Shinji Mizuno, Michael J. Todd
2001 J jnl
Sensitivity analysis in linear programming and semidefinite programming using interior-point methods.
Math. Program.
E. Alper Yildirim, Michael J. Todd
2000 J jnl
Least-change quasi-Newton updates for equality-constrained optimization.
Math. Program.
Michael Wagner, Michael J. Todd
1999 J jnl
Infeasible-start primal-dual methods and infeasibility detectors for nonlinear programming problems.
Math. Program.
Yurii E. Nesterov, Michael J. Todd, Yinyu Ye
1998 J jnl
Approximate Farkas lemmas and stopping rules for iterative infeasible-point algorithms for linear programming.
Math. Program.
Michael J. Todd, Yinyu Ye
1998 J jnl
Erratum: Probabilistic Models for Linear Programming.
Math. Oper. Res.
Michael J. Todd
1998 J jnl
On the Nesterov-Todd Direction in Semidefinite Programming.
SIAM J. Optim.
Michael J. Todd, Kim-Chuan Toh, Reha H. Tütüncü
1998 J jnl
Primal-Dual Interior-Point Methods for Self-Scaled Cones.
SIAM J. Optim.
Yurii E. Nesterov, Michael J. Todd
1997 J jnl
On the Interplay among Entropy, Variable Metrics and Potential Functions in Interior-Point Algorithms.
Comput. Optim. Appl.
Levent Tunçel, Michael J. Todd
1997 J jnl
Self-Scaled Barriers and Interior-Point Methods for Convex Programming.
Math. Oper. Res.
Yurii E. Nesterov, Michael J. Todd
1996 J jnl
A lower bound on the number of iterations of long-step primal-dual linear programming algorithms.
Ann. Oper. Res.
Michael J. Todd, Yinyu Ye
1996 J jnl
Asymptotic Behavior of Interior-Point Methods: A View From Semi-Infinite Programming.
Math. Oper. Res.
Levent Tunçel, Michael J. Todd
1996 J jnl
Potential-reduction methods in mathematical programming.
Math. Program.
Michael J. Todd
1996 J jnl
Solving LP Problems via Weighted Centers.
SIAM J. Optim.
Aiping Liao, Michael J. Todd
1995 J jnl
A Surface of Analytic Centers and Primal-Dual Infeasible-Interior-Point Algorithms for Linear Programming.
Math. Oper. Res.
Shinji Mizuno, Michael J. Todd, Yinyu Ye
1995 J jnl
Barrier Functions and Interior-Point Algorithms for Linear Programming with Zero-, One-, or Two-Sided Bounds on the Variables.
Math. Oper. Res.
Robert M. Freund, Michael J. Todd
1995 J jnl
Infeasible-Interior-Point Primal-Dual Potential-Reduction Algorithms for Linear Programming.
SIAM J. Optim.
Shinji Mizuno, Masakazu Kojima, Michael J. Todd
1994 J jnl
An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm.
Math. Oper. Res.
Yinyu Ye, Michael J. Todd, Shinji Mizuno
1994 J jnl
Commentary - Theory and Practice for Interior-Point Methods.
INFORMS J. Comput.
Michael J. Todd
1994 J jnl
Interior-point algorithms for semi-infinite programming.
Math. Program.
Michael J. Todd
1994 J jnl
Monotonicity of Primal and Dual Objective Values in Primal-dual Interior-point Algorithms.
SIAM J. Optim.
Shinji Mizuno, Michael J. Todd, Levent Tunçel
1994 J jnl
Scaling, shifting and weighting in interior-point methods.
Comput. Optim. Appl.
Michael J. Todd
1993 J jnl
A New Triangulation for Simplicial Algorithms.
SIAM J. Discret. Math.
Michael J. Todd, Levent Tunçel
1993 J jnl
Combining phase I and phase II in a potential reduction algorithm for linear programming.
Math. Program.
Michael J. Todd
1993 J jnl
On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming.
Math. Oper. Res.
Shinji Mizuno, Michael J. Todd, Yinyu Ye
1993 J jnl
On Combined Phase 1-Phase 2 Projective Methods for Linear Programming.
Algorithmica
Michael J. Todd, Yufei Wang
1993 J jnl
On the complexity of approximating the maximal inscribed ellipsoid for a polytope.
Math. Program.
Leonid Khachiyan, Michael J. Todd
1993 J jnl
The ellipsoid algorithm using parallel cuts.
Comput. Optim. Appl.
Aiping Liao, Michael J. Todd
1992 J jnl
A Low Complexity Interior-Point Algorithm for Linear Programming.
SIAM J. Optim.
Michael J. Todd
1992 J jnl
An (O√(n) L)-Iteration Large-Step Primal-Dual Affine Algorithm for Linear Programming.
SIAM J. Optim.
Clóvis C. Gonzaga, Michael J. Todd
1992 J jnl
On Anstreicher's combined phase I-phase II projective algorithm for linear programming.
Math. Program.
Michael J. Todd
1992 J jnl
Solving combinatorial optimization problems using Karmarkar's algorithm.
Math. Program.
John E. Mitchell, Michael J. Todd
1992 J jnl
Todd's low-complexity algorithm is a predictor-corrector path-following method.
Oper. Res. Lett.
Michael J. Todd, Jean-Philippe Vial
1991 J jnl
An O(n
Math. Program.
Shinji Mizuno, Michael J. Todd
1991 J jnl
Probabilistic Models for Linear Programming.
Math. Oper. Res.
Michael J. Todd
1990 J jnl
A Centered Projective Algorithm for Linear Programming.
Math. Oper. Res.
Michael J. Todd, Yinyu Ye
1990 J jnl
A Dantzig-Wolfe-Like Variant of Karmarkar's Interior-Point Linear Programming Algorithm.
Oper. Res.
Michael J. Todd
1990 J jnl
Containing and Shrinking Ellipsoids in the Path-Following Algorithm.
Math. Program.
Yinyu Ye, Michael J. Todd
1990 J jnl
Convex Resource Allocation Problems on Directed Acyclic Graphs: Duality, Complexity, Special Cases, and Extensions.
Math. Oper. Res.
Clyde L. Monma, Alexander Schrijver, Michael J. Todd, Victor K.-W. Wei
1988 J jnl
Exploiting special structure in Karmarkar's linear programming algorithm.
Math. Program.
Michael J. Todd
1988 J jnl
Improved Bounds and Containing Ellipsoids in Karmarkar's Linear Programming Algorithm.
Math. Oper. Res.
Michael J. Todd
1988 J jnl
Symmetry and Positive Definiteness in Oriented Matroids.
Eur. J. Comb.
Walter D. Morris Jr., Michael J. Todd
1986 J jnl
An Extension of Karmarkar's Algorithm for Linear Programming Using Dual Variables.
Algorithmica
Michael J. Todd, Bruce P. Burrell
1986 J jnl
From the editor.
Math. Program.
Michael J. Todd
1986 J jnl
Polynomial expected behavior of a pivoting algorithm for linear complementarity and linear programming problems.
Math. Program.
Michael J. Todd
1985 J jnl
'Fat' triangulations, or solving certain nonconvex matrix optimization problems.
Math. Program.
Michael J. Todd
1985 J jnl
Linear and quadratic programming in oriented matroids.
J. Comb. Theory B
Michael J. Todd
1985 J jnl
The Ellipsoid Method Generates Dual Variables.
Math. Oper. Res.
Bruce P. Burrell, Michael J. Todd
1983 J jnl
An efficient simplicial algorithm for computing a zero of a convex union of smooth functions.
Math. Program.
Samuel A. Awoniyi, Michael J. Todd
1983 J jnl
Large-scale linear programming: Geometry, working bases and factorizations.
Math. Program.
Michael J. Todd
1982 J jnl
An implementation of the simplex method for linear programming problems with variable upper bounds.
Math. Program.
Michael J. Todd
1982 J jnl
Modifications and implementation of the ellipsoid algorithm for linear programming.
Math. Program.
Donald Goldfarb, Michael J. Todd
1982 J jnl
On Minimum Volume Ellipsoids Containing Part of a Given Ellipsoid.
Math. Oper. Res.
Michael J. Todd
1982 J jnl
On the computational complexity of piecewise-linear homotopy algorithms.
Math. Program.
Michael J. Todd
1981 J jnl
A Constructive Proof of Tucker's Combinatorial Lemma.
J. Comb. Theory A
Robert M. Freund, Michael J. Todd
1981 J jnl
Approximate Labelling for Simplicial Algorithms and Two Classes of Special Subsets of the Sphere.
Math. Oper. Res.
Michael J. Todd
1981 J jnl
Feature Article - The Ellipsoid Method: A Survey.
Oper. Res.
Robert G. Bland, Donald Goldfarb, Michael J. Todd
1980 J jnl
A Note on Optimally Dissecting Simplices.
Math. Oper. Res.
Michael J. Todd, Robert C. Acar
1980 J jnl
A quadratically-convergent fixed-point algorithm for economic equilibria and linearly constrained optimization.
Math. Program.
Michael J. Todd
1980 J jnl
Determining Optimal Use of Resources among Regional Producers under Differing Levels of Cooperation.
Oper. Res.
Robert B. Rovinsky, Christine A. Shoemaker, Michael J. Todd
1980 J jnl
Exploiting structure in piecewise-linear homotopy algorithms for solving equations.
Math. Program.
Michael J. Todd
1980 J jnl
The Monotonic Bounded Hirsch Conjecture is False for Dimension at Least 4.
Math. Oper. Res.
Michael J. Todd
1980 J jnl
Traversing Large Pieces of Linearity in Algorithms that Solve Equations by Following Piecewise-Linear Paths.
Math. Oper. Res.
Michael J. Todd
1979 J jnl
Piecewise linear paths to minimize convex functions may not be monotonic.
Math. Program.
Michael J. Todd
1978 J jnl
Bimatrix games - an addendum.
Math. Program.
Michael J. Todd
1978 J jnl
On the Jacobian of a Function at a Zero Computed by a Fixed Point Algorithm.
Math. Oper. Res.
Michael J. Todd
1976 J jnl
Characterizing binary simplical matroids.
Discret. Math.
Michael J. Todd
1976 J jnl
On triangulations for computing fixed points.
Math. Program.
Michael J. Todd
1976 J jnl
Orientation in Complementary Pivot Algorithms.
Math. Oper. Res.
Michael J. Todd
1974 J jnl
A generalized complementary pivoting algorithm.
Math. Program.
Michael J. Todd