University of Hertfordshire

From the same journal

By the same authors

Traversing non-convex regions

Research output: Contribution to journalArticlepeer-review


  • 904861

    Final published version, 260 KB, PDF document


View graph of relations
Original languageEnglish
Pages (from-to)387-407
JournalAdvanced Modeling and Optimization
Publication statusPublished - 2013


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

ID: 1695647