An artificial fish swarm algorithm based hyperbolic augmented Lagrangian method

This paper aims to present a hyperbolic augmented Lagrangian (HAL) framework with guaranteed convergence to an ϵ-global minimizer of a constrained nonlinear optimization problem. The bound constrained subproblems that emerge at each iteration k of the framework are solved by an improved artificial fish swarm algorithm. Convergence to an ϵk-global minimizer of the HAL function is guaranteed with probability one, where ϵk→ϵ as k→∞. Preliminary numerical experiments show that the proposed paradigm compares favorably with other penalty-type methods.Fundação para a Ciência e a Tecnologia (FCT

On a hyperbolic augmented lagrangian artificial fish swarm based method: convergence issues

Fundação para a Ciência e a Tecnologia (FCT

Theoretical and practical convergence of a self-adaptive penalty algorithm for constrained global optimization

This paper proposes a self-adaptive penalty function and presents a penalty-based algorithm for solving nonsmooth and nonconvex constrained optimization problems. We prove that the general constrained optimization problem is equivalent to a bound constrained problem in the sense that they have the same global solutions. The global minimizer of the penalty function subject to a set of bound constraints may be obtained by a population-based meta-heuristic. Further, a hybrid self-adaptive penalty firefly algorithm, with a local intensification search, is designed, and its convergence analysis is established. The numerical experiments and a comparison with other penalty-based approaches show the effectiveness of the new self-adaptive penalty algorithm in solving constrained global optimization problems.The authors would like to thank the referees, the Associate Editor and the Editor-in-Chief for their valuable comments and suggestions to improve the paper. This work has been supported by COMPETE: POCI-01-0145-FEDER-007043 and FCT - Funda¸c˜ao para a Ciˆencia e Tecnologia within the projects UID/CEC/00319/2013 and UID/MAT/00013/2013.info:eu-repo/semantics/publishedVersio