Trait benchmark_functions::Function

pub trait Function {
    const BOUNDS: (f64, f64);
    const MINIMUM: f64;

    fn f(x: Vec<f64>) -> f64;
    fn minimizer(n: usize) -> Vec<f64>;
}

This is a trait that ensures consistent implementation of different benchmark functions

Associated Constants

const BOUNDS: (f64, f64)

The bounds of the canonical optimization problem

const MINIMUM: f64

The global minimum is constant and zero

Loading content...

Required methods

fn f(x: Vec<f64>) -> f64

Function for evaluating the objective function

fn minimizer(n: usize) -> Vec<f64>

This function returns the minimizer (argument that will return the global minimum)

Loading content...

Implementors

impl Function for Ackley

const BOUNDS: (f64, f64)

The bounds of the canonical sphere optimization problem are infinite.

const MINIMUM: f64

The global minimum is constant and zero

fn f(x: Vec<f64>) -> f64

Function for evaluating

fn minimizer(n: usize) -> Vec<f64>

This function returns the minimizer (argument that will return the global minimum

impl Function for Griewank

const BOUNDS: (f64, f64)

The bounds of the canonical sphere optimization problem are infinite.

const MINIMUM: f64

The global minimum is constant and zero

fn f(x: Vec<f64>) -> f64

Function for evaluating

fn minimizer(n: usize) -> Vec<f64>

This function returns the minimizer (argument that will return the global minimum

impl Function for Matyas

const BOUNDS: (f64, f64)

The bounds of the canonical sphere optimization problem are infinite.

const MINIMUM: f64

The global minimum is constant and zero

fn f(x: Vec<f64>) -> f64

Function for evaluating

fn minimizer(n: usize) -> Vec<f64>

This function returns the minimizer (argument that will return the global minimum

impl Function for Rastrigin

const BOUNDS: (f64, f64)

The bounds of the canonical sphere optimization problem are infinite.

const MINIMUM: f64

The global minimum is constant and zero

fn f(x: Vec<f64>) -> f64

Function for evaluating

fn minimizer(n: usize) -> Vec<f64>

This function returns the minimizer (argument that will return the global minimum

impl Function for Ridge

const BOUNDS: (f64, f64)

The bounds of the canonical sphere optimization problem are infinite.

const MINIMUM: f64

The global minimum is constant and zero

fn f(x: Vec<f64>) -> f64

Function for evaluating

fn minimizer(n: usize) -> Vec<f64>

This function returns the minimizer (argument that will return the global minimum

impl Function for Rosenbrock

const BOUNDS: (f64, f64)

The bounds of the canonical sphere optimization problem are infinite.

const MINIMUM: f64

The global minimum is constant and zero

fn f(x: Vec<f64>) -> f64

Function for evaluating

fn minimizer(n: usize) -> Vec<f64>

This function returns the minimizer (argument that will return the global minimum

impl Function for Salomon

const BOUNDS: (f64, f64)

The bounds of the canonical sphere optimization problem are infinite.

const MINIMUM: f64

The global minimum is constant and zero

fn f(x: Vec<f64>) -> f64

Function for evaluating

fn minimizer(n: usize) -> Vec<f64>

This function returns the minimizer (argument that will return the global minimum

impl Function for Sphere

const BOUNDS: (f64, f64)

The bounds of the canonical sphere optimization problem are infinite.

const MINIMUM: f64

The global minimum is constant and zero

fn f(x: Vec<f64>) -> f64

Function for evaluating

fn minimizer(n: usize) -> Vec<f64>

This function returns the minimizer (argument that will return the global minimum

impl Function for Zakharov

const BOUNDS: (f64, f64)

The bounds of the canonical sphere optimization problem are infinite.

const MINIMUM: f64

The global minimum is constant and zero

fn f(x: Vec<f64>) -> f64

Function for evaluating

fn minimizer(n: usize) -> Vec<f64>

This function returns the minimizer (argument that will return the global minimum

Loading content...