The following pages link to Michael J. Todd (Q173843):
Displaying 50 items.
- Distance-Weighted Discrimination (Q146793) (← links)
- Solving semidefinite-quadratic-linear programs using SDPT3 (Q146795) (← links)
- A robust robust optimization result (Q433824) (← links)
- Linear quadratic programming in oriented matroids (Q760437) (← links)
- The affine-scaling direction for linear programming is a limit of projective-scaling directions (Q806963) (← links)
- (Q959980) (redirect page) (← links)
- Largest dual ellipsoids inscribed in dual cones (Q959981) (← links)
- The symmetric rank-one quasi-Newton method is a space-dilation subgradient algorithm (Q1083371) (← links)
- An extension of Karmarkar's algorithm for linear programming using dual variables (Q1090601) (← links)
- Symmetry and positive definiteness in oriented matroids (Q1105613) (← links)
- Exploiting special structure in Karmarkar's linear programming algorithm (Q1106098) (← links)
- A note on computing equilibria in economies with activity analysis models of production (Q1138982) (← links)
- A constructive proof of Tucker's combinatorial lemma (Q1153158) (← links)
- An \(O(n^ 3L)\) adaptive path following algorithm for a linear complementarity problem (Q1181916) (← links)
- On Anstreicher's combined phase I-phase II projective algorithm for linear programming (Q1194852) (← links)
- Solving combinatorial optimization problems using Karmarkar's algorithm (Q1196181) (← links)
- Todd's low-complexity algorithm is a predictor-corrector path-following method (Q1197903) (← links)
- On combined phase 1-phase 2 projective methods for linear programming (Q1207329) (← links)
- A combinatorial generalization of polytopes (Q1212941) (← links)
- Extensions of Lemke's algorithm for the linear complementarity problem (Q1226441) (← links)
- The computation of fixed points and applications (Q1228114) (← links)
- Characterizing binary simplicial matroids (Q1229875) (← links)
- Approximate Farkas lemmas and stopping rules for iterative infeasible-point algorithms for linear programming (Q1290596) (← links)
- On the complexity of approximating the maximal inscribed ellipsoid for a polytope (Q1315411) (← links)
- The ellipsoid algorithm using parallel cuts (Q1315450) (← links)
- Interior-point algorithms for semi-infinite programming (Q1334960) (← links)
- Scaling, shifting and weighting in interior-point methods (Q1342881) (← links)
- On the interplay among entropy, variable metrics and potential functions in interior-point algorithms (Q1360218) (← links)
- Potential-reduction methods in mathematical programming (Q1361104) (← links)
- Infeasible-start primal-dual methods and infeasibility detectors for nonlinear programming problems (Q1572675) (← links)
- Two new proofs of Afriat's theorem (Q1762746) (← links)
- On max-\(k\)-sums (Q1785208) (← links)
- Containing and shrinking ellipsoids in the path-following algorithm (Q1813834) (← links)
- The many facets of linear programming (Q1849524) (← links)
- On the Riemannian geometry defined by self-concordant barriers and interior-point methods. (Q1865823) (← links)
- Reducing horizontal linear complementarity problems (Q1894520) (← links)
- A lower bound on the number of iterations of long-step primal-dual linear programming algorithms (Q1915913) (← links)
- A modified Frank--Wolfe algorithm for computing minimum-area enclosing ellipsoidal cylinders: theory and algorithms (Q1941215) (← links)
- Combining phase I and phase II in a potential reduction algorithm for linear programming (Q2368075) (← links)
- On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids (Q2381536) (← links)
- Dual versus primal-dual interior-point methods for linear and conic programming (Q2467157) (← links)
- Erratum: Probabilistic models for linear programming (Q2757565) (← links)
- An interior-point approach to sensitivity analysis in degenerate linear programs (Q2784431) (← links)
- On the Implementation and Usage of SDPT3 – A Matlab Software Package for Semidefinite-Quadratic-Linear Programming, Version 4.0 (Q2802544) (← links)
- Minimum-volume ellipsoids. Theory and algorithms (Q2825979) (← links)
- Computation, Multiplicity, and Comparative Statics of Cournot Equilibria in Integers (Q3186547) (← links)
- A Centered Projective Algorithm for Linear Programming (Q3211107) (← links)
- Complementarity in Oriented Matroids (Q3220600) (← links)
- $J'$: A New Triangulation of $R^n $ (Q3330396) (← links)
- (Q3331881) (← links)
