Identifying an optimal basis in linear programming
From MaRDI portal
Recommendations
- An optimal-basis identification technique for interior-point linear programming algorithms
- Determining basic variables of optimal solutions in Karmarkar's new LP algorithm
- On Exploiting Problem Structure in a Basis Identification Procedure for Linear Programming
- On Finding Primal- and Dual-Optimal Bases
Cites work
- A Dantzig-Wolfe-Like Variant of Karmarkar's Interior-Point Linear Programming Algorithm
- A new polynomial-time algorithm for linear programming
- A polynomial-time algorithm, based on Newton's method, for linear programming
- A Short-Cut Potential Reduction Algorithm for Linear Programming
- An active-set strategy in an interior point method for linear programming
- An analogue of Moreau's proximation theorem, with application to the nonlinear complementarity problem
- Convergence behavior of interior-point algorithms
- scientific article; zbMATH DE number 3644821 (Why is no real title available?)
- On bounds for scaled projections and pseudoinverses
- On scaled projections and pseudoinverses
- The Nonlinear Geometry of Linear Programming. I Affine and Projective Scaling Trajectories
- The Nonlinear Geometry of Linear Programming. II Legendre Transform Coordinates and Central Trajectories
- The Nonlinear Geometry of Linear Programming. III Projective Legendre Transform Coordinates and Hilbert Geometry
Cited in
(5)- An optimal-basis identification technique for interior-point linear programming algorithms
- A note on properties of condition numbers
- Towards an efficient augmented Lagrangian method for convex quadratic programming
- Improved complexity results on solving real-number linear feasibility problems
- scientific article; zbMATH DE number 4182797 (Why is no real title available?)
This page was built for publication: Identifying an optimal basis in linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1915926)
