Achievable potential reductions in the method of Kojima et al. in the case of linear programming

DOI10.1051/RO/1994280201231MaRDI QIDQ4887124zbMATH OpenOpenAlexFDO

Authors C. Roos, Jean-Philippe Vial

Publication date 21 April 1997

Published in RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/105078

zbMATH Keywords

duality gapprimal-dual interior point methodlinear complementaritypotential reduction

Mathematics Subject Classification ID

Linear programming (90C05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Recommendations

• An \(O(n^ 3L)\) potential reduction algorithm for linear programming
• Large Step Path-Following Methods for Linear Programming, Part II: Potential Reduction Method
• scientific article; zbMATH DE number 4197744
• A potential-reduction variant of Renegar's short-step path-following method for linear programming
• Infeasible-Interior-Point Primal-Dual Potential-Reduction Algorithms for Linear Programming

Cited in

(3)

• A new linesearch method for quadratically constrained convex programming
• Consistency, redundancy, and implied equalities in linear systems
• On partial updating in a potential reduction linear programming algorithm of Kojima, Mizuno, and Yoshise

This page was built for publication: Achievable potential reductions in the method of Kojima et al. in the case of linear programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4887124)