Optimality tests for partitioning and sectional search algorithms (Q1178318)

This paper considers an extension of the Gauss-Southwell procedure for constrained optimization, i.e. at each step a minimization is performed with respect to a restricted set of variables. The author discusses whether a limit point of the algorithm satisfies the first order optimality conditions. He gives a posteriori sufficient conditions relating the multipliers computed for each subproblem.