Michael J. Todd
Affiliations: Cornell University, Ithaca, NY, USA
According to our database^{1},
Michael J. Todd
authored at least 89 papers
between 1974 and 2018.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Online presence:

on zbmath.org

on orcid.org
On csauthors.net:
Bibliography
2018
Math. Program., 2018
2016
Computation, Multiplicity, and Comparative Statics of Cournot Equilibria in Integers.
Math. Oper. Res., 2016
Minimum volume ellipsoids  theory and algorithms.
MOSSIAM Series on Optimization 23, SIAM, ISBN: 9781611974379, 2016
2014
SIAM J. Discret. Math., 2014
2013
IEEE Trans. Image Process., 2013
A modified FrankWolfe algorithm for computing minimumarea enclosing ellipsoidal cylinders: Theory and algorithms.
Comput. Geom., 2013
2012
Oper. Res. Lett., 2012
2010
Proceedings of the Equilibrium Computation, 25.04.  30.04.2010, 2010
2009
Math. Program., 2009
2008
Linear convergence of a modified FrankWolfe algorithm for computing minimumvolume enclosing ellipsoids.
Optim. Methods Softw., 2008
Math. Program., 2008
Proceedings of the International Conference on Image Processing, 2008
2007
On Khachiyan's algorithm for the computation of minimumvolume enclosing ellipsoids.
Discret. Appl. Math., 2007
2004
Proceedings of the Handbook of Discrete and Computational Geometry, Second Edition., 2004
2003
Math. Program., 2003
Found. Comput. Math., 2003
2002
SIAM J. Optim., 2002
Math. Program., 2002
On the Riemannian Geometry Defined by SelfConcordant Barriers and InteriorPoint Methods.
Found. Comput. Math., 2002
2001
Sensitivity analysis in linear programming and semidefinite programming using interiorpoint methods.
Math. Program., 2001
Characterizations, bounds, and probabilistic analysis of two complexity measures for linear programming problems.
Math. Program., 2001
Math. Program., 2001
2000
Math. Program., 2000
1999
Infeasiblestart primaldual methods and infeasibility detectors for nonlinear programming problems.
Math. Program., 1999
1998
SIAM J. Optim., 1998
SIAM J. Optim., 1998
Approximate Farkas lemmas and stopping rules for iterative infeasiblepoint algorithms for linear programming.
Math. Program., 1998
Math. Oper. Res., 1998
1997
Math. Oper. Res., 1997
On the Interplay among Entropy, Variable Metrics and Potential Functions in InteriorPoint Algorithms.
Comput. Optim. Appl., 1997
1996
SIAM J. Optim., 1996
Math. Program., 1996
Asymptotic Behavior of InteriorPoint Methods: A View From SemiInfinite Programming.
Math. Oper. Res., 1996
A lower bound on the number of iterations of longstep primaldual linear programming algorithms.
Ann. Oper. Res., 1996
1995
InfeasibleInteriorPoint PrimalDual PotentialReduction Algorithms for Linear Programming.
SIAM J. Optim., 1995
A Surface of Analytic Centers and PrimalDual InfeasibleInteriorPoint Algorithms for Linear Programming.
Math. Oper. Res., 1995
Barrier Functions and InteriorPoint Algorithms for Linear Programming with Zero, One, or TwoSided Bounds on the Variables.
Math. Oper. Res., 1995
1994
Monotonicity of Primal and Dual Objective Values in Primaldual Interiorpoint Algorithms.
SIAM J. Optim., 1994
Math. Program., 1994
Math. Oper. Res., 1994
INFORMS J. Comput., 1994
Comput. Optim. Appl., 1994
1993
SIAM J. Discret. Math., 1993
Combining phase I and phase II in a potential reduction algorithm for linear programming.
Math. Program., 1993
On the complexity of approximating the maximal inscribed ellipsoid for a polytope.
Math. Program., 1993
Math. Oper. Res., 1993
Comput. Optim. Appl., 1993
Algorithmica, 1993
1992
SIAM J. Optim., 1992
An (O√(n) L)Iteration LargeStep PrimalDual Affine Algorithm for Linear Programming.
SIAM J. Optim., 1992
On Anstreicher's combined phase Iphase II projective algorithm for linear programming.
Math. Program., 1992
Math. Program., 1992
1991
An O(n<sup>3</sup>L) adaptive path following algorithm for a linear complementarity problem.
Math. Program., 1991
Math. Oper. Res., 1991
1990
Math. Program., 1990
Math. Oper. Res., 1990
Convex Resource Allocation Problems on Directed Acyclic Graphs: Duality, Complexity, Special Cases, and Extensions.
Math. Oper. Res., 1990
A DantzigWolfeLike Variant of Karmarkar's InteriorPoint Linear Programming Algorithm.
Oper. Res., 1990
1988
Math. Program., 1988
Improved Bounds and Containing Ellipsoids in Karmarkar's Linear Programming Algorithm.
Math. Oper. Res., 1988
Eur. J. Comb., 1988
1986
Polynomial expected behavior of a pivoting algorithm for linear complementarity and linear programming problems.
Math. Program., 1986
Math. Program., 1986
An Extension of Karmarkar's Algorithm for Linear Programming Using Dual Variables.
Algorithmica, 1986
1985
Math. Program., 1985
Math. Oper. Res., 1985
J. Comb. Theory, Ser. B, 1985
1983
Math. Program., 1983
An efficient simplicial algorithm for computing a zero of a convex union of smooth functions.
Math. Program., 1983
1982
Math. Program., 1982
An implementation of the simplex method for linear programming problems with variable upper bounds.
Math. Program., 1982
Modifications and implementation of the ellipsoid algorithm for linear programming.
Math. Program., 1982
Math. Oper. Res., 1982
1981
Approximate Labelling for Simplicial Algorithms and Two Classes of Special Subsets of the Sphere.
Math. Oper. Res., 1981
J. Comb. Theory, Ser. A, 1981
Oper. Res., 1981
1980
Exploiting structure in piecewiselinear homotopy algorithms for solving equations.
Math. Program., 1980
A quadraticallyconvergent fixedpoint algorithm for economic equilibria and linearly constrained optimization.
Math. Program., 1980
Math. Oper. Res., 1980
Math. Oper. Res., 1980
Traversing Large Pieces of Linearity in Algorithms that Solve Equations by Following PiecewiseLinear Paths.
Math. Oper. Res., 1980
Determining Optimal Use of Resources among Regional Producers under Differing Levels of Cooperation.
Oper. Res., 1980
1979
Math. Program., 1979
1978
Math. Program., 1978
Math. Oper. Res., 1978
1976
Math. Program., 1976
Math. Oper. Res., 1976
Discret. Math., 1976
1974
Math. Program., 1974