The problem of finding a geodesic joining given points x0; x1 in a connected complete Riemannian manifold requires much more effort than determining a geodesic from initial data. Boundary value problems of this type are sometimes solved using shooting methods, which work best when good initial guesses are available, especially when x0; x1 are nearby. Galerkin methods have their drawbacks too. T...

A hybrid global optimization method, the coevolutionary global optimization algorithm, is proposed which utilizes the self-organized critical state as the mean of diversification of search and the traditional conjugate gradient local minimization method as the mean of intensification of search. The former has been recently used by Boettcher and Percus (Artificial Intelligence 119 (2000) 275) to...

There are two types of digital filters including Infinite Impulse Response (IIR) and Finite Impulse Response (FIR). IIR filters attract more attention as they can decrease the filter order significantly compared to FIR filters. Owing to multi-modal error surface, simple powerful optimization techniques should be utilized in designing IIR digital filters to avoid local minimum. Imperialist compe...

Abtstract A generalization of the multistart algorithm is proposed for nding the global minimizer of a nonlinear function of n variables. Our method concentrates a quasirandom sample by performing a few inexpensive local searches. The sample is then reduced by replacing worse points by new quasirandom points. A complete local search is performed only on those points with small function values. ...

MOTIVATION Homologous sequences are sometimes similar over some regions but different over other regions. Homologous sequences have a much lower global similarity if the different regions are much longer than the similar regions. RESULTS We present a generalized global alignment algorithm for comparing sequences with intermittent similarities, an ordered list of similar regions separated by d...

in this work, harmony search meta-heuristic optimization algorithm has been developed for aerodynamic shape optimization problem for the first time. the aerodynamic shape, which has been investigated, is an airfoil with parces method for its shape parameterization. the problem was minimization of aerodynamic objective function using inverse design method and the objective function has been the ...

A well-known clustering algorithm is K-means. This algorithm, besides advantages such as high speed and ease of employment, suffers from the problem of local optima. In order to overcome this problem, a lot of studies have been done in clustering. This paper presents a hybrid Extended Cuckoo Optimization Algorithm (ECOA) and K-means (K), which is called ECOA-K. The COA algorithm has advantages ...

knowing the fact that the main weakness of the most standard methods including k-means and hierarchical data clustering is their sensitivity to initialization and trapping to local minima, this paper proposes a modification of convex data clustering  in which there is no need to  be peculiar about how to select initial values. due to properly converting the task of optimization to an equivalent...

This paper presents a robust hybrid improved dolphin echolocation and ant colony optimization algorithm (IDEACO) for optimization of truss structures with discrete sizing variables. The dolphin echolocation (DE) is inspired by the navigation and hunting behavior of dolphins. An improved version of dolphin echolocation (IDE), as the main engine, is proposed and uses the positive attributes of an...