Iteration bound $O(\sqrt{n}\,\log(n\mu^0/\varepsilon))$ for the primal path following algorithm

Initializing...

Iteration bound $O(\sqrt{n}\,\log(n\mu^0/\varepsilon))$ for the primal path following algorithm · Prove2Me