Class QPbySOCPMinimizer
- java.lang.Object
-
- dev.nm.solver.multivariate.constrained.convex.sdp.socp.qp.solver.socp.QPbySOCPMinimizer
-
- All Implemented Interfaces:
Minimizer<QPProblem,IterativeSolution<QPSolution>>
,ConstrainedMinimizer<QPProblem,IterativeSolution<QPSolution>>
,QPMinimizer
,Optimizer<QPProblem,IterativeSolution<QPSolution>>
public class QPbySOCPMinimizer extends Object implements QPMinimizer
We first convert a QP problem to an equivalent SOCP problem and then solve it using an SOCP solver.
-
-
Nested Class Summary
Nested Classes Modifier and Type Class Description class
QPbySOCPMinimizer.Solution
-
Constructor Summary
Constructors Constructor Description QPbySOCPMinimizer(double epsilon, int maxIterations)
Constructs an SOCP minimizer to solve quadratic programming problems.
-
Method Summary
All Methods Instance Methods Concrete Methods Modifier and Type Method Description QPbySOCPMinimizer.Solution
solve(QPProblem qp)
Solve an optimization problem, e.g.,OptimProblem
.
-
-
-
Constructor Detail
-
QPbySOCPMinimizer
public QPbySOCPMinimizer(double epsilon, int maxIterations)
Constructs an SOCP minimizer to solve quadratic programming problems.- Parameters:
epsilon
- a precision parameter: when a number |x| ≤ ε, it is considered 0maxIterations
- the maximum number of iterations, e.g.,Integer.MAX_VALUE
-
-
Method Detail
-
solve
public QPbySOCPMinimizer.Solution solve(QPProblem qp) throws Exception
Description copied from interface:Optimizer
Solve an optimization problem, e.g.,OptimProblem
.- Specified by:
solve
in interfaceOptimizer<QPProblem,IterativeSolution<QPSolution>>
- Parameters:
qp
- an optimization problem- Returns:
- a solution to the optimization problem
- Throws:
Exception
- when there is an error solving the problem
-
-