A Decomposition Method and Its Application to Block Angular Linear Programs.
Technical summary rept.,
WISCONSIN UNIV-MADISON MATHEMATICS RESEARCH CENTER
Pagination or Media Count:
In this paper we propose and develop techniques for solving structured, large-scale convex programming problems. The procedure is a combination of a decomposition technique of Dantzig-Wolfe type and the proximal point method. The proximal point method is used to overcome the drawbacks of the decomposition technique. The procedure is then used to solve block angular linear programming problems. By exploiting the linearity of the problem we have several variants of the procedure. Author
- Theoretical Mathematics
- Computer Programming and Software