会议专题

A Framework for Parallel Nonlinear Optimization by Partitioning Localized Constraints

We present a novel parallel framework for solving large-scale continuous nonlinear optimization problems based on constraint partitioning. The framework distributes constraints and variables to parallel processors and uses an existing solver to handle the partitioned subproblems. In contrast to most previous decomposition methods that require either separability or convexity of constraints, our approach is based on a new constraint partitioning theory and can handle nonconvex problems with inseparable global constraints. We also propose a hypergraph partitioning method to recognize the problem structure. Experimental results show that the proposed parallel algorithm can efficiently solve some difficult test cases.

You Xu Yixin Chen

Department of Computer Science and Engineering Washington University in St.Louis

国际会议

The Inaugural Symposium on Parallel Algorithms, Architectures and Programming(并行算法、结构和编程国际研讨会)

广州

英文

37-52

2008-09-16(万方平台首次上网日期,不代表论文的发表时间)