Task Decomposition for Optimization Problem Solving
SEAL '08 Proceedings of the 7th International Conference on Simulated Evolution and Learning
A Parallel Implementation of the PBSGDS Method for Solving CBAU Optimization Problems
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
A Parallel Algorithm for NMNF Problems with a Large Number of Capacity Constraints
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Hi-index | 0.00 |
In this paper, we propose two techniques to solve the nonlinear constrained optimization problem in large scale mesh-interconnected system. The first one is a diagram-method-based decomposition technique which decomposes the large scale system into some small subsystems. The second technique is a projected-Jacobi-based parallel dual-type method which can solve the optimization problems in the decomposed subsystems efficiently. We have used the proposed algorithm to solve numerous examples of large scale constrained optimization problems in power system. The test results show that the proposed algorithm has computational efficiency with respect to the conventional approach of the centralized Newton method and the state-of-the-art Block-Parallel Newton method.