On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming 3: The Potential-Reduction Algorithm in N∞⁻(β) with ρ − n of Order n² Attains Precision t in O(nt) IterationsResearch Paper
Primal–dual interior-point methods solve a linear program by following, approximately, the central path of strictly feasible primal–dual pairs. Two families dominate the theory. Path-following methods keep the iterates in a neighbourhood of the path and measure progress by the duality gap. Potential-reduction methods measure progress by a merit function,…