Todd Michael J.

Michael J. Todd

Information about the author Michael J. Todd will soon be added to the site.
Found 21 papers in total
Another derivation of the Karmarkar direction for linear programming
Another derivation of the Karmarkar direction for linear programming
2005
This paper provides another derivation of the Karmarkar direction for linear...
Barrier functions and interior-point algorithms for linear programming with zero-, one-, or two-sided bounds on the variables
Barrier functions and interior-point algorithms for linear programming with zero-, one-, or two-sided bounds on the variables
1995
This study examines two different barrier functions and their use in both...
Approximate Farkas lemmas and stopping rules for iterative infeasible-point algorithms for linear programming
Approximate Farkas lemmas and stopping rules for iterative infeasible-point algorithms for linear programming
1998
In exact arithmetic, the simplex method applied to a particular linear programming...
On the interplay among entropy, variable metrics and potential functions in interior-point algorithms
On the interplay among entropy, variable metrics and potential functions in interior-point algorithms
1997
We are motivated by the problem of constructing a primal–dual barrier function...
Potential-reduction methods in mathematical programming
Potential-reduction methods in mathematical programming
1997
We provide a survey of interior-point methods for linear programming and its...
A lower bound on the number of iterations of long-step primal-dual linear programming algorithms
A lower bound on the number of iterations of long-step primal-dual linear programming algorithms
1996
Recently, Todd has analyzed in detail the primal-dual affine-scaling method for linear...
Interior-point algorithms for semi-infinite programming
Interior-point algorithms for semi-infinite programming
1994
In order to study the behavior of interior-point methods on very large-scale linear...
Scaling, shifting and weighting in interior-point methods
Scaling, shifting and weighting in interior-point methods
1994
The paper examines certain questions related to the choice of scaling, shifting and...
On the complexity of approximating the maximal inscribed ellipsoid for a polytope
On the complexity of approximating the maximal inscribed ellipsoid for a polytope
1993
The authors give a new polynomial bound on the complexity of approximating the maximal...
Combining phase I and phase II in a potential reduction algorithm for linear programming
Combining phase I and phase II in a potential reduction algorithm for linear programming
1993
This paper describes an affine potential reduction algorithm for linear programming...
An
An
1994
The authors present an -iteration homogeneous and self-dual linear programming (LP)...
On adaptive-step primal-dual interior-point algorithms for linear programming
On adaptive-step primal-dual interior-point algorithms for linear programming
1993
The authors describe several adaptive-step primal-dual interior point algorithms for...
A new triangulation for simplicial algorithms
A new triangulation for simplicial algorithms
1993
Triangulations are used in simplicial algorithms to find the fixed points of...
Solving combinatorial optimization problems using Karmarkar’s algorithm
Solving combinatorial optimization problems using Karmarkar’s algorithm
1992
The authors describe a cutting plane algorithm for solving combinatorial optimization...
On Anstreicher’s combined phase I-phase II projective algorithm for linear programming
On Anstreicher’s combined phase I-phase II projective algorithm for linear programming
1992
Anstreicher has proposed a variant of Karmarkar’s projective algorithm that...
Probabilistic models for linear programming
Probabilistic models for linear programming
1991
The paper proposes and investigates new probabilistic models for linear programming....
A Dantzig-Wolfe-like variant of Karmarkar’s interior-point linear programming algorithm
A Dantzig-Wolfe-like variant of Karmarkar’s interior-point linear programming algorithm
1990
The paper shows that a variant of Karmarkar’s projective algorithm for linear...
Containing and shrinking ellipsoids in the path-following algorithm
Containing and shrinking ellipsoids in the path-following algorithm
1990
The authors describe a new potential function and a sequence of ellipsoids in the...
Convex resource allocation problems on directed acyclic graphs: Duality, complexity, special cases, and extensions
Convex resource allocation problems on directed acyclic graphs: Duality, complexity, special cases, and extensions
1990
Consider the following resource allocation problem on a directed acyclic graph (the...
A centered projective algorithm for linear programming
A centered projective algorithm for linear programming
1990
The authors describe a projective algorithm for linear programming that shares...
Improved bounds and containing ellipsoids in Karmarkar’s linear programming algorithm
Improved bounds and containing ellipsoids in Karmarkar’s linear programming algorithm
1988
Karmarkar’s projective algorithm for linear programming provides not only primal...
Papers per page: