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

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:AL-Rafidain journal of computer sciences and mathematics Ročník 3; číslo 2; s. 69 - 82
Hlavní autor: Khalil K. Abbo
Médium: Journal Article
Jazyk:angličtina
Vydáno: Mosul University 04.12.2006
Témata:
hessian matrix
newton method
non-linear unconstrained optimization
parallel algorithm
ISSN:1815-4816, 2311-7990
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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