GreedyRandomSampler.h

 
// Description: The concrete implementation of the Choi et. al's greedy algorithm
//              using random sampling or latin-hypercube sampling.
 
#ifndef included_GreedyRandomSampler_h
#define included_GreedyRandomSampler_h
 
#include "GreedySampler.h"
 
namespace CAROM {
 
class GreedyRandomSampler : public GreedySampler
{
public:
    GreedyRandomSampler(
        Vector param_space_min,
        Vector param_space_max,
        int num_parameter_points,
        bool check_local_rom,
        double relative_error_tolerance,
        double alpha,
        double max_clamp,
        int subset_size,
        int convergence_subset_size,
        bool use_latin_hypercube,
        std::string output_log_path = "",
        std::string warm_start_file_name = "",
        bool use_centroid = true,
        int random_seed = 1,
        bool debug_algorithm = false);
 
    GreedyRandomSampler(
        double param_space_min,
        double param_space_max,
        int num_parameter_points,
        bool check_local_rom,
        double relative_error_tolerance,
        double alpha,
        double max_clamp,
        int subset_size,
        int convergence_subset_size,
        bool use_latin_hypercube,
        std::string output_log_path = "",
        std::string warm_start_file_name = "",
        bool use_centroid = true,
        int random_seed = 1,
        bool debug_algorithm = false);
 
    GreedyRandomSampler(
        std::string base_file_name,
        std::string output_log_path = "");
 
    void
    save(std::string base_file_name);
 
    ~GreedyRandomSampler();
 
protected:
 
    void load(std::string base_file_name);
 
    void constructParameterPoints();
 
    void getNextParameterPointAfterConvergenceFailure();
 
    bool d_use_latin_hypercube;
};
 
}
 
#endif