Superlinear and Quadratic Convergence of Primal-Dual Interior-Point Methods for Linear Programming Revisited
Recently, Zhang, Tapia and Dennis produced a superlinear and quadratic convergence theory for the duality gap sequence in primal-dual interior-point methods for linear programming. In this theory, a basic assumption for superlinear convergence is the convergence of the iteration sequence; and a basic assumption for quadratic convergence is nondegeneracy. Several recent research projects have either used or built on this theory under one or both of the above mentioned assumptions. In this paper, we remove both assumptions from the Zhang-Tapia-Dennis theory.
Citable link to this pagehttps://hdl.handle.net/1911/101728
MetadataShow full item record
- CAAM Technical Reports