From: Bio-inspired computational heuristics to study Lane–Emden systems arising in astrophysics model
Methods | Parameter | Setting | Parameter | Setting |
---|---|---|---|---|
SQP | Initial weight vector creation | Randomly between (−1, 1) | Maximum function evaluation | 10000 |
Number of variable | 30 | Fitness limit | 10−25 | |
Total initial weight vectors | 1000 | X tolerance | 10−25 | |
Number of iterations | 10000 | Function tolerance | 10−30 | |
Derivative | By solvers | Nonlinear constraint tolerance | 10−30 | |
Finite difference type | Central | Upper bound | −10 | |
Hessian | BFGS | Lower bound | 10 | |
Algorithm | SQP | Others | Default | |
PS | Solver | Pattern search | Maximum size | Inf |
Start point | Randn (1, 30) | Scale | On | |
Poll method | GPS positive 2N | Bind tolerance | 10−03 | |
Complete poll | Off | Maximum iteration | 2000 | |
Polling order | Consecutive | Max function evaluation | 1,000,000 | |
Initial size | 1 | X tolerance | 10−25 | |
Expansion factor | 2 | Function tolerance | 10−30 | |
Tolerance | Eps | Nonlinear constraint tolerance | 10−30 | |
Mesh tolerance | 10−32 | Plot | Function value | |
GA | Solver | GA | Pop type | Double vector |
No of variables | 30 | Pop size | [30, 30, 30, 30, 30, 30, 30, 30, 30] | |
Time limit | Default | Initial range | [0,1] | |
Generations | 1,000,000 | Scaling fun | Rank | |
Stall generations | 2000 | Selection fun | Stochastic | |
Function tolerance | 10−28 | Interval | 20 | |
Nonlinear constraint tolerance | 10−28 | Fraction | 0.2 | |
Initial penalty | 10 | Plot | Best function | |
Penalty factor | 100 | Elite count | 2 | |
Crossover | Forward | Time limit | Inf | |
Direction | Forward | Other | Defaults |