1
$\begingroup$

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.

  • 1
    Line search is a technique usually used in unconstrained nonlinear optimization. You can apply it to linear programming only after somehow converting your LP into an unconstrained problem, e.g. by using barrier functions.2012-12-27

1 Answers 1

0

About points 15-20 in the lecture here by Stanford. I cannot fully yet understand it but as reference.

enter image description here

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

  • The page 463 here i.e. the chapter 9.2 Descent Methods.