module documentation
A collection of boundary and (in future) constraints handling classes.
Class 

Augmented Lagrangian with adaptation of the coefficients 
Class 

quick hack versatile base class 
Class 

no boundaries 
Class 

Compute a bound penalty and update coordinatewise penalty weights. 
Class 

Handle boundaries by a smooth, piecewise linear and quadratic transformation into the feasible domain. 
Class 

Construct an unconstrained objective function from constraints. 
Class 

Biobjective Pareto archive to store some Pareto optimal solutions for constrained optimization. 
Class 

An array/list of successive samesign counts. 
Class 

a queue with (in case) elementwise cdf computation. 
Class 

list of loggers with plot method 
Class 

evaluate and store f and gvalues of a population in attributes F and G. 
Function  constraints 
return dictionary with arg values, mainly there to unify names 
Function  _g 
Undocumented 
Function  _g 
Undocumented 
Function  _g 
Undocumented 
Function  _get 
avoid unpicklable lambda construct 
Function  _log 
Undocumented 
Function  _log 
Undocumented 
Function  _log 
for active constraints, lam is generally positive because Dg and Df are opposed 
Function  _log 
Undocumented 