Talk:Interior-point method

These algorithms have been inspired by Karmarkar's algorithm, developed by Narendra Karmarkar in 1984 for linear programming. The basic elements of the method consists of a self-concordant barrier function used to encode the convex set. Contrary to the simplex method, it reaches the optimal vertex by traversing the interior of the feasible region. Is there much of a chance someone who is not already an expert in interior point methods is going to understand this? If not is there any purpose to leaving this entry in wikipedia? What is the conditional probability of someone understanding what barrier functions are if they don't understand what an interior point method is? --Dilaudid (talk) 11:23, 27 November 2007 (UTC)