Projection algorithms for linear programming (Q1199509)

The paper is concerned with iterative projection methods for solving the feasibility problem of linear programming. The approach gives rise to a geometric interpretation based on the nearest point projection. It uses an unconstrained convex programming formulation in which it is possible to chose differentiable objective functions. A particular study of an algorithm using a variable metric method with exact line search is presented.