On solution-containing ellipsoids in linear programming
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3301975 (Why is no real title available?)
- A ``build-down scheme for linear programming
- A new polynomial-time algorithm for linear programming
- A polynomial-time algorithm for a class of linear complementarity problems
- A polynomial-time algorithm, based on Newton's method, for linear programming
- A variation on Karmarkar’s algorithm for solving linear programming problems
- An \(O(n^ 3L)\) potential reduction algorithm for linear programming
- Containing and shrinking ellipsoids in the path-following algorithm
- Determining basic variables of optimal solutions in Karmarkar's new LP algorithm
- Improved Bounds and Containing Ellipsoids in Karmarkar's Linear Programming Algorithm
- Interior path following primal-dual algorithms. I: Linear programming
- Polynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential function
- Recovering Optimal Basic Variables in Karmarkar's Polynomial Algorithm for Linear Programming
- The Ellipsoid Method Generates Dual Variables
Cited in
(8)- Improved Bounds and Containing Ellipsoids in Karmarkar's Linear Programming Algorithm
- On improved Choi-Goldfarb solution-containing ellipsoids in linear programming
- scientific article; zbMATH DE number 4003907 (Why is no real title available?)
- scientific article; zbMATH DE number 4060993 (Why is no real title available?)
- scientific article; zbMATH DE number 232497 (Why is no real title available?)
- The Ellipsoid Method Generates Dual Variables
- scientific article; zbMATH DE number 5585899 (Why is no real title available?)
- Ellipsoids containing optimal solutions of the linear programming problem
This page was built for publication: On solution-containing ellipsoids in linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1321453)
