Methods of conjugate directions without line searches

dc.contributor.author	Osei-Frimpong, Emmanuel
dc.date.accessioned	2012-03-28T20:51:16Z
dc.date.accessioned	2023-04-21T11:16:37Z
dc.date.available	2012-03-28T20:51:16Z
dc.date.available	2023-04-21T11:16:37Z
dc.date.issued	1992-09-28
dc.description	A thesis submitted to the Board of Postgraduate Studies, Kwame Nkrumah University of Science and Technology, Kumasi, in partial fulfilment of the requirement for the award of the Degree of Master of Science in Mathematics, 1992	en_US
dc.description.abstract	Most published minimization algorithms on conjugate direction involve exact linear searches in the generation of’ the conjugate directions. Examples of these algorithms include conjugate gradient and variable metric methods. The most expensive aspect of any conjugate direction method is the (exact) linear search part. Recently, ways have been sought to avoid these exact linear searches by replacing them with inexact or approximate linear searches. This thesis examines some conjugate direction algorithms without exact linear searches, namely those by (i) R. Fletcher (ii) L. C. W. Dixon (iii) D. Goldfarb For each of these algorithms, a FORTRAN subroutine program has been written and tested on some standard test functions on an IBM PS/2 computer system.	en_US
dc.description.sponsorship	KNUST	en_US
dc.identifier.uri	https://ir.knust.edu.gh/handle/123456789/3340
dc.language.iso	en	en_US
dc.relation.ispartofseries	2122;
dc.title	Methods of conjugate directions without line searches	en_US
dc.type	Thesis	en_US

Now showing 1 - 1 of 1

Now showing 1 - 2 of 2