public class QPbySOCPMinimizer.Solution extends Object implements IterativeSolution<QPSolution>
| Modifier and Type | Method and Description |
|---|---|
QPSolution |
minimizer()
Get the minimizer (solution) to the minimization problem.
|
double |
minimum()
Get the (approximate) minimum found.
|
QPSolution |
search(QPSolution... initials)
Search for a solution that optimizes the objective function from the
given starting points.
|
void |
setInitials(QPSolution... initials)
Supply the starting points for the search.
|
Object |
step()
Do the next iteration.
|
public double minimum()
MinimizationSolutionminimum in interface MinimizationSolution<QPSolution>public QPSolution minimizer()
MinimizationSolutionminimizer in interface MinimizationSolution<QPSolution>public void setInitials(QPSolution... initials)
IterativeMethodsetInitials in interface IterativeMethod<QPSolution>initials - the initial guessespublic Object step() throws Exception
IterativeMethodstep in interface IterativeMethod<QPSolution>Exception - when an error occurs during the searchpublic QPSolution search(QPSolution... initials) throws Exception
IterativeMethod#setInitials(S...) and then
iteratively IterativeMethod.step().
It implements a default convergence criterion.search in interface IterativeMethod<QPSolution>initials - the initial guessesException - when an error occurs during the searchCopyright © 2010-2020 NM FinTech Ltd.. All Rights Reserved.