A Hybrid Epigraph Directions Method for Nonsmooth and Nonconvex Constrained Optimization via Generalized Augmented Lagrangian Duality and a Genetic Algorithm

Algorithm 1

The generational Genetic Algorithm to minimize the Lagrangian function.

(1) Input:  Parameter popsize, size, , ;

(2) Output:   The best solution found in all generations;

(3) ;

(4) Pop[] = InitializePopulation();

(5) Evaluate (, Pop[]);

(6) while    do

(7) selPop[] = Selection(Pop[]);

(8) newPop[] = Crossover(selPop[]);

(9) Mutation(newPop[]);

(10) Evaluate (, newPop[]);

(11) Pop[] = NewGeneration(newPop[], Pop[]);

(12) ;

(13) end