Crate slsqp

Expand description

slsqp - a pure Rust implementation

SLSQP is a sequential quadratic programming algorithm for nonlinearly constrained gradient-based optimization based on the implementation by Dieter Kraft and described in:

Dieter Kraft, “A software package for sequential quadratic programming”, Technical Report DFVLR-FB 88-28, Institut für Dynamik der Flugsysteme, Oberpfaffenhofen, July 1988. Dieter Kraft, “Algorithm 733: TOMP–Fortran modules for optimal control calculations,” ACM Transactions on Mathematical Software, vol. 20, no. 3, pp. 262-281 (1994).

The Rust code was generated/adapted from the C code from the NLopt project (version 2.7.1). The algorithme is available here as a minimize function. An initial transpilation was done with c2rust then the code was manually edited to make it work. The callback mechanism is inspired from the Rust binding of NLopt, namely rust-nlopt.

Example

cargo run --example paraboloid

rust-nlopt: the Rust binding of the NLopt project
cobyla: a pure Rust implementation of the COBYLA algorithm.

License

The project is released under MIT License.

Structs

StopTols
Tolerances used as termination criteria. For all, condition is disabled if value is not strictly positive.

Enums

FailStatus
Failed termination status of the optimization process
SuccessStatus
Successful termination status of the optimization process

Traits

Func
A trait representing a function. It is used for objective and constraint functions.

Functions

minimize
Minimizes a function using the SLSQP method.