We establish the convergence theories of the symmetric relaxation methods for the system of linear equations with symmetric positive definite coefficient matrix, and more generally, those of the ...
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.
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback