Uses of Interface
dev.nm.solver.problem.OptimProblem
-
-
Uses of OptimProblem in dev.nm.solver
Classes in dev.nm.solver with type parameters of type OptimProblem Modifier and Type Interface Description interfaceMaxmizer<P extends OptimProblem,S extends MaximizationSolution<?>>This interface represents an optimization algorithm that maximizers a real valued objective function, one or multi dimension.interfaceMinimizer<P extends OptimProblem,S extends MinimizationSolution<?>>This interface represents an optimization algorithm that minimizes a real valued objective function, one or multi dimension. -
Uses of OptimProblem in dev.nm.solver.multivariate.constrained
Subinterfaces of OptimProblem in dev.nm.solver.multivariate.constrained Modifier and Type Interface Description interfaceConstrainedOptimSubProblemA constrained optimization sub-problem takes this form. -
Uses of OptimProblem in dev.nm.solver.multivariate.constrained.convex.sdp.problem
Classes in dev.nm.solver.multivariate.constrained.convex.sdp.problem that implement OptimProblem Modifier and Type Class Description classSDPDualProblemA dual SDP problem, as in equation 14.4 in the reference, takes the following form. -
Uses of OptimProblem in dev.nm.solver.multivariate.constrained.convex.sdp.socp.problem
Classes in dev.nm.solver.multivariate.constrained.convex.sdp.socp.problem that implement OptimProblem Modifier and Type Class Description classSOCPDualProblemThis is the Dual Second Order Conic Programming problem.classSOCPDualProblem1This is the Dual Second Order Conic Programming problem.classSOCPGeneralProblemMany convex programming problems can be represented in the following form.classSOCPGeneralProblem1Many convex programming problems can be represented in the following form. -
Uses of OptimProblem in dev.nm.solver.multivariate.constrained.convex.sdp.socp.problem.portfoliooptimization
Classes in dev.nm.solver.multivariate.constrained.convex.sdp.socp.problem.portfoliooptimization that implement OptimProblem Modifier and Type Class Description classSOCPPortfolioProblemConstructs an SOCP problem for portfolio optimization.classSOCPPortfolioProblem1Constructs an SOCP problem for portfolio optimization. -
Uses of OptimProblem in dev.nm.solver.multivariate.constrained.convex.sdp.socp.qp.lp.problem
Subinterfaces of OptimProblem in dev.nm.solver.multivariate.constrained.convex.sdp.socp.qp.lp.problem Modifier and Type Interface Description interfaceLPProblemA linear programming (LP) problem minimizes a linear objective function subject to a collection of linear constraints.Classes in dev.nm.solver.multivariate.constrained.convex.sdp.socp.qp.lp.problem that implement OptimProblem Modifier and Type Class Description classLPCanonicalProblem1This is a linear programming problem in the 1st canonical form (following the convention in the reference): min c'x s.t.classLPCanonicalProblem2This is a linear programming problem in the 2nd canonical form (following the convention in the wiki): min c'x s.t.classLPProblemImpl1This is an implementation of a linear programming problem,LPProblem.classLPStandardProblemThis is a linear programming problem in the standard form: min c'x s.t. -
Uses of OptimProblem in dev.nm.solver.multivariate.constrained.convex.sdp.socp.qp.lp.simplex.solver
Classes in dev.nm.solver.multivariate.constrained.convex.sdp.socp.qp.lp.simplex.solver that implement OptimProblem Modifier and Type Class Description static classLPRevisedSimplexSolver.Problem -
Uses of OptimProblem in dev.nm.solver.multivariate.constrained.convex.sdp.socp.qp.problem
Classes in dev.nm.solver.multivariate.constrained.convex.sdp.socp.qp.problem that implement OptimProblem Modifier and Type Class Description classQPProblemQuadratic Programming is the problem of optimizing (minimizing) a quadratic function of several variables subject to linear constraints on these variables. -
Uses of OptimProblem in dev.nm.solver.multivariate.constrained.integer
Subinterfaces of OptimProblem in dev.nm.solver.multivariate.constrained.integer Modifier and Type Interface Description interfaceIPProblemAn Integer Programming problem is a mathematical optimization or feasibility program in which some or all of the variables are restricted to be integers.Classes in dev.nm.solver.multivariate.constrained.integer that implement OptimProblem Modifier and Type Class Description classIPProblemImpl1This is an implementation of a general Integer Programming problem in which some variables take only integers. -
Uses of OptimProblem in dev.nm.solver.multivariate.constrained.integer.bruteforce
Classes in dev.nm.solver.multivariate.constrained.integer.bruteforce that implement OptimProblem Modifier and Type Class Description classBruteForceIPProblemThis implementation is an integral constrained minimization problem that has enumerable integral domains. -
Uses of OptimProblem in dev.nm.solver.multivariate.constrained.integer.linear.bb
Classes in dev.nm.solver.multivariate.constrained.integer.linear.bb that implement OptimProblem Modifier and Type Class Description classILPNodeThis is the branch-and-bound node used in conjunction withILPBranchAndBoundMinimizerto solve an Integer Linear Programming problem. -
Uses of OptimProblem in dev.nm.solver.multivariate.constrained.integer.linear.problem
Subinterfaces of OptimProblem in dev.nm.solver.multivariate.constrained.integer.linear.problem Modifier and Type Interface Description interfaceILPProblemA linear program in real variables is said to be integral if it has at least one optimal solution which is integral.Classes in dev.nm.solver.multivariate.constrained.integer.linear.problem that implement OptimProblem Modifier and Type Class Description classILPProblemImpl1This implementation is an ILP problem, in which the variables can be real or integral.classPureILPProblemThis is a pure integer linear programming problem, in which all variables are integral. -
Uses of OptimProblem in dev.nm.solver.multivariate.constrained.problem
Subinterfaces of OptimProblem in dev.nm.solver.multivariate.constrained.problem Modifier and Type Interface Description interfaceConstrainedOptimProblemA constrained optimization problem takes this form.Classes in dev.nm.solver.multivariate.constrained.problem that implement OptimProblem Modifier and Type Class Description classBoxOptimProblemA box constrained optimization problem, for which a solution must be within fixed bounds.classConstrainedOptimProblemImpl1This implements a constrained optimization problem for a function f subject to equality and less-than-or-equal-to constraints.classNonNegativityConstraintOptimProblemThis is a constrained optimization problem for a function which has all non-negative variables. -
Uses of OptimProblem in dev.nm.solver.multivariate.geneticalgorithm.minimizer.deoptim
Methods in dev.nm.solver.multivariate.geneticalgorithm.minimizer.deoptim with parameters of type OptimProblem Modifier and Type Method Description IterativeSolution<Vector>DEOptim. solve(OptimProblem problem) -
Uses of OptimProblem in dev.nm.solver.multivariate.geneticalgorithm.minimizer.local
Classes in dev.nm.solver.multivariate.geneticalgorithm.minimizer.local with type parameters of type OptimProblem Modifier and Type Class Description classLocalSearchCellFactory<P extends OptimProblem,T extends IterativeMinimizer<OptimProblem>>classLocalSearchCellFactory<P extends OptimProblem,T extends IterativeMinimizer<OptimProblem>>static interfaceLocalSearchCellFactory.MinimizerFactory<U extends IterativeMinimizer<OptimProblem>>This factory constructs a newMinimizerfor each mutation operation. -
Uses of OptimProblem in dev.nm.solver.multivariate.geneticalgorithm.minimizer.simplegrid
Methods in dev.nm.solver.multivariate.geneticalgorithm.minimizer.simplegrid with parameters of type OptimProblem Modifier and Type Method Description IterativeSolution<Vector>SimpleGridMinimizer. solve(OptimProblem problem) -
Uses of OptimProblem in dev.nm.solver.multivariate.unconstrained
Classes in dev.nm.solver.multivariate.unconstrained with type parameters of type OptimProblem Modifier and Type Interface Description interfaceIterativeMinimizer<P extends OptimProblem>This is an iterative multivariate minimizer.interfaceMultivariateMinimizer<P extends OptimProblem,S extends MinimizationSolution<Vector>>This is a minimizer that minimizes a multivariate function or a Vector function.Methods in dev.nm.solver.multivariate.unconstrained with parameters of type OptimProblem Modifier and Type Method Description BruteForceMinimizer.SolutionDoubleBruteForceMinimizer. solve(OptimProblem problem) -
Uses of OptimProblem in dev.nm.solver.multivariate.unconstrained.annealing
Methods in dev.nm.solver.multivariate.unconstrained.annealing with parameters of type OptimProblem Modifier and Type Method Description IterativeSolution<Vector>SimulatedAnnealingMinimizer. solve(OptimProblem problem) -
Uses of OptimProblem in dev.nm.solver.problem
Subinterfaces of OptimProblem in dev.nm.solver.problem Modifier and Type Interface Description interfaceC2OptimProblemThis is an optimization problem of a real valued function that is twice differentiable.Classes in dev.nm.solver.problem that implement OptimProblem Modifier and Type Class Description classC2OptimProblemImplThis is an optimization problem of a real valued function: \(\max_x f(x)\).
-