Relaxed variants of Karmarkar's algorithm for linear programs with unknown optimal objective value
From MaRDI portal
DOI10.1007/BF01580729zbMATH Open0645.90048MaRDI QIDQ1103522FDOQ1103522
Authors: Donald Goldfarb, Sanjay Mehrotra 
Publication date: 1988
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Recommendations
- A variant of Karmarkar's linear programming algorithm for problems in standard form
- A Variant of Karmarkar’s Linear Programming Algorithm for Problems with Some Unrestricted Variables
- A variation on Karmarkar’s algorithm for solving linear programming problems
- An extension of Karmarkar's algorithm for linear programming using dual variables
- A relaxed version of Karmarkar's method
Cites Work
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- A new polynomial-time algorithm for linear programming
- A relaxed version of Karmarkar's method
- An extension of Karmarkar's algorithm for linear programming using dual variables
- A monotonic projective algorithm for fractional linear programming
- A variant of Karmarkar's linear programming algorithm for problems in standard form
- An experimental approach to karmarkar’s projective method for linear programming
Cited In (13)
- An active-set strategy in an interior point method for linear programming
- Computational results of an interior point algorithm for large scale linear programming
- El metodo de Karmarkar: Un estudio de sus variantes
- A variation on Karmarkar’s algorithm for solving linear programming problems
- An \(\epsilon\)-active barrier-function method for solving minimax problems
- A relaxed primal-dual path-following algorithm for linear programming
- A Variant of Karmarkar’s Linear Programming Algorithm for Problems with Some Unrestricted Variables
- A modified scaling algorithm for LP
- A combined phase I-phase II projective algorithm for linear programming
- Vector processing in simplex and interior methods for linear programming
- A relaxed version of Karmarkar's method
- Asymptotic behaviour of Karmarkar's method for linear programming
- A barrier function method for minimax problems
Uses Software
This page was built for publication: Relaxed variants of Karmarkar's algorithm for linear programs with unknown optimal objective value
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1103522)
