economic dispatch with valve point effect and prohibited operating zones (pozs) is a non-convex and discontinuous optimization problem. harmony search (hs) is one of the recently presented meta-heuristic algorithms for solving optimization problems, which has different variants. the performances of these variants are severely affected by selection of different parameters of the algorithm. intel...

Nowadays, solving nonsmooth (not necessarily differentiable) optimization problems plays a very important role in many areas of industrial applications. Most of the algorithms developed so far deal only with nonsmooth convex functions. In this paper, we propose a new algorithm for solving nonsmooth optimization problems that are not assumed to be convex. The algorithm combines the traditional c...

Nowadays, solving nonsmooth (not necessarily differentiable) optimization problems plays a very important role in many areas of industrial applications. Most of the algorithms developed so far deal only with nonsmooth convex functions. In this paper, we propose a new algorithm for solving nonsmooth optimization problems that are not assumed to be convex. The algorithm combines the traditional c...

Two corrector-predictor interior point algorithms are proposed for solving monotone linear complementarity problems. The algorithms produce a sequence of iterates in the N− ∞ neighborhood of the central path. The first algorithm uses line search schemes requiring the solution of higher order polynomial equations in one variable, while the line search procedures of the second algorithm can be im...

This lecture provides an in-depth explanation of ellipsoid algorithm which was developed in 1979 by a Soviet mathematician L.G. Khachian. Ellipsoid algorithm is the first polynomial-time linear programming algorithm which also knows as Khachiyan’s algorithm to acknowledge Khachiyan’s discovery. This algorithm is fundamentally different from Simplex Algorithm in a sense that it does not exploit ...

We propose a new technique for minimization of convex functions not necessarily smooth. Our approach employs an equivalent constrained optimization problem and approximated linear programs obtained with cutting planes. At each iteration a search direction and a step length are computed. If the step length is considered “non serious”, a cutting plane is added and a new search direction is comput...

This paper proposes a novel hybrid algorithm namely APSO-BFO which combines merits of Bacterial Foraging Optimization (BFO) algorithm and Adaptive Particle Swarm Optimization (APSO) algorithm to determine the optimal PID parameters for control of nonlinear systems. To balance between exploration and exploitation, the proposed hybrid algorithm accomplishes global search over the whole search spa...

This paper proposes a novel hybrid algorithm namely APSO-BFO which combines merits of Bacterial Foraging Optimization (BFO) algorithm and Adaptive Particle Swarm Optimization (APSO) algorithm to determine the optimal PID parameters for control of nonlinear systems. To balance between exploration and exploitation, the proposed hybrid algorithm accomplishes global search over the whole search spa...

gravitational search algorithm (gsa) is one of the newest swarm based optimization algorithms, which has been inspired by the newtonian laws of gravity and motion. gsa has empirically shown to be an efficient and robust stochastic search algorithm. since introducing gsa a convergence analysis of this algorithm has not yet been developed. this paper introduces the first attempt to a formal conve...

In this paper a new method for determining the search area for motion estimation algorithm based on block matching is suggested. In the proposed method the search area is adaptively found for each block of a frame. This search area is similar to that of the full search (FS) algorithm but smaller for most blocks of a frame. Therefore, the proposed algorithm is analogous to FS in terms of reg...