The Scaling Of Hybrid Method In Solving Unconstrained Optimization Method

Please use this identifier to cite or link to this item: http://umt-ir.umt.edu.my:8080/handle/123456789/5647

Full metadata record

DC Field	Value	Language
dc.contributor.author	Mohd Asrul Hery, Ibrahim	-
dc.contributor.author	Mustafa, Mamat	-
dc.contributor.author	Puspa Liza, Ghazali	-
dc.contributor.author	Zabidin, Salleh	-
dc.date.accessioned	2017-04-11T00:23:09Z	-
dc.date.available	2017-04-11T00:23:09Z	-
dc.date.issued	2015-10-01	-
dc.identifier.citation	Vol.99(7);983-991p.	en_US
dc.identifier.uri	http://hdl.handle.net/123456789/5647	-
dc.description.abstract	In this paper, the solution of unconstrained optimization problems has been suggested by using scaling of BFGS-SD method. This method is globally convergent with inexact line searches for general convex functions. The number of iterations and CPU-time of this method has been compared with those of the original BFGS method.	en_US
dc.language.iso	en	en_US
dc.publisher	Far East Journal of Mathematical Sciences (FJMS)	en_US
dc.title	The Scaling Of Hybrid Method In Solving Unconstrained Optimization Method	en_US
dc.type	Article	en_US
Appears in Collections:	Journal Articles

Files in This Item:

File	Description	Size	Format
147-The_scaling_of_hybrid_method_in_solving_unconstrained_optimization_method.png	Evidence	148.29 kB	image/png	View/Open
147 The scaling of hybrid method in solving unconstrained optimization method.pdf	Fulltext File	278.11 kB	Adobe PDF	View/Open

DSpace JSPUI