Computational experience with a dual affine variant of Karmarkar's method for linear programming
From MaRDI portal
Publication:1092808
DOI10.1016/0167-6377(87)90040-XzbMath0627.90065MaRDI QIDQ1092808
Clyde l. Monma, Andrew J. Morton
Publication date: 1987
Published in: Operations Research Letters (Search for Journal in Brave)
68Q25: Analysis of algorithms and problem complexity
65K05: Numerical mathematical programming methods
90C05: Linear programming
Related Items
An efficient search direction for linear programming problems, The steepest descent gravitational method for linear programming, Feasibility issues in a primal-dual interior-point method for linear programming, Optimizing over three-dimensional subspaces in an interior-point method for linear programming, An \(O(n^ 3L)\) potential reduction algorithm for linear programming, Cubically convergent method for locating a nearby vertex in linear programming, An algorithm for linear programming that is easy to implement, An analysis of an available set of linear programming test problems, On finding a vertex solution using interior point methods, An optimal-basis identification technique for interior-point linear programming algorithms, Global convergence of the affine scaling methods for degenerate linear programming problems, Comparative analysis of affine scaling algorithms based on simplifying assumptions, A survey of search directions in interior point methods for linear programming, Computational results of an interior point algorithm for large scale linear programming, On the convergence of the affine-scaling algorithm, A weighted least squares study of robustness in interior point linear programming, A simplified global convergence proof of the affine scaling algorithm, Interior dual proximal point algorithm for linear programs, Interior-point algorithms for semi-infinite programming, An interior multiobjective primal-dual linear programming algorithm based on approximated gradients and efficient anchoring points, Trust region affine scaling algorithms for linearly constrained convex and concave programs, Convergence properties of Dikin's affine scaling algorithm for nonconvex quadratic minimization, Efficient solution of two-stage stochastic linear programs using interior point methods, Superlinear convergence of the affine scaling algorithm, Limiting behavior of the affine scaling continuous trajectories for linear programming problems, Loss and retention of accuracy in affine scaling methods, Interior-point methods for linear programming: a review, Numerical experiments with the symmetric affine scaling algorithm on degenerate linear programming problema
Uses Software
Cites Work
- A modification of Karmarkar's linear programming algorithm
- A new polynomial-time algorithm for linear programming
- Computational results of an interior point algorithm for large scale linear programming
- On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
- A variation on Karmarkar’s algorithm for solving linear programming problems
- On the Efficiency of Newton's Method in Approximating All Zeros of a System of Complex Polynomials
