OPTIMIZATION OF UNIMODAL FUNCTIONS USING PARABOLIC PREDICTOR search

A combined parabolic predictor search is proposed for the conditional minimization of the unimodal function using the predictive-based selective application of phases of extremum search by golden section search and parabolic search. The formula for calculating the value of parabolic predictor function is given, with its help it is possible to work out the forecast and tactics of extremum search of the minimized function. Predictor includes forecasting extremeness, monotony and constancy of function on a segment of uncertainty. Identification forecast for a direct function is described, using which allows to find a solution in three calculations. The assertion is made that if three successive computations of a function give points with similar ordinates, then abscissa of each point can be a solution of the problem. The procedure of identifying non-direct monotonic functions is described. It is shown that the reliability of monotonicity forecast can be determined by five calculations of the function. There has been described the procedure of using phases of parabolic method, which can be performed at favorable prediction of detecting the internal extremum of function. It has been stated that carrying out these phases, even with favorable forecast, can be considered inexpedient for cases when it is recognized that the problem is weakly sensitive or insensitive to the parabolic forecast. Block diagrams of algorithms implementing the method are given. It is shown that, compared to golden section search, the predictor has 3-5 times faster response for smooth functions and is comparable by this criterion to Brent method. The predictor achieves the greatest speed when minimizing monotonic functions. The method works somewhat slower than golden section search, however, it is much faster than Brent method when searching for the minimum of piecewise, flat, planar and other functions of a similar nature for which approximation of parabola does not give the expected effect. In comparison with Brent method, parabolic predictor has 1.5-4 times more speed in solving problems of such type.

A Measurement Fusion Method for Nonlinear System Identification Using a Cooperative Learning Algorithm

Identification of a general nonlinear noisy system viewed as an estimation of a predictor function is studied in this article. A measurement fusion method for the predictor function estimate is proposed. In the proposed scheme, observed data are first fused by using an optimal fusion technique, and then the optimal fused data are incorporated in a nonlinear function estimator based on a robust least squares support vector machine (LS-SVM). A cooperative learning algorithm is proposed to implement the proposed measurement fusion method. Compared with related identification methods, the proposed method can minimize both the approximation error and the noise error. The performance analysis shows that the proposed optimal measurement fusion function estimate has a smaller mean square error than the LS-SVM function estimate. Moreover, the proposed cooperative learning algorithm can converge globally to the optimal measurement fusion function estimate. Finally, the proposed measurement fusion method is applied to ARMA signal and spatial temporal signal modeling. Experimental results show that the proposed measurement fusion method can provide a more accurate model.

Reconstructing Bifurcation Diagrams of Dynamical Systems Using Measured Time Series

We present an algorithm for reconstructing the bifurcation structure of a dynamical system from time series. The method consists in finding a parameterized predictor function whose bifurcation structure is similar to that of the given system. Nonlinear autoregressive (NAR) models with polynomial terms are employed as predictor functions. The appropriate terms in the NAR models are obtained using a fast orthogonal search scheme. This scheme eliminates the problem of multiparameter optimization and makes the approach robust to noise. The algorithm is applied to the reconstruction of the bifurcation diagram (BD) of a neuron model from the simulated membrane potential waveforms. The reconstructed BD captures the different behaviors of the given system. Moreover, the algorithm also works well even for a limited number of time series.