Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

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.

share|cite|improve this question
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. – Rahul Dec 27 '12 at 3:53

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.


  • The page 463 here i.e. the chapter 9.2 Descent Methods.
share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.