A log barrier algorithm for linear separability which does not rely on central path framework

State-of-the-art log barrier algorithms for linear programming rely on central-path framework.Recently, some hard instances for any algorithms relying on this framework has been found, making relevant to look for not-central-path alternatives.This paper introduces a simple log barrier algorithm with similar times complexity than previous ones, but, with a different underlying mechanism.Currently, this algorithm could be seen as a log barrier extension of the Perceptron, and, has some interesting features for machine learning context.