Skip to main content


eCommons@Cornell >
Faculty of Computing and Information Science >
Center for Advance Computing >
Cornell Theory Center Technical Reports >

Please use this identifier to cite or link to this item:
Title: An Accelerated Interior Point Method Whose Running Time Depends Only on A
Authors: Vavasis, Stephen A.
Ye, Yinyu
Keywords: theory center
Issue Date: Oct-1993
Publisher: Cornell University
Abstract: We propose a "layered-step" interior point (LIP) algorithm for linear programming. This algorithm follows the central path, either with shortsteps or with a new type of step called a "layered least squares" (LLS)step. The algorithm returns the exact global minimum after a finite numberof steps - in particular, after O (mathematical symbol omitted) iterations, where c(A) is a function of the coefficient matrix. The LLS steps can be thought of as accelerating a path-following interior point method whenever near-degeneracies occur. One consequence of the new method is a new characterization of the central path: we show that it composed of at most n-squared alternating straight and curved segments. If the LIP algorithm is applied to integer data, we get as another corollary a new proof of a well-known theorom by Tardos that linear programming can be solved in strongly polynomial time provided that A contains small-integerentries.
Appears in Collections:Cornell Theory Center Technical Reports

Files in This Item:

File Description SizeFormat
93-155.pdf402.75 kBAdobe PDFView/Open
93-155.ps475.31 kBPostscriptView/Open

Refworks Export

Items in eCommons are protected by copyright, with all rights reserved, unless otherwise indicated.


© 2014 Cornell University Library Contact Us