Package dev.nm.solver

Interface IterativeSolution<S>

Type Parameters:
S - the minimizer type
All Superinterfaces:
IterativeMethod<S>, MinimizationSolution<S>
All Known Subinterfaces:
SubProblemMinimizer.IterativeSolution<Vector>
All Known Implementing Classes:
BFGSMinimizer.BFGSImpl, CSDPMinimizer.Solution, DEOptim.Solution, GaussNewtonMinimizer.MySteepestDescent.GaussNewtonImpl, HomogeneousPathFollowingMinimizer.Solution, HuangMinimizer.HuangImpl, NelderMeadMinimizer.Solution, NewtonRaphsonMinimizer.NewtonRaphsonImpl, PowellMinimizer.PowellImpl, PrimalDualInteriorPointMinimizer.Solution, PrimalDualInteriorPointMinimizer1.Solution, PrimalDualPathFollowingMinimizer.Solution, QPbySOCPMinimizer.Solution, QPbySOCPMinimizer1.Solution, QPDualActiveSetMinimizer.Solution, QPPrimalActiveSetMinimizer.Solution, QuasiNewtonMinimizer.QuasiNewtonImpl, SimpleGridMinimizer.Solution, SQPActiveSetMinimizer.Solution, SQPActiveSetOnlyInequalityConstraintMinimizer.Solution, SteepestDescentMinimizer.SteepestDescentImpl, ZangwillMinimizer.ZangwillImpl
public interface IterativeSolution<S> extends MinimizationSolution<S>, IterativeMethod<S>
Many minimization algorithms work by starting from some given initials and iteratively moving toward an approximate solution.
See Also: