Traversing non-convex regions

dc.contributor.author	Bartholomew-Biggs, Michael
dc.contributor.author	Beddiaf, Salah
dc.contributor.author	Kane, Stephen
dc.date.accessioned	2013-04-08T12:59:43Z
dc.date.available	2013-04-08T12:59:43Z
dc.date.issued	2013
dc.identifier.citation	Bartholomew-Biggs , M , Beddiaf , S & Kane , S 2013 , ' Traversing non-convex regions ' , Advanced Modeling and Optimization , vol. 15 , no. 2 , pp. 387-407 . < http://camo.ici.ro/journal/jamo.htm >
dc.identifier.issn	1841-4311
dc.identifier.uri	http://hdl.handle.net/2299/10318
dc.description.abstract	This paper considers a method for dealing with non-convex objective functions in optimization problems. It uses the Hessian matrix and combines features of trust-region techniques and continuous steepest descent trajectory-following in order to construct an algorithm which performs curvilinear searches away from the starting point of each iteration. A prototype implementation yields promising results	en
dc.format.extent	265960
dc.language.iso	eng
dc.relation.ispartof	Advanced Modeling and Optimization
dc.title	Traversing non-convex regions	en
dc.contributor.institution	School of Physics, Astronomy and Mathematics
dc.contributor.institution	Science & Technology Research Institute
dc.description.status	Peer reviewed
dc.identifier.url	http://camo.ici.ro/journal/jamo.htm
rioxxterms.type	Journal Article/Review
herts.preservation.rarelyaccessed	true