Learn how easy it is to sync an existing GitHub or Google Code repo to a SourceForge project!

[Vxl-users] lbfgsb

 [Vxl-users] lbfgsb From: David Doria - 2009-02-16 19:17:34 ```I made a little demo for lbfgsb: The minimum of the cost function I provide (a simple quadratic surface) is (7,4). By setting a lower bound of (7.1, 4.2), this should then be the minimum. However, the first thing lbfgsb says is "This problem is unconstrained" and it still returns (7,4) as the minimum. What have I done wrong? DistanceFunction Distance(2); vnl_lbfgsb Minimizer(Distance); vnl_vector l(2); l(0) = 7.1; l(1) = 4.2; vnl_vector u(2); u(0) = 10; u(1) = 10; Minimizer.set_lower_bound(l); Minimizer.set_upper_bound(u); vnl_vector x0(2); x0(0) = 9; x0(1) = 5; cout << "Started at: " << x0 << endl; Minimizer.minimize(x0); cout << "Ended at: " << x0 << endl; Thanks, David ```

 [Vxl-users] lbfgsb From: David Doria - 2009-02-16 19:17:34 ```I made a little demo for lbfgsb: The minimum of the cost function I provide (a simple quadratic surface) is (7,4). By setting a lower bound of (7.1, 4.2), this should then be the minimum. However, the first thing lbfgsb says is "This problem is unconstrained" and it still returns (7,4) as the minimum. What have I done wrong? DistanceFunction Distance(2); vnl_lbfgsb Minimizer(Distance); vnl_vector l(2); l(0) = 7.1; l(1) = 4.2; vnl_vector u(2); u(0) = 10; u(1) = 10; Minimizer.set_lower_bound(l); Minimizer.set_upper_bound(u); vnl_vector x0(2); x0(0) = 9; x0(1) = 5; cout << "Started at: " << x0 << endl; Minimizer.minimize(x0); cout << "Ended at: " << x0 << endl; Thanks, David ```