M. Todd

发表

Improving the convergence of fixed-point algorithms

M. Todd, 1978 .

Exploiting Structure in Fixed-Point Computation.

M. Todd, 1978 .

A variable-dimension simplicial algorithm for antipodal fixed-point theorems

M. Todd, A. Wright, 1980 .

The Computation of Fixed Points and Applications

M. Todd, 1976 .

Union Jack Triangulations

M. Todd, 1977 .

Numerical Stability and Sparsity in Piecewise-Linear Algorithms

M. Todd, 1980 .

Efficient Acceleration Techniques for Fixed Point Algorithms

M. Todd, R. Saigal, 1978 .

Piecewise-Linear Homotopy Algorithms for Sparse Systems of Nonlinear Equations

M. Todd, 1983 .

An introduction to piecewise-linear homotopy algorithms for solving systems of equations

M. Todd, 1982 .

A Centered Projective Algorithm for Linear Programming

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

On the Relationship Between the Search Directions in the Affine and Projective Variants of Karmarkar's Linear Programming Algorithm

M. Todd, J. Mitchell, 1986 .

Potential-reduction methods in mathematical programming

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

A study of search directions in primal-dual interior-point methods for semidefinite programming

M. Todd, 1999 .

Interior-point methods for optimization

A. Nemirovski, M. Todd, 2008, Acta Numerica.

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

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

SDPT3 -- A Matlab Software Package for Semidefinite Programming

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

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

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

Mathematical Developments Arising from Linear Programming

M. Todd, J. Lagarias, 1990 .

Chapter II Linear programming

M. Todd, D. Goldfarb, 1989 .

Containing and shrinking ellipsoids in the path-following algorithm

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

Exploiting special structure in Karmarkar's linear programming algorithm

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

Structured trust region algorithms for the minimization of nonlinear functions

M. Todd, Johara Shahabuddin, 1996 .

The many facets of linear programming

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

Self-Scaled Cones and Interior-Point Methods in Nonlinear Programming

Y. Nesterov, M. Todd, 1994 .

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

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

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

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

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

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

The Effects of Degeneracy and Null and Unbounded Variables on Variants of Karmarkar's Linear Programming Algorithm

M. Todd, 1989 .

A Lower Bound on the Number of Iterations of Long-Step and Polynomial Interior-Point Linear Programming Algorithms

Y. Ye, M. Todd, 1994 .

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

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

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

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

On Convergence Properties of Algorithms for Unconstrained Minimization

M. Todd, 1989 .

On the Nesterov-Todd Direction in Semidefinite Programming

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

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 .

The Ellipsoid Method: A Survey

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

Modifications and Implementation of the Shor-Khachian Algorithm for Linear Programming

M. Todd, D. Goldfarb, 1980 .

Homotopy methods and global convergence

F. J. Gould, M. Todd, B. Eaves, 1983 .

A note on computing equilibria in economies with activity analysis models of production

M. Todd, 1979 .

The Ellipsoid Method Generates Dual Variables

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

An Oblivious Ellipsoid Algorithm for Solving a System of (In)Feasible Linear Inequalities.

M. Todd, R. Freund, Jourdain Lamperski, 2019, 1910.03114.

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

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

Convex Analysis and Nonlinear Optimization: Theory and Examples. Jonathan M. Borwein and Adrian S. Lewis, Springer, New York, 2000

M. Todd, 2003 .

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

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

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

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

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

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

Mathematical programming

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

Anticipated Behavior of Path-Following Algorithms for Linear Programming

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

Reducing horizontal linear complementarity problems

M. Todd, R. Tütüncü, 1995 .

Hamiltonian triangulations of Rn

M. Todd, 1979 .

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

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

Complementarity in Oriented Matroids

M. Todd, 1984 .

Extensions of Lemke's algorithm for the linear complementarity problem

M. Todd, 1976 .

Distance-Weighted Discrimination

J. S. Marron, J. Marron, M. Todd, 2007 .

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

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

Probabilistic Models for Linear Programming

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

Modifications and implementation of the ellipsoid algorithm for linear programming

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

Multiclass Distance-Weighted Discrimination

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

Asymptotic Properties of Distance-Weighted Discrimination

Hao Helen Zhang, J. Marron, Yufeng Liu, 2008 .

Weighted Distance Weighted Discrimination and Its Asymptotic Properties

Hao Helen Zhang, J. Marron, Yufeng Liu, 2010, Journal of the American Statistical Association.

Optimal conditioning and convergence in rank one quasi-Newton updates

M. Todd, C. Ip, 1988 .

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

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

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

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

Linear and quadratic programming in oriented matroids

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

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

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

Solving semidefinite-quadratic-linear programs using SDPT3

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

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

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

New results on the average behavior of simplex algorithms

N. Megiddo, M. Todd, I. Adler, 1984 .

Wing Design via Numerical Optimization

M. Todd, 2015 .

On Adjusting Parameters in HomotopyMethods for Linear Programming

M. Todd, A. Iserles, M. Buhmann, 1997 .

Detecting Infeasibility in Infeasible-Interior-Point Methods for Optimization

M. Todd, 2003 .

Semidefinite optimization

M. Todd, 2001, Acta Numerica.

Inexact primal-dual path-following algorithms for a special class of convex quadratic SDP and related problems

M. Todd, K. Toh, R. Tütüncü, 2005 .

On search directions for self-scaled conic programming

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

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

Michael J. Todd, M. Todd, 1991 .

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 .

Multiclass Distance Weighted Discrimination with Applications to Batch Adjustment

J. Marron, Yufeng Liu, M. Todd, 2010 .

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

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

2 Smoothing using randomization

M. Todd, 2016 .

Linear Programming with Relative Bounded Variables

M. Todd, H. M. Wagner, C. Duguay, 1973, Management Science.

Computing Fixed Points, with Applications to Economic Equilibrium Models

M. Todd, 1983 .

Foundations of Computational Mathematics, Hong Kong 2008: Preface

Felipe Cucker, Allan Pinkus, Michael J. Todd, 2009 .

The Ellipsoid Method: A Survey

M. Todd, D. Goldfarb, R. Bland, 1980 .

Message from the Editor

M. Todd, M. Anjos, 2008, Cerebrovascular Diseases.

Bimatrix games—an addendum

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

Modifying the forrest-Tomlin and saunders updates for linear programming problems with variable upper bounds

M. Todd, 1986 .

Recent Developments and New Directions in Linear Programming

M. Todd, M. Todd, M. Todd, 1988 .

PRIMAL-DUAL PATH-FOLLOWING ALGORITHMS FOR A SPECIAL CLASS OF CONVEX QUADRATIC SDP AND RELATED PROBLEMS

M. Todd, K. Toh, R. Tütüncü, 2005 .

Topics in infeasible-interior-point methods

M. Todd, B. Rangarajan, 2004 .

Some Properties of the Global Behaviour of Conservative Low-Dimensional Systems

A. Pinkus, M. Todd, F. Cucker, 2009 .

On max-k-sums

M. Todd, 2017, Mathematical Programming.

ON THE C OMPUTATIONAL C OMPLEXITY OF PIECEWISE- LINEAR H OMOTOPY A LGORITHMS*

M. Todd, 1982 .

Infeasible-interior-point methods for linear and convex programming

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

Minimum volume ellipsoids - theory and algorithms

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

Chapter 5: Algorithms for the MAEC Problem

Michael J. Todd, M. Todd, 2016 .

Sparse Grids for Higher Dimensional Problems

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

Anticipated Behavior of Karmarkar's Algorithm

Michael J. Todd, M. Todd, 1989 .

On Adjusting Parameters in Homotopy Methods for Linear Programming

Michael J. Todd, M. Todd, 1996 .

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

Michael J. Todd, M. Todd, 1993 .

From the editor

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

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

Michael J. Todd, M. Todd, 1990 .

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 .

Comments on a Note by Aggarwal

Michael J. Todd, M. Todd, 1976 .

Solving the generalized market area problem

Michael J. Todd, M. Todd, 1978 .

Michael J. Todd, M. Todd, 2016 .

Chapter 3: Algorithms for the MVEE Problem

Michael J. Todd, M. Todd, 2016 .

ALGORITHM F OR L INEAR C OMPLEMENTARITY A ND LINEAR P ROGRAMMING P ROBLEMS

M. Todd, 1986 .

Book Review: The basic George B. Dantzig

Michael J. Todd, M. Todd, 2011 .

The ellipsoid method redux

M. Todd, 2023, 2301.07632.

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..

Solving ellipsoidal inclusion and optimal experimental design problems: theory and algorithms

Selin Damla Ahipasaoglu, M. Todd, Michael Jeremy Todd, 2009 .

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..

Editorial

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

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

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

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

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

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

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

Feature Article - The Ellipsoid Method: A Survey

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

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

Michael J. Todd, M. Todd, 1986 .

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

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

Exploiting structure in piecewise-linear homotopy algorithms for solving equations

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

The ellipsoid algorithm using parallel cuts

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

On triangulations for computing fixed points

Michael J. Todd, M. Todd, 1976, 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..

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

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

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..

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..

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

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

Solving combinatorial optimization problems using Karmarkar's algorithm

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

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..

Interior-point algorithms for semi-infinite programming

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

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 .

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

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

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..

Two new proofs of Afriat’s theorem

M. J. Todd, M. Todd, H. Scarf, 2003 .

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

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

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

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

Scaling, shifting and weighting in interior-point methods

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

A generalized complementary pivoting algorithm

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

A Constructive Proof of Tucker's Combinatorial Lemma

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

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

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

On the implementation of SDPT3 (version 3.1) - a MATLAB software package for semidefinite-quadratic-linear programming

K.C. Toh, R.H. Tutuncu, M.J. Todd, 2004, 2004 IEEE International Conference on Robotics and Automation (IEEE Cat. No.04CH37508).

J': A new Triangulation of R^n

Michael J. Todd, M. Todd, 1984 .

A Note on Optimally Dissecting Simplices

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

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

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

Largest dual ellipsoids inscribed in dual cones

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

Foundations of Computational Mathematics, Santander 2005 (London Mathematical Society Lecture Note Series)

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

Polynomial Algorithms for Linear Programming

Michael J. Todd, M. Todd, 1988 .

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 .

Path-Following Methods

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

Computing a Cournot Equilibrium in Integers

M. Todd, 2013 .

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

Y. Ye, M. Todd, 1998, Math. Program..

A Centered Projective Algorithm for Linear Programming

Y. Ye, M. Todd, 1990, Math. Oper. Res..

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

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

Symmetry and Positive Definiteness in Oriented Matroids

Michael J. Todd, Walter D. Morris, M. Todd, 1988, Eur. J. Comb..

On max-k-sums

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

Mathematical programming

M. Todd, 1997 .

Characterizing binary simplical matroids

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

A combinatorial generalization of polytopes

Michael J. Todd, M. Todd, 1976 .

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..

Containing and shrinking ellipsoids in the path-following algorithm

Y. Ye, M. Todd, 1990, Math. Program..

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

Michael J. Todd, M. Todd, 2007, 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..

Probabilistic analysis of two complexity measures for linear programming problems

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

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

M. Todd, S. Ahipaşaoğlu, Peng Sun, 2008, Optim. Methods Softw..