A particle swarm-BFGS algorithm for nonlinear programming problems

► The article proposes a hybrid optimization algorithm based on a modified BFGS and particle swarm optimization. ► The algorithm launches into a global search over the solution space while keeping a detailed exploration into the neighborhoods. ► 30 benchmark test problems are provided to evaluate the algorithm competency. ► The numerical experiments illustrate that the proposed algorithm makes an effective use of hybrid framework when dealing with nonlinear equality constraints.