Convergence results and numerical experiments on a linear programming hybrid algorithm

DOI10.1016/0377-2217(87)90270-0zbMath0631.90038OpenAlexW2024448501MaRDI QIDQ1095026

B. George

Publication date: 1987

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(87)90270-0

zbMATH Keywords

convergence resultsorthogonal projectioncolumn scalingmodificationKarmarkar's algorithmsteepest descent directionsscaling algorithminterior-feasible-preserving algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05)

Related Items (11)

Interior-point algorithms for semi-infinite programming ⋮ Implementing an affine scaling algorithm for linear programming ⋮ An interior point algorithm for semi-infinite linear programming ⋮ A second order affine scaling algorithm for the geometric programming dual with logarithmic barrier ⋮ Asymptotic behaviour of Karmarkar's method for linear programming ⋮ On the convergence of the affine-scaling algorithm ⋮ A modified scaling algorithm for LP ⋮ Computation of the collapse state in limit analysis using the LP primal affine scaling algorithm ⋮ Computing material collapse displacement fields on a Cray X-MP/48 by the LP primal affine scaling algorithm ⋮ An affine-scaling pivot algorithm for linear programming ⋮ An \(O(n^ 3L)\) potential reduction algorithm for linear programming

Cites Work

• A new polynomial-time algorithm for linear programming
• Intelligent gradient search in linear programming
• The iterative step in the linear programming algorithm of N. Karmarkar
• An extension of Karmarkar's algorithm for linear programming using dual variables
• Iterative linear programming solution of convex programs
• On semi-infinite systems of linear inequalities
• On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
• A variant of Karmarkar's linear programming algorithm for problems in standard form
• An experimental approach to karmarkar’s projective method for linear programming
• The efficient solution of large-scale linear programming problems—some algorithmic techniques and computational results
• THE STRONG MINKOWSKI FARKAS-WEYL THEOREM FOR VECTOR SPACES OVER ORDERED FIELDS

This page was built for publication: Convergence results and numerical experiments on a linear programming hybrid algorithm