this study concerns with a trust-region-based method for solving unconstrained optimization problems. the approach takes the advantages of the compact limited memory bfgs updating formula together with an appropriate adaptive radius strategy. in our approach, the adaptive technique leads us to decrease the number of subproblems solving, while utilizing the structure of limited memory quasi-newt...

In this paper, a new algorithm which is the result of the combination of cellular learning automata and frog leap algorithm (SFLA) is proposed for optimization in continuous, static environments.At the proposed algorithm, each memeplex of frogs is placed in a cell of cellular learning automata. Learning automata in each cell acts as the brain of memeplex, and will determine the strategy of moti...

The paper discusses three major issues First it discusses why it makes sense to approach problems in a hierarchical fashion It de nes the class of hierarchically decomposable functions that can be used to test the algorithms that approach problems in this fashion Finally the Bayesian optimization algorithm BOA is extended in order to solve the proposed class of problems

Comparable to other optimization techniques, the performance of Evolution Strategies (ESs) depends on a suitable choice of internal strategy control parameters. Apart from a xed setting, ESs facilitate an adjustment of such parameters within a selfadaptation process. For step-size control in particular, various adaptation concepts have been evolved early in the development of ESs. These algorit...

Mutagenesis is a process which forces the coverage of certain zones of the search space during the generations of an evolution strategy, by keeping track of the covered ranges for the different variables in the so called gene matrix. Originally introduced as an artifact to control the automated stopping criterion in a memetic algorithm, ESLAT, it also improved the exploration capabilities of th...

We deene Higher Order Recursive Program Schemes (HRPSs) by allowing metasubstitutions (as in the-calculus) in right-hand sides of function and quantiier deenitions. A study of several kinds of similarity of redexes makes it possible to lift properties of ((rst order) Recursive Program Schemes to the higher order case. The main result is the decidability of weak normalization in HRPSs, which imm...

We design a normalizing strategy for orthogonal term rewriting systems (OTRSs), which is a generalization of the call-by-need strategy of Huet-L evy 4]. The redexes contracted in our strategy are essential in the sense that they have \descendants" under any reduction of a given term. There is an essential redex in any term not in normal form. We further show that contraction of the innermost es...