The following pages link to Michael J. Todd (Q173843):
Displaying 50 items.
- New results on the average behavior of simplex algorithms (Q3337215) (← links)
- (Q3348698) (← links)
- Semidefinite optimization (Q3413756) (← links)
- (Q3470215) (← links)
- (Q3570229) (← links)
- Interior-point methods for optimization (Q3612043) (← links)
- (Q3662938) (← links)
- Large-scale linear programming: Geometry, working bases and factorizations (Q3664825) (← links)
- Quasi-Newton Updates in Abstract Vector Spaces (Q3692718) (← links)
- The Ellipsoid Method Generates Dual Variables (Q3705220) (← links)
- (Q3710314) (← links)
- ‘Fat’ triangulations, or solving certain nonconvex matrix optimization problems (Q3716828) (← links)
- Optimal Conditioning and Convergence in Rank One Quasi-Newton Updates (Q3779670) (← links)
- (Q3796957) (← links)
- Improved Bounds and Containing Ellipsoids in Karmarkar's Linear Programming Algorithm (Q3818123) (← links)
- A Variant of Karmarkar’s Linear Programming Algorithm for Problems with Some Unrestricted Variables (Q3819909) (← links)
- (Q3859595) (← links)
- A quadratically-convergent fixed-point algorithm for economic equilibria and linearly constrained optimization (Q3867585) (← links)
- (Q3868472) (← links)
- Exploiting structure in piecewise-linear homotopy algorithms for solving equations (Q3872237) (← links)
- A Note on Optimally Dissecting Simplices (Q3873199) (← links)
- Determining Optimal Use of Resources among Regional Producers under Differing Levels of Cooperation (Q3883845) (← links)
- Traversing Large Pieces of Linearity in Algorithms that Solve Equations by Following Piecewise-Linear Paths (Q3883944) (← links)
- (Q3896415) (← links)
- A variable-dimension simplicial algorithm for antipodal fixed-point theorems (Q3906317) (← links)
- The Monotonic Bounded Hirsch Conjecture is False for Dimension at Least 4 (Q3906725) (← links)
- Orientation in Complementary Pivot Algorithms (Q3907429) (← links)
- Feature Article—The Ellipsoid Method: A Survey (Q3929391) (← links)
- (Q3930547) (← links)
- Modifications and implementation of the ellipsoid algorithm for linear programming (Q3934131) (← links)
- An implementation of the simplex method for linear programming problems with variable upper bounds (Q3934132) (← links)
- Note—Solving the Generalized Market Area Problem (Q3955143) (← links)
- An efficient simplicial algorithm for computing a zero of a convex union of smooth functions (Q3956756) (← links)
- (Q3959350) (← links)
- Probabilistic Models for Linear Programming (Q3989814) (← links)
- A Low Complexity Interior-Point Algorithm for Linear Programming (Q4018391) (← links)
- An $O(\sqrt{n} L)$-Iteration Large-Step Primal-Dual Affine Algorithm for Linear Programming (Q4018832) (← links)
- On triangulations for computing fixed points (Q4083225) (← links)
- On triangulations for computing fixed points (Q4132260) (← links)
- Bimatrix games—an addendum (Q4158857) (← links)
- Optimal Dissection of Simplices (Q4164503) (← links)
- On the Jacobian of a Function at a Zero Computed by a Fixed Point Algorithm (Q4167479) (← links)
- Efficient Acceleration Techniques for Fixed Point Algorithms (Q4179756) (← links)
- Improving the convergence of fixed-point algorithms (Q4184197) (← links)
- Piecewise linear paths to minimize convex functions may not be monotonic (Q4196252) (← links)
- On Convergence Properties of Algorithms for Unconstrained Minimization (Q4205014) (← links)
- On the Nesterov--Todd Direction in Semidefinite Programming (Q4210331) (← links)
- On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming (Q4286944) (← links)
- (Q4288560) (← links)
- Commentary—Theory and Practice for Interior-Point Methods (Q4291495) (← links)
