A multilevel algorithm for solving the trust-region subproblem

Philippe Toint, D. Tomanos, Melissa Weber Mendonca

Research output: Contribution to journalArticlepeer-review

131 Downloads (Pure)


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.
Original languageEnglish
Pages (from-to)299-311
Number of pages13
JournalOptimization Methods and Software
Issue number2
Publication statusPublished - 1 Apr 2009


Dive into the research topics of 'A multilevel algorithm for solving the trust-region subproblem'. Together they form a unique fingerprint.

Cite this