|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||
public interface ConvergenceChecker
This interface specifies how to check if a direct search method has converged.
Deciding if convergence has been reached is a problem-dependent issue. The user should provide a class implementing this interface to allow the optimization algorithm to stop its search according to the problem at hand.
| Method Summary | |
|---|---|
boolean |
converged(PointCostPair[] simplex)
Check if the optimization algorithm has converged on the simplex. |
| Method Detail |
|---|
boolean converged(PointCostPair[] simplex)
simplex - ordered simplex (all points in the simplex have
been eavluated and are sorted from lowest to largest cost)
|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||