Search Results

In the crowded environment of bio-inspired population-based metaheuristics, the Salp Swarm Optimization (SSO) algorithm recently appeared and immediately gained a lot of momentum. Inspired by the peculiar spatial arrangement of salp ...

• Critical analysis of the widely-used salp optimization algorithm (SSO).
• ...

We introduce a new interval global optimization method for solving bound constrained problems. The method originates from a small standalone software and is implemented in the COCONUT Environment, a framework designed for the development of complex ...

An active set truncated Newton method for large-scale bound constrained optimization is proposed. The active sets are guessed by an identification technique. The search direction consists of two parts: some of the components are simply defined; the ...

In this paper we present a multi-start particle swarm optimization algorithm for the global optimization of a function subject to bound constraints. The procedure consists of three main steps. In the initialization phase, an opposition learning strategy ...

In this paper, we propose an active set modified Polak---Ribiére---Polyak method for solving large-scale optimization with simple bounds on the variables. The active set is guessed by an identification technique at each iteration and the recently ...

We consider the problem of minimizing a continuously differentiable function of several variables subject to simple bound constraints where some of the variables are restricted to take integer values. We assume that the first order derivatives of the ...

A algorithm for solving nonlinear optimization problems with simple bounds is described. The constraint is treated with the gradient projection method. The applied line search technology couples the monotone line search technology and nonmonotone line ...

In this paper, by introducing a new nonmonotone line search technique and combining it with the spectral projected gradient method, we propose a solution method for solving the bound constrained optimization problems. Under mild conditions, we obtain ...