public class PrimalDualPathFollowingMinimizer extends Object implements ConstrainedMinimizer<SDPDualProblem,IterativeSolution<CentralPath>>
phi = delta(duality gap) + norm(rd) + norm(rp)where norm(rd) + norm(rp) measures the feasibility of solution.
Modifier and Type | Class and Description |
---|---|
class |
PrimalDualPathFollowingMinimizer.Solution
This is the solution to a Semi-Definite Programming problem using the Primal-Dual
Path-Following algorithm.
|
Constructor and Description |
---|
PrimalDualPathFollowingMinimizer(double epsilon)
Constructs a Primal-Dual Path-Following minimizer to solve semi-definite programming
problems.
|
PrimalDualPathFollowingMinimizer(double gamma0,
double epsilon)
Constructs a Primal-Dual Path-Following minimizer to solve semi-definite programming
problems.
|
PrimalDualPathFollowingMinimizer(double gamma0,
double sigma0,
double epsilon)
Constructs a Primal-Dual Path-Following minimizer to solve semi-definite programming
problems.
|
Modifier and Type | Method and Description |
---|---|
protected static double |
getMinEigenValue(Matrix A,
double epsilon)
Gets the minimum of all the eigen values of a matrix.
|
PrimalDualPathFollowingMinimizer.Solution |
solve(SDPDualProblem problem)
Solve an optimization problem, e.g.,
OptimProblem . |
public PrimalDualPathFollowingMinimizer(double gamma0, double sigma0, double epsilon)
gamma0
- \(0 < \gamma < 1\); it ensures the next iterates are inside the feasible
set; suggested values are between 0.9 and 0.99sigma0
- \(0 \leq \sigma < 1\), the centering parameterepsilon
- a precision parameter: when a number |x| ≤ ε, it is considered 0public PrimalDualPathFollowingMinimizer(double gamma0, double epsilon)
gamma0
- \(0 < \gamma < 1\); it ensures the next iterates are inside the feasible
set; suggested values are between 0.9 and 0.99epsilon
- a precision parameter: when a number |x| ≤ ε, it is considered 0public PrimalDualPathFollowingMinimizer(double epsilon)
epsilon
- a precision parameter: when a number |x| ≤ ε, it is considered 0public PrimalDualPathFollowingMinimizer.Solution solve(SDPDualProblem problem) throws Exception
Optimizer
OptimProblem
.solve
in interface Optimizer<SDPDualProblem,IterativeSolution<CentralPath>>
problem
- an optimization problemException
- when there is an error solving the problemprotected static double getMinEigenValue(Matrix A, double epsilon)
A
- a matrixepsilon
- a precision parameter: when a number |x| ≤ ε, it is considered 0Copyright © 2010-2020 NM FinTech Ltd.. All Rights Reserved.