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 t...

Full description

Saved in:
Bibliographic Details
Published in:AL-Rafidain journal of computer sciences and mathematics Vol. 3; no. 2; pp. 69 - 82
Main Author: Khalil K. Abbo
Format: Journal Article
Language:English
Published: Mosul University 04.12.2006
Subjects:
hessian matrix
newton method
non-linear unconstrained optimization
parallel algorithm
ISSN:1815-4816, 2311-7990
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:1815-4816
2311-7990
DOI:10.33899/csmj.2006.164053