The COCO problem structure. More...
#include <coco_internal.h>
Data Fields | |
| coco_evaluate_function_t | evaluate_function |
| The function for evaluating the problem. More... | |
| coco_evaluate_function_t | evaluate_constraint |
| The function for evaluating the constraints. More... | |
| coco_evaluate_function_t | evaluate_gradient |
| The function for evaluating the constraints. More... | |
| coco_recommend_function_t | recommend_solution |
| The function for recommending a solution. More... | |
| coco_problem_free_function_t | problem_free_function |
| The function for freeing this problem. More... | |
| size_t | number_of_variables |
| Number of variables expected by the function, i.e. problem dimension. More... | |
| size_t | number_of_objectives |
| Number of objectives. More... | |
| size_t | number_of_constraints |
| Number of constraints. More... | |
| double * | smallest_values_of_interest |
| The lower bounds of the ROI in the decision space. More... | |
| double * | largest_values_of_interest |
| The upper bounds of the ROI in the decision space. More... | |
| size_t | number_of_integer_variables |
| Number of integer variables (if > 0, all integer variables come before any continuous ones). More... | |
| double * | initial_solution |
| Initial feasible solution. More... | |
| double * | best_value |
| Optimal (smallest) function value. More... | |
| double * | nadir_value |
| The nadir point (defined when number_of_objectives > 1) More... | |
| double * | best_parameter |
| Optimal decision vector (defined only when unique) More... | |
| char * | problem_name |
| Problem name. More... | |
| char * | problem_id |
| Problem ID (unique in the containing suite) More... | |
| char * | problem_type |
| Problem type. More... | |
| size_t | evaluations |
| Number of objective function evaluations performed on the problem. More... | |
| size_t | evaluations_constraints |
| Number of constraint function evaluations performed on the problem. More... | |
| double | final_target_delta [1] |
| Final target delta. More... | |
| double | best_observed_fvalue [1] |
| The best observed value so far. More... | |
| size_t | best_observed_evaluation [1] |
| The evaluation when the best value so far was achieved. More... | |
| coco_suite_t * | suite |
| Pointer to the containing suite (NULL if not given) More... | |
| size_t | suite_dep_index |
| Suite-depending problem index (starting from 0) More... | |
| size_t | suite_dep_function |
| Suite-depending function. More... | |
| size_t | suite_dep_instance |
| Suite-depending instance. More... | |
| void * | data |
| Pointer to a data instance. More... | |
| void * | versatile_data |
Detailed Description
The COCO problem structure.
This is one of the main structures in COCO. It contains information about a problem to be optimized. The problems can be wrapped around each other (similar to the onion layers) by means of the data field and the coco_problem_transformed_data_t structure creating some kind of "object inheritance". Even the logger is considered as just another coco_problem instance wrapped around the original problem.
Field Documentation
| size_t best_observed_evaluation[1] |
The evaluation when the best value so far was achieved.
| double best_observed_fvalue[1] |
The best observed value so far.
| double* best_parameter |
Optimal decision vector (defined only when unique)
| double* best_value |
Optimal (smallest) function value.
| void* data |
Pointer to a data instance.
- See also
- coco_problem_transformed_data_t
| coco_evaluate_function_t evaluate_constraint |
The function for evaluating the constraints.
| coco_evaluate_function_t evaluate_function |
The function for evaluating the problem.
| coco_evaluate_function_t evaluate_gradient |
The function for evaluating the constraints.
| size_t evaluations |
Number of objective function evaluations performed on the problem.
| size_t evaluations_constraints |
Number of constraint function evaluations performed on the problem.
| double final_target_delta[1] |
Final target delta.
| double* initial_solution |
Initial feasible solution.
| double* largest_values_of_interest |
The upper bounds of the ROI in the decision space.
| double* nadir_value |
The nadir point (defined when number_of_objectives > 1)
| size_t number_of_constraints |
Number of constraints.
| size_t number_of_integer_variables |
Number of integer variables (if > 0, all integer variables come before any continuous ones).
| size_t number_of_objectives |
Number of objectives.
| size_t number_of_variables |
Number of variables expected by the function, i.e. problem dimension.
| coco_problem_free_function_t problem_free_function |
The function for freeing this problem.
| char* problem_id |
Problem ID (unique in the containing suite)
| char* problem_name |
Problem name.
| char* problem_type |
Problem type.
| coco_recommend_function_t recommend_solution |
The function for recommending a solution.
| double* smallest_values_of_interest |
The lower bounds of the ROI in the decision space.
| coco_suite_t* suite |
Pointer to the containing suite (NULL if not given)
| size_t suite_dep_function |
Suite-depending function.
| size_t suite_dep_index |
Suite-depending problem index (starting from 0)
| size_t suite_dep_instance |
Suite-depending instance.
| void* versatile_data |
The documentation for this struct was generated from the following file:
- C:/Users/dimo/Desktop/coco/code-experiments/src/coco_internal.h
