University of Hertfordshire

From the same journal

By the same authors

Traversing non-convex regions

Research output: Contribution to journalArticlepeer-review

Standard

Traversing non-convex regions. / Bartholomew-Biggs, Michael; Beddiaf, Salah; Kane, Stephen.

In: Advanced Modeling and Optimization, Vol. 15, No. 2, 2013, p. 387-407.

Research output: Contribution to journalArticlepeer-review

Harvard

APA

Vancouver

Author

Bartholomew-Biggs, Michael ; Beddiaf, Salah ; Kane, Stephen. / Traversing non-convex regions. In: Advanced Modeling and Optimization. 2013 ; Vol. 15, No. 2. pp. 387-407.

Bibtex

@article{27527c47d1ba47ed8753ce3bc2bbbf0f,
title = "Traversing non-convex regions",
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",
author = "Michael Bartholomew-Biggs and Salah Beddiaf and Stephen Kane",
year = "2013",
language = "English",
volume = "15",
pages = "387--407",
journal = "Advanced Modeling and Optimization",
issn = "1841-4311",
number = "2",

}

RIS

TY - JOUR

T1 - Traversing non-convex regions

AU - Bartholomew-Biggs, Michael

AU - Beddiaf, Salah

AU - Kane, Stephen

PY - 2013

Y1 - 2013

N2 - 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

AB - 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

M3 - Article

VL - 15

SP - 387

EP - 407

JO - Advanced Modeling and Optimization

JF - Advanced Modeling and Optimization

SN - 1841-4311

IS - 2

ER -