Conical projection algorithms for linear programming

65K05: Numerical mathematical programming methods

90C05: Linear programming

Related Items

Search directions for a class of projective methods, On monotonicity in the scaled potential algorithm for linear programming, Theoretical efficiency of a shifted-barrier-function algorithm for linear programming, The affine-scaling direction for linear programming is a limit of projective-scaling directions, A ``build-down scheme for linear programming, A standard form variant, and safeguarded linesearch, for the modified Karmarkar algorithm, Cutting planes and column generation techniques with the projective algorithm, A primal projective interior point method for linear programming, Interior point algorithms for linear programming with inequality constraints, Global convergence of the affine scaling methods for degenerate linear programming problems, On lower bound updates in primal potential reduction methods for linear programming, A combined phase I-phase II scaled potential algorithm for linear programming, A survey of search directions in interior point methods for linear programming, On Anstreicher's combined phase I-phase II projective algorithm for linear programming, Solving combinatorial optimization problems using Karmarkar's algorithm, Long steps in an \(O(n^ 3L)\) algorithm for linear programming, On combined phase 1-phase 2 projective methods for linear programming, Polynomial primal-dual cone affine scaling for semidefinite programming, Strict monotonicity and improved complexity in the standard form projective algorithm for linear programming, Updating lower bounds when using Karmarkar's projective algorithm for linear programming, Interior-point algorithms for semi-infinite programming, Containing and shrinking ellipsoids in the path-following algorithm, Polynomial affine algorithms for linear programming, On motivating the Mitchell-Todd modification of Karmarkar's algorithm for LP problems with free variables, Potential reduction method for harmonically convex programming, An \(O(\sqrt {n} L)\) iteration bound primal-dual cone affine scaling algorithm for linear programming, Convergence analysis of the projective scaling algorithm based on a long-step homogeneous affine scaling algorithm, Search directions for interior linear-programming methods

Cites Work