LBFGS

scalation.optimization.quasi_newton.LBFGS
See theLBFGS companion object
class LBFGS(f: FunctionV2S, g: FunctionV2V) extends Minimize

The LBFGS the class implements the Limited-Memory Broyden–Fletcher–Goldfarb–Shanno (BFGS) Quasi-Newton Algorithm for solving Non-Linear Programming (NLP) problems. minimize f(x)

Value parameters

f

the multi-variate objective function to be minimized

gr

its gradient vector-valued function

Attributes

Companion
object
Graph
Supertypes
trait Minimize
class Object
trait Matchable
class Any

Members list

Value members

Concrete methods

def solve(x0: VectorD, α: Double): FuncVec

Solve the Non-Linear Programming (NLP) problem by starting at x0 and iteratively moving down in the search space to a minimal point. Return the optimal point/vector x and its objective function value. For more options @see LBFGS.lbfgsMain

Solve the Non-Linear Programming (NLP) problem by starting at x0 and iteratively moving down in the search space to a minimal point. Return the optimal point/vector x and its objective function value. For more options @see LBFGS.lbfgsMain

Value parameters

x0

the starting point (initial guess)

α

the current learning rate/step size

Attributes