package sdp
Generic description of conic linear programs including free, linear and SDP cones.
- Source
- package.scala
- Alphabetic
- By Inheritance
- sdp
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Type Members
- case class BasisTerm(basisIndex: Int, realPart: Double, imagPart: Double) extends Product with Serializable
-
case class
Block(size: Int, basisSize: Int, basisIndices: Array[Int], rowIndices: Array[Int], colIndices: Array[Int], coefficients: Array[Double]) extends Product with Serializable
Describes a SDP constraint block expressed as a linear combination of basis elements on real scalar variables.
Describes a SDP constraint block expressed as a linear combination of basis elements on real scalar variables.
The block is described as a sparse tensor by a sequence of (basisIndex, rowIndex, colIndex, coefficient) tuples.
- size
The block is a matrix of shape size x size
- basisSize
Number of elements
- basisIndices
Index of basis element
- rowIndices
Row index
- colIndices
Column index
- coefficients
Real coefficient
- case class BlockElement(basisIndex: Int, r: Int, c: Int, realPart: Double, complexPart: Double) extends Product with Serializable
- sealed trait GenPermMat extends AnyRef
- case class MatElement(r: Int, c: Int, real: Double) extends Product with Serializable
-
case class
Program(direction: Direction, obj: Vec[Double], sdpCon: SDPConstraint, eqA: Mat[Double], ineqA: Mat[Double]) extends Product with Serializable
Description of an semidefinite program extended dual.
Description of an semidefinite program extended dual.
The conic linear program is given by:
maximize sum_i objToMaximize(i) * y(i) over real y(0), ..., y(m-1)
subject to
y(0) == 1 for all j: sum_i y(i) blocks(j).basis(i) >= 0 eqA * y == 0 ineqA * y >= 0 (component-wise)
- case class RepMat(blocks: Seq[GenPermMat]) extends Product with Serializable
- case class SDPConstraint(basisSize: Int, blocks: Seq[Block], symmetryGroup: Grp[Perm], representation: Morphism[Perm, RepMat, Group]) extends Product with Serializable