We propose a new decomposition method for large-scale linear programming. This method dualizes an (arbitrary) subset of the constraints and then maximizes the resulting dual functional by dual ascent.

We study a class of blockwise waveform relaxation methods, and investigate its convergence properties in both asymptotic and monotone senses. In addition, the monotone convergence rates between ...

SOME six years ago Dr. Southwell published his now famous treatise on “Relaxation Methods in Engineering Science”, in which he gave an account of the investigations of his school of research workers ...