A Note on Using Partitioning Techniques for Solving Unconstrained Optimization Problems on Parallel Systems

Abstract

We deal with the design of parallel algorithms by using variable partitioning techniques to solve nonlinear optimization problems. We propose an iterative solution method that is very efficient for separable functions, our scope being to discuss its performance for general functions. Experimental results on an illustrative example have suggested some useful modifications that, even though they improve the efficiency of our parallel method, leave some questions open for further investigation.

Keywords

• Distributed systems
• Parallel algorithms
• Partitioning techniques
• Unconstrained optimization.