The following pages link to Michael J. Todd (Q173843):
Displaying 38 items.
- An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm (Q4294729) (← links)
- Monotonicity of Primal and Dual Objective Values in Primal-dual Interior-point Algorithms (Q4308558) (← links)
- (Q4308907) (← links)
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming (Q4339371) (← links)
- Primal-Dual Interior-Point Methods for Self-Scaled Cones (Q4389195) (← links)
- (Q4401029) (← links)
- (Q4421362) (← links)
- A study of search directions in primal-dual interior-point methods for semidefinite programming (Q4504774) (← links)
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3 (Q4504792) (← links)
- (Q4517105) (← links)
- Solving LP Problems via Weighted Centers (Q4717550) (← links)
- Polynomial expected behavior of a pivoting algorithm for linear complementarity and linear programming problems (Q4721880) (← links)
- (Q4733658) (← links)
- On Minimum Volume Ellipsoids Containing Part of a Given Ellipsoid (Q4739662) (← links)
- Approximate Labelling for Simplicial Algorithms and Two Classes of Special Subsets of the Sphere (Q4739682) (← links)
- Piecewise-Linear Homotopy Algorithms for Sparse Systems of Nonlinear Equations (Q4746732) (← links)
- On the computational complexity of piecewise-linear homotopy algorithms (Q4749612) (← links)
- Infeasible-Interior-Point Primal-Dual Potential-Reduction Algorithms for Linear Programming (Q4764308) (← links)
- A generalized complementary pivoting algorithm (Q4772970) (← links)
- A Surface of Analytic Centers and Primal-Dual Infeasible-Interior-Point Algorithms for Linear Programming (Q4835390) (← links)
- Barrier Functions and Interior-Point Algorithms for Linear Programming with Zero-, One-, or Two-Sided Bounds on the Variables (Q4848422) (← links)
- Asymptotic Behavior of Interior-Point Methods: A View From Semi-Infinite Programming (Q4895563) (← links)
- A Dantzig-Wolfe-Like Variant of Karmarkar's Interior-Point Linear Programming Algorithm (Q5202502) (← links)
- (Q5202835) (← links)
- An Improved Kalai--Kleitman Bound for the Diameter of a Polyhedron (Q5246095) (← links)
- Weighted Distance Weighted Discrimination and Its Asymptotic Properties (Q5254964) (← links)
- A New Triangulation for Simplicial Algorithms (Q5285945) (← links)
- Augmented Active Surface Model for the Recovery of Small Structures in CT (Q5373573) (← links)
- (Q5442492) (← links)
- Linear convergence of a modified Frank–Wolfe algorithm for computing minimum-volume enclosing ellipsoids (Q5459815) (← links)
- (Q5482452) (← links)
- Book Review: The basic George B. Dantzig (Q5494765) (← links)
- (Q5672441) (← links)
- Convex Resource Allocation Problems on Directed Acyclic Graphs: Duality, Complexity, Special Cases, and Extensions (Q5749161) (← links)
- Characterizations, bounds, and probabilistic analysis of two complexity measures for linear programming problems (Q5930724) (← links)
- On two homogeneous self-dual approaches to linear programming and its extensions. (Q5930742) (← links)
- Sensitivity analysis in linear programming and semidefinite programming using interior-point methods (Q5935708) (← links)
- An Oblivious Ellipsoid Algorithm for Solving a System of (In)Feasible Linear Inequalities (Q6189902) (← links)
