"Quadratic Constrained Machine".
"Quadratic Constrained Machine". It's a machine with alpha parameters which are the minimum of a constrained quadratic problem.The problem:
minimize
![]()
with the following constraints:
![]()
![]()
where
,
,
are given by the user and must be
.
The number of alpha variable is determined here by l. (Therefore, it determines the size of de Cup, Cdown et y...)
Note: if
is closed to
[ou
] with the accuracy "eps bounds",
is considered to be equal to
[ou
].
Options:
"eps bounds" real bound accuracy: [1E-4 in float, 1E-12 in double]
Alphabetic index HTML hierarchy of classes or Java