Skip to main content
Log in

Least Frobenius norm updating of quadratic models that satisfy interpolation conditions

  • Published:
Mathematical Programming Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  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)

    MATH  Google Scholar 

  2. Conn, A.R., Gould, N.I.M., Toint, Ph.L.: Trust-Region Methods. MPS–SIAM Series on Optimization, Philadelphia, 2000

  3. Conn, A.R., Scheinberg, K., Toint, Ph.L.: ‘‘Recent progress in unconstrained nonlinear optimization without derivatives’’. Math. Program. 79, 397–414 (1997)

    Article  MathSciNet  Google Scholar 

  4. Fletcher, R.: Practical Methods of Optimization. John Wiley & Sons, Chichester, 1987

  5. Powell, M.J.D.: ‘‘Direct search algorithms for optimization calculations’’. Acta Numerica 7, 287–336 (1998)

    MATH  Google Scholar 

  6. Powell, M.J.D.: ‘‘On the Lagrange functions of quadratic models that are defined by interpolation’’. Optim. Meth. Softw. 16, 289–309 (2001)

    MathSciNet  MATH  Google Scholar 

  7. Powell, M.J.D.: ‘‘UOBYQA: unconstrained optimization by quadratic approximation’’. Math. Program. 92, 555–582 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  8. Powell, M.J.D.: ‘‘On trust region methods for unconstrained minimization without derivatives’’. Math. Program. 97, 605–623 (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Powell, M. Least Frobenius norm updating of quadratic models that satisfy interpolation conditions. Math. Program., Ser. B 100, 183–215 (2004). https://doi.org/10.1007/s10107-003-0490-7

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10107-003-0490-7

Keywords

Navigation