On the convergence of partitioning group correction algorithms

This paper studies a successive partitioning group correction algorithm and its some modified algorithms for solving large scale sparse unconstrained optimization problems. The methods depend on a symmetric consistent partition of the columns of the Hessian matrix. A q-superlinear convergence result and an r-convergence rate estimate show that the methods have good local convergence properties. The numerical results show that the methods, especially the modified algorithms, may be competitive with some current used algorithms.