Uses of Package
dev.nm.misc.algorithm.iterative
-
Classes in dev.nm.misc.algorithm.iterative used by dev.nm.algebra.linear.matrix.doubles.matrixtype.sparse.solver.iterative Class Description IterativeMethod An iterative method is a mathematical procedure that generates a sequence of improving approximate solutions for a class of problems. -
Classes in dev.nm.misc.algorithm.iterative used by dev.nm.misc.algorithm.bb Class Description IterativeMethod An iterative method is a mathematical procedure that generates a sequence of improving approximate solutions for a class of problems. -
Classes in dev.nm.misc.algorithm.iterative used by dev.nm.solver Class Description IterativeMethod An iterative method is a mathematical procedure that generates a sequence of improving approximate solutions for a class of problems. -
Classes in dev.nm.misc.algorithm.iterative used by dev.nm.solver.multivariate.constrained Class Description IterativeMethod An iterative method is a mathematical procedure that generates a sequence of improving approximate solutions for a class of problems. -
Classes in dev.nm.misc.algorithm.iterative used by dev.nm.solver.multivariate.constrained.convex.sdp.pathfollowing Class Description IterativeMethod An iterative method is a mathematical procedure that generates a sequence of improving approximate solutions for a class of problems. -
Classes in dev.nm.misc.algorithm.iterative used by dev.nm.solver.multivariate.constrained.convex.sdp.socp.interiorpoint Class Description IterativeMethod An iterative method is a mathematical procedure that generates a sequence of improving approximate solutions for a class of problems. -
Classes in dev.nm.misc.algorithm.iterative used by dev.nm.solver.multivariate.constrained.convex.sdp.socp.qp.solver.activeset Class Description IterativeMethod An iterative method is a mathematical procedure that generates a sequence of improving approximate solutions for a class of problems. -
Classes in dev.nm.misc.algorithm.iterative used by dev.nm.solver.multivariate.constrained.convex.sdp.socp.qp.solver.socp Class Description IterativeMethod An iterative method is a mathematical procedure that generates a sequence of improving approximate solutions for a class of problems. -
Classes in dev.nm.misc.algorithm.iterative used by dev.nm.solver.multivariate.constrained.general.sqp.activeset Class Description IterativeMethod An iterative method is a mathematical procedure that generates a sequence of improving approximate solutions for a class of problems. -
Classes in dev.nm.misc.algorithm.iterative used by dev.nm.solver.multivariate.geneticalgorithm.minimizer.deoptim Class Description IterativeMethod An iterative method is a mathematical procedure that generates a sequence of improving approximate solutions for a class of problems. -
Classes in dev.nm.misc.algorithm.iterative used by dev.nm.solver.multivariate.geneticalgorithm.minimizer.simplegrid Class Description IterativeMethod An iterative method is a mathematical procedure that generates a sequence of improving approximate solutions for a class of problems. -
Classes in dev.nm.misc.algorithm.iterative used by dev.nm.solver.multivariate.unconstrained.c2 Class Description IterativeMethod An iterative method is a mathematical procedure that generates a sequence of improving approximate solutions for a class of problems. -
Classes in dev.nm.misc.algorithm.iterative used by dev.nm.solver.multivariate.unconstrained.c2.conjugatedirection Class Description IterativeMethod An iterative method is a mathematical procedure that generates a sequence of improving approximate solutions for a class of problems. -
Classes in dev.nm.misc.algorithm.iterative used by dev.nm.solver.multivariate.unconstrained.c2.quasinewton Class Description IterativeMethod An iterative method is a mathematical procedure that generates a sequence of improving approximate solutions for a class of problems. -
Classes in dev.nm.misc.algorithm.iterative used by dev.nm.solver.multivariate.unconstrained.c2.steepestdescent Class Description IterativeMethod An iterative method is a mathematical procedure that generates a sequence of improving approximate solutions for a class of problems.