openGPMP
Open Source Mathematics Package
|
This is the complete list of members for gpmp::optim::Func, including all inherited members.
bisection_method(const std::function< double(const std::vector< double > &)> &func, double lower_bound, double upper_bound, size_t max_iterations) | gpmp::optim::Func | |
calculate_centroid(const std::vector< std::vector< double >> &simplex, size_t exclude_index) | gpmp::optim::Func | |
calculate_midpoint(double a, double b, double fraction) const | gpmp::optim::Func | |
calculate_range(const std::vector< double > &values) | gpmp::optim::Func | |
cubic_fit(const std::vector< double > &x, const std::vector< double > &y) | gpmp::optim::Func | |
cubic_interpolation(double x, double x0, double x1, double y0, double y1, double y0_prime, double y1_prime) | gpmp::optim::Func | |
fibonacci_search(const std::function< double(const std::vector< double > &)> &func, const std::vector< double > &lower_bounds, const std::vector< double > &upper_bounds, size_t max_iterations) | gpmp::optim::Func | |
fit_linear(const std::vector< double > &x, const std::vector< double > &y) | gpmp::optim::Func | |
generate_fibonacci_sequence(size_t length) const | gpmp::optim::Func | |
generate_random_point(const std::vector< double > &lower_bounds, const std::vector< double > &upper_bounds) const | gpmp::optim::Func | |
golden_section_search(const std::function< double(double)> &func, double a, double b, double tol) | gpmp::optim::Func | |
golden_section_search_minimize(const std::function< double(double)> &func, double a, double b, double tol, double x1, double x2) | gpmp::optim::Func | private |
golden_section_search_minimize_multivariate(const std::function< double(const std::vector< double > &)> &func, const std::vector< double > &lower_bounds, const std::vector< double > &upper_bounds, double tol, const std::vector< double > &x1, const std::vector< double > &x2) | gpmp::optim::Func | private |
golden_section_search_multivariate(const std::function< double(const std::vector< double > &)> &func, const std::vector< double > &lower_bounds, const std::vector< double > &upper_bounds, double tol) | gpmp::optim::Func | |
is_valid_interval(double a, double b) | gpmp::optim::Func | |
linear_interpolation(double x, double x0, double x1, double y0, double y1) | gpmp::optim::Func | |
nelder_mead(const std::function< double(const std::vector< double > &)> &func, std::vector< double > initial_point, double tolerance, size_t max_iterations) | gpmp::optim::Func | |
newton_method(const std::function< double(const std::vector< double > &)> &func, const std::function< double(const std::vector< double > &)> &derivative, double initial_guess, size_t max_iterations) | gpmp::optim::Func | |
random_search(const std::function< double(const std::vector< double > &)> &func, const std::vector< double > &lower_bounds, const std::vector< double > &upper_bounds, size_t max_iterations) | gpmp::optim::Func | |
reflect(const std::vector< double > &point, const std::vector< double > ¢roid, double reflection_coefficient) | gpmp::optim::Func | |
regula_falsi(const std::function< double(const std::vector< double > &)> &func, double lower_bound, double upper_bound, size_t max_iterations) | gpmp::optim::Func | |
ternary_search(const std::function< double(const std::vector< double > &)> &func, const std::vector< double > &lower_bounds, const std::vector< double > &upper_bounds, size_t max_iterations) const | gpmp::optim::Func | |
vector_addition(const std::vector< double > &a, const std::vector< double > &b) const | gpmp::optim::Func | |
vector_scalar_multiply(double scalar, const std::vector< double > &vec) const | gpmp::optim::Func | |
vector_subtraction(const std::vector< double > &a, const std::vector< double > &b) const | gpmp::optim::Func |