Uses of Interface
dev.nm.solver.MinimizationSolution
-
-
Uses of MinimizationSolution in dev.nm.misc.algorithm.bb
Classes in dev.nm.misc.algorithm.bb that implement MinimizationSolution Modifier and Type Class Description classBranchAndBoundBranch-and-Bound (BB or B&B) is a general algorithm for finding optimal solutions of various optimization problems, especially in discrete and combinatorial optimization. -
Uses of MinimizationSolution in dev.nm.root.univariate
Subinterfaces of MinimizationSolution in dev.nm.root.univariate Modifier and Type Interface Description static interfaceUnivariateMinimizer.SolutionThis is the solution to a univariate minimization problem.Classes in dev.nm.root.univariate that implement MinimizationSolution Modifier and Type Class Description classGridSearchMinimizer.SolutionThis is the solution to theGridSearchMinimizer. -
Uses of MinimizationSolution in dev.nm.root.univariate.bracketsearch
Classes in dev.nm.root.univariate.bracketsearch that implement MinimizationSolution Modifier and Type Class Description protected classBracketSearchMinimizer.SolutionclassBrentMinimizer.SolutionThis is the solution to a Brent's univariate optimization.classFibonaccMinimizer.SolutionThis is the solution to a Fibonacci's univariate optimization.classGoldenMinimizer.SolutionThis is the solution to a Golden section univariate optimization. -
Uses of MinimizationSolution in dev.nm.solver
Classes in dev.nm.solver with type parameters of type MinimizationSolution Modifier and Type Interface Description interfaceMinimizer<P extends OptimProblem,S extends MinimizationSolution<?>>This interface represents an optimization algorithm that minimizes a real valued objective function, one or multi dimension.Subinterfaces of MinimizationSolution in dev.nm.solver Modifier and Type Interface Description interfaceIterativeSolution<S>Many minimization algorithms work by starting from some given initials and iteratively moving toward an approximate solution. -
Uses of MinimizationSolution in dev.nm.solver.multivariate.constrained
Classes in dev.nm.solver.multivariate.constrained with type parameters of type MinimizationSolution Modifier and Type Interface Description interfaceBoxMinimizer<P extends BoxOptimProblem,S extends MinimizationSolution<?>>A box minimizer solves aBoxOptimProblem.interfaceConstrainedMinimizer<P extends ConstrainedOptimProblem,S extends MinimizationSolution<?>>A constrained minimizer solves a constrained optimization problem, namely,ConstrainedOptimProblem.Subinterfaces of MinimizationSolution in dev.nm.solver.multivariate.constrained Modifier and Type Interface Description static interfaceSubProblemMinimizer.IterativeSolution<Vector> -
Uses of MinimizationSolution in dev.nm.solver.multivariate.constrained.convex.sdp.pathfollowing
Classes in dev.nm.solver.multivariate.constrained.convex.sdp.pathfollowing that implement MinimizationSolution Modifier and Type Class Description classCSDPMinimizer.SolutionclassHomogeneousPathFollowingMinimizer.SolutionThis is the solution to a Semi-Definite Programming problem using the Homogeneous Self-Dual Path-Following algorithm.classPrimalDualPathFollowingMinimizer.SolutionThis is the solution to a Semi-Definite Programming problem using the Primal-Dual Path-Following algorithm. -
Uses of MinimizationSolution in dev.nm.solver.multivariate.constrained.convex.sdp.socp.interiorpoint
Classes in dev.nm.solver.multivariate.constrained.convex.sdp.socp.interiorpoint that implement MinimizationSolution Modifier and Type Class Description classPrimalDualInteriorPointMinimizer.SolutionThis is the solution to a Dual Second Order Conic Programming problem using the Primal Dual Interior Point algorithm.classPrimalDualInteriorPointMinimizer1.SolutionThis is the solution to a Dual Second-Order Conic Programming problem using the Primal-Dual Predictor-Corrector Interior Point algorithm. -
Uses of MinimizationSolution in dev.nm.solver.multivariate.constrained.convex.sdp.socp.qp.lp
Subinterfaces of MinimizationSolution in dev.nm.solver.multivariate.constrained.convex.sdp.socp.qp.lp Modifier and Type Interface Description interfaceLPMinimizerAn LP minimizer minimizes the objective of an LP problem, satisfying all the constraints.interfaceLPSolution<T extends LPMinimizer>A solution to an LP problem contains all information about solving an LP problem such as whether the problem has a solution (bounded), how many minimizers it has, and the minimum. -
Uses of MinimizationSolution in dev.nm.solver.multivariate.constrained.convex.sdp.socp.qp.lp.simplex
Classes in dev.nm.solver.multivariate.constrained.convex.sdp.socp.qp.lp.simplex that implement MinimizationSolution Modifier and Type Class Description classSimplexTableThis is a simplex table used to solve a linear programming problem using a simplex method. -
Uses of MinimizationSolution in dev.nm.solver.multivariate.constrained.convex.sdp.socp.qp.lp.simplex.solution
Subinterfaces of MinimizationSolution in dev.nm.solver.multivariate.constrained.convex.sdp.socp.qp.lp.simplex.solution Modifier and Type Interface Description interfaceLPSimplexMinimizerA simplex LP minimizer can be read off from the solution simplex table.interfaceLPSimplexSolutionThe solution to a linear programming problem using a simplex method contains anLPSimplexMinimizer.Classes in dev.nm.solver.multivariate.constrained.convex.sdp.socp.qp.lp.simplex.solution that implement MinimizationSolution Modifier and Type Class Description classLPBoundedMinimizerThis is the solution to a bounded linear programming problem.classLPUnboundedMinimizerThis is the solution to an unbounded linear programming problem.classLPUnboundedMinimizerScheme2This is the solution to an unbounded linear programming problem found in scheme 2. -
Uses of MinimizationSolution in dev.nm.solver.multivariate.constrained.convex.sdp.socp.qp.solver.activeset
Classes in dev.nm.solver.multivariate.constrained.convex.sdp.socp.qp.solver.activeset that implement MinimizationSolution Modifier and Type Class Description classQPDualActiveSetMinimizer.SolutionThis is the solution to a Quadratic Programming problem using the Dual Active Set algorithm.classQPPrimalActiveSetMinimizer.SolutionThis is the solution to a Quadratic Programming problem using the Primal Active Set algorithm. -
Uses of MinimizationSolution in dev.nm.solver.multivariate.constrained.convex.sdp.socp.qp.solver.socp
Classes in dev.nm.solver.multivariate.constrained.convex.sdp.socp.qp.solver.socp that implement MinimizationSolution Modifier and Type Class Description classQPbySOCPMinimizer.SolutionclassQPbySOCPMinimizer1.Solution -
Uses of MinimizationSolution in dev.nm.solver.multivariate.constrained.general.sqp.activeset
Classes in dev.nm.solver.multivariate.constrained.general.sqp.activeset that implement MinimizationSolution Modifier and Type Class Description classSQPActiveSetMinimizer.SolutionThis is the solution to a general minimization with only inequality constraints using the SQP Active Set algorithm.classSQPActiveSetOnlyInequalityConstraintMinimizer.SolutionThis is the solution to a general minimization problem with only inequality constraints using the SQP Active Set algorithm. -
Uses of MinimizationSolution in dev.nm.solver.multivariate.constrained.integer
Classes in dev.nm.solver.multivariate.constrained.integer with type parameters of type MinimizationSolution Modifier and Type Interface Description interfaceIPMinimizer<T extends IPProblem,S extends MinimizationSolution<Vector>>An Integer Programming minimizer minimizes an objective function subject to equality/inequality constraints as well as integral constraints. -
Uses of MinimizationSolution in dev.nm.solver.multivariate.constrained.integer.bruteforce
Classes in dev.nm.solver.multivariate.constrained.integer.bruteforce that implement MinimizationSolution Modifier and Type Class Description classBruteForceIPMinimizer.SolutionThis is the solution to an integral constrained minimization using the brute-force search. -
Uses of MinimizationSolution in dev.nm.solver.multivariate.constrained.integer.linear.bb
Methods in dev.nm.solver.multivariate.constrained.integer.linear.bb that return MinimizationSolution Modifier and Type Method Description MinimizationSolution<Vector>ILPBranchAndBoundMinimizer. solve(ILPProblem problem) -
Uses of MinimizationSolution in dev.nm.solver.multivariate.constrained.integer.linear.cuttingplane
Methods in dev.nm.solver.multivariate.constrained.integer.linear.cuttingplane that return MinimizationSolution Modifier and Type Method Description MinimizationSolution<Vector>SimplexCuttingPlaneMinimizer. solve(ILPProblem problem) -
Uses of MinimizationSolution in dev.nm.solver.multivariate.geneticalgorithm.minimizer.deoptim
Classes in dev.nm.solver.multivariate.geneticalgorithm.minimizer.deoptim that implement MinimizationSolution Modifier and Type Class Description protected classDEOptim.SolutionThis is the solution to a minimization problem usingDEOptim. -
Uses of MinimizationSolution in dev.nm.solver.multivariate.geneticalgorithm.minimizer.simplegrid
Classes in dev.nm.solver.multivariate.geneticalgorithm.minimizer.simplegrid that implement MinimizationSolution Modifier and Type Class Description protected classSimpleGridMinimizer.SolutionThis is the solution to a minimization problem usingSimpleGridMinimizer. -
Uses of MinimizationSolution in dev.nm.solver.multivariate.unconstrained
Classes in dev.nm.solver.multivariate.unconstrained with type parameters of type MinimizationSolution Modifier and Type Interface Description interfaceMultivariateMinimizer<P extends OptimProblem,S extends MinimizationSolution<Vector>>This is a minimizer that minimizes a multivariate function or a Vector function.Classes in dev.nm.solver.multivariate.unconstrained that implement MinimizationSolution Modifier and Type Class Description classBruteForceMinimizer.SolutionThis is the solution to solving an optimization using the brute force algorithm. -
Uses of MinimizationSolution in dev.nm.solver.multivariate.unconstrained.c2
Classes in dev.nm.solver.multivariate.unconstrained.c2 that implement MinimizationSolution Modifier and Type Class Description classNelderMeadMinimizer.SolutionThis is the solution to an optimization problem by the Nelder-Mead method. -
Uses of MinimizationSolution in dev.nm.solver.multivariate.unconstrained.c2.conjugatedirection
Classes in dev.nm.solver.multivariate.unconstrained.c2.conjugatedirection that implement MinimizationSolution Modifier and Type Class Description protected classPowellMinimizer.PowellImplan implementation of Powell's algorithmprotected classZangwillMinimizer.ZangwillImplan implementation of Zangwill's algorithm -
Uses of MinimizationSolution in dev.nm.solver.multivariate.unconstrained.c2.quasinewton
Classes in dev.nm.solver.multivariate.unconstrained.c2.quasinewton that implement MinimizationSolution Modifier and Type Class Description protected classBFGSMinimizer.BFGSImplan implementation of the BFGS algorithmprotected classHuangMinimizer.HuangImplan implementation of Huang's formula.protected classQuasiNewtonMinimizer.QuasiNewtonImplThis is an implementation of the Quasi-Newton algorithm. -
Uses of MinimizationSolution in dev.nm.solver.multivariate.unconstrained.c2.steepestdescent
Classes in dev.nm.solver.multivariate.unconstrained.c2.steepestdescent that implement MinimizationSolution Modifier and Type Class Description protected classGaussNewtonMinimizer.MySteepestDescent.GaussNewtonImplan implementation of the Gauss-Newton algorithm.protected classNewtonRaphsonMinimizer.NewtonRaphsonImplprotected classSteepestDescentMinimizer.SteepestDescentImplThis is an implementation of the steepest descent method.
-