class StrongWolfeLineSearch extends CubicLineSearch
Linear Supertypes
Ordering
- Alphabetic
- By Inheritance
Inherited
- StrongWolfeLineSearch
- CubicLineSearch
- MinimizingLineSearch
- SerializableLogging
- Serializable
- AnyRef
- Any
- Hide All
- Show All
Visibility
- Public
- Protected
Type Members
Value Members
- final def !=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def ##: Int
- Definition Classes
- AnyRef → Any
- final def ==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- val c1: Double
- val c2: Double
- def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @native() @IntrinsicCandidate()
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equals(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef → Any
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @IntrinsicCandidate()
- def hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @IntrinsicCandidate()
- def interp(l: Bracket, r: Bracket): Double
- Definition Classes
- CubicLineSearch
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- def logger: LazyLogger
- Attributes
- protected
- Definition Classes
- SerializableLogging
- def minimize(f: DiffFunction[Double], init: Double = 1.0): Double
- Definition Classes
- StrongWolfeLineSearch → CubicLineSearch → MinimizingLineSearch
- def minimizeWithBound(f: DiffFunction[Double], init: Double = 1.0, bound: Double = 1.0): Double
Performs a line search on the function f with bound, returning a point satisfying the Strong Wolfe conditions OR satisfying sufficient decrease condition and hit bound.
Performs a line search on the function f with bound, returning a point satisfying the Strong Wolfe conditions OR satisfying sufficient decrease condition and hit bound. Based on the line search detailed in Nocedal & Wright Numerical Optimization p58. BUT add some modification for bound checking.
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @IntrinsicCandidate()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @IntrinsicCandidate()
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- def toString(): String
- Definition Classes
- AnyRef → Any
- final def wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException]) @native()
- final def wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])