Indexed on: 01 Feb '84Published on: 01 Feb '84Published in: Journal of Optimization Theory and Applications
Parallel algorithms and test case results for the solution of the unconstrained optimization problem are presented. The algorithms involve the use of pseudo-conjugate directions (directions which tend to become conjugate as the solution is approached). It is shown that the algorithms are both fast and robust. Although all the algorithms of this paper involve the parallel execution of linear search procedures, a critical differentiation can be made among them, depending on whether the linear searches are performed along the same direction (parallel unidirectional algorithms) or different directions (parallel multidirectional algorithms).