| 2 | Asynchronous Nested Optimization Algorithms and Their Parallel Implementation显示文摘Large scale optimization problems can only be solved in an efficient way, if their special structure is taken as the basis of algorithm design. In this paper we consider a very broad class of large-scale problems with special structure, namely tree structured problems. We show how the exploitation of the structure leads to efficient decomposition algorithms and how it may be implemented in a parallel environment. | Hans W. Moritsch, G.Ch. Pflug, M. Siomak Department of Statistics and Decision Support Systems,University of Vienna, Universitaetsstrasse 5 A\|1090 Vienna, Austria | 2001 | Wuhan University Journal of Natural Sciences2001，6，Z1： | 0 |
您所在的机构暂未开通此部分的功能，请联系管理员