Abstract: In this study, we study the application of a kind of nonmonotone line search in BFGS algorithm for solving unconstrained optimization problems. This nonmonotone line search is belongs to Armijo-type line searches and when the step size is being computed at each iteration, the initial test step size can be adjusted according to the characteristics of objective functions. The global con...

An extension of the global convergence framework for unconstrained derivative free optimization methods is presented. The extension makes it possible for the framework to include optimization methods with varying cardinality of the ordered direction set. Grid-based search methods are shown to be a special case of the more general extended global convergence framework. Furthermore, the required ...

Ensemble approaches introduced in the Extreme Learning Machine literature mainly come from methods that rely on data sampling procedures, under assumption training are heterogeneously enough to set up diverse base learners. To overcome this assumption, it was proposed an ELM ensemble method based Negative Correlation framework, called (NCELM). This model works two stages: (i) different ELMs gen...

0. Introduction. The QR algorithm was developed by Francis (1960) to find the eigenvalues (or roots) of real or complex matrices. We shall consider it here in the context of exact arithmetic. Sufficient conditions for convergence, listed in order of increasing generality have been given by Francis [1], Kublanovskaja [3], Parlett [4], and Wilkinson [8]. It seems that necessary and sufficient con...