|
||||||||||
PREV NEXT | FRAMES NO FRAMES |
Packages that use Time | |
---|---|
de.jstacs.algorithms.optimization | Provides classes for different types of algorithms that are not directly linked to the modelling components of Jstacs: Algorithms on graphs, algorithms for numerical optimization, and a basic alignment algorithm. |
de.jstacs.utils | This package contains a bundle of useful classes and interfaces like ... |
Uses of Time in de.jstacs.algorithms.optimization |
---|
Methods in de.jstacs.algorithms.optimization with parameters of type Time | |
---|---|
static int |
Optimizer.conjugateGradientsFR(DifferentiableFunction f,
double[] currentValues,
Optimizer.TerminationCondition terminationMode,
double eps,
double linEps,
StartDistanceForecaster startDistance,
SafeOutputStream out,
Time t)
The conjugate gradient algorithm by Fletcher and Reeves. |
static int |
Optimizer.conjugateGradientsPR(DifferentiableFunction f,
double[] currentValues,
Optimizer.TerminationCondition terminationMode,
double eps,
double linEps,
StartDistanceForecaster startDistance,
SafeOutputStream out,
Time t)
The conjugate gradient algorithm by Polak and Ribiere. |
static int |
Optimizer.conjugateGradientsPRP(DifferentiableFunction f,
double[] currentValues,
Optimizer.TerminationCondition terminationMode,
double eps,
double linEps,
StartDistanceForecaster startDistance,
SafeOutputStream out,
Time t)
The conjugate gradient algorithm by Polak and Ribiere called Polak-Ribiere-Positive. |
static int |
Optimizer.limitedMemoryBFGS(DifferentiableFunction f,
double[] currentValues,
byte m,
Optimizer.TerminationCondition terminationMode,
double eps,
double linEps,
StartDistanceForecaster startDistance,
SafeOutputStream out,
Time t)
The Broyden-Fletcher-Goldfarb-Shanno version of limited memory quasi Newton methods. |
static int |
Optimizer.optimize(byte algorithm,
DifferentiableFunction f,
double[] currentValues,
Optimizer.TerminationCondition terminationMode,
double eps,
double linEps,
StartDistanceForecaster startDistance,
SafeOutputStream out,
Time t)
This method enables you to use all different implemented optimization algorithms by only one method. |
static int |
Optimizer.quasiNewtonBFGS(DifferentiableFunction f,
double[] currentValues,
Optimizer.TerminationCondition terminationMode,
double eps,
double linEps,
StartDistanceForecaster startDistance,
SafeOutputStream out,
Time t)
The Broyden-Fletcher-Goldfarb-Shanno version of quasi Newton method. |
static int |
Optimizer.quasiNewtonDFP(DifferentiableFunction f,
double[] currentValues,
Optimizer.TerminationCondition terminationMode,
double eps,
double linEps,
StartDistanceForecaster startDistance,
SafeOutputStream out,
Time t)
The Davidon-Fletcher-Powell version of quasi Newton method. |
static int |
Optimizer.steepestDescent(DifferentiableFunction f,
double[] currentValues,
Optimizer.TerminationCondition terminationMode,
double eps,
double linEps,
StartDistanceForecaster startDistance,
SafeOutputStream out,
Time t)
The steepest descent. |
Uses of Time in de.jstacs.utils |
---|
Subclasses of Time in de.jstacs.utils | |
---|---|
class |
RealTime
This is a very simple implementation of Time. |
class |
UserTime
This is an implementation of Time that uses an native method. |
Constructors in de.jstacs.utils with parameters of type Time | |
---|---|
TimeLimitedProgressUpdater(Time t,
int sec,
int min,
int hours,
int days)
Creates a new TimelimitedProgressUpdater. |
|
||||||||||
PREV NEXT | FRAMES NO FRAMES |