breeze.optimize.proximal

QuadraticMinimizer

object QuadraticMinimizer extends Serializable

Linear Supertypes
Serializable, Serializable, AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. QuadraticMinimizer
  2. Serializable
  3. Serializable
  4. AnyRef
  5. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Type Members

  1. case class Cost(H: DenseMatrix[Double], q: DenseVector[Double]) extends DiffFunction[DenseVector[Double]] with Product with Serializable

Value Members

  1. final def !=(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  2. final def !=(arg0: Any): Boolean

    Definition Classes
    Any
  3. final def ##(): Int

    Definition Classes
    AnyRef → Any
  4. final def ==(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  5. final def ==(arg0: Any): Boolean

    Definition Classes
    Any
  6. def apply(rank: Int, constraint: Constraint, lambda: Double = 1.0): QuadraticMinimizer

  7. def approximateMaxEigen(H: DenseMatrix[Double]): Double

  8. def approximateMinEigen(H: DenseMatrix[Double]): Double

  9. final def asInstanceOf[T0]: T0

    Definition Classes
    Any
  10. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  11. def computeObjective(h: DenseMatrix[Double], q: DenseVector[Double], x: DenseVector[Double]): Double

  12. 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

  13. 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

  14. final def eq(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  15. def equals(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any
  16. def finalize(): Unit

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  17. def gemv(alpha: Double, A: DenseMatrix[Double], x: DenseVector[Double], beta: Double, y: DenseVector[Double]): Unit

    y := alpha * A * x + beta * y For DenseMatrix A.

  18. final def getClass(): Class[_]

    Definition Classes
    AnyRef → Any
  19. def hashCode(): Int

    Definition Classes
    AnyRef → Any
  20. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any
  21. def main(args: Array[String]): Unit

  22. final def ne(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  23. def normColumn(H: DenseMatrix[Double]): Double

  24. final def notify(): Unit

    Definition Classes
    AnyRef
  25. final def notifyAll(): Unit

    Definition Classes
    AnyRef
  26. def optimizeWithLBFGS(init: DenseVector[Double], H: DenseMatrix[Double], q: DenseVector[Double]): DenseVector[Double]

  27. final def synchronized[T0](arg0: ⇒ T0): T0

    Definition Classes
    AnyRef
  28. def toString(): String

    Definition Classes
    AnyRef → Any
  29. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  30. final def wait(arg0: Long, arg1: Int): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  31. final def wait(arg0: Long): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from Serializable

Inherited from Serializable

Inherited from AnyRef

Inherited from Any

Ungrouped