Improved Bounds and Containing Ellipsoids in Karmarkar's Linear Programming Algorithm
From MaRDI portal
Publication:3818123
DOI10.1287/moor.13.4.650zbMath0665.90059OpenAlexW2016904922WikidataQ92951986 ScholiaQ92951986MaRDI QIDQ3818123
Publication date: 1988
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://hdl.handle.net/1813/8604
Related Items
Exploiting special structure in Karmarkar's linear programming algorithm, A direct ellipsoid method for linear programming, Eliminating columns in the simplex method for linear programming, A ``build-down scheme for linear programming, An optimal-basis identification technique for interior-point linear programming algorithms, On the finite convergence of interior-point algorithms for linear programming, On the computation of weighted analytic centers and dual ellipsoids with the projective algorithm, On combined phase 1-phase 2 projective methods for linear programming, Linear updates for a single-phase projective method, Ellipsoids that contain all the solutions of a positive semi-definite linear complementarity problem, Global ellipsoidal approximations and homotopy methods for solving convex analytic programs, Containing and shrinking ellipsoids in the path-following algorithm, Primal-dual-infeasible Newton approach for the analytic center deep-cutting plane method, On improved Choi-Goldfarb solution-containing ellipsoids in linear programming, Degeneracy in interior point methods for linear programming: A survey, The affine-scaling direction for linear programming is a limit of projective-scaling directions, Updating lower bounds when using Karmarkar's projective algorithm for linear programming, On solution-containing ellipsoids in linear programming
