Nonlinear programming algorithms as the (un-)constrained minimization problems with the focus on their numerical expression using various programming languages.
The Unlicense
3
stars
6
forks
source link
NLPUC: Hooke-Jeeves-Vala: Almost all good in this impl.: #52
Except one thing, there're all the reasons to claim that Vala implementation of the Hooke and Jeeves alg. is almost finished and is quite smart. But that thing is zeroed funevals value:
Except one thing, there're all the reasons to claim that Vala implementation of the Hooke and Jeeves alg. is almost finished and is quite smart. But that thing is zeroed funevals value:
`... After 0 funevals, f(x) = 1.0007e+00 at x[ 0] = 3.2121e-01 x[ 1] = 7.9306e-02 x[ 2] = 1.3822e+00 x[ 3] = 1.9121e+00
After 0 funevals, f(x) = 9.6673e-01 at x[ 0] = 3.0206e-01 x[ 1] = 8.5687e-02 x[ 2] = 1.3799e+00 x[ 3] = 1.9057e+00
HOOKE USED 27 ITERATIONS, AND RETURNED x[ 0] = 3.5318901e-01 x[ 1] = 1.0273157e-01 x[ 2] = 1.3737259e+00 x[ 3] = 1.8886365e+00 ...`