Working set selection by maximization of the projected gradient. More...
#include <shark/Algorithms/QP/BoxConstrainedProblems.h>
Public Member Functions | |
template<class Problem > | |
double | operator() (Problem &problem, std::size_t &i, std::size_t &j) |
void | reset () |
Working set selection by maximization of the projected gradient.
This selection operator picks the largest and second largest variable index if possible.
Definition at line 44 of file BoxConstrainedProblems.h.
|
inline |
Definition at line 46 of file BoxConstrainedProblems.h.
References shark::swap().
|
inline |
Definition at line 72 of file BoxConstrainedProblems.h.