org.spaceroots.mantissa.optimization

Interface ConvergenceChecker

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.

Version:

$Id: ConvergenceChecker.java 1580 2004-07-15 20:13:43Z luc $

Author:

L. Maisonobe

Method Summary

Modifier and Type	Method and Description
boolean	converged(PointCostPair[] simplex) Check if the optimization algorithm has converged on the simplex.

Method Detail

converged

boolean converged(PointCostPair[] simplex)

Check if the optimization algorithm has converged on the simplex.

Parameters:

simplex - ordered simplex (all points in the simplex have been eavluated and are sorted from lowest to largest cost)

Returns:

true if the algorithm is considered to have converged