Uses of Package
dev.nm.solver

Classes in dev.nm.solver used by dev.nm.misc.algorithm.bb Class Description MinimizationSolution This is the solution to a minimization problem. 
Classes in dev.nm.solver used by dev.nm.root.univariate Class Description MinimizationSolution This is the solution to a minimization problem.Minimizer This interface represents an optimization algorithm that minimizes a real valued objective function, one or multi dimension.Optimizer Optimization, or mathematical programming, refers to choosing the best element from some set of available alternatives. 
Classes in dev.nm.solver used by dev.nm.root.univariate.bracketsearch Class Description MinimizationSolution This is the solution to a minimization problem.Minimizer This interface represents an optimization algorithm that minimizes a real valued objective function, one or multi dimension.Optimizer Optimization, or mathematical programming, refers to choosing the best element from some set of available alternatives. 
Classes in dev.nm.solver used by dev.nm.solver Class Description MaximizationSolution This is the solution to a maximization problem.MinimizationSolution This is the solution to a minimization problem.Optimizer Optimization, or mathematical programming, refers to choosing the best element from some set of available alternatives. 
Classes in dev.nm.solver used by dev.nm.solver.multivariate.constrained Class Description IterativeSolution Many minimization algorithms work by starting from some given initials and iteratively moving toward an approximate solution.MinimizationSolution This is the solution to a minimization problem.Minimizer This interface represents an optimization algorithm that minimizes a real valued objective function, one or multi dimension.Optimizer Optimization, or mathematical programming, refers to choosing the best element from some set of available alternatives. 
Classes in dev.nm.solver used by dev.nm.solver.multivariate.constrained.convex.sdp.pathfollowing Class Description IterativeSolution Many minimization algorithms work by starting from some given initials and iteratively moving toward an approximate solution.MinimizationSolution This is the solution to a minimization problem.Minimizer This interface represents an optimization algorithm that minimizes a real valued objective function, one or multi dimension.Optimizer Optimization, or mathematical programming, refers to choosing the best element from some set of available alternatives. 
Classes in dev.nm.solver used by dev.nm.solver.multivariate.constrained.convex.sdp.socp.interiorpoint Class Description IterativeSolution Many minimization algorithms work by starting from some given initials and iteratively moving toward an approximate solution.MinimizationSolution This is the solution to a minimization problem.Minimizer This interface represents an optimization algorithm that minimizes a real valued objective function, one or multi dimension.Optimizer Optimization, or mathematical programming, refers to choosing the best element from some set of available alternatives. 
Classes in dev.nm.solver used by dev.nm.solver.multivariate.constrained.convex.sdp.socp.qp.lp Class Description MinimizationSolution This is the solution to a minimization problem.Minimizer This interface represents an optimization algorithm that minimizes a real valued objective function, one or multi dimension.Optimizer Optimization, or mathematical programming, refers to choosing the best element from some set of available alternatives. 
Classes in dev.nm.solver used by dev.nm.solver.multivariate.constrained.convex.sdp.socp.qp.lp.simplex Class Description MinimizationSolution This is the solution to a minimization problem. 
Classes in dev.nm.solver used by dev.nm.solver.multivariate.constrained.convex.sdp.socp.qp.lp.simplex.solution Class Description MinimizationSolution This is the solution to a minimization problem. 
Classes in dev.nm.solver used by dev.nm.solver.multivariate.constrained.convex.sdp.socp.qp.lp.simplex.solver Class Description Minimizer This interface represents an optimization algorithm that minimizes a real valued objective function, one or multi dimension.Optimizer Optimization, or mathematical programming, refers to choosing the best element from some set of available alternatives. 
Classes in dev.nm.solver used by dev.nm.solver.multivariate.constrained.convex.sdp.socp.qp.solver Class Description Minimizer This interface represents an optimization algorithm that minimizes a real valued objective function, one or multi dimension.Optimizer Optimization, or mathematical programming, refers to choosing the best element from some set of available alternatives. 
Classes in dev.nm.solver used by dev.nm.solver.multivariate.constrained.convex.sdp.socp.qp.solver.activeset Class Description IterativeSolution Many minimization algorithms work by starting from some given initials and iteratively moving toward an approximate solution.MinimizationSolution This is the solution to a minimization problem.Minimizer This interface represents an optimization algorithm that minimizes a real valued objective function, one or multi dimension.Optimizer Optimization, or mathematical programming, refers to choosing the best element from some set of available alternatives. 
Classes in dev.nm.solver used by dev.nm.solver.multivariate.constrained.convex.sdp.socp.qp.solver.socp Class Description IterativeSolution Many minimization algorithms work by starting from some given initials and iteratively moving toward an approximate solution.MinimizationSolution This is the solution to a minimization problem.Minimizer This interface represents an optimization algorithm that minimizes a real valued objective function, one or multi dimension.Optimizer Optimization, or mathematical programming, refers to choosing the best element from some set of available alternatives. 
Classes in dev.nm.solver used by dev.nm.solver.multivariate.constrained.general.box Class Description IterativeSolution Many minimization algorithms work by starting from some given initials and iteratively moving toward an approximate solution.Minimizer This interface represents an optimization algorithm that minimizes a real valued objective function, one or multi dimension.Optimizer Optimization, or mathematical programming, refers to choosing the best element from some set of available alternatives. 
Classes in dev.nm.solver used by dev.nm.solver.multivariate.constrained.general.penaltymethod Class Description IterativeSolution Many minimization algorithms work by starting from some given initials and iteratively moving toward an approximate solution.Minimizer This interface represents an optimization algorithm that minimizes a real valued objective function, one or multi dimension.Optimizer Optimization, or mathematical programming, refers to choosing the best element from some set of available alternatives. 
Classes in dev.nm.solver used by dev.nm.solver.multivariate.constrained.general.sqp.activeset Class Description IterativeSolution Many minimization algorithms work by starting from some given initials and iteratively moving toward an approximate solution.MinimizationSolution This is the solution to a minimization problem.Minimizer This interface represents an optimization algorithm that minimizes a real valued objective function, one or multi dimension.Optimizer Optimization, or mathematical programming, refers to choosing the best element from some set of available alternatives. 
Classes in dev.nm.solver used by dev.nm.solver.multivariate.constrained.general.sqp.activeset.equalityconstraint Class Description IterativeSolution Many minimization algorithms work by starting from some given initials and iteratively moving toward an approximate solution.Minimizer This interface represents an optimization algorithm that minimizes a real valued objective function, one or multi dimension.Optimizer Optimization, or mathematical programming, refers to choosing the best element from some set of available alternatives. 
Classes in dev.nm.solver used by dev.nm.solver.multivariate.constrained.integer Class Description MinimizationSolution This is the solution to a minimization problem.Minimizer This interface represents an optimization algorithm that minimizes a real valued objective function, one or multi dimension.Optimizer Optimization, or mathematical programming, refers to choosing the best element from some set of available alternatives. 
Classes in dev.nm.solver used by dev.nm.solver.multivariate.constrained.integer.bruteforce Class Description IterativeSolution Many minimization algorithms work by starting from some given initials and iteratively moving toward an approximate solution.MinimizationSolution This is the solution to a minimization problem.Minimizer This interface represents an optimization algorithm that minimizes a real valued objective function, one or multi dimension.Optimizer Optimization, or mathematical programming, refers to choosing the best element from some set of available alternatives. 
Classes in dev.nm.solver used by dev.nm.solver.multivariate.constrained.integer.linear.bb Class Description MinimizationSolution This is the solution to a minimization problem.Minimizer This interface represents an optimization algorithm that minimizes a real valued objective function, one or multi dimension.Optimizer Optimization, or mathematical programming, refers to choosing the best element from some set of available alternatives. 
Classes in dev.nm.solver used by dev.nm.solver.multivariate.constrained.integer.linear.cuttingplane Class Description MinimizationSolution This is the solution to a minimization problem.Minimizer This interface represents an optimization algorithm that minimizes a real valued objective function, one or multi dimension.Optimizer Optimization, or mathematical programming, refers to choosing the best element from some set of available alternatives. 
Classes in dev.nm.solver used by dev.nm.solver.multivariate.geneticalgorithm.minimizer.deoptim Class Description IterativeSolution Many minimization algorithms work by starting from some given initials and iteratively moving toward an approximate solution.MinimizationSolution This is the solution to a minimization problem.Minimizer This interface represents an optimization algorithm that minimizes a real valued objective function, one or multi dimension.Optimizer Optimization, or mathematical programming, refers to choosing the best element from some set of available alternatives. 
Classes in dev.nm.solver used by dev.nm.solver.multivariate.geneticalgorithm.minimizer.local Class Description Minimizer This interface represents an optimization algorithm that minimizes a real valued objective function, one or multi dimension.Optimizer Optimization, or mathematical programming, refers to choosing the best element from some set of available alternatives. 
Classes in dev.nm.solver used by dev.nm.solver.multivariate.geneticalgorithm.minimizer.simplegrid Class Description IterativeSolution Many minimization algorithms work by starting from some given initials and iteratively moving toward an approximate solution.MinimizationSolution This is the solution to a minimization problem.Minimizer This interface represents an optimization algorithm that minimizes a real valued objective function, one or multi dimension.Optimizer Optimization, or mathematical programming, refers to choosing the best element from some set of available alternatives. 
Classes in dev.nm.solver used by dev.nm.solver.multivariate.minmax Class Description IterativeSolution Many minimization algorithms work by starting from some given initials and iteratively moving toward an approximate solution.Optimizer Optimization, or mathematical programming, refers to choosing the best element from some set of available alternatives. 
Classes in dev.nm.solver used by dev.nm.solver.multivariate.unconstrained Class Description MinimizationSolution This is the solution to a minimization problem.Minimizer This interface represents an optimization algorithm that minimizes a real valued objective function, one or multi dimension.Optimizer Optimization, or mathematical programming, refers to choosing the best element from some set of available alternatives. 
Classes in dev.nm.solver used by dev.nm.solver.multivariate.unconstrained.annealing Class Description IterativeSolution Many minimization algorithms work by starting from some given initials and iteratively moving toward an approximate solution.Minimizer This interface represents an optimization algorithm that minimizes a real valued objective function, one or multi dimension.Optimizer Optimization, or mathematical programming, refers to choosing the best element from some set of available alternatives. 
Classes in dev.nm.solver used by dev.nm.solver.multivariate.unconstrained.c2 Class Description IterativeSolution Many minimization algorithms work by starting from some given initials and iteratively moving toward an approximate solution.MaximizationSolution This is the solution to a maximization problem.MinimizationSolution This is the solution to a minimization problem.Minimizer This interface represents an optimization algorithm that minimizes a real valued objective function, one or multi dimension.Optimizer Optimization, or mathematical programming, refers to choosing the best element from some set of available alternatives. 
Classes in dev.nm.solver used by dev.nm.solver.multivariate.unconstrained.c2.conjugatedirection Class Description IterativeSolution Many minimization algorithms work by starting from some given initials and iteratively moving toward an approximate solution.MinimizationSolution This is the solution to a minimization problem.Minimizer This interface represents an optimization algorithm that minimizes a real valued objective function, one or multi dimension.Optimizer Optimization, or mathematical programming, refers to choosing the best element from some set of available alternatives. 
Classes in dev.nm.solver used by dev.nm.solver.multivariate.unconstrained.c2.linesearch Class Description Optimizer Optimization, or mathematical programming, refers to choosing the best element from some set of available alternatives. 
Classes in dev.nm.solver used by dev.nm.solver.multivariate.unconstrained.c2.quasinewton Class Description IterativeSolution Many minimization algorithms work by starting from some given initials and iteratively moving toward an approximate solution.MinimizationSolution This is the solution to a minimization problem.Minimizer This interface represents an optimization algorithm that minimizes a real valued objective function, one or multi dimension.Optimizer Optimization, or mathematical programming, refers to choosing the best element from some set of available alternatives. 
Classes in dev.nm.solver used by dev.nm.solver.multivariate.unconstrained.c2.steepestdescent Class Description IterativeSolution Many minimization algorithms work by starting from some given initials and iteratively moving toward an approximate solution.MinimizationSolution This is the solution to a minimization problem.Minimizer This interface represents an optimization algorithm that minimizes a real valued objective function, one or multi dimension.Optimizer Optimization, or mathematical programming, refers to choosing the best element from some set of available alternatives. 
Classes in dev.nm.solver used by tech.nmfin.portfoliooptimization.corvalan2005 Class Description IterativeSolution Many minimization algorithms work by starting from some given initials and iteratively moving toward an approximate solution.Minimizer This interface represents an optimization algorithm that minimizes a real valued objective function, one or multi dimension. 
Classes in dev.nm.solver used by tech.nmfin.portfoliooptimization.lai2010.ceta.maximizer Class Description Optimizer Optimization, or mathematical programming, refers to choosing the best element from some set of available alternatives.