Skip to main content

AlgorithmBuilder

Struct AlgorithmBuilder 

Source
pub struct AlgorithmBuilder {
Show 18 fields pub algorithm: AlgorithmChoice, pub linear_solver: LinearSolverChoice, pub linear_system_scaling: LinearSystemScalingChoice, pub linear_scaling_on_demand: bool, pub mu_strategy: MuStrategyChoice, pub mu_oracle: MuOracleKind, pub hessian_approximation: HessianApproxChoice, pub limited_memory_update_type: UpdateType, pub line_search_method: LineSearchChoice, pub warm_start_init_point: bool, pub mehrotra_algorithm: bool, pub conv_check: ConvCheckOptions, pub mu: MuOptions, pub line_search: LineSearchOptions, pub output: OutputOptions, pub warm: WarmStartOptions, pub sqp: SqpOptions, pub init: InitOptions,
}

Fields§

§algorithm: AlgorithmChoice

Top-level algorithm dispatch. Default InteriorPointbuild_with_backend returns the existing AlgorithmBundle (consumed by IpoptAlgorithm). ActiveSetSqp ⇒ caller must use build_sqp_with_backend to assemble the Phase 5b SqpAlgorithm. The two builder methods sit side by side because the assembled algorithm shape differs (IPM bundle vs SQP struct).

§linear_solver: LinearSolverChoice§linear_system_scaling: LinearSystemScalingChoice

Symmetric scaling method for the augmented KKT system. Wired into TSymLinearSolver by Self::build_with_backend. Mirrors upstream linear_system_scaling (IpAlgBuilder.cpp:538-560).

§linear_scaling_on_demand: bool

Lazy-vs-eager scaling toggle (linear_scaling_on_demand, IpTSymLinearSolver.cpp:50-58). Only consulted when linear_system_scaling != None. Upstream default is true (compute scaling only on the first solve that fails / shows poor conditioning); pounce mirrors that. Set to false to scale every factorization.

§mu_strategy: MuStrategyChoice§mu_oracle: MuOracleKind

Selector forwarded to AdaptiveMuUpdate when mu_strategy = Adaptive. Ignored for Monotone. Defaults to QualityFunction per upstream’s RegisterOptions default.

§hessian_approximation: HessianApproxChoice§limited_memory_update_type: UpdateType§line_search_method: LineSearchChoice§warm_start_init_point: bool§mehrotra_algorithm: bool

mehrotra_algorithm — when true, PdSearchDirCalc folds the Mehrotra second-order complementarity term into the search-direction RHS. Mirrors upstream’s IpAlgBuilder.cpp:Mehrotra flag. Requires mu_strategy = Adaptive so that an affine step is computed each iteration; Self::build_with_backend does not enforce this — the option-parser in application.rs is responsible for the cascading defaults (mu_oracle = probing etc.).

§conv_check: ConvCheckOptions§mu: MuOptions§line_search: LineSearchOptions§output: OutputOptions§warm: WarmStartOptions§sqp: SqpOptions

SQP-specific options (consulted only when algorithm = ActiveSetSqp).

§init: InitOptions

Implementations§

Source§

impl AlgorithmBuilder

Source

pub fn new() -> Self

Source

pub fn build(&self) -> AlgorithmBundle

Assemble the strategy bundle without a search-direction calculator. Used by structural unit tests that don’t want to pull in a linear-solver backend.

Source

pub fn build_with_backend( &self, factory: LinearBackendFactory, ) -> AlgorithmBundle

Same as Self::build but also constructs the SymLinearSolver → AugSystemSolver → PdFullSpaceSolver → PdSearchDirCalc chain via the supplied factory.

Source

pub fn build_sqp_with_backend( &self, factory: LinearBackendFactory, ) -> Option<SqpAlgorithm>

Phase 5b assembly path for the SQP algorithm. Consults self.algorithm: when ActiveSetSqp, constructs an SqpAlgorithm using the supplied backend factory for the QP subproblem solver; otherwise returns None so the caller can fall back to the IPM build_with_backend.

Sister to build_with_backend: the SQP algorithm doesn’t share AlgorithmBundle’s shape (no mu_update / no IPM line search), so the two paths return different types.

Trait Implementations§

Source§

impl Clone for AlgorithmBuilder

Source§

fn clone(&self) -> AlgorithmBuilder

Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source. Read more
Source§

impl Debug for AlgorithmBuilder

Source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
Source§

impl Default for AlgorithmBuilder

Source§

fn default() -> Self

Returns the “default value” for a type. Read more

Auto Trait Implementations§

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> CloneToUninit for T
where T: Clone,

Source§

unsafe fn clone_to_uninit(&self, dest: *mut u8)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dest. Read more
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T> Instrument for T

Source§

fn instrument(self, span: Span) -> Instrumented<Self>

Instruments this type with the provided Span, returning an Instrumented wrapper. Read more
Source§

fn in_current_span(self) -> Instrumented<Self>

Instruments this type with the current Span, returning an Instrumented wrapper. Read more
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> ToOwned for T
where T: Clone,

Source§

type Owned = T

The resulting type after obtaining ownership.
Source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
Source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
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<T> WithSubscriber for T

Source§

fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
where S: Into<Dispatch>,

Attaches the provided Subscriber to this type, returning a WithDispatch wrapper. Read more
Source§

fn with_current_subscriber(self) -> WithDispatch<Self>

Attaches the current default Subscriber to this type, returning a WithDispatch wrapper. Read more