Parameter optimization for differential equations in asset price forecasting


Duran A. , Caginalp G.

OPTIMIZATION METHODS & SOFTWARE, cilt.23, ss.551-574, 2008 (SCI İndekslerine Giren Dergi) identifier identifier

  • Cilt numarası: 23
  • Basım Tarihi: 2008
  • Doi Numarası: 10.1080/10556780801996178
  • Dergi Adı: OPTIMIZATION METHODS & SOFTWARE
  • Sayfa Sayıları: ss.551-574

Özet

A system of nonlinear asset flow differential equations (AFDE) gives rise to an inverse problem involving optimization of parameters that characterize an investor population. The optimization procedure is used in conjunction with daily market prices (MPs) and net asset values to determine the parameters for which the AFDE yield the best fit for the previous n days. Using these optimal parameters, the equations are computed and solved to render a forecast for MPs for the following days. For a number of closed-end funds, the results are statistically closer to the ensuing MPs than the default prediction of random walk (RW). In particular, we perform this optimization by a nonlinear computational algorithm that combines a quasi-Newton weak line search with the Broyden-Fletcher-Goldfarb-Shanno formula. We develop a nonlinear least-square technique with an initial value problem (IVP) approach for arbitrary stream data by focusing on the MP variable P since any real data for the other three variables B, zeta(1), and zeta(2) in the dynamical system is not available explicitly. We minimize the sum of exponentially weighted squared differences F[(K) over tilde] between the true trading prices from Day i to Day i+n-1, and the corresponding computed MPs obtained from the first row vector of the numerical solution U of the IVP with AFDE for ith optimal parameter vector, where (K) over tilde is an initial parameter vector. Here, the gradient (del F(x)) is approximated by using the central difference formula, and step length s is determined by the backtracking line search. One of the novel components of the proposed asset flow optimization forecast algorithm is a dynamic initial parameter pool that contains most recently used successful parameters, besides the various fixed parameters from a set of grid points in a hyper-box.