object QuadraticMinimizer extends Serializable
Linear Supertypes
Ordering
- Alphabetic
- By Inheritance
Inherited
- QuadraticMinimizer
- Serializable
- AnyRef
- Any
- Hide All
- Show All
Visibility
- Public
- Protected
Type Members
- case class Cost(H: DenseMatrix[Double], q: DenseVector[Double]) extends DiffFunction[DenseVector[Double]] with Product with Serializable
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
- def apply(rank: Int, constraint: Constraint, lambda: Double = 1.0): QuadraticMinimizer
- def approximateMaxEigen(H: DenseMatrix[Double]): Double
- def approximateMinEigen(H: DenseMatrix[Double]): Double
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @native() @IntrinsicCandidate()
- def computeObjective(h: DenseMatrix[Double], q: DenseVector[Double], x: DenseVector[Double]): Double
- def dgetrs(A: DenseMatrix[Double], pivot: Array[Int], x: DenseVector[Double]): Unit
Triangular LU solve for finding y such that y := Ax where A is the LU factorization
Triangular LU solve for finding y such that y := Ax where A is the LU factorization
- A
vector representation of LU factorization
- pivot
pivot from LU factorization
- x
the linear term for the solve which will also host the result
- def dpotrs(A: DenseMatrix[Double], x: DenseVector[Double]): Unit
Triangular Cholesky solve for finding y through backsolves such that y := Ax
Triangular Cholesky solve for finding y through backsolves such that y := Ax
- A
vector representation of lower triangular cholesky factorization
- x
the linear term for the solve which will also host the result
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equals(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef → Any
- def gemv(alpha: Double, A: DenseMatrix[Double], x: DenseVector[Double], beta: Double, y: DenseVector[Double]): Unit
y := alpha * A * x + beta * y For
DenseMatrixA. - final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @IntrinsicCandidate()
- def hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @IntrinsicCandidate()
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- def main(args: Array[String]): Unit
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def normColumn(H: DenseMatrix[Double]): Double
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @IntrinsicCandidate()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @IntrinsicCandidate()
- def optimizeWithLBFGS(init: DenseVector[Double], H: DenseMatrix[Double], q: DenseVector[Double]): DenseVector[Double]
- 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])