Interior Point Algorithms III: The Primal-Dual Potential Function Falls by a Constant Every StepTextbook
Karmarkar's 1984 algorithm solved linear programs in polynomial time by reducing a logarithmic potential function by a constant at every step (doi:10.1007/BF02579150). Its successors replaced Karmarkar's projective transformations with a primal-dual potential that measures the duality gap and the distance from the central path together. Tanabe, and Todd and…