A particle swarm–BFGS algorithm for nonlinear programming problems

This article proposes a hybrid optimization algorithm based on a modified BFGS and particle swarm optimization to solve medium scale nonlinear programs. The hybrid algorithm integrates the modified BFGS into particle swarm optimization to solve augmented Lagrangian penalty function. In doing so, the algorithm launches into a global search over the solution space while keeping a detailed exploration into the neighborhoods. To shed light on the merit of the algorithm, we provide a test bed consisting of 30 test problems to compare our algorithm against two of its variations along with two state‐of‐the‐art nonlinear optimization algorithms. The numerical experiments illustrate that the proposed algorithm makes an effective use of hybrid framework when dealing with nonlinear equality constraints although its convergence cannot be guaranteed.