Files Classes Functions Hierarchy
#include <minexpdim.h>
Public Member Functions | |
| boolc | operator! () const |
| Use this object as an iterator. | |
| virtual void | reset () |
| Set the current position as the new minimum. | |
| virtual void | operator++ () |
| 0th order approximator to minimum. | |
| minexpdim (funcstate< X > &fn_, X const h0step=20.0, uintc indexmax_=500, boolc mem_=true) | |
| Allocate the fn with new. | |
| virtual | ~minexpdim () |
| Cleanup. | |
| boolc | minmove () |
| Update the new state if successful. | |
| boolc | exploredimension (uintc i) |
| Update the new state if successful. | |
| boolc | moveOrder1 () |
| First order approxmation with N moves. | |
| boolc | moveOrder1 (uintc maxloop) |
| Move until a successful minimization. | |
| X | himax () |
| Maximum hi[i]^2. | |
| X | himaxtol () |
| Maximum tollerance abs(hi[i]). | |
| void | h0set (X h) |
| void | hiset (X h) |
Public Attributes | |
| funcstate< X > * | fn |
| Function being minimized. | |
| X * | hi |
| The step sizes. | |
| X * | h0 |
| N dimensional array of initial step sizes. | |
| X * | xi |
| From fn. | |
| X | fmin |
| The minimum. | |
| bool | mem |
| Is the memory managed? | |
| uint | index |
| Local index. | |
| bool | valid |
| Associated with ++ operator and reset(). | |
| bool | hasminimized |
| Set to true when there is a change in state with ++ opertion. | |
| uint | indexmax |
| Each index has a counter, if during iteration this is exceeded valid is set to false. | |
| bool | magnitude_increase |
| To increase algorithm stability at cost increase hi[i] on successive search. | |
Does not use derivatives. Simplist and likely expensive minimization algorithm.
Definition at line 18 of file minexpdim.h.
| minexpdim< X >::minexpdim | ( | funcstate< X > & | fn_, | |
| X const | h0step = 20.0, |
|||
| uintc | indexmax_ = 500, |
|||
| boolc | mem_ = true | |||
| ) |
Allocate the fn with new.
| void minexpdim< X >::h0set | ( | X | h | ) |
| X minexpdim< X >::himax | ( | ) |
| X minexpdim< X >::himaxtol | ( | ) |
Maximum tollerance abs(hi[i]).
| void minexpdim< X >::hiset | ( | X | h | ) |
Move until a successful minimization.
First order approxmation with N moves.
Referenced by minexpdim< X >::moveOrder1(), and minexpdimtest::test02().
| virtual void minexpdim< X >::operator++ | ( | ) | [virtual] |
0th order approximator to minimum.
Reimplemented in minexpdimN< X >, minpatternsearch< X >, and minpatternsearchorder2< X >.
Referenced by minexpdim< X >::moveOrder1().
| virtual void minexpdim< X >::reset | ( | ) | [virtual] |
Set the current position as the new minimum.
Reimplemented in minpatternsearch< X >, and minpatternsearchorder2< X >.
Referenced by minexpdimtest::test01(), and minexpdimtest::test02().
The minimum.
Definition at line 32 of file minexpdim.h.
Referenced by minexpdim< X >::exploredimension(), minexpdim< X >::minmove(), and minexpdim< X >::reset().
Function being minimized.
Definition at line 23 of file minexpdim.h.
Referenced by minexpdim< X >::exploredimension(), minexpdim< X >::h0set(), minexpdim< X >::himax(), minexpdim< X >::himaxtol(), minexpdim< X >::hiset(), minexpdim< X >::minmove(), minexpdim< X >::moveOrder1(), minexpdim< X >::operator++(), minexpdim< X >::reset(), minexpdimtest::test01(), minexpdimtest::test02(), and minexpdim< X >::~minexpdim().
N dimensional array of initial step sizes.
Definition at line 28 of file minexpdim.h.
Referenced by minexpdim< X >::h0set(), minexpdim< X >::reset(), and minexpdim< X >::~minexpdim().
| bool minexpdim< X >::hasminimized |
Set to true when there is a change in state with ++ opertion.
Definition at line 46 of file minexpdim.h.
Referenced by minexpdim< X >::exploredimension(), minexpdim< X >::minmove(), minexpdim< X >::moveOrder1(), and minexpdim< X >::reset().
The step sizes.
Definition at line 26 of file minexpdim.h.
Referenced by minexpdim< X >::exploredimension(), minexpdim< X >::himax(), minexpdim< X >::himaxtol(), minexpdim< X >::hiset(), minexpdim< X >::reset(), and minexpdim< X >::~minexpdim().
Local index.
Definition at line 42 of file minexpdim.h.
Referenced by minexpdim< X >::operator++(), and minexpdim< X >::reset().
Each index has a counter, if during iteration this is exceeded valid is set to false.
Definition at line 50 of file minexpdim.h.
Referenced by minexpdim< X >::operator++().
| bool minexpdim< X >::magnitude_increase |
To increase algorithm stability at cost increase hi[i] on successive search.
Definition at line 85 of file minexpdim.h.
Referenced by minexpdim< X >::exploredimension(), and minexpdimtest::test01().
Is the memory managed?
Definition at line 40 of file minexpdim.h.
Referenced by minexpdim< X >::~minexpdim().
Associated with ++ operator and reset().
Definition at line 44 of file minexpdim.h.
Referenced by minexpdim< X >::operator!(), minexpdim< X >::operator++(), and minexpdim< X >::reset().
From fn.
Definition at line 30 of file minexpdim.h.
Referenced by minexpdim< X >::exploredimension(), minexpdim< X >::minmove(), minexpdimtest::test01(), minexpdimtest::test02(), and minexpdim< X >::~minexpdim().
1.5.8