Oblivious Sketching-based Central Path Method for Linear Programming

                          Zhao Song 1 Zheng Yu 2

             Abstract                 Consider solving a general linear program in standard form
                                  minAx=b,x≥0 c> x of size A ∈ Rd×n without redundant
   In this work, we propose a sketching-based cen-        constraints. For the case d = (n) we considered in this
   tral path method for solving linear programmings,       paper, the state of the ...