Most
constructor(problemDefinition: ProblemDefinition, center: DoubleArray, visited: List<DoubleArray>)(source)
Parameters
problem
the problem whose feasible region the MPA refines
center
the current best point x*, in the problem's input order
visited
the set of previously visited points (each in the problem's input order); the center itself, if present, contributes no constraint and is ignored