Parallel Newtonian Optimization without Hessian Approximation

The purpose of this paper is to introduce parallel algorithms based on the Newton method for solving non-linear unconstrained optimization problem in (MIMD) parallel computers by solving linear system in parallel using Gaussian Elimination method rather than finding inverse Hessian matrix to avoid the errors caused by evaluating the inverse matrix and also to increase computing power and reduce run time.