Add complex PSD cone

src/COSMO.jl

@@ -10,6 +10,7 @@ using Reexport
 
 export assemble!, warm_start!, empty_model!, update!
 
+const RealOrComplex{T <: Real} = Union{T, Complex{T}}
 const DefaultFloat = Float64
 const DefaultInt   = LinearAlgebra.BlasInt
 

src/MOI_wrapper.jl

@@ -20,7 +20,8 @@ const IntervalConvertible = Union{GreaterThan, Interval}
 const Zeros = MOI.Zeros
 const SOC = MOI.SecondOrderCone
 const PSDT = MOI.Scaled{MOI.PositiveSemidefiniteConeTriangle}
-const SupportedVectorSets = Union{Zeros, MOI.Nonnegatives, SOC, PSDT, MOI.ExponentialCone, MOI.DualExponentialCone, MOI.PowerCone, MOI.DualPowerCone}
+const ComplexPSDT = MOI.Scaled{MOI.HermitianPositiveSemidefiniteConeTriangle}
+const SupportedVectorSets = Union{Zeros, MOI.Nonnegatives, SOC, PSDT, ComplexPSDT, MOI.ExponentialCone, MOI.DualExponentialCone, MOI.PowerCone, MOI.DualPowerCone}
 const AggregatedSets = Union{Zeros, MOI.Nonnegatives, MOI.GreaterThan}
 aggregate_equivalent(::Type{<: MOI.Zeros}) = COSMO.ZeroSet
 aggregate_equivalent(::Type{<: Union{MOI.GreaterThan, MOI.Nonnegatives}}) = COSMO.Nonnegatives
@@ -449,7 +450,12 @@ end
 
 
 function processSet!(b::Vector{T}, rows::UnitRange{Int}, cs, s::PSDT) where {T <: AbstractFloat}
-    push!(cs, COSMO.PsdConeTriangle{T}(length(rows)))
+    push!(cs, COSMO.PsdConeTriangle{T, T}(length(rows)))
+    nothing
+end
+
+function processSet!(b::Vector{T}, rows::UnitRange{Int}, cs, s::ComplexPSDT) where {T <: AbstractFloat}
+    push!(cs, COSMO.PsdConeTriangle{T, Complex{T}}(length(rows)))
     nothing
 end
 

src/algebra.jl

@@ -222,23 +222,23 @@ function symmetrize_full!(A::AbstractMatrix{T}) where {T <: AbstractFloat}
 	nothing
 end
 
-# this function assumes real symmetric X and only considers the upper triangular part
-function is_pos_def!(X::AbstractMatrix{T}, tol::T=zero(T)) where T
+# this function assumes real or complex Hermitian X and only considers the upper triangular part
+function is_pos_def!(X::AbstractMatrix{<:RealOrComplex{T}}, tol::T=zero(T)) where {T}
 	# See https://math.stackexchange.com/a/13311
 	@inbounds for i = 1:size(X, 1)
 		X[i, i] += tol
 	end
-	F = cholesky!(Symmetric(X), check = false)
+	F = cholesky!(Hermitian(X), check = false)
 	return issuccess(F)
 end
 
-function is_neg_def!(X::AbstractMatrix{T}, tol::T=zero(T)) where T
+function is_neg_def!(X::AbstractMatrix{<:RealOrComplex{T}}, tol::T=zero(T)) where {T}
 	@. X *= -one(T)
 	return is_pos_def!(X, tol)
 end
 
-is_pos_def(X::AbstractMatrix{T}, tol::T=zero(T)) where T = is_pos_def!(copy(X), tol)
-is_neg_def(X::AbstractMatrix{T}, tol::T=zero(T)) where T = is_pos_def!(-X, tol)
+is_pos_def(X::AbstractMatrix{<:RealOrComplex{T}}, tol::T=zero(T)) where {T} = is_pos_def!(copy(X), tol)
+is_neg_def(X::AbstractMatrix{<:RealOrComplex{T}}, tol::T=zero(T)) where {T} = is_pos_def!(-X, tol)
 
 
 "Round x to the closest multiple of N."

src/chordal_decomposition/chordal_decomposition.jl

@@ -75,7 +75,8 @@ function _analyse_sparsity_pattern(ci::ChordalInfo{T}, csp::Array{Int, 1}, sets:
 end
 
 DenseEquivalent(C::COSMO.PsdCone{T}, dim::Int) where {T <: AbstractFloat} = COSMO.DensePsdCone{T}(dim)
-DenseEquivalent(C::COSMO.PsdConeTriangle{T}, dim::Int) where {T <: AbstractFloat} = COSMO.DensePsdConeTriangle{T}(dim)
+DenseEquivalent(C::COSMO.PsdConeTriangle{T, T}, dim::Int) where {T <: AbstractFloat} = COSMO.DensePsdConeTriangle{T, T}(dim)
+DenseEquivalent(C::COSMO.PsdConeTriangle{T, Complex{T}}, dim::Int) where {T <: AbstractFloat} = COSMO.DensePsdConeTriangle{T, Complex{T}}(dim)
 
 function nz_rows(a::SparseMatrixCSC{T}, ind::UnitRange{Int}, DROP_ZEROS_FLAG::Bool) where {T <: AbstractFloat}
   DROP_ZEROS_FLAG && dropzeros!(a)

src/constraint.jl

@@ -93,7 +93,17 @@ function Constraint{T}(
 	# this constructor doesnt work with cones that need special arguments like the power cone
 	set_type <: ArgumentCones && error("You can't create a constraint by passing the convex set as a type, if your convex set is a $(set_type). Please pass an object.")
 	# call the appropriate set constructor
-	convex_set = set_type{T}(size(A, 1))
+    n = size(A, 1)
+    # we can deduce whether the PsdCone must be real or complex from the dimension
+	if set_type <: PsdConeTriangles
+	    if n == 1 || isqrt(n)^2 != n
+            convex_set = set_type{T, T}(n)
+        else
+            convex_set = set_type{T, Complex{T}}(n)
+        end
+    else
+        convex_set = set_type{T}(n)
+    end
 	Constraint{T}(A, b, convex_set, args...)
 end