com.numericalmethod.suanshu.optimization.constrained.convex.sdp.socp.qp

Interface QPSolution

All Superinterfaces:

java.io.Serializable

public interface QPSolution
extends java.io.Serializable

This is a solution to a quadratic programming problem.

Method Summary

Modifier and Type	Method and Description
boolean	isUnique() Return true if the quadratic programming problem has only one solution.
ImmutableVector	minimizer() Get a minimizing vector.

Method Detail

isUnique

boolean isUnique()

Return true if the quadratic programming problem has only one solution.

Returns:

true if the quadratic programming problem has only one solution

minimizer

ImmutableVector minimizer()

Get a minimizing vector.

Returns:

a minimizing vector as a solution to the quadratic programming problem