.png){kind=icon}
Return
Coevolutionary augmented Lagrangian methods for constrained optimization
.png){kind=icon}
PRE
AI
DOI：10.1109/4235.850652.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper introduces a coevolutionary method developed for solving constrained optimization problems, This algorithm is based on the evolution of two populations with opposite objectives to solve saddle-point problems, The augmented Lagrangian approach is taken to transform a constrained optimization problem to a zero-sum game with the saddle-point solution. The populations of the parameter vector and the multiplier vector approximate the zero-sum game by a static matrix game, in which the fitness of individuals is determined according to the security strategy of each population group. Selection, recombination, and mutation are done by using the evolutionary mechanism of conventional evolutionary algorithms such as evolution strategies, evolutionary programming, and genetic algorithms. Four benchmark problems are solved to demonstrate that the proposed coevolutionary method provides consistent solutions with better numerical accuracy than other evolutionary methods.
Keywords:
constrained optimization
evolutionary computation
Lagrangian methods
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
12
Papers:
1.8K
Citations:
2.4W
Organization
No organization information available
.png){kind=icon}
