Analysis of a Nonhierarchical Decomposition Algorithm
1992) Analysis of a Nonhierarchical Decomposition Algorithm. Technical Report TR-92-48, Computer Science, Virginia Polytechnic Institute and State University. (
Large scale optimization problems are tractable only if they are somehow decomposed. Hierarchical decompositions are inappropriate for some types of problems and do not parallelize well. Sobieszczanski-Sobieski has proposed a nonhierarchical decomposition strategy for nonlinear constrained optimization that is naturally parallel. Despite some successes on engineering problems, the algorithm as originally proposed fails on simple two dimensional quadratic programs. This paper carefully analyzes the algorithm for quadratic programs, and suggests a number of modifications to improve its robustness.
|Item Type:||Departmental Technical Report|
|Subjects:||Computer Science > Historical Collection(Till Dec 2001)|
|Deposited By:||User autouser|
|Deposited On:||05 December 2001|