File List
Here is a list of all files with brief descriptions:
[detail level 1234]
| ▼ coco | |
| ▼ code-experiments | |
| ▼ src | |
| c_linear.c | Implements the linear constraints for the suite of constrained problems |
| coco.h | All public COCO functions, constants and variables are defined in this file |
| coco_archive.c | Definitions of functions regarding COCO archives |
| coco_internal.h | Definitions of internal COCO structures and typedefs |
| coco_observer.c | Definitions of functions regarding COCO observers |
| coco_platform.h | Automatic platform-dependent configuration of the COCO framework |
| coco_problem.c | Definitions of functions regarding COCO problems |
| coco_random.c | Definitions of functions regarding COCO random numbers |
| coco_runtime_c.c | Generic COCO runtime implementation for the C language |
| coco_runtime_matlab.c | Specific COCO runtime implementation for the Matlab language that replaces coco_runtime_c.c with the Matlab-specific counterparts |
| coco_string.c | Definitions of functions that manipulate strings |
| coco_suite.c | Definitions of functions regarding COCO suites |
| coco_utilities.c | Definitions of miscellaneous functions used throughout the COCO framework |
| f_attractive_sector.c | Implementation of the attractive sector function and problem |
| f_bent_cigar.c | Implementation of the bent cigar function and problem |
| f_bent_cigar_generalized.c | Implementation of the generalized bent cigar function and problem |
| f_bueche_rastrigin.c | Implementation of the Bueche-Rastrigin function and problem |
| f_different_powers.c | Implementation of the different powers function and problem |
| f_discus.c | Implementation of the discus function and problem |
| f_discus_generalized.c | Implementation of the discus function and problem |
| f_ellipsoid.c | Implementation of the ellipsoid function and problem |
| f_gallagher.c | Implementation of the Gallagher function and problem |
| f_griewank_rosenbrock.c | Implementation of the Griewank-Rosenbrock function and problem |
| f_katsuura.c | Implementation of the Katsuura function and problem |
| f_linear_slope.c | Implementation of the linear slope function and problem |
| f_lunacek_bi_rastrigin.c | Implementation of the Lunacek bi-Rastrigin function and problem |
| f_rastrigin.c | Implementation of the Rastrigin function and problem |
| f_rosenbrock.c | Implementation of the Rosenbrock function and problem |
| f_schaffers.c | Implementation of the Schaffer's F7 function and problem, transformations not implemented for the moment |
| f_schwefel.c | Implementation of the Schwefel function and problem |
| f_schwefel_generalized.c | Implementation of the Schwefel function and problem |
| f_sharp_ridge.c | Implementation of the sharp ridge function and problem |
| f_sharp_ridge_generalized.c | Implementation of the generalized sharp ridge function and problem |
| f_sphere.c | Implementation of the sphere function and problem |
| f_step_ellipsoid.c | Implementation of the step ellipsoid function and problem |
| f_weierstrass.c | Implementation of the Weierstrass function and problem |
| logger_bbob.c | Implementation of the bbob logger |
| logger_biobj.c | Implementation of the bbob-biobj logger |
| logger_rw.c | Implementation of the real-world logger |
| logger_toy.c | Implementation of the toy logger |
| mo_avl_tree.c | |
| mo_utilities.c | Definitions of miscellaneous functions used for multi-objective problems |
| observer_bbob.c | Implementation of the bbob observer |
| observer_biobj.c | Implementation of the bbob-biobj observer |
| observer_rw.c | Implementation of an observer for real-world problems |
| observer_toy.c | Implementation of the toy observer |
| suite_bbob.c | Implementation of the bbob suite containing 24 noiseless single-objective functions in 6 dimensions |
| suite_bbob_legacy_code.c | Legacy code from BBOB2009 required to replicate the 2009 functions |
| suite_bbob_mixint.c | Implementation of a suite with mixed-integer bbob problems. The functions are the same as those in the bbob suite with 24 functions, but the large-scale implementations of the functions are used instead of the original ones for dimensions over 40. Additionally, the functions are scaled as given by suite_bbob_mixint_scaling_factors |
| suite_biobj.c | Implementation of two bi-objective suites created by combining two single-objective problems from the bbob suite: |
| suite_biobj_best_values_hyp.c | The best known hypervolume values for the bbob-biobj and bbob-biobj-ext suite problems |
| suite_biobj_ext.c | Implementation of the extended biobjective bbob-biobj-ext suite containing 92 functions and 6 dimensions |
| suite_biobj_mixint.c | Implementation of a bi-objective mixed-integer suite. The functions are the same as those in the bbob-biobj-ext suite with 92 functions, but the large-scale implementations of the functions are used instead of the original ones for dimensions over 40 |
| suite_biobj_mixint_best_values_hyp.c | The best known hypervolume values for the bbob-biobj-mixint suite problems |
| suite_biobj_utilities.c | Implementation of some functions (mostly handling instances) used by the bi-objective suites |
| suite_cons_bbob.c | Implementation of the constrained bbob suite containing 48 constrained problems in 6 dimensions. See comments in "suite_cons_bbob_problems.c" for more details |
| suite_cons_bbob_problems.c | Implementation of the problems in the constrained BBOB suite |
| suite_largescale.c | Implementation of the bbob large-scale suite containing 24 functions in 6 large dimensions |
| suite_toy.c | Implementation of a toy suite containing 6 noiseless "basic" single-objective functions in 5 dimensions |
| transform_obj_norm_by_dim.c | Implementation of normalizing the raw fitness functions by the dimensions Mostly used to in the large-scale testsuite |
| transform_obj_oscillate.c | Implementation of oscillating the objective value |
| transform_obj_penalize.c | Implementation of adding a penalty to the objective value for solutions outside of the ROI in the decision space |
| transform_obj_power.c | Implementation of raising the objective value to the power of a given exponent |
| transform_obj_scale.c | Implementation of scaling the objective value by the given factor |
| transform_obj_shift.c | Implementation of shifting the objective value by the given offset |
| transform_vars_affine.c | Implementation of performing an affine transformation on decision values |
| transform_vars_asymmetric.c | Implementation of performing an asymmetric transformation on decision values |
| transform_vars_blockrotation.c | Implementation of performing a block-rotation transformation on decision values |
| transform_vars_blockrotation_helpers.c | Implements functions needed by transform_vars_blockrotation.c |
| transform_vars_brs.c | Implementation of the ominous 's_i scaling' of the BBOB Bueche-Rastrigin problem |
| transform_vars_conditioning.c | Implementation of conditioning decision values |
| transform_vars_discretize.c | Implementation of transforming a continuous problem to a mixed-integer problem by making some of its variables discrete. The integer variables are considered as bounded (any variable outside the decision space is mapped to the closest boundary point), while the continuous ones are treated as unbounded |
| transform_vars_gallagher_blockrotation.c | Implementation of performing a block-rotation transformation on decision values for the Gallagher function. The block-rotation is applied only once per call and the result is stored such that the sub-problems can access it |
| transform_vars_oscillate.c | Implementation of oscillating the decision values |
| transform_vars_permblockdiag.c | |
| transform_vars_permutation.c | Implementation of permuting the decision values |
| transform_vars_permutation_helpers.c | Implements functions needed by transform_vars_permutation.c |
| transform_vars_round_step.c | Implementation of rounding the variables for the step-ellipsoid function TODO: should this be a helper function instead? |
| transform_vars_scale.c | Implementation of scaling decision values by a given factor |
| transform_vars_shift.c | Implementation of shifting all decision values by an offset |
| transform_vars_x_hat.c | Implementation of multiplying the decision values by the vector 1+- |
| transform_vars_x_hat_generic.c | Implementation of multiplying the decision values by the vector 1+-. Wassim: TODO: should eventually replace the non generic version in its use in Schwefel where xopt would be set elsewhere |
| transform_vars_z_hat.c | Implementation of the z^hat transformation of decision values for the BBOB Schwefel problem |
