Michael J. Todd

发表

An implementation of the simplex method for linear programming problems with variable upper bounds

Michael J. Todd, M. Todd, 1982, Math. Program..

On the complexity of approximating the maximal inscribed ellipsoid for a polytope

Leonid Khachiyan, Michael J. Todd, L. Khachiyan, 1993, Math. Program..

Solving combinatorial optimization problems using Karmarkar's algorithm

Michael J. Todd, John E. Mitchell, M. Todd, 1992, Math. Program..

Probabilistic Models for Linear Programming

Michael J. Todd, M. Todd, 1991, Math. Oper. Res..

Combining phase I and phase II in a potential reduction algorithm for linear programming

Michael J. Todd, M. Todd, 1993, Math. Program..

Computation, Multiplicity, and Comparative Statics of Cournot Equilibria in Integers

Michael J. Todd, M. Todd, 2016, Math. Oper. Res..

Convergence of infeasible-interior-point methods for self-scaled conic programming

Michael J. Todd, B. K. Rangarajan, M. Todd, 2003 .

Containing and shrinking ellipsoids in the path-following algorithm

Michael J. Todd, Yinyu Ye, Y. Ye, 1990, Math. Program..

Anticipated Behavior of Path-Following Algorithms for Linear Programming

Shinji Mizuno, Michael J. Todd, Yinyu Ye, 1989 .

Largest dual ellipsoids inscribed in dual cones

Michael J. Todd, M. Todd, 2008, Math. Program..

A robust robust optimization result

Michael J. Todd, Martina Gancarova, 2012, Oper. Res. Lett..

On combined phase 1-phase 2 projective methods for linear programming

Michael J. Todd, Yufei Wang, M. Todd, 2005, Algorithmica.

Piecewise linear paths to minimize convex functions may not be monotonic

Michael J. Todd, 1979, Math. Program..

Bimatrix games—an addendum

Michael J. Todd, M. Todd, 1978, Math. Program..

Sensitivity analysis in linear programming and semidefinite programming using interior-point methods

Michael J. Todd, E. Alper Yildirim, M. Todd, 2001, Math. Program..

The Ellipsoid Method Generates Dual Variables

Michael J. Todd, Bruce P. Burrell, M. Todd, 1985, Math. Oper. Res..

On Minimum Volume Ellipsoids Containing Part of a Given Ellipsoid

Michael J. Todd, 1982, Math. Oper. Res..

From the editor

Michael J. Todd, M. Todd, 1986, Math. Program..

Polynomial Algorithms for Linear Programming

Michael J. Todd, M. Todd, 1988 .

Chapter 5: Algorithms for the MAEC Problem

Michael J. Todd, M. Todd, 2016 .

An O(n3L) adaptive path following algorithm for a linear complementarity problem

Shinji Mizuno, Michael J. Todd, M. Todd, 1991, Math. Program..

Mathematical programming

Michael J. Todd, M. Todd, 2004, Handbook of Discrete and Computational Geometry, 2nd Ed..

A Dantzig-Wolfe-Like Variant of Karmarkar's Interior-Point Linear Programming Algorithm

Michael J. Todd, M. Todd, 1990, Oper. Res..

On triangulations for computing fixed points

Michael J. Todd, M. Todd, 1976, Math. Program..

The many facets of linear programming

Michael J. Todd, M. Todd, Michael J. Todd, 2002, Math. Program..

Approximate Farkas lemmas and stopping rules for iterative infeasible-point algorithms for linear programming

Michael J. Todd, Yinyu Ye, Y. Ye, 1998, Math. Program..

The ellipsoid algorithm using parallel cuts

Michael J. Todd, Aiping Liao, M. Todd, 1993, Comput. Optim. Appl..

On the Jacobian of a Function at a Zero Computed by a Fixed Point Algorithm

Michael J. Todd, 1978, Math. Oper. Res..

A Mathematical Model of Human Semicircular Canal Geometry: A New Basis for Interpreting Vestibular Physiology

Michael J. Todd, David S. Taubman, John S. Magnussen, 2010, Journal of the Association for Research in Otolaryngology.

Approximate Labelling for Simplicial Algorithms and Two Classes of Special Subsets of the Sphere

Michael J. Todd, 1981, Math. Oper. Res..

Dual versus primal-dual interior-point methods for linear and conic programming

Michael J. Todd, M. Todd, 2007, Math. Program..

Scaling, shifting and weighting in interior-point methods

Michael J. Todd, M. Todd, 1994, Comput. Optim. Appl..

Active surface modeling at CT resolution limits with micro CT ground truth

Michael J. Todd, David S. Taubman, Andrew Philip Bradshaw, 2008, 2008 15th IEEE International Conference on Image Processing.

SDPT3 — a Matlab software package for semidefinite-quadratic-linear programming, version 3.0

Kim-Chuan Toh, Michael J. Todd, Reha H. Tütüncü, 2001 .

Primal-Dual Interior-Point Methods for Self-Scaled Cones

Michael J. Todd, Yurii Nesterov, Y. Nesterov, 1998, SIAM J. Optim..

An Interior-Point Approach to Sensitivity Analysis in Degenerate Linear Programs

Michael J. Todd, E. Alper Yildirim, M. Todd, 2002, SIAM J. Optim..

Mathematical developments arising from linear programming : proceedings of a joint summer research conference held at Bowdoin College, June 25-July 1, 1988

Jeffrey C. Lagarias, Michael J. Todd, M. Todd, 1990 .

On max-k-sums

Michael J. Todd, M. Todd, 2018, Math. Program..

A New Triangulation for Simplicial Algorithms

Michael J. Todd, Levent Tunçel, 1993, SIAM J. Discret. Math..

On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids

Michael J. Todd, E. Alper Yildirim, M. Todd, 2007, Discret. Appl. Math..

3D anatomical orientations of the human semicircular canals from CT image reconstruction: functional implications

Michael J. Todd, Andrew P. Bradshaw, Swee T. Aw, 2004 .

A quadratically-convergent fixed-point algorithm for economic equilibria and linearly constrained optimization

Michael J. Todd, M. Todd, 1980, Math. Program..

Traversing Large Pieces of Linearity in Algorithms that Solve Equations by Following Piecewise-Linear Paths

Michael J. Todd, 1980, Math. Oper. Res..

Self-Scaled Barriers and Interior-Point Methods for Convex Programming

Michael J. Todd, Yurii Nesterov, Y. Nesterov, 1997, Math. Oper. Res..

‘Fat’ triangulations, or solving certain nonconvex matrix optimization problems

Michael J. Todd, 1985, Math. Program..

A Centered Projective Algorithm for Linear Programming

Michael J. Todd, Yinyu Ye, Y. Ye, 1990, Math. Oper. Res..

Determining Optimal Use of Resources among Regional Producers under Differing Levels of Cooperation

Christine A. Shoemaker, Michael J. Todd, R. B. Rovinsky, 1980, Oper. Res..

Superior semicurcular canal dehiscence simulating otoscierosis

Michael J. Todd, Andrew P. Bradshaw, Swee T. Aw, 2003 .

On the computational complexity of piecewise-linear homotopy algorithms

Michael J. Todd, M. Todd, 1982, Math. Program..

An efficient simplicial algorithm for computing a zero of a convex union of smooth functions

Michael J. Todd, Samuel A. Awoniyi, M. Todd, 1983, Math. Program..

A generalized complementary pivoting algorithm

Michael J. Todd, M. Todd, 1974, Math. Program..

Probabilistic analysis of two complexity measures for linear programming problems

Michael J. Todd, Levent Tunçel, Yinyu Ye, 1998 .

Improved Bounds and Containing Ellipsoids in Karmarkar's Linear Programming Algorithm

Michael J. Todd, M. Todd, 1988, Math. Oper. Res..

A lower bound on the number of iterations of long-step primal-dual linear programming algorithms

Michael J. Todd, Yinyu Ye, Y. Ye, 1996, Ann. Oper. Res..

Anticipated Behavior of Long-Step Algorithms for Linear Programming.

Shinji Mizuno, Michael J. Todd, Yinyu Ye, 1990 .

Solving the generalized market area problem

Michael J. Todd, M. Todd, 1978 .

Characterizing binary simplical matroids

Michael J. Todd, M. Todd, 1976, Discret. Math..

On the Implementation and Usage of SDPT3 – A Matlab Software Package for Semidefinite-Quadratic-Linear Programming, Version 4.0

Kim-Chuan Toh, Michael J. Todd, Reha H. Tütüncü, 2012 .

Linear convergence of a modified Frank–Wolfe algorithm for computing minimum-volume enclosing ellipsoids

Peng Sun, Michael J. Todd, Selin Damla Ahipasaoglu, 2008, Optim. Methods Softw..

Monotonicity of Primal and Dual Objective Values in Primal-dual Interior-point Algorithms

Shinji Mizuno, Michael J. Todd, Levent Tunçel, 1994, SIAM J. Optim..

On Anstreicher's combined phase I—phase II projective algorithm for linear programming

Michael J. Todd, M. Todd, 1992, Math. Program..

Editorial

Michael J. Todd, Ronald A. DeVore, Arieh Iserles, 1983, Found. Comput. Math..

SDPT3 -- A Matlab Software Package for Semidefinite Programming

Kim-Chuan Toh, Michael J. Todd, Reha H. Tütüncü, 1996 .

Linear and quadratic programming in oriented matroids

Michael J. Todd, M. Todd, 1985, J. Comb. Theory, Ser. B.

Erratum: Probabilistic Models for Linear Programming

Michael J. Todd, 1998, Math. Oper. Res..

A Surface of Analytic Centers and Infeasible- Interior-Point Algorithms for Linear Programming

Shinji Mizuno, Michael J. Todd, Yinyu Ye, 1993 .

Infeasible-Interior-Point Primal-Dual Potential-Reduction Algorithms for Linear Programming

Shinji Mizuno, Michael J. Todd, Masakazu Kojima, 1995, SIAM J. Optim..

Multiclass Distance-Weighted Discrimination

Michael J. Todd, James Stephen Marron, Ying Du, 2013 .

Large-scale linear programming: Geometry, working bases and factorizations

Michael J. Todd, M. Todd, 1983, Math. Program..

Eaves’ First Algorithm

Michael J. Todd, 1976 .

A Note on Optimally Dissecting Simplices

Michael J. Todd, Robert C. Acar, M. Todd, 1980, Math. Oper. Res..

An Improved Kalai-Kleitman Bound for the Diameter of a Polyhedron

Michael J. Todd, M. Todd, 2014, SIAM J. Discret. Math..

Least-change quasi-Newton updates for equality-constrained optimization

Michael J. Todd, Michael Wagner, M. Wagner, 2000, Math. Program..

Exploiting structure in piecewise-linear homotopy algorithms for solving equations

Michael J. Todd, M. Todd, 1980, Math. Program..

Augmented Active Surface Model for the Recovery of Small Structures in CT

Michael J. Todd, David S. Taubman, John S. Magnussen, 2013, IEEE Transactions on Image Processing.

Anticipated Behavior of Karmarkar's Algorithm

Michael J. Todd, M. Todd, 1989 .

Infeasible-interior-point methods for linear and convex programming

Michael J. Todd, Reha H. Tütüncü, M. Todd, 1996 .

On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming

Shinji Mizuno, Michael J. Todd, Yinyu Ye, 1993, Math. Oper. Res..

Exploiting special structure in Karmarkar's linear programming algorithm

Michael J. Todd, M. Todd, 1988, Math. Program..

Characterizations, bounds, and probabilistic analysis of two complexity measures for linear programming problems

Michael J. Todd, Levent Tunçel, Yinyu Ye, 2001, Math. Program..

Error Noted in a Paper by Jacobs, Silan, and Clemson

Egon Balas, Michael J. Todd, Eitan Zemel, 1998 .

On the Nesterov-Todd Direction in Semidefinite Programming

Kim-Chuan Toh, Michael J. Todd, Reha H. Tütüncü, 1998, SIAM J. Optim..

A Lower Bound on the Number of Iterations of Primal-Dual Interior-Point Methods for Linear Programming

Michael J. Todd, M. Todd, 1993 .

Analysis of Interior-Point Methods for Linear Programming Problems with Variable Upper Bounds

Michael J. Todd, 1994 .

Orientation in Complementary Pivot Algorithms

Michael J. Todd, M. Todd, 1976, Math. Oper. Res..

The Ellipsoid Method: A Survey

Michael J. Todd, Donald Goldfarb, Robert G. Bland, 1980 .

Potential-reduction methods in mathematical programming

Michael J. Todd, M. Todd, 1997, Math. Program..

On the Interplay among Entropy, Variable Metrics and Potential Functions in Interior-Point Algorithms

Michael J. Todd, Levent Tunçel, M. Todd, 1997, Comput. Optim. Appl..

Solving semidefinite-quadratic-linear programs using SDPT3

Kim-Chuan Toh, Michael J. Todd, Reha H. Tütüncü, 2003, Math. Program..

Asymptotic Behavior of Interior-Point Methods: A View From Semi-Infinite Programming

Michael J. Todd, Levent Tunçel, M. Todd, 1996, Math. Oper. Res..

Modifications and implementation of the ellipsoid algorithm for linear programming

Michael J. Todd, Donald Goldfarb, M. Todd, 1982, Math. Program..

Polynomial expected behavior of a pivoting algorithm for linear complementarity and linear programming problems

Michael J. Todd, M. Todd, 1986, Math. Program..

A modified Frank-Wolfe algorithm for computing minimum-area enclosing ellipsoidal cylinders: Theory and algorithms

Michael J. Todd, Selin Damla Ahipasaoglu, M. Todd, 2013, Comput. Geom..

An extension of Karmarkar's algorithm for linear programming using dual variables

Michael J. Todd, Bruce P. Burrell, M. Todd, 1986, Algorithmica.

Interior-point algorithms for semi-infinite programming

Michael J. Todd, M. Todd, 1994, Math. Program..

Path-Following Methods

Michael J. Todd, Renato D. C. Monteiro, R. Monteiro, 2000 .

Identifying the set of always-active constraints in a system of linear inequalities by a single linear program

Michael J. Todd, Robert M. Freund, Robin. Roundy, 1985 .

Convex Resource Allocation Problems on Directed Acyclic Graphs: Duality, Complexity, Special Cases, and Extensions

Clyde L. Monma, Alexander Schrijver, Michael J. Todd, 1990, Math. Oper. Res..

An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm

Shinji Mizuno, Michael J. Todd, Yinyu Ye, 1994, Math. Oper. Res..

A Low Complexity Interior-Point Algorithm for Linear Programming

Michael J. Todd, 1992, SIAM J. Optim..

Solving LP Problems via Weighted Centers

Michael J. Todd, Aiping Liao, 1996, SIAM J. Optim..

Feature Article - The Ellipsoid Method: A Survey

Michael J. Todd, Donald Goldfarb, Robert G. Bland, 1981, Oper. Res..

A Surface of Analytic Centers and Primal-Dual Infeasible-Interior-Point Algorithms for Linear Programming

Shinji Mizuno, Michael J. Todd, Yinyu Ye, 1995, Math. Oper. Res..

Michael J. Todd, M. Todd, 2016 .

Proportional Response as Iterated Cobb-Douglas

Michael J. Todd, 2010, Equilibrium Computation.

Infeasible-start primal-dual methods and infeasibility detectors for nonlinear programming problems

Michael J. Todd, Yurii Nesterov, Yinyu Ye, 1999, Math. Program..

Minimum volume ellipsoids - theory and algorithms

Michael J. Todd, M. Todd, 2016, MOS-SIAM Series on Optimization.

Chapter 3: Algorithms for the MVEE Problem

Michael J. Todd, M. Todd, 2016 .

Todd's low-complexity algorithm is a predictor-corrector path-following method

Michael J. Todd, J. P. Vial, 1992, Oper. Res. Lett..

A Constructive Proof of Tucker's Combinatorial Lemma

Michael J. Todd, Robert M. Freund, M. Todd, 1981, J. Comb. Theory, Ser. A.

Barrier Functions and Interior-Point Algorithms for Linear Programming with Zero-, One-, or Two-Sided Bounds on the Variables

Michael J. Todd, Robert M. Freund, 1995, Math. Oper. Res..

The Monotonic Bounded Hirsch Conjecture is False for Dimension at Least 4

Michael J. Todd, M. Todd, 1980, Math. Oper. Res..

On two homogeneous self-dual approaches to linear programming and its extensions

Shinji Mizuno, Michael J. Todd, 2001, Math. Program..

On the Riemannian Geometry Defined by Self-Concordant Barriers and Interior-Point Methods

Michael J. Todd, Yurii Nesterov, Y. Nesterov, 2002, Found. Comput. Math..

The symmetric rank-one quasi-Newton method is a space-dilation subgradient algorithm

Michael J. Todd, M. Todd, 1986 .

Optimal Dissection of Simplices

Michael J. Todd, 1978 .

J': A new Triangulation of R^n

Michael J. Todd, M. Todd, 1984 .

Sparse Grids for Higher Dimensional Problems

Endre Süli, Michael J. Todd, Michael Griebel, 2006 .

A variant of Karmarkar's linear programming algorithm for problems with some unrestricted variables

Michael J. Todd, John E. Mitchell, M. Todd, 1989 .

Some algorithms for large-scale linear and convex minimization in relative scale

Michael J. Todd, Peter Richtárik, M. Todd, 2007 .

On Adjusting Parameters in Homotopy Methods for Linear Programming

Michael J. Todd, M. Todd, 1996 .

Two interior-point algorithms for a class of convex programming problems

Michael J. Todd, Stefano Herzel, M. Todd, 1995 .

The affine-scaling direction for linear programming is a limit of projective-scaling directions

Michael J. Todd, M. Todd, 1991 .

Note--Solving the Generalized Market Area Problem

Michael J. Todd, 1978 .

Linear Programming

Michael J. Todd, Donald Goldfarb, 2004 .

A combinatorial generalization of polytopes

Michael J. Todd, M. Todd, 1976 .

On search directions for self-scaled conic programming

Michael J. Todd, Raphael Hauser, M. Todd, 1999 .

Comments on a Note by Aggarwal

Michael J. Todd, M. Todd, 1976 .

Book Review: The basic George B. Dantzig

Michael J. Todd, M. Todd, 2011 .

Quasi-Newton Updates in Abstract Vector Spaces

Michael J. Todd, 1984 .

Foundations of computational mathematics : Santander 2005

Endre Süli, Michael J. Todd, Allan Pinkus, 2006 .

Projected scaled steepest descent in Kojima-Mizuno-Yoshise's potential reduction algorithm for the linear complementarity problem

Michael J. Todd, M. Todd, 1990 .