Uses of Class
de.jstacs.utils.Time

Packages that use Time

Package	Description
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.algorithms.optimization.termination	Provides classes for termination conditions that can be used in algorithms.
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

Modifier and Type	Method and Description
static int	Optimizer.conjugateGradientsFR(DifferentiableFunction f, double[] currentValues, TerminationCondition terminationMode, double linEps, StartDistanceForecaster startDistance, OutputStream out, Time t) The conjugate gradient algorithm by Fletcher and Reeves.
static int	Optimizer.conjugateGradientsPR(DifferentiableFunction f, double[] currentValues, TerminationCondition terminationMode, double linEps, StartDistanceForecaster startDistance, OutputStream out, Time t) The conjugate gradient algorithm by Polak and Ribière.
static int	Optimizer.conjugateGradientsPRP(DifferentiableFunction f, double[] currentValues, TerminationCondition terminationMode, double linEps, StartDistanceForecaster startDistance, OutputStream out, Time t) The conjugate gradient algorithm by Polak and Ribière called "Polak-Ribière-Positive".
static int	Optimizer.limitedMemoryBFGS(DifferentiableFunction f, double[] currentValues, byte m, TerminationCondition terminationMode, double linEps, StartDistanceForecaster startDistance, OutputStream 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, TerminationCondition terminationMode, double linEps, StartDistanceForecaster startDistance, OutputStream 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, TerminationCondition terminationMode, double linEps, StartDistanceForecaster startDistance, OutputStream out, Time t) The Broyden-Fletcher-Goldfarb-Shanno version of the quasi-Newton method.
static int	Optimizer.quasiNewtonDFP(DifferentiableFunction f, double[] currentValues, TerminationCondition terminationMode, double linEps, StartDistanceForecaster startDistance, OutputStream out, Time t) The Davidon-Fletcher-Powell version of the quasi-Newton method.
static int	Optimizer.steepestDescent(DifferentiableFunction f, double[] currentValues, TerminationCondition terminationMode, double linEps, StartDistanceForecaster startDistance, OutputStream out, Time t) The steepest descent.

Uses of Time in de.jstacs.algorithms.optimization.termination

Methods in de.jstacs.algorithms.optimization.termination with parameters of type Time

Modifier and Type	Method and Description
boolean	TimeCondition.doNextIteration(int iteration, double f_last, double f_current, double[] gradient, double[] direction, double alpha, Time t)
boolean	TerminationCondition.doNextIteration(int iteration, double f_last, double f_current, double[] gradient, double[] direction, double alpha, Time t) This method allows to decide whether to do another iteration in an optimization or not.
boolean	SmallStepCondition.doNextIteration(int iteration, double f_last, double f_current, double[] gradient, double[] direction, double alpha, Time t)
boolean	SmallGradientConditon.doNextIteration(int iteration, double fLast, double fCurrent, double[] gradient, double[] direction, double alpha, Time t)
boolean	SmallDifferenceOfFunctionEvaluationsCondition.doNextIteration(int iteration, double f_last, double f_current, double[] gradient, double[] direction, double alpha, Time t)
boolean	MultipleIterationsCondition.doNextIteration(int iteration, double f_last, double f_current, double[] gradient, double[] direction, double alpha, Time t)
boolean	IterationCondition.doNextIteration(int iteration, double f_last, double f_current, double[] gradient, double[] direction, double alpha, Time t)
boolean	CombinedCondition.doNextIteration(int iteration, double f_last, double f_current, double[] gradient, double[] direction, double alpha, Time t)
boolean	AbsoluteValueCondition.doNextIteration(int iteration, double f_last, double f_current, double[] gradient, double[] direction, double alpha, Time t) Deprecated.

Uses of Time in de.jstacs.utils

Subclasses of Time in de.jstacs.utils

Modifier and Type	Class and Description
class	RealTime This is a very simple implementation of Time.
class	UserTime This is an implementation of Time that uses a native method.

Methods in de.jstacs.utils that return Time

Modifier and Type	Method and Description
static Time	Time.getTimeInstance(OutputStream out) This method tries to return a UserTime instance, if not possible (due to native code) it returns a RealTime instance.

Constructors in de.jstacs.utils with parameters of type Time

Constructor and Description
TimeLimitedProgressUpdater(Time t, int sec, int min, int hours, int days) Creates a new TimeLimitedProgressUpdater.