Incomplete series expansion for function approximation

Albert A. Groenwold

doi:10.1007/s00158-006-0070-6

2007-01-09

PRE

Albert A. Groenwold *

L.F.P. Etman

J. A. Snyman

J.E. Rooda

DOI：10.1007/s00158-006-0070-6

原文链接

原文求助

摘要

En 中文

We present an incomplete series expansion (ISE) as a basis for function approximation. The ISE is expressed in terms of an approximate Hessian matrix, which may contain second, third, and even higher order main or diagonal terms, but which excludes interaction or off-diagonal terms. From the ISE, a family of approximation functions may be derived. The approximation functions may be based on an arbitrary number of previously sampled points, and any of the function and gradient values at suitable previously sampled points may be enforced when deriving the approximation functions. When function values only are enforced, the storage requirements are minimal. However, irrespective of the conditions enforced, the approximate Hessian matrix is a sparse diagonal matrix. In addition, the resultant approximations are separable. Hence, the proposed approximation functions are very well-suited for use in gradient-based sequential approximate optimization requiring computationally expensive simulations; a typical example is structural design problems with many design variables and constraints. We derived a wide selection of approximations from the family of ISE approximating functions; these include approximations based on the substitution of reciprocal and exponential intervening variables. A comparison with popular approximating functions previously proposed illustrates the accuracy and flexibility of the new family of approximation functions. In fact, a number of popular approximating functions previously proposed for structural optimization applications derive from our ISE.

Keyword:

nonlinear function approximation

sequential approximate optimization (SAO)

incomplete series expansion (ISE)