Skip to main content

RastriginBoxed

basin::problems::rastrigin

Struct RastriginBoxed 

Source 
pub struct RastriginBoxed<P> { /* private fields */ }
Available on crate feature problems only.
Expand description

Rastrigin function with explicit element-wise box bounds, suitable for solvers that require BoxConstraints (e.g. CMA-ES variants like MA-LSCh-CMA). Carries the bounds as data on the problem (tenet 4 in crate::core / CONTRIBUTING.md) and routes the cost through the same raw rastrigin free function as the unconstrained Rastrigin.

The standard search domain [−5.12, 5.12]ⁿ from Mühlenbein et al. (1991) is the common case; build it with RastriginBoxed::with_standard_bounds.

Implementations§

Source§

impl RastriginBoxed<DVector<f64>>

Source

pub fn with_standard_bounds(n: usize) -> Self

Available on crate feature nalgebra only.

Build the canonical Rastrigin instance on [−5.12, 5.12]ⁿ for the requested dimension n.

Source§

impl RastriginBoxed<Array1<f64>>

Source

pub fn with_standard_bounds(n: usize) -> Self

Available on crate feature ndarray only.

Build the canonical Rastrigin instance on [−5.12, 5.12]ⁿ for the requested dimension n.

Source§

impl RastriginBoxed<Col<f64>>

Source

pub fn with_standard_bounds(n: usize) -> Self

Available on crate feature faer only.

Build the canonical Rastrigin instance on [−5.12, 5.12]ⁿ for the requested dimension n.

Source§

impl<P> RastriginBoxed<P>

Source

pub fn new(lower: P, upper: P) -> Self

Build a Rastrigin problem with arbitrary element-wise bounds. Caller must ensure lower[i] ≤ upper[i] per component.

Source§

impl RastriginBoxed<Vec<f64>>

Source

pub fn with_standard_bounds(n: usize) -> Self

Build the canonical Rastrigin instance on [−5.12, 5.12]ⁿ for the requested dimension n.

Trait Implementations§

Source§

impl BoxConstraints for RastriginBoxed<Vec<f64>>

Source§

fn lower(&self) -> &Vec<f64>

Element-wise lower bound on Param. Same shape as Param.
Source§

fn upper(&self) -> &Vec<f64>

Element-wise upper bound on Param. Same shape as Param.
Source§

impl BoxConstraints for RastriginBoxed<DVector<f64>>

Available on crate feature nalgebra only.
Source§

fn lower(&self) -> &DVector<f64>

Element-wise lower bound on Param. Same shape as Param.
Source§

fn upper(&self) -> &DVector<f64>

Element-wise upper bound on Param. Same shape as Param.
Source§

impl BoxConstraints for RastriginBoxed<Array1<f64>>

Available on crate feature ndarray only.
Source§

fn lower(&self) -> &Array1<f64>

Element-wise lower bound on Param. Same shape as Param.
Source§

fn upper(&self) -> &Array1<f64>

Element-wise upper bound on Param. Same shape as Param.
Source§

impl BoxConstraints for RastriginBoxed<Col<f64>>

Available on crate feature faer only.
Source§

fn lower(&self) -> &Col<f64>

Element-wise lower bound on Param. Same shape as Param.
Source§

fn upper(&self) -> &Col<f64>

Element-wise upper bound on Param. Same shape as Param.
Source§

impl CostFunction for RastriginBoxed<Vec<f64>>

Source§

type Param = Vec<f64>

The parameter type the objective is defined over.
Source§

type Output = f64

Scalar cost type. In practice f64 (see CONTRIBUTING.md’s provisional choices).
Source§

type Error = Infallible

User-chosen hard-abort error. Pick std::convert::Infallible when the cost cannot fail — its niche optimization keeps Result<f64, Infallible> the same layout as bare f64 on the happy path.
Source§

fn cost(&self, x: &Vec<f64>) -> Result<f64, Infallible>

Evaluate the objective at param.
Source§

impl CostFunction for RastriginBoxed<DVector<f64>>

Available on crate feature nalgebra only.
Source§

type Param = Matrix<f64, Dyn, Const<1>, VecStorage<f64, Dyn, Const<1>>>

The parameter type the objective is defined over.
Source§

type Output = f64

Scalar cost type. In practice f64 (see CONTRIBUTING.md’s provisional choices).
Source§

type Error = Infallible

User-chosen hard-abort error. Pick std::convert::Infallible when the cost cannot fail — its niche optimization keeps Result<f64, Infallible> the same layout as bare f64 on the happy path.
Source§

fn cost(&self, x: &DVector<f64>) -> Result<f64, Infallible>

Evaluate the objective at param.
Source§

impl CostFunction for RastriginBoxed<Array1<f64>>

Available on crate feature ndarray only.
Source§

type Param = ArrayBase<OwnedRepr<f64>, Dim<[usize; 1]>>

The parameter type the objective is defined over.
Source§

type Output = f64

Scalar cost type. In practice f64 (see CONTRIBUTING.md’s provisional choices).
Source§

type Error = Infallible

User-chosen hard-abort error. Pick std::convert::Infallible when the cost cannot fail — its niche optimization keeps Result<f64, Infallible> the same layout as bare f64 on the happy path.
Source§

fn cost(&self, x: &Array1<f64>) -> Result<f64, Infallible>

Evaluate the objective at param.
Source§

impl CostFunction for RastriginBoxed<Col<f64>>

Available on crate feature faer only.
Source§

type Param = Col<Own<f64>>

The parameter type the objective is defined over.
Source§

type Output = f64

Scalar cost type. In practice f64 (see CONTRIBUTING.md’s provisional choices).
Source§

type Error = Infallible

User-chosen hard-abort error. Pick std::convert::Infallible when the cost cannot fail — its niche optimization keeps Result<f64, Infallible> the same layout as bare f64 on the happy path.
Source§

fn cost(&self, x: &Col<f64>) -> Result<f64, Infallible>

Evaluate the objective at param.
Source§

impl<P> HasSpec for RastriginBoxed<P>

Source§

const SPEC: &'static ProblemSpec

The catalogue entry for this problem type.

Auto Trait Implementations§

§

impl<P> Freeze for RastriginBoxed<P>
where P: Freeze,

§

impl<P> RefUnwindSafe for RastriginBoxed<P>
where P: RefUnwindSafe,

§

impl<P> Send for RastriginBoxed<P>
where P: Send,

§

impl<P> Sync for RastriginBoxed<P>
where P: Sync,

§

impl<P> Unpin for RastriginBoxed<P>
where P: Unpin,

§

impl<P> UnsafeUnpin for RastriginBoxed<P>
where P: UnsafeUnpin,

§

impl<P> UnwindSafe for RastriginBoxed<P>
where P: UnwindSafe,

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> ByRef<T> for T

Source§

fn by_ref(&self) -> &T

Source§

impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
where ST: ?Sized, DT: ?Sized,

Source§

impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
where ST: ?Sized, DT: ?Sized,

Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Imply<T> for U
where T: ?Sized, U: ?Sized,

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> IntoEither for T

Source§

fn into_either(self, into_left: bool) -> Either<Self, Self>

Converts self into a Left variant of Either<Self, Self> if into_left is true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
Source§

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

Converts self into a Left variant of Either<Self, Self> if into_left(&self) returns true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
Source§

impl<T> Pointable for T

Source§

const ALIGN: usize

The alignment of pointer.
Source§

type Init = T

The type for initializers.
Source§

unsafe fn init(init: <T as Pointable>::Init) -> usize

Initializes a with the given initializer. Read more
Source§

unsafe fn deref<'a>(ptr: usize) -> &'a T

Dereferences the given pointer. Read more
Source§

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

Mutably dereferences the given pointer. Read more
Source§

unsafe fn drop(ptr: usize)

Drops the object pointed to by the given pointer. Read more
Source§

impl<T> Read<Exclusive, BecauseExclusive> for T
where T: ?Sized,

Source§

impl<T> Same for T

Source§

type Output = T

Should always be Self
Source§

impl<SS, SP> SupersetOf<SS> for SP
where SS: SubsetOf<SP>,

Source§

fn to_subset(&self) -> Option<SS>

The inverse inclusion map: attempts to construct self from the equivalent element of its superset. Read more
Source§

fn is_in_subset(&self) -> bool

Checks if self is actually part of its subset T (and can be converted to it).
Source§

fn to_subset_unchecked(&self) -> SS

Use with care! Same as self.to_subset but without any property checks. Always succeeds.
Source§

fn from_subset(element: &SS) -> SP

The inclusion map: converts self to the equivalent element of its superset.
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
Source§

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

Source§

fn vzip(self) -> V