|
SuanShu, a Java numerical and statistical library | |||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||
java.lang.Objectcom.numericalmethod.suanshu.optimization.constrained.integer.BruteForce
public class BruteForce
| Constructor Summary | |
|---|---|
BruteForce()
|
|
BruteForce(ConstrainedMinimizerFactory solverFactory)
|
|
| Method Summary | |
|---|---|
double |
minimum()
Get the minimum found. |
Vector |
search(int maxIterations,
Vector... initials)
Search for a minimizer that minimizes the objective function from the given starting points. |
void |
solve(IntegerConstrainedProblem problem,
double tol)
|
| Methods inherited from class java.lang.Object |
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
| Constructor Detail |
|---|
public BruteForce(ConstrainedMinimizerFactory solverFactory)
public BruteForce()
| Method Detail |
|---|
public void solve(IntegerConstrainedProblem problem,
double tol)
solve in interface IntegerConstrainedMinimizer
public Vector search(int maxIterations,
Vector... initials)
Minimizer
search in interface MinimizermaxIterations - the maximum number of iterationsinitials - the initial guesses; they could include information such as boundaries
public double minimum()
MinimizerThis is especially useful for an objective function that takes a long time to compute.
minimum in interface Minimizer
|
SuanShu, a Java numerical and statistical library | |||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||