Search Java Classes and Packages
#Com.numericalmethod.suanshu.misc.algorithm Classes and Interfaces - 21 results found.
| Name | Description | Type | Package | Framework |
| AbsoluteTolerance | The stopping criteria is that the norm of the residual r is equal to or smaller than the specified tolerance, that is, | Class | com.numericalmethod.suanshu.misc.algorithm.iterative.tolerance | SuanShu |
| ActiveList | This interface defines the node popping strategy used in a branch-and-bound algorithm, e. | Interface | com.numericalmethod.suanshu.misc.algorithm.bb | SuanShu |
| ActiveSet | This class keeps track of the active and inactive indices. | Class | com.numericalmethod.suanshu.misc.algorithm | SuanShu |
| AfterIterations | Stops after a given number of iterations. | Class | com.numericalmethod.suanshu.misc.algorithm.stopcondition | SuanShu |
| AfterNoImprovement | Class | com.numericalmethod.suanshu.misc.algorithm.stopcondition | SuanShu | |
| AndStopConditions | Combines an arbitrary number of stop conditions, terminating when all conditions are met. | Class | com.numericalmethod.suanshu.misc.algorithm.stopcondition | SuanShu |
| AtThreshold | Stops when the value reaches a given value with a given precision. | Class | com.numericalmethod.suanshu.misc.algorithm.stopcondition | SuanShu |
| BBNode | A branch-and-bound algorithm maintains a tree of nodes to keep track of the search paths and the pruned paths. | Interface | com.numericalmethod.suanshu.misc.algorithm.bb | SuanShu |
| Bins | This class divides the items based on their keys into a number of bins. | Class | com.numericalmethod.suanshu.misc.algorithm | SuanShu |
| BranchAndBound | Branch-and-Bound (BB or B&B) is a general algorithm for finding optimal solutions of various optimization problems, especially in discrete and combinatorial optimization. | Class | com.numericalmethod.suanshu.misc.algorithm.bb | SuanShu |
| CartesianProduct | The Cartesian product can be generalized to the n-ary Cartesian product over n sets X1, . | Class | com.numericalmethod.suanshu.misc.algorithm | SuanShu |
| CountMonitor | This IterationMonitor counts the number of iterates generated, hence the number of iterations. | Class | com.numericalmethod.suanshu.misc.algorithm.iterative.monitor | SuanShu |
| IteratesMonitor | This IterationMonitor stores all states generated during iterations. | Class | com.numericalmethod.suanshu.misc.algorithm.iterative.monitor | SuanShu |
| IterationMonitor | To debug an iterative algorithm, such as in IterativeMethod, it is useful to keep track of the all states generated in the iterations. | Interface | com.numericalmethod.suanshu.misc.algorithm.iterative.monitor | SuanShu |
| IterativeMethod | An iterative method is a mathematical procedure that generates a sequence of improving approximate solutions for a class of problems. | Interface | com.numericalmethod.suanshu.misc.algorithm.iterative | SuanShu |
| NullMonitor | This IterationMonitor does nothing when a new iterate is added. | Class | com.numericalmethod.suanshu.misc.algorithm.iterative.monitor | SuanShu |
| OrStopConditions | Combines an arbitrary number of stop conditions, terminating when the first condition is met. | Class | com.numericalmethod.suanshu.misc.algorithm.stopcondition | SuanShu |
| RelativeTolerance | The stopping criteria is that the norm of the residual r relative to the input base is equal to or smaller than the specified | Class | com.numericalmethod.suanshu.misc.algorithm.iterative.tolerance | SuanShu |
| StopCondition | Defines when an algorithm stops (the iterations). | Interface | com.numericalmethod.suanshu.misc.algorithm.stopcondition | SuanShu |
| Tolerance | The tolerance criteria for an iterative algorithm to stop. | Interface | com.numericalmethod.suanshu.misc.algorithm.iterative.tolerance | SuanShu |
| VectorMonitor | This IterationMonitor stores all vectors generated during iterations. | Class | com.numericalmethod.suanshu.misc.algorithm.iterative.monitor | SuanShu |