Summary
The NEWUOA software seeks the least value of a function F(x), x∈Rn, when F(x) can be calculated for any vector of variables x. The algorithm is iterative, a quadratic model Q≈F being required at the beginning of each iteration, which is used in a trust region procedure for adjusting the variables. When Q is revised, the new Q interpolates F at m points, the value m = 2n + 1 being recommended. The remaining freedom in the new Q is taken up by minimizing the Frobenius norm of the change to ∇2Q. Only one interpolation point is altered on each iteration. Thus, except for occasional origin shifts, the amount of work per iteration is only of order (m+n)2, which allows n to be quite large. Many questions were addressed during the development of NEWUOA, for the achievement of good accuracy and robustness. They include the choice of the initial quadratic model, the need to maintain enough linear independence in the interpolation conditions in the presence of computer rounding errors, and the stability of the updating of certain matrices that allow the fast revision of Q. Details are given of the techniques that answer all the questions that occurred. The software was tried on several test problems. Numerical results for nine of them are reported and discussed, in order to demonstrate the performance of the software for up to 160 variables.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
A.G. Buckley, Test functions for unconstrained minimization, Technical Report CS-3, Dalhousie University, Canada, (1989).
A.R. Conn, N.I.M. Gould, M. Lescrenier and Ph.L. Toint, Performance of a multifrontal scheme for partially separable optimization, in Advances in Optimization and Numerical Analysis, eds. Susana Gomez and Jean-Pierre Hennart, Kluwer Academic (Dordrecht), pp. 79–96, (1994).
A.R. Conn, N.I.M. Gould and Ph.L. Toint, Trust-Region Methods, MPS-SIAM Series on Optimization (Philadelphia), (2000).
J.E. Dennis and R.B. Schnabel, Numerical Methods for Unconstrained Optimization and Nonlinear Equations, Prentice Hall (Englewood Cliffs), (1983).
R. Fletcher and C.M. Reeves, Function minimization by conjugate gradients, Computer J., Vol. 7, pp. 149–154, (1964).
M.J.D. Powell, On the Lagrange functions of quadratic models that are defined by interpolation, Optim. Meth. Software, Vol. 16, pp. 289–309, (2001).
M.J.D. Powell, UOBYQA: unconstrained optimization by quadratic approximation, Math. Programming, Vol. 92, pp. 555–582, (2002).
M.J.D. Powell, On trust region methods for unconstrained minimization without derivatives, Math. Programming, Vol. 97, pp. 605–623, (2003).
M.J.D. Powell, Least Frobenius norm updating of quadratic models that satisfy interpolation conditions, Math. Programming, Vol. 100, pp. 183–215, (2004).
M.J.D. Powell, On the use of quadratic models in unconstrained minimization without derivatives, Optim. Meth. Software, Vol. 19, pp. 399–411, (2004).
M.J.D. Powell, On updating the inverse of a KKT matrix, in Numerical Linear Algebra and Optimization, ed. Ya-xiang Yuan, Science Press (Beijing), pp. 56–78, (2004).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer Science+Business Media, Inc.
About this chapter
Cite this chapter
Powell, M.J.D. (2006). The NEWUOA software for unconstrained optimization without derivatives. In: Di Pillo, G., Roma, M. (eds) Large-Scale Nonlinear Optimization. Nonconvex Optimization and Its Applications, vol 83. Springer, Boston, MA. https://doi.org/10.1007/0-387-30065-1_16
Download citation
DOI: https://doi.org/10.1007/0-387-30065-1_16
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-30063-4
Online ISBN: 978-0-387-30065-8
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)