Comparative analysis of affine scaling algorithms based on simplifying assumptions
From MaRDI portal
Publication:1181906
DOI10.1007/BF01582897zbMath0774.90057OpenAlexW2041973174MaRDI QIDQ1181906
Publication date: 27 June 1992
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01582897
Abstract computational complexity for mathematical programming problems (90C60) Linear programming (90C05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (2)
Extension of Karmarkar's algorithm onto convex quadratically constrained quadratic problems ⋮ An extension of the potential reduction algorithm for linear complementarity problems with some priority goals
Cites Work
- Unnamed Item
- Unnamed Item
- A modification of Karmarkar's linear programming algorithm
- A new polynomial-time algorithm for linear programming
- An \(O(n^ 3L)\) potential reduction algorithm for linear programming
- Computational experience with a dual affine variant of Karmarkar's method for linear programming
- An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems
- Polynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential function
- Long steps in an \(O(n^ 3L)\) algorithm for linear programming
- An interior point potential reduction algorithm for the linear complementarity problem
- Polynomial affine algorithms for linear programming
- An implementation of Karmarkar's algorithm for linear programming
- A variation on Karmarkar’s algorithm for solving linear programming problems
- A Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and Its Power Series Extension
- An $O(\sqrt{n} L)$-Iteration Large-Step Primal-Dual Affine Algorithm for Linear Programming
- An Implementation of a Primal-Dual Interior Point Method for Linear Programming
This page was built for publication: Comparative analysis of affine scaling algorithms based on simplifying assumptions
