Projects per year
We present a multilevel numerical algorithm for the exact solution of the Euclidean trust-region subproblem. This particular subproblem typically arises when optimizing a nonlinear (possibly non-convex) objective function whose variables are discretized continuous functions, in which case the different levels of discretization provide a natural multilevel context. The trust-region problem is considered at the highest level (corresponding to the finest discretization), but information on the problem curvature at lower levels is exploited for improved efficiency. The algorithm is inspired by the method described in [J.J. More and D.C. Sorensen, On the use of directions of negative curvature in a modified Newton method, Math. Program. 16(1) (1979), pp. 1-20], for which two different multilevel variants will be analysed. Some preliminary numerical comparisons are also presented. © 2009 Taylor & Francis.
FingerprintDive into the research topics of 'A multilevel algorithm for solving the trust-region subproblem'. Together they form a unique fingerprint.
4 Sep 2009
Student thesis: Doc types › Doctor of SciencesFile