Michael J. Todd

Publication Activity (10 Years)

Years Active: 1974-2024
Publications (10 Years): 3

Top Topics

Nash Equilibria

Linear Inequalities

Top Venues

Math. Oper. Res.

SIAM J. Discret. Math.

Publications

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