Trust region algorithms and timestep selection

D.J. Higham

Research output: Contribution to journalArticle

33 Citations (Scopus)

Abstract

Unconstrained optimization problems are closely related to systems of ordinary differential equations (ODEs) with gradient structure. In this work, we prove results that apply to both areas. We analyze the convergence properties of a trust region, or Levenberg--Marquardt, algorithm for optimization. The algorithm may also be regarded as a linearized implicit Euler method with adaptive timestep for gradient ODEs. From the optimization viewpoint, the algorithm is driven directly by the Levenberg--Marquardt parameter rather than the trust region radius. This approach is discussed, for example, in [R. Fletcher, Practical Methods of Optimization, 2nd ed., John Wiley, New York, 1987], but no convergence theory is developed. We give a rigorous error analysis for the algorithm, establishing global convergence and an unusual, extremely rapid, type of superlinear convergence. The precise form of superlinear convergence is exhibited---the ratio of successive displacements from the limit point is bounded above and below by geometrically decreasing sequences. We also show how an inexpensive change to the algorithm leads to quadratic convergence. From the ODE viewpoint, this work contributes to the theory of gradient stability by presenting an algorithm that reproduces the correct global dynamics and gives very rapid local convergence to a stable steady state.
Original languageEnglish
Pages (from-to)194-210
Number of pages16
JournalSIAM Journal on Numerical Analysis
Volume37
Issue number1
DOIs
Publication statusPublished - 1999

Keywords

  • global convergence
  • gradientsystem
  • Levenberg--Marquardt
  • quadratic convergence
  • steady state
  • superlinear convergence
  • unconstrained optimization
  • applied mathematics
  • computer science

Fingerprint Dive into the research topics of 'Trust region algorithms and timestep selection'. Together they form a unique fingerprint.

  • Cite this