Mixing a log barrier algorithm with simplex-like oracle for solving linear programming.

This paper offers a polynomial-time log barrier algorithm for linear programming which can benefit from oracle guesses. Despite being probably less efficient than classical log barrier, this algorithm is still polynomial, while potentially much more efficient on instances where large synergies are found with a simplex-like oracle.