- Counter Example to A Conjecture on Infeasible Interior-Point Methods G. Gu(g.gutudelft.nl) C. Roos(c.roostudelft.nl) Abstract: Based on extensive computational evidence (hundreds of thousands of randomly generated problems) the second author conjectured that $\bar{\kappa}(\zeta)=1$, which is a factor of $\sqrt{2n}$ better than that has been proved, and which would yield an $O(\sqrt{n})$ iteration full-Newton step infeasible interior-point algorithm. In this paper we present an example showing that $\bar{\kappa}(\zeta)$ is in the order of $\sqrt{n}$, the same order as that has been proved. In other words, the current best iteration bound for infeasible interior-point algorithms cannot be improved. Keywords: linear optimization, infeasible interior-point method, full-Newton step method, conjecture Category 1: Linear, Cone and Semidefinite Programming (Linear Programming ) Citation: July/2008 Download: [PDF]Entry Submitted: 12/05/2008Entry Accepted: 12/05/2008Entry Last Modified: 12/05/2008Modify/Update this entry Visitors Authors More about us Links Subscribe, Unsubscribe Digest Archive Search, Browse the Repository Submit Update Policies Coordinator's Board Classification Scheme Credits Give us feedback Optimization Journals, Sites, Societies Optimization Online is supported by the Mathematical Programming Society and by the Optimization Technology Center.