Home | Trees | Indices | Help |
|
---|
|
object --+ | BoundaryHandlerBase --+ | BoundPenalty
Computes the boundary penalty. Must be updated each iteration, using the update method.
The penalty computes like sum(w[i] * (x[i]-xfeas[i])**2),
where xfeas
is the closest feasible (in-bounds) solution from x
.
The weight w[i]
should be updated during each iteration using
the update method.
Example:
>>> import cma >>> cma.fmin(cma.felli, 6 * [1], 1, ... { ... 'boundary_handling': 'BoundPenalty', ... 'bounds': [-1, 1], ... 'fixed_variables': {0: 0.012, 2:0.234} ... })
Reference: Hansen et al 2009, A Method for Handling Uncertainty... IEEE TEC, with addendum, see http://www.lri.fr/~hansen/TEC2009online.pdf
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
Inherited from Inherited from Inherited from |
|
|||
Inherited from |
|
None or bounds[0] and bounds[1]
are lower and upper domain boundaries, each is either None or
a scalar or a list or array of appropriate size.
|
|
x ,where x is a
single solution or a list or array of solutions.
|
counts for each coordinate the number of feasible values in solutions and returns an array of length len(solutions[0]) with the ratios.
|
updates the weights for computing a boundary penalty. Arguments
|
Home | Trees | Indices | Help |
|
---|
Generated by Epydoc 3.0.1 on Tue Mar 3 01:17:17 2015 | http://epydoc.sourceforge.net |