Carving perfect layers out of docker images
Dimitrios Skourtis, Lukas Rupprecht, et al.
HotCloud 2019
This paper proposes two sets of rules, Rule G and Rule P, for controlling step lengths in a generic primal-dual interior point method for solving the linear programming problem in standard form and its dual. Theoretically, Rule G ensures the global convergence, while Rule P, which is a special case of Rule G, ensures the O(nL) iteration polynomial-time computational complexity. Both rules depend only on the lengths of the steps from the current iterates in the primal and dual spaces to the respective boundaries of the primal and dual feasible regions. They rely neither on neighborhoods of the central trajectory nor on potential function. These rules allow large steps without performing any line search. Rule G is especially flexible enough for implementation in practically efficient primal-dual interior point algorithms. © 1993 The Mathematical Programming Society, Inc.
Dimitrios Skourtis, Lukas Rupprecht, et al.
HotCloud 2019
Ching-Tien Ho, Rakesh Agrawal, et al.
SIGMOD Record (ACM Special Interest Group on Management of Data)
Nimrod Megiddo, Shinji Mizuno, et al.
Mathematical Programming, Series B
Masakazu Kojima, Nimrod Megiddo
Linear Algebra and Its Applications