Solve the provided convex optimization problem.
Set the convergence tolerance of iterations for L-BFGS.
Set the convergence tolerance of iterations for L-BFGS. Default 1E-4. Smaller value will lead to higher accuracy with the cost of more iterations. This value must be nonnegative. Lower convergence values are less tolerant and therefore generally cause more iterations to be run.
Set the gradient function (of the loss function of one single data example) to be used for L-BFGS.
Set the number of corrections used in the LBFGS update.
Set the number of corrections used in the LBFGS update. Default 10. Values of numCorrections less than 3 are not recommended; large values of numCorrections will result in excessive computing time. 3 < numCorrections < 10 is recommended. Restriction: numCorrections > 0
Set the maximal number of iterations for L-BFGS.
Set the maximal number of iterations for L-BFGS. Default 100.
Set the regularization parameter.
Set the regularization parameter. Default 0.0.
Set the updater function to actually perform a gradient step in a given direction.
Set the updater function to actually perform a gradient step in a given direction. The updater is responsible to perform the update from the regularization term as well, and therefore determines what kind or regularization is used, if any.
Set the maximal number of iterations for L-BFGS.
Set the maximal number of iterations for L-BFGS. Default 100.
(Since version 1.1.0) use setNumIterations instead
:: DeveloperApi :: Class used to solve an optimization problem using Limited-memory BFGS. Reference: http://en.wikipedia.org/wiki/Limited-memory_BFGS