GlobiPack
Version of the Day
|
![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() ![]() ![]() | Simple concrete class that implements a 1D algorithm to mimimize a 1D function |
![]() ![]() ![]() ![]() | Simple concrete class that implements a 1D algorithm to bracket the minimum of a 1D merit function |
![]() ![]() ![]() ![]() | Base class for 1D linearsearch algorithms |
![]() ![]() ![]() ![]() ![]() | Linesearch subclass implementing a backtracking-only line search using an Armijo cord test condition and a quadratic interploation |
![]() ![]() ![]() ![]() ![]() | Linesearch subclass implementing a function-value-only approximate minimization algorithm using bracketing and then Brent's 1D minimization method |
![]() ![]() ![]() ![]() | Base class for 1D merit fucntions used in globalization methods |
![]() ![]() ![]() | |
![]() ![]() | Thrown if search direction not a descent direction for the merit function |
![]() ![]() | |
![]() ![]() ![]() | Base class for 1D linearsearch algorithms |
![]() ![]() ![]() | |
![]() ![]() ![]() ![]() | Linesearch subclass implementing a backtracking-only line search using an Armijo cord test condition and a quadratic interploation |
![]() ![]() ![]() ![]() | Simple concrete class that implements a 1D algorithm to mimimize a 1D function |
![]() ![]() ![]() ![]() | Linesearch subclass implementing a function-value-only approximate minimization algorithm using bracketing and then Brent's 1D minimization method |
![]() ![]() ![]() ![]() | Simple concrete class that implements a 1D algorithm to bracket the minimum of a 1D merit function |
![]() ![]() ![]() | |
![]() ![]() | Represents the evaluation point of the merit function phi(alpha) and/or is derivative Dphi(alpha) |
![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() ![]() ![]() | Simple concrete class that implements a 1D algorithm to mimimize a 1D function |
![]() ![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() ![]() ![]() | Simple concrete class that implements a 1D algorithm to bracket the minimum of a 1D merit function |
![]() ![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() ![]() ![]() | Base class for 1D linearsearch algorithms |
![]() ![]() ![]() |