Computes the most violating pair of the problem. More...
#include <shark/Algorithms/QP/SvmProblems.h>
Public Member Functions | |
template<class Problem > | |
double | operator() (Problem &problem, std::size_t &i, std::size_t &j) |
Select the most violating pair (MVP) More... | |
void | reset () |
Computes the most violating pair of the problem.
The MVP is defined as the set of indices (i,j) such that g(i) - g(j) is maximal and alpha_i < max_j and alpha_j > min_j.
Definition at line 47 of file SvmProblems.h.
|
inline |
Select the most violating pair (MVP)
problem | the SVM problem to select the working set for |
i | first working set component |
j | second working set component |
Definition at line 55 of file SvmProblems.h.
|
inline |
Definition at line 85 of file SvmProblems.h.