Optimization Online


On solving trust-region and other regularised subproblems in optimization

Sue Dollar( sue.dollar***at***stfc.ac.uk)
Nick Gould( nick.gould***at***stfc.ac.uk )
Daniel Robinson( daniel.robinson***at***comlab.ox.ac.uk)

Abstract: The solution of trust-region and regularisation subproblems which arise in unconstrained optimization is considered. Building on the pioneering work of Gay, More' and Sorensen, methods which obtain the solution of a sequence of parametrized linear systems by factorization are used. Enhancements using high-order polynomial approximation and inverse iteration ensure that the resulting method is both globally and asymptotically at least superlinearly convergent in all cases, including in the notorious hard case. Numerical experiments validate the effectiveness of our approach. The resulting software is available as packages TRS and RQS as part of the GALAHAD optimization library, and is especially designed for large-scale problems.

Keywords: Trust-region subproblem, Cubic-regularisation subproblem, software

Category 1: Nonlinear Optimization (Unconstrained Optimization )

Category 2: Nonlinear Optimization (Quadratic Programming )

Category 3: Optimization Software and Modeling Systems

Citation: RAL Technical Report RAL-TR-2009-003, Rutherford Appleton Laboratory, Oxfordshire OX11 0QX, England

Download: [PDF]

Entry Submitted: 02/13/2009
Entry Accepted: 02/13/2009
Entry Last Modified: 02/13/2009

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Programming Society