El metodo de Karmarkar: Un estudio de sus variantes
From MaRDI portal
Publication:3360002
Recommendations
Cites work
- A monotonic projective algorithm for fractional linear programming
- A new polynomial-time algorithm for linear programming
- A polynomial-time algorithm, based on Newton's method, for linear programming
- A reduced-gradient variant of Karmarkar's algorithm and null-space projections
- A relaxed version of Karmarkar's method
- A variable-metric variant of the Karmarkar algorithm for linear programming
- A variant of Karmarkar's linear programming algorithm for problems in standard form
- A variation on Karmarkar’s algorithm for solving linear programming problems
- An experimental approach to karmarkar’s projective method for linear programming
- An extension of Karmarkar's algorithm for linear programming using dual variables
- An extension of Karmarkar's algorithm for solving a system of linear homogeneous equations on the simplex
- Computing Karmarkar projections quickly
- Exploiting special structure in Karmarkar's linear programming algorithm
- On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
- Recovering optimal dual solutions in Karmarkar's polynomial algorithm for linear programming
- Relaxed variants of Karmarkar's algorithm for linear programs with unknown optimal objective value
This page was built for publication: El metodo de Karmarkar: Un estudio de sus variantes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3360002)