A Superlinearly Convergent Polynomial Primal-Dual Interior-Point Algorithm for Linear Programming

Simple item page
dc.contributor.authorZhang, Yinen_US
dc.contributor.authorTapia, Richarden_US
dc.date.accessioned2018-06-18T17:30:12Zen_US
dc.date.available2018-06-18T17:30:12Zen_US
dc.date.issued1991-02en_US
dc.date.noteFebruary 1991 (Revised December 1991)en_US
dc.description.abstractThe choice of the centering (or barrier) parameter and the step length parameter are the fundamental issues in primal-dual interior-point algorithms for linear programming. Various choices for these two parameters have been proposed that lead to polynomial algorithms. Recently, Zhang, Tapia and Dennis gave conditions that these choices must satisfy in order to achieve quadratic or superlinear convergence. However, it has not been shown that these conditions for fast convergence are compatible with the choices that lead to polynomiality. It is worth noting that none of the existing polynomial algorithms satisfies these fast convergence requirements. This paper gives an affirmative answer to the question: can an algorithm be both polynomial and superlinearly convergent? We construct and analyze a "large step" algorithm that possesses both polynomiality and Q-superlinear convergence. For nondegenerate problems, the convergence rate is actually Q-quadratic.en_US
dc.format.extent31 ppen_US
dc.identifier.citationZhang, Yin and Tapia, Richard. "A Superlinearly Convergent Polynomial Primal-Dual Interior-Point Algorithm for Linear Programming." (1991) <a href="https://hdl.handle.net/1911/101704">https://hdl.handle.net/1911/101704</a>.en_US
dc.identifier.digitalTR90-40en_US
dc.identifier.urihttps://hdl.handle.net/1911/101704en_US
dc.language.isoengen_US
dc.titleA Superlinearly Convergent Polynomial Primal-Dual Interior-Point Algorithm for Linear Programmingen_US
dc.typeTechnical reporten_US
dc.type.dcmiTexten_US
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
TR90-40.pdf
Size:
344.38 KB
Format:
Adobe Portable Document Format
Download
Collections
CMOR Technical Reports