Hi, I have a problem that I would like to use NLopt to solve. I have access to function evaluations and gradients, and the problem is bounded (in terms of the parameters). I saw that NLopt has L-BFGS built in, but doesn't have the bounded version (usually referred to as L-BFGS-B).
Is using NLopt's L-BFGS in a bounded fashion just up to setting the correct parameters for the process, or will I have to actually dig in and change the algorithm should I want to do this? Thanks! Noam
_______________________________________________ NLopt-discuss mailing list [email protected] http://ab-initio.mit.edu/cgi-bin/mailman/listinfo/nlopt-discuss
