We consider a rather general class of mathematical programming problems with data uncertainty, where the uncertainty set is represented by a system of convex inequalities. We prove that the robust counterparts of this class of problems can be equivalently reformulated as finite and explicit optimization problems. Moreover, we develop simplified reformulations for problems with uncertainty sets ...

Abstract Random constraint satisfaction problems (CSPs) can exhibit a phase where the number of constraints per variable α makes system solvable in theory on one hand, but also search for solution hard, meaning that common algorithms such as Monte Carlo (MC) method fail to find solution. The onset this hardness is deeply linked appearance dynamical transition space problem breaks into an expone...

blind source separation technique separates mixed signals blindly without any information on the mixing system. in this paper, we have used two evolutionary algorithms, namely, genetic algorithm and particle swarm optimization for blind source separation. in these techniques a novel fitness function that is based on the mutual information and high order statistics is proposed. in order to evalu...

Robot footstep planning strategies can be divided in two main approaches: discrete searches and continuous optimizations. While discrete searches have been broadly applied, continuous optimizations approaches have been restricted for humanoid platforms. This article introduces a generalized continuous-optimization approach for multilegged footstep planning which can be adapted to different plat...

In this paper we investigate multiplicative noise models in the context of continuous optimization. We illustrate how some intrinsic properties of the noise model imply the failure of reasonable search algorithms for locating the optimum of the noiseless part of the objective function. Those findings are rigorously investigated on the (1 + 1)-ES for the minimization of the noisy sphere function...

In metaheuristic optimization, understanding the relationship between problems and algorithms is important but non-trivial. There has been a growing interest in the literature on techniques for analysing problems, however previous work has mainly been developed for discrete problems. In this paper, we develop a novel framework for characterising continuous optimization problems based on the con...

In this paper we consider a fractional optimization problem that minimizes the ratio of two quadratic functions subject to a strictly convex quadratic constraint. First using the extension of Charnes-Cooper transformation, an equivalent homogenized quadratic reformulation of the problem is given. Then we show that under certain assumptions, it can be solved to global optimality using semidefini...

We consider the speed planning problem for a robotic manipulator. In particular, we present an algorithm for finding the time-optimal speed law along an assigned path that satisfies velocity and acceleration constraints and respects the maximum forces and torques allowed by the actuators. The addressed optimization problem is a finite dimensional reformulation of the continuous-time speed optim...

pumps are among the early instruments invented by humans to be taken advantage of in the use of water utilities. design and operation problem of pumping stations is a type of mixed integer non linear programming, in which gradient based optimization methods are not efficient for solving complex problems of this type. in this regard, such evolutionary optimization algorithms as genetic algorithm...

We explore a general-purpose heuristic algorithm for finding high-quality solutions to continuous optimization problems. The method, called continuous extremal optimization (CEO), can be considered as an extension of extremal optimization and consists of two components, one which is responsible for global searching and the other which is responsible for local searching. The CEO's performance pr...