![]() |
SG++-Doxygen-Documentation
|
#include <OperationMakePositiveCandidateSetAlgorithm.hpp>
Additional Inherited Members | |
![]() | |
void | computeIntersection (base::HashGridPoint &gpi, base::HashGridPoint &gpj, base::HashGridPoint &gpintersection) |
bool | haveOverlappingSupport (base::HashGridPoint &gpi, base::HashGridPoint &gpj) |
bool | haveOverlappingSupport (base::HashGridPoint &gpi, base::HashGridPoint &gpj, size_t dim) |
virtual void | initializeCandidates (base::Grid &grid, std::vector< size_t > &negativeGridPoints) |
![]() | |
void | findNodesWithNegativeCoefficients (base::DataVector &alpha, std::vector< size_t > &negativeGridPoints, double tol=-1e-14) |
Extract grid points with negative coefficient. | |
![]() | |
static bool | compareGridPointsByHash (const std::shared_ptr< base::HashGridPoint > &lhs, const std::shared_ptr< base::HashGridPoint > &rhs) |
![]() | |
std::unordered_map< size_t, std::shared_ptr< base::HashGridPoint > > | candidates |
std::set< std::shared_ptr< base::HashGridPoint >, HashGridPointCompare > | currentIntersections |
std::unordered_map< size_t, std::shared_ptr< std::vector< std::shared_ptr< base::HashGridPoint > > > > | intersections |
std::set< std::shared_ptr< base::HashGridPoint >, HashGridPointCompare > | nextIntersections |
base::DataVector | numCandidatesIteration |
![]() | |
base::DataVector | costsPerIteration |
comparison costs per iteration | |
base::DataVector | gridPointsPerLevel |
candiddate grid points per level | |
size_t | iteration |
iteration counter | |
size_t | maxLevel |
maximum full grid level for the candidate set | |
bool | verbose |
verbosity level | |
|
explicit |
|
override |
|
overridevirtual |
Reimplemented from sgpp::datadriven::OperationMakePositiveFindIntersectionCandidates.
References sgpp::datadriven::OperationMakePositiveFindIntersectionCandidates::computeIntersection(), sgpp::datadriven::OperationMakePositiveCandidateSetAlgorithm::costsPerIteration, sgpp::op_factory::createOperationEvalNaive(), sgpp::datadriven::OperationMakePositiveFindIntersectionCandidates::currentIntersections, grid(), sgpp::datadriven::OperationMakePositiveFindIntersectionCandidates::haveOverlappingSupport(), sgpp::base::DataVector::insert(), sgpp::datadriven::OperationMakePositiveFindIntersectionCandidates::intersections, sgpp::datadriven::OperationMakePositiveCandidateSetAlgorithm::iteration, sgpp::datadriven::OperationMakePositiveFindIntersectionCandidates::nextIntersections, sgpp::datadriven::OperationMakePositiveFindIntersectionCandidates::numCandidatesIteration, sgpp::base::DataVector::resizeZero(), sgpp::base::DataVector::sum(), and sgpp::datadriven::OperationMakePositiveCandidateSetAlgorithm::verbose.
Referenced by nextCandidates().
|
overridevirtual |
Load the next candidate set that contains grid points with the currently explored levelsum.
grid | current sparse grid that needs to be extended |
alpha | corresponding coefficient vector |
levelSum | current levelsum to be explored |
candidates | vector that contains the candidate set for the current levelsum |
Reimplemented from sgpp::datadriven::OperationMakePositiveFindIntersectionCandidates.
References alpha, sgpp::datadriven::OperationMakePositiveFindIntersectionCandidates::candidates, sgpp::datadriven::OperationMakePositiveCandidateSetAlgorithm::costsPerIteration, findIntersections(), sgpp::datadriven::OperationMakePositiveCandidateSetAlgorithm::findNodesWithNegativeCoefficients(), sgpp::base::HashGridStorage::getMaxLevel(), sgpp::base::DataVector::getSize(), sgpp::base::Grid::getStorage(), grid(), sgpp::datadriven::OperationMakePositiveFindIntersectionCandidates::initializeCandidates(), sgpp::datadriven::OperationMakePositiveCandidateSetAlgorithm::iteration, sgpp::datadriven::OperationMakePositiveCandidateSetAlgorithm::maxLevel, sgpp::base::DataVector::sum(), and sgpp::datadriven::OperationMakePositiveCandidateSetAlgorithm::verbose.