A Primal-dual Accelerated Interior Point Method Whose Running Time Depends Only on A

  • Stephen A. Vavasisy, Yinyu Yez
  • Published 1994


We propose a primal-dual \layered-step" interior point (LIP) algorithm for linear programming with data given by real numbers. This algorithm follows the central path, either with short steps or with a new type of step called a \layered least squares" (LLS) step. The algorithm returns an exact optimum after a nite number of steps|in particular, after O(n 3… (More)


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics