Module unconstrained

Unconstrained optimization algorithms

This module provides various algorithms for unconstrained minimization problems.

Re-exports

pub use result::OptimizeResult;

pub use bfgs::minimize_bfgs;

pub use conjugate_gradient::minimize_conjugate_gradient;

pub use lbfgs::minimize_lbfgs;

pub use lbfgs::minimize_lbfgsb;

pub use nelder_mead::minimize_nelder_mead;

pub use newton::minimize_newton_cg;

pub use powell::minimize_powell;

pub use trust_region::minimize_trust_exact;

pub use trust_region::minimize_trust_krylov;

pub use trust_region::minimize_trust_ncg;

Modules

bfgs

BFGS (Broyden-Fletcher-Goldfarb-Shanno) algorithm for unconstrained optimization

conjugate_gradient

Conjugate Gradient method for unconstrained optimization

lbfgs

Limited-memory BFGS algorithms for large-scale optimization

line_search

Line search algorithms for optimization

nelder_mead

Nelder-Mead simplex algorithm for unconstrained optimization

newton

Newton methods for unconstrained optimization

powell

Powell’s method for unconstrained optimization

result

Result structure for unconstrained optimization

trust_region

Trust region methods for unconstrained optimization

utils

Common utilities for unconstrained optimization algorithms

Structs

Bounds

Bounds for optimization variables

Options

Options for optimization algorithms

Enums

Method

Optimization methods for unconstrained minimization.

Functions

minimize

Main minimize function for unconstrained optimization