On the convergence rate of the duality gap in a symmetric primal-dual potential reduction algorithm

DOI10.1016/0167-6377(92)90005-NzbMath0759.90069OpenAlexW2070224352MaRDI QIDQ1196215

Jishan Zhu, Siming Huang

Publication date: 17 December 1992

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(92)90005-n

zbMATH Keywords

duality gapglobal convergence ratepotential reduction algorithmsymmetric primal-dual potential algorithm

Mathematics Subject Classification ID

Linear programming (90C05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Cites Work

• A new polynomial-time algorithm for linear programming
• A Centered Projective Algorithm for Linear Programming
• Unnamed Item

This page was built for publication: On the convergence rate of the duality gap in a symmetric primal-dual potential reduction algorithm