I am trying to visualize this recursive algorithm in LP, Wikipedia here. I am looking for references about in which kind of problems is this used and what does it really look like?
I am also interested about visual comparisons between other basic LP algorithms.
About points 15-20 in the lecture here by Stanford. I cannot fully yet understand it but as reference.
A key decision in line search seems to be a step-size. And please notice that there are many different kinds of line searches.
Related