Dear all,
I am wondering whether there are any plans to include bound constraints for general optimisation problems in Ceres. An implementation of the LBFGSB algorithm version 3.0 would be very useful.
This feature was mentioned in this thread but I haven't seen an update afterwards, hence this enquiry:
Would it make sense to create a feature request for this on the github issue tracker?
For the record, if that help, there is a C port of the LBFGSB v3.0 here:
There is also an Eigen-based independent reimplementation of LBFGSB (not sure if it's version 3.0 of the algorithm) in CppNumericalSolvers:
I haven't tried it yet so can't comment on the quality of this implementation in comparison to the original L-BFGS-B code.
Best wishes,
Tom