Michael J. Todd

According to our database1, Michael J. Todd authored at least 89 papers between 1974 and 2018.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2018
On max-k-sums.
Math. Program., 2018

2016
Computation, Multiplicity, and Comparative Statics of Cournot Equilibria in Integers.
Math. Oper. Res., 2016

Minimum volume ellipsoids - theory and algorithms.
MOS-SIAM Series on Optimization 23, SIAM, ISBN: 978-1-611-97437-9, 2016

2014
An Improved Kalai-Kleitman Bound for the Diameter of a Polyhedron.
SIAM J. Discret. Math., 2014

2013
Augmented Active Surface Model for the Recovery of Small Structures in CT.
IEEE Trans. Image Process., 2013

A modified Frank-Wolfe algorithm for computing minimum-area enclosing ellipsoidal cylinders: Theory and algorithms.
Comput. Geom., 2013

2012
A robust robust optimization result.
Oper. Res. Lett., 2012

2010
Proportional Response as Iterated Cobb-Douglas.
Proceedings of the Equilibrium Computation, 25.04. - 30.04.2010, 2010

2009
Largest dual ellipsoids inscribed in dual cones.
Math. Program., 2009

2008
Linear convergence of a modified Frank-Wolfe algorithm for computing minimum-volume enclosing ellipsoids.
Optimization Methods and Software, 2008

Dual versus primal-dual interior-point methods for linear and conic programming.
Math. Program., 2008

Active surface modeling at CT resolution limits with micro CT ground truth.
Proceedings of the International Conference on Image Processing, 2008

2007
On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids.
Discret. Appl. Math., 2007

2004
Mathematical programming.
Proceedings of the Handbook of Discrete and Computational Geometry, Second Edition., 2004

2003
Solving semidefinite-quadratic-linear programs using SDPT3.
Math. Program., 2003

Editorial.
Found. Comput. Math., 2003

2002
An Interior-Point Approach to Sensitivity Analysis in Degenerate Linear Programs.
SIAM J. Optim., 2002

The many facets of linear programming.
Math. Program., 2002

On the Riemannian Geometry Defined by Self-Concordant Barriers and Interior-Point Methods.
Found. Comput. Math., 2002

2001
Sensitivity analysis in linear programming and semidefinite programming using interior-point methods.
Math. Program., 2001

Characterizations, bounds, and probabilistic analysis of two complexity measures for linear programming problems.
Math. Program., 2001

On two homogeneous self-dual approaches to linear programming and its extensions.
Math. Program., 2001

2000
Least-change quasi-Newton updates for equality-constrained optimization.
Math. Program., 2000

1999
Infeasible-start primal-dual methods and infeasibility detectors for nonlinear programming problems.
Math. Program., 1999

1998
On the Nesterov-Todd Direction in Semidefinite Programming.
SIAM J. Optim., 1998

Primal-Dual Interior-Point Methods for Self-Scaled Cones.
SIAM J. Optim., 1998

Approximate Farkas lemmas and stopping rules for iterative infeasible-point algorithms for linear programming.
Math. Program., 1998

Erratum: Probabilistic Models for Linear Programming.
Math. Oper. Res., 1998

1997
Self-Scaled Barriers and Interior-Point Methods for Convex Programming.
Math. Oper. Res., 1997

On the Interplay among Entropy, Variable Metrics and Potential Functions in Interior-Point Algorithms.
Comput. Optim. Appl., 1997

1996
Solving LP Problems via Weighted Centers.
SIAM J. Optim., 1996

Potential-reduction methods in mathematical programming.
Math. Program., 1996

Asymptotic Behavior of Interior-Point Methods: A View From Semi-Infinite Programming.
Math. Oper. Res., 1996

A lower bound on the number of iterations of long-step primal-dual linear programming algorithms.
Annals OR, 1996

1995
Infeasible-Interior-Point Primal-Dual Potential-Reduction Algorithms for Linear Programming.
SIAM J. Optim., 1995

A Surface of Analytic Centers and Primal-Dual Infeasible-Interior-Point Algorithms for Linear Programming.
Math. Oper. Res., 1995

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

1994
Monotonicity of Primal and Dual Objective Values in Primal-dual Interior-point Algorithms.
SIAM J. Optim., 1994

Interior-point algorithms for semi-infinite programming.
Math. Program., 1994

An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm.
Math. Oper. Res., 1994

Commentary - Theory and Practice for Interior-Point Methods.
INFORMS J. Comput., 1994

Scaling, shifting and weighting in interior-point methods.
Comput. Optim. Appl., 1994

1993
A New Triangulation for Simplicial Algorithms.
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

On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming.
Math. Oper. Res., 1993

The ellipsoid algorithm using parallel cuts.
Comput. Optim. Appl., 1993

On Combined Phase 1-Phase 2 Projective Methods for Linear Programming.
Algorithmica, 1993

1992
A Low Complexity Interior-Point Algorithm for Linear Programming.
SIAM J. Optim., 1992

An (O√(n) L)-Iteration Large-Step Primal-Dual Affine Algorithm for Linear Programming.
SIAM J. Optim., 1992

On Anstreicher's combined phase I-phase II projective algorithm for linear programming.
Math. Program., 1992

Solving combinatorial optimization problems using Karmarkar's algorithm.
Math. Program., 1992

1991
An O(n<sup>3</sup>L) adaptive path following algorithm for a linear complementarity problem.
Math. Program., 1991

Probabilistic Models for Linear Programming.
Math. Oper. Res., 1991

1990
Containing and Shrinking Ellipsoids in the Path-Following Algorithm.
Math. Program., 1990

A Centered Projective Algorithm for Linear Programming.
Math. Oper. Res., 1990

Convex Resource Allocation Problems on Directed Acyclic Graphs: Duality, Complexity, Special Cases, and Extensions.
Math. Oper. Res., 1990

A Dantzig-Wolfe-Like Variant of Karmarkar's Interior-Point Linear Programming Algorithm.
Oper. Res., 1990

1988
Exploiting special structure in Karmarkar's linear programming algorithm.
Math. Program., 1988

Improved Bounds and Containing Ellipsoids in Karmarkar's Linear Programming Algorithm.
Math. Oper. Res., 1988

Symmetry and Positive Definiteness in Oriented Matroids.
Eur. J. Comb., 1988

1986
Polynomial expected behavior of a pivoting algorithm for linear complementarity and linear programming problems.
Math. Program., 1986

From the editor.
Math. Program., 1986

An Extension of Karmarkar's Algorithm for Linear Programming Using Dual Variables.
Algorithmica, 1986

1985
'Fat' triangulations, or solving certain nonconvex matrix optimization problems.
Math. Program., 1985

The Ellipsoid Method Generates Dual Variables.
Math. Oper. Res., 1985

Linear and quadratic programming in oriented matroids.
J. Comb. Theory, Ser. B, 1985

1983
Large-scale linear programming: Geometry, working bases and factorizations.
Math. Program., 1983

An efficient simplicial algorithm for computing a zero of a convex union of smooth functions.
Math. Program., 1983

1982
On the computational complexity of piecewise-linear homotopy algorithms.
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

On Minimum Volume Ellipsoids Containing Part of a Given Ellipsoid.
Math. Oper. Res., 1982

1981
Approximate Labelling for Simplicial Algorithms and Two Classes of Special Subsets of the Sphere.
Math. Oper. Res., 1981

A Constructive Proof of Tucker's Combinatorial Lemma.
J. Comb. Theory, Ser. A, 1981

Feature Article - The Ellipsoid Method: A Survey.
Oper. Res., 1981

1980
Exploiting structure in piecewise-linear homotopy algorithms for solving equations.
Math. Program., 1980

A quadratically-convergent fixed-point algorithm for economic equilibria and linearly constrained optimization.
Math. Program., 1980

A Note on Optimally Dissecting Simplices.
Math. Oper. Res., 1980

The Monotonic Bounded Hirsch Conjecture is False for Dimension at Least 4.
Math. Oper. Res., 1980

Traversing Large Pieces of Linearity in Algorithms that Solve Equations by Following Piecewise-Linear Paths.
Math. Oper. Res., 1980

Determining Optimal Use of Resources among Regional Producers under Differing Levels of Cooperation.
Oper. Res., 1980

1979
Piecewise linear paths to minimize convex functions may not be monotonic.
Math. Program., 1979

1978
Bimatrix games - an addendum.
Math. Program., 1978

On the Jacobian of a Function at a Zero Computed by a Fixed Point Algorithm.
Math. Oper. Res., 1978

1976
On triangulations for computing fixed points.
Math. Program., 1976

Orientation in Complementary Pivot Algorithms.
Math. Oper. Res., 1976

Characterizing binary simplical matroids.
Discret. Math., 1976

1974
A generalized complementary pivoting algorithm.
Math. Program., 1974


  Loading...