public class CSDPMinimizer.Solution extends Object implements IterativeSolution<CentralPath>
| Modifier and Type | Method and Description |
|---|---|
CentralPath |
minimizer()
Get the minimizer (solution) to the minimization problem.
|
double |
minimum()
Get the (approximate) minimum found.
|
CentralPath |
search()
Searches for a solution that optimizes the objective function from the default starting
points.
|
CentralPath |
search(CentralPath... initials)
Search for a solution that optimizes the objective function from the
given starting points.
|
CentralPath |
search(CentralPath initial)
Search for a solution that optimizes the objective function from the given starting
points.
|
void |
setInitials(CentralPath... initials)
Supply the starting points for the search.
|
Boolean |
step()
Do the next iteration.
|
protected Matrix |
svecA() |
public CentralPath search(CentralPath... initials)
#setInitials(S...) and then
iteratively IterativeMethod.step().
It implements a default convergence criterion.search in interface IterativeMethod<CentralPath>initials - initial values (one value only)public CentralPath search()
public CentralPath search(CentralPath initial)
initial - an initial valuepublic void setInitials(CentralPath... initials)
IterativeMethodsetInitials in interface IterativeMethod<CentralPath>initials - the initial guessespublic Boolean step()
IterativeMethodstep in interface IterativeMethod<CentralPath>false when the iteration should stopprotected Matrix svecA()
public double minimum()
MinimizationSolutionminimum in interface MinimizationSolution<CentralPath>public CentralPath minimizer()
MinimizationSolutionminimizer in interface MinimizationSolution<CentralPath>Copyright © 2010-2020 NM FinTech Ltd.. All Rights Reserved.