Mathematical Programming

, Volume 100, Issue 1, pp 183–215

Least Frobenius norm updating of quadratic models that satisfy interpolation conditions

  • M.J.D. Powell
Article

Abstract.

Quadratic models of objective functions are highly useful in many optimization algorithms. They are updated regularly to include new information about the objective function, such as the difference between two gradient vectors. We consider the case, however, when each model interpolates some function values, so an update is required when a new function value replaces an old one. We let the number of interpolation conditions, m say, be such that there is freedom in each new quadratic model that is taken up by minimizing the Frobenius norm of the second derivative matrix of the change to the model. This variational problem is expressed as the solution of an (m+n+1)×(m+n+1) system of linear equations, where n is the number of variables of the objective function. Further, the inverse of the matrix of the system provides the coefficients of quadratic Lagrange functions of the current interpolation problem. A method is presented for updating all these coefficients in ({m+n}2) operations, which allows the model to be updated too. An extension to the method is also described that suppresses the constant terms of the Lagrange functions. These techniques have a useful stability property that is investigated in some numerical experiments.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Broyden, C.G., Dennis, J.E., Moré, J.J.: ‘‘On the local and superlinear convergence of quasi-Newton methods’’. J. Inst. Math. Appl. 12, 223–245 (1973)MATHGoogle Scholar
  2. 2.
    Conn, A.R., Gould, N.I.M., Toint, Ph.L.: Trust-Region Methods. MPS–SIAM Series on Optimization, Philadelphia, 2000Google Scholar
  3. 3.
    Conn, A.R., Scheinberg, K., Toint, Ph.L.: ‘‘Recent progress in unconstrained nonlinear optimization without derivatives’’. Math. Program. 79, 397–414 (1997)CrossRefMathSciNetGoogle Scholar
  4. 4.
    Fletcher, R.: Practical Methods of Optimization. John Wiley & Sons, Chichester, 1987Google Scholar
  5. 5.
    Powell, M.J.D.: ‘‘Direct search algorithms for optimization calculations’’. Acta Numerica 7, 287–336 (1998)MATHGoogle Scholar
  6. 6.
    Powell, M.J.D.: ‘‘On the Lagrange functions of quadratic models that are defined by interpolation’’. Optim. Meth. Softw. 16, 289–309 (2001)MathSciNetMATHGoogle Scholar
  7. 7.
    Powell, M.J.D.: ‘‘UOBYQA: unconstrained optimization by quadratic approximation’’. Math. Program. 92, 555–582 (2002)CrossRefMathSciNetMATHGoogle Scholar
  8. 8.
    Powell, M.J.D.: ‘‘On trust region methods for unconstrained minimization without derivatives’’. Math. Program. 97, 605–623 (2003)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • M.J.D. Powell
    • 1
  1. 1.Department of Applied Mathematics and Theoretical PhysicsCentre for Mathematical Sciences, University of CambridgeCambridgeEngland

Personalised recommendations