Rosen's gradient projection with discrete steps (Q922296)

The minimization problem under consideration has linear constraints and a continuously differentiable objective function. The descent direction is defined as a projection of a gradient into active constraints. The step size is defined by halving of an interval, but with some specific stopping condition, i.e. the line search is not exact. It is proved that the algorithm converges to a K-T point.