DOE OSTI · 1123918
A Framework for Parallel Nonlinear Optimization by Partitioning Localized Constraints
Abstract
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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Xu, You, Chen, Yixin. 2008-06-28. A Framework for Parallel Nonlinear Optimization by Partitioning Localized Constraints. https://engineeringpapers.com/record/osti%3A1123918/a-framework-for-parallel-nonlinear-optimization-by-partitioning-localized-constraints
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Engineering Papers by Indiciae: BibTeX · RIS.