A Parallel Optimization Method Based on the Theory of Parallel Subspaces

The purpose of this paper is to develop a parallel algorithm for solving unconstrained optimization problems. This parallel algorithm in which several tasks may be executed at the same time in parallel based on the parallel subspaces theorem and it's designed to run on MIMD computing systems.