Skip to content

Commit c98ce7d

Browse files
committed
Update
1 parent 0129f78 commit c98ce7d

File tree

1 file changed

+0
-24
lines changed

1 file changed

+0
-24
lines changed

test/runtests.jl

Lines changed: 0 additions & 24 deletions
Original file line numberDiff line numberDiff line change
@@ -111,27 +111,3 @@ end
111111
@test log10(state_final.fsblt_gap) <= -4
112112

113113
end
114-
115-
# Low rank factor analysis testing, requires MOSEK
116-
117-
# using NExOS
118-
#
119-
# using LinearAlgebra, Convex, JuMP, MosekTools
120-
#
121-
# Σ = [1.0 -0.34019653769952096 -0.263030887801514 -0.14349389289304187 -0.18605860686109255; -0.34019653769952096 1.0 0.4848473200092671 0.3421745595621214 0.38218138592185846; -0.263030887801514 0.4848473200092671 1.0 0.3768343949936584 0.5028863662242727; -0.14349389289304187 0.3421745595621214 0.3768343949936584 1.0 0.3150998750134158; -0.18605860686109255 0.38218138592185846 0.5028863662242727 0.3150998750134158 1.0]
122-
#
123-
# n, _ = size(Σ)
124-
#
125-
# r = convert(Int64, round(rank(Σ)/2))
126-
#
127-
# M = 2*opnorm(Σ ,2)
128-
#
129-
# Z0 = Σ # zeros(n,n) Initial condition
130-
#
131-
# z0 = zeros(n) # Initial condition
132-
#
133-
# problem = NExOS.ProblemFactorAnalysisModel(Σ, r, M, Z0, z0)
134-
#
135-
# settings = NExOS.Settings(μ_max = 1, μ_min = 1e-4, μ_mult_fact = 0.5, n_iter_min = 10, n_iter_max = 10, verbose = true, freq = 50, tol = 1e-2, γ_updt_rule = :adaptive)
136-
#
137-
# state_final = NExOS.solve!(problem, settings)

0 commit comments

Comments
 (0)