shark::LibSVMSelectionCriterion Struct Reference

Computes the maximum gian solution. 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 a working set according to the second order algorithm of LIBSVM 2.8. More...
void	reset ()

Detailed Description

Computes the maximum gian solution.

The first index is chosen based on the maximum gradient (first index of MVP) and the second index is chosen such that the step of the corresponding alphas produces the largest gain.

Definition at line 94 of file SvmProblems.h.

Member Function Documentation

operator()()

template<class Problem >

double shark::LibSVMSelectionCriterion::operator() ( Problem &  problem, std::size_t &  i, std::size_t &  j  )

inline

Select a working set according to the second order algorithm of LIBSVM 2.8.

Returns

maximal KKT vioation

Parameters

problem	the svm problem to select the working set for
i	first working set component
j	second working set component

Definition at line 103 of file SvmProblems.h.

reset()

void shark::LibSVMSelectionCriterion::reset ( )

inline

Definition at line 155 of file SvmProblems.h.

---

The documentation for this struct was generated from the following file:

• include/shark/Algorithms/QP/SvmProblems.h