ApproximateLineSearch

A line search optimizes a function of one variable without analytic gradient information. It's often used approximately (e.g. in backtracking line search), where there is no intrinsic termination criterion, only extrinsic

class Object
trait Matchable
class Any

Type members

Classlikes

final case class State(alpha: Double, value: Double, deriv: Double)

Value members

Abstract methods

def iterations(f: DiffFunction[Double], init: Double): Iterator[State]

Concrete methods

def minimize(f: DiffFunction[Double], init: Double): Double