Show simple item record

dc.contributor.authorBartholomew-Biggs, Michael
dc.contributor.authorBeddiaf, Salah
dc.contributor.authorKane, Stephen
dc.date.accessioned2013-04-08T12:59:43Z
dc.date.available2013-04-08T12:59:43Z
dc.date.issued2013
dc.identifier.citationBartholomew-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.issn1841-4311
dc.identifier.otherPURE: 1695647
dc.identifier.otherPURE UUID: 27527c47-d1ba-47ed-8753-ce3bc2bbbf0f
dc.identifier.urihttp://hdl.handle.net/2299/10318
dc.description.abstractThis 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 resultsen
dc.language.isoeng
dc.relation.ispartofAdvanced Modeling and Optimization
dc.titleTraversing non-convex regionsen
dc.contributor.institutionSchool of Physics, Astronomy and Mathematics
dc.contributor.institutionScience & Technology Research Institute
dc.description.statusPeer reviewed
dc.identifier.urlhttp://camo.ici.ro/journal/jamo.htm
rioxxterms.versionVoR
rioxxterms.typeJournal Article/Review
herts.preservation.rarelyaccessedtrue


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record