π π = [1.0, 0.0]
π¬[:, d] = JuMP.VariableRef[π¬[1,2], π¬[2,2]]
------------------------------------------------------------------
SCS v3.2.7 - Splitting Conic Solver
(c) Brendan O'Donoghue, Stanford University, 2012
------------------------------------------------------------------
problem: variables n: 14, constraints m: 26
cones: z: primal zero / dual free vars: 2
l: linear vars: 24
settings: eps_abs: 1.0e-004, eps_rel: 1.0e-004, eps_infeas: 1.0e-007
alpha: 1.50, scale: 1.00e-001, adaptive_scale: 1
max_iters: 100000, normalize: 1, rho_x: 1.00e-006
acceleration_lookback: 10, acceleration_interval: 10
compiled with openmp parallelization enabled
lin-sys: sparse-direct-amd-qdldl
nnz(A): 34, nnz(P): 0
------------------------------------------------------------------
iter | pri res | dua res | gap | obj | scale | time (s)
------------------------------------------------------------------
0|1.00e+001 1.04e+000 1.99e+001 -1.01e+001 1.00e-001 6.46e-004
50|2.57e-006 1.48e-006 1.82e-006 -2.00e-001 1.00e-001 1.34e-003
------------------------------------------------------------------
status: solved
timings: total: 1.34e-003s = setup: 1.55e-004s + solve: 1.18e-003s
lin-sys: 1.94e-005s, cones: 5.80e-006s, accel: 3.10e-006s
------------------------------------------------------------------
objective = -0.199999
------------------------------------------------------------------
π π = [0.0, 1.0]
π¬[:, d] = JuMP.VariableRef[π¬[1,2], π¬[2,2]]
------------------------------------------------------------------
SCS v3.2.7 - Splitting Conic Solver
(c) Brendan O'Donoghue, Stanford University, 2012
------------------------------------------------------------------
problem: variables n: 14, constraints m: 26
cones: z: primal zero / dual free vars: 2
l: linear vars: 24
settings: eps_abs: 1.0e-004, eps_rel: 1.0e-004, eps_infeas: 1.0e-007
alpha: 1.50, scale: 1.00e-001, adaptive_scale: 1
max_iters: 100000, normalize: 1, rho_x: 1.00e-006
acceleration_lookback: 10, acceleration_interval: 10
compiled with openmp parallelization enabled
lin-sys: sparse-direct-amd-qdldl
nnz(A): 34, nnz(P): 0
------------------------------------------------------------------
iter | pri res | dua res | gap | obj | scale | time (s)
------------------------------------------------------------------
0|1.00e+001 1.00e+000 1.97e+001 -9.95e+000 1.00e-001 4.66e-004
50|9.98e-006 2.09e-006 7.14e-007 -1.25e-001 1.00e-001 1.22e-003
------------------------------------------------------------------
status: solved
timings: total: 1.23e-003s = setup: 8.81e-005s + solve: 1.14e-003s
lin-sys: 1.99e-005s, cones: 5.20e-006s, accel: 3.00e-006s
------------------------------------------------------------------
objective = -0.125001
------------------------------------------------------------------
π π = [-1.0, 0.0]
π¬[:, d] = JuMP.VariableRef[π¬[1,2], π¬[2,2]]
------------------------------------------------------------------
SCS v3.2.7 - Splitting Conic Solver
(c) Brendan O'Donoghue, Stanford University, 2012
------------------------------------------------------------------
problem: variables n: 14, constraints m: 26
cones: z: primal zero / dual free vars: 2
l: linear vars: 24
settings: eps_abs: 1.0e-004, eps_rel: 1.0e-004, eps_infeas: 1.0e-007
alpha: 1.50, scale: 1.00e-001, adaptive_scale: 1
max_iters: 100000, normalize: 1, rho_x: 1.00e-006
acceleration_lookback: 10, acceleration_interval: 10
compiled with openmp parallelization enabled
lin-sys: sparse-direct-amd-qdldl
nnz(A): 34, nnz(P): 0
------------------------------------------------------------------
iter | pri res | dua res | gap | obj | scale | time (s)
------------------------------------------------------------------
0|1.00e+001 1.04e+000 1.99e+001 -1.01e+001 1.00e-001 4.21e-004
50|2.57e-006 1.48e-006 1.82e-006 -2.00e-001 1.00e-001 1.13e-003
------------------------------------------------------------------
status: solved
timings: total: 1.13e-003s = setup: 6.37e-005s + solve: 1.07e-003s
lin-sys: 1.89e-005s, cones: 2.17e-005s, accel: 2.30e-006s
------------------------------------------------------------------
objective = -0.199999
------------------------------------------------------------------
π π = [0.0, -1.0]
π¬[:, d] = JuMP.VariableRef[π¬[1,2], π¬[2,2]]
------------------------------------------------------------------
SCS v3.2.7 - Splitting Conic Solver
(c) Brendan O'Donoghue, Stanford University, 2012
------------------------------------------------------------------
problem: variables n: 14, constraints m: 26
cones: z: primal zero / dual free vars: 2
l: linear vars: 24
settings: eps_abs: 1.0e-004, eps_rel: 1.0e-004, eps_infeas: 1.0e-007
alpha: 1.50, scale: 1.00e-001, adaptive_scale: 1
max_iters: 100000, normalize: 1, rho_x: 1.00e-006
acceleration_lookback: 10, acceleration_interval: 10
compiled with openmp parallelization enabled
lin-sys: sparse-direct-amd-qdldl
nnz(A): 34, nnz(P): 0
------------------------------------------------------------------
iter | pri res | dua res | gap | obj | scale | time (s)
------------------------------------------------------------------
0|1.00e+001 1.00e+000 1.97e+001 -9.95e+000 1.00e-001 2.77e-004
50|9.98e-006 2.09e-006 7.14e-007 -1.25e-001 1.00e-001 6.10e-004
------------------------------------------------------------------
status: solved
timings: total: 6.11e-004s = setup: 4.40e-005s + solve: 5.67e-004s
lin-sys: 4.83e-005s, cones: 5.50e-006s, accel: 2.40e-006s
------------------------------------------------------------------
objective = -0.125001
------------------------------------------------------------------
π π = [1.0, 0.0]
π¬[:, d] = JuMP.VariableRef[π¬[1,3], π¬[2,3]]
------------------------------------------------------------------
SCS v3.2.7 - Splitting Conic Solver
(c) Brendan O'Donoghue, Stanford University, 2012
------------------------------------------------------------------
problem: variables n: 21, constraints m: 38
cones: z: primal zero / dual free vars: 4
l: linear vars: 34
settings: eps_abs: 1.0e-004, eps_rel: 1.0e-004, eps_infeas: 1.0e-007
alpha: 1.50, scale: 1.00e-001, adaptive_scale: 1
max_iters: 100000, normalize: 1, rho_x: 1.00e-006
acceleration_lookback: 10, acceleration_interval: 10
compiled with openmp parallelization enabled
lin-sys: sparse-direct-amd-qdldl
nnz(A): 54, nnz(P): 0
------------------------------------------------------------------
iter | pri res | dua res | gap | obj | scale | time (s)
------------------------------------------------------------------
0|1.00e+001 1.01e+000 2.95e+001 -1.49e+001 1.00e-001 4.21e-004
75|7.08e-007 8.89e-009 8.65e-009 -1.96e-001 1.00e-001 1.40e-003
------------------------------------------------------------------
status: solved
timings: total: 1.40e-003s = setup: 7.53e-005s + solve: 1.32e-003s
lin-sys: 4.24e-005s, cones: 1.02e-005s, accel: 4.10e-006s
------------------------------------------------------------------
objective = -0.196250
------------------------------------------------------------------
π π = [0.0, 1.0]
π¬[:, d] = JuMP.VariableRef[π¬[1,3], π¬[2,3]]
------------------------------------------------------------------
SCS v3.2.7 - Splitting Conic Solver
(c) Brendan O'Donoghue, Stanford University, 2012
------------------------------------------------------------------
problem: variables n: 21, constraints m: 38
cones: z: primal zero / dual free vars: 4
l: linear vars: 34
settings: eps_abs: 1.0e-004, eps_rel: 1.0e-004, eps_infeas: 1.0e-007
alpha: 1.50, scale: 1.00e-001, adaptive_scale: 1
max_iters: 100000, normalize: 1, rho_x: 1.00e-006
acceleration_lookback: 10, acceleration_interval: 10
compiled with openmp parallelization enabled
lin-sys: sparse-direct-amd-qdldl
nnz(A): 54, nnz(P): 0
------------------------------------------------------------------
iter | pri res | dua res | gap | obj | scale | time (s)
------------------------------------------------------------------
0|1.00e+001 1.00e+000 3.31e+001 -1.67e+001 1.00e-001 3.86e-004
50|3.46e-005 1.79e-006 1.34e-005 -2.31e-001 1.00e-001 9.05e-004
------------------------------------------------------------------
status: solved
timings: total: 9.06e-004s = setup: 6.02e-005s + solve: 8.46e-004s
lin-sys: 2.77e-005s, cones: 6.60e-006s, accel: 2.80e-006s
------------------------------------------------------------------
objective = -0.231245
------------------------------------------------------------------
π π = [-1.0, 0.0]
π¬[:, d] = JuMP.VariableRef[π¬[1,3], π¬[2,3]]
------------------------------------------------------------------
SCS v3.2.7 - Splitting Conic Solver
(c) Brendan O'Donoghue, Stanford University, 2012
------------------------------------------------------------------
problem: variables n: 21, constraints m: 38
cones: z: primal zero / dual free vars: 4
l: linear vars: 34
settings: eps_abs: 1.0e-004, eps_rel: 1.0e-004, eps_infeas: 1.0e-007
alpha: 1.50, scale: 1.00e-001, adaptive_scale: 1
max_iters: 100000, normalize: 1, rho_x: 1.00e-006
acceleration_lookback: 10, acceleration_interval: 10
compiled with openmp parallelization enabled
lin-sys: sparse-direct-amd-qdldl
nnz(A): 54, nnz(P): 0
------------------------------------------------------------------
iter | pri res | dua res | gap | obj | scale | time (s)
------------------------------------------------------------------
0|1.00e+001 1.01e+000 2.95e+001 -1.49e+001 1.00e-001 1.67e-004
75|7.08e-007 8.89e-009 8.65e-009 -1.96e-001 1.00e-001 5.73e-004
------------------------------------------------------------------
status: solved
timings: total: 5.74e-004s = setup: 5.90e-005s + solve: 5.15e-004s
lin-sys: 4.18e-005s, cones: 9.80e-006s, accel: 4.10e-006s
------------------------------------------------------------------
objective = -0.196250
------------------------------------------------------------------
π π = [0.0, -1.0]
π¬[:, d] = JuMP.VariableRef[π¬[1,3], π¬[2,3]]
------------------------------------------------------------------
SCS v3.2.7 - Splitting Conic Solver
(c) Brendan O'Donoghue, Stanford University, 2012
------------------------------------------------------------------
problem: variables n: 21, constraints m: 38
cones: z: primal zero / dual free vars: 4
l: linear vars: 34
settings: eps_abs: 1.0e-004, eps_rel: 1.0e-004, eps_infeas: 1.0e-007
alpha: 1.50, scale: 1.00e-001, adaptive_scale: 1
max_iters: 100000, normalize: 1, rho_x: 1.00e-006
acceleration_lookback: 10, acceleration_interval: 10
compiled with openmp parallelization enabled
lin-sys: sparse-direct-amd-qdldl
nnz(A): 54, nnz(P): 0
------------------------------------------------------------------
iter | pri res | dua res | gap | obj | scale | time (s)
------------------------------------------------------------------
0|1.00e+001 1.00e+000 3.31e+001 -1.67e+001 1.00e-001 2.29e-004
50|3.46e-005 1.79e-006 1.34e-005 -2.31e-001 1.00e-001 6.14e-004
------------------------------------------------------------------
status: solved
timings: total: 6.15e-004s = setup: 5.90e-005s + solve: 5.57e-004s
lin-sys: 4.30e-005s, cones: 6.70e-006s, accel: 2.50e-006s
------------------------------------------------------------------
objective = -0.231245
------------------------------------------------------------------
π π = [1.0, 0.0]
π¬[:, d] = JuMP.VariableRef[π¬[1,4], π¬[2,4]]
------------------------------------------------------------------
SCS v3.2.7 - Splitting Conic Solver
(c) Brendan O'Donoghue, Stanford University, 2012
------------------------------------------------------------------
problem: variables n: 28, constraints m: 50
cones: z: primal zero / dual free vars: 6
l: linear vars: 44
settings: eps_abs: 1.0e-004, eps_rel: 1.0e-004, eps_infeas: 1.0e-007
alpha: 1.50, scale: 1.00e-001, adaptive_scale: 1
max_iters: 100000, normalize: 1, rho_x: 1.00e-006
acceleration_lookback: 10, acceleration_interval: 10
compiled with openmp parallelization enabled
lin-sys: sparse-direct-amd-qdldl
nnz(A): 74, nnz(P): 0
------------------------------------------------------------------
iter | pri res | dua res | gap | obj | scale | time (s)
------------------------------------------------------------------
0|1.00e+001 1.00e+000 3.83e+001 -1.93e+001 1.00e-001 3.91e-004
50|1.86e-004 9.18e-006 5.22e-006 -1.89e-001 1.00e-001 8.59e-004
------------------------------------------------------------------
status: solved
timings: total: 8.61e-004s = setup: 8.58e-005s + solve: 7.75e-004s
lin-sys: 5.35e-005s, cones: 7.90e-006s, accel: 3.80e-006s
------------------------------------------------------------------
objective = -0.189306
------------------------------------------------------------------
π π = [0.0, 1.0]
π¬[:, d] = JuMP.VariableRef[π¬[1,4], π¬[2,4]]
------------------------------------------------------------------
SCS v3.2.7 - Splitting Conic Solver
(c) Brendan O'Donoghue, Stanford University, 2012
------------------------------------------------------------------
problem: variables n: 28, constraints m: 50
cones: z: primal zero / dual free vars: 6
l: linear vars: 44
settings: eps_abs: 1.0e-004, eps_rel: 1.0e-004, eps_infeas: 1.0e-007
alpha: 1.50, scale: 1.00e-001, adaptive_scale: 1
max_iters: 100000, normalize: 1, rho_x: 1.00e-006
acceleration_lookback: 10, acceleration_interval: 10
compiled with openmp parallelization enabled
lin-sys: sparse-direct-amd-qdldl
nnz(A): 74, nnz(P): 0
------------------------------------------------------------------
iter | pri res | dua res | gap | obj | scale | time (s)
------------------------------------------------------------------
0|1.25e+001 1.31e+000 5.23e+001 -2.64e+001 1.00e-001 3.08e-004
50|1.16e-004 7.60e-006 5.19e-005 -3.18e-001 1.00e-001 7.07e-004
------------------------------------------------------------------
status: solved
timings: total: 7.08e-004s = setup: 6.99e-005s + solve: 6.38e-004s
lin-sys: 3.76e-005s, cones: 8.20e-006s, accel: 2.90e-006s
------------------------------------------------------------------
objective = -0.318405
------------------------------------------------------------------
π π = [-1.0, 0.0]
π¬[:, d] = JuMP.VariableRef[π¬[1,4], π¬[2,4]]
------------------------------------------------------------------
SCS v3.2.7 - Splitting Conic Solver
(c) Brendan O'Donoghue, Stanford University, 2012
------------------------------------------------------------------
problem: variables n: 28, constraints m: 50
cones: z: primal zero / dual free vars: 6
l: linear vars: 44
settings: eps_abs: 1.0e-004, eps_rel: 1.0e-004, eps_infeas: 1.0e-007
alpha: 1.50, scale: 1.00e-001, adaptive_scale: 1
max_iters: 100000, normalize: 1, rho_x: 1.00e-006
acceleration_lookback: 10, acceleration_interval: 10
compiled with openmp parallelization enabled
lin-sys: sparse-direct-amd-qdldl
nnz(A): 74, nnz(P): 0
------------------------------------------------------------------
iter | pri res | dua res | gap | obj | scale | time (s)
------------------------------------------------------------------
0|1.00e+001 1.00e+000 3.83e+001 -1.93e+001 1.00e-001 1.69e-004
50|1.86e-004 9.18e-006 5.22e-006 -1.89e-001 1.00e-001 3.98e-004
------------------------------------------------------------------
status: solved
timings: total: 4.00e-004s = setup: 6.85e-005s + solve: 3.31e-004s
lin-sys: 3.74e-005s, cones: 7.80e-006s, accel: 2.80e-006s
------------------------------------------------------------------
objective = -0.189306
------------------------------------------------------------------
π π = [0.0, -1.0]
π¬[:, d] = JuMP.VariableRef[π¬[1,4], π¬[2,4]]
------------------------------------------------------------------
SCS v3.2.7 - Splitting Conic Solver
(c) Brendan O'Donoghue, Stanford University, 2012
------------------------------------------------------------------
problem: variables n: 28, constraints m: 50
cones: z: primal zero / dual free vars: 6
l: linear vars: 44
settings: eps_abs: 1.0e-004, eps_rel: 1.0e-004, eps_infeas: 1.0e-007
alpha: 1.50, scale: 1.00e-001, adaptive_scale: 1
max_iters: 100000, normalize: 1, rho_x: 1.00e-006
acceleration_lookback: 10, acceleration_interval: 10
compiled with openmp parallelization enabled
lin-sys: sparse-direct-amd-qdldl
nnz(A): 74, nnz(P): 0
------------------------------------------------------------------
iter | pri res | dua res | gap | obj | scale | time (s)
------------------------------------------------------------------
0|1.25e+001 1.31e+000 5.23e+001 -2.64e+001 1.00e-001 1.88e-004
50|1.16e-004 7.60e-006 5.19e-005 -3.18e-001 1.00e-001 4.22e-004
------------------------------------------------------------------
status: solved
timings: total: 4.23e-004s = setup: 6.54e-005s + solve: 3.58e-004s
lin-sys: 4.12e-005s, cones: 7.60e-006s, accel: 3.20e-006s
------------------------------------------------------------------
objective = -0.318405
------------------------------------------------------------------
π π = [1.0, 0.0]
π¬[:, d] = JuMP.VariableRef[π¬[1,5], π¬[2,5]]
------------------------------------------------------------------
SCS v3.2.7 - Splitting Conic Solver
(c) Brendan O'Donoghue, Stanford University, 2012
------------------------------------------------------------------
problem: variables n: 35, constraints m: 62
cones: z: primal zero / dual free vars: 8
l: linear vars: 54
settings: eps_abs: 1.0e-004, eps_rel: 1.0e-004, eps_infeas: 1.0e-007
alpha: 1.50, scale: 1.00e-001, adaptive_scale: 1
max_iters: 100000, normalize: 1, rho_x: 1.00e-006
acceleration_lookback: 10, acceleration_interval: 10
compiled with openmp parallelization enabled
lin-sys: sparse-direct-amd-qdldl
nnz(A): 94, nnz(P): 0
------------------------------------------------------------------
iter | pri res | dua res | gap | obj | scale | time (s)
------------------------------------------------------------------
0|1.00e+001 1.00e+000 4.61e+001 -2.32e+001 1.00e-001 3.98e-004
50|1.75e-004 1.49e-005 1.67e-005 -1.80e-001 1.00e-001 1.04e-003
------------------------------------------------------------------
status: solved
timings: total: 1.04e-003s = setup: 9.46e-005s + solve: 9.47e-004s
lin-sys: 4.90e-005s, cones: 1.01e-005s, accel: 2.01e-005s
------------------------------------------------------------------
objective = -0.179756
------------------------------------------------------------------
π π = [0.0, 1.0]
π¬[:, d] = JuMP.VariableRef[π¬[1,5], π¬[2,5]]
------------------------------------------------------------------
SCS v3.2.7 - Splitting Conic Solver
(c) Brendan O'Donoghue, Stanford University, 2012
------------------------------------------------------------------
problem: variables n: 35, constraints m: 62
cones: z: primal zero / dual free vars: 8
l: linear vars: 54
settings: eps_abs: 1.0e-004, eps_rel: 1.0e-004, eps_infeas: 1.0e-007
alpha: 1.50, scale: 1.00e-001, adaptive_scale: 1
max_iters: 100000, normalize: 1, rho_x: 1.00e-006
acceleration_lookback: 10, acceleration_interval: 10
compiled with openmp parallelization enabled
lin-sys: sparse-direct-amd-qdldl
nnz(A): 94, nnz(P): 0
------------------------------------------------------------------
iter | pri res | dua res | gap | obj | scale | time (s)
------------------------------------------------------------------
0|1.53e+001 1.59e+000 7.79e+001 -3.92e+001 1.00e-001 3.93e-004
75|5.81e-007 1.18e-007 6.02e-008 -3.87e-001 1.00e-001 9.79e-004
------------------------------------------------------------------
status: solved
timings: total: 9.81e-004s = setup: 7.80e-005s + solve: 9.03e-004s
lin-sys: 1.01e-004s, cones: 1.20e-005s, accel: 4.40e-006s
------------------------------------------------------------------
objective = -0.386766
------------------------------------------------------------------
π π = [-1.0, 0.0]
π¬[:, d] = JuMP.VariableRef[π¬[1,5], π¬[2,5]]
------------------------------------------------------------------
SCS v3.2.7 - Splitting Conic Solver
(c) Brendan O'Donoghue, Stanford University, 2012
------------------------------------------------------------------
problem: variables n: 35, constraints m: 62
cones: z: primal zero / dual free vars: 8
l: linear vars: 54
settings: eps_abs: 1.0e-004, eps_rel: 1.0e-004, eps_infeas: 1.0e-007
alpha: 1.50, scale: 1.00e-001, adaptive_scale: 1
max_iters: 100000, normalize: 1, rho_x: 1.00e-006
acceleration_lookback: 10, acceleration_interval: 10
compiled with openmp parallelization enabled
lin-sys: sparse-direct-amd-qdldl
nnz(A): 94, nnz(P): 0
------------------------------------------------------------------
iter | pri res | dua res | gap | obj | scale | time (s)
------------------------------------------------------------------
0|1.00e+001 1.00e+000 4.61e+001 -2.32e+001 1.00e-001 2.46e-004
50|1.75e-004 1.49e-005 1.67e-005 -1.80e-001 1.00e-001 5.00e-004
------------------------------------------------------------------
status: solved
timings: total: 5.01e-004s = setup: 7.68e-005s + solve: 4.24e-004s
lin-sys: 5.06e-005s, cones: 9.80e-006s, accel: 3.50e-006s
------------------------------------------------------------------
objective = -0.179756
------------------------------------------------------------------
π π = [0.0, -1.0]
π¬[:, d] = JuMP.VariableRef[π¬[1,5], π¬[2,5]]
------------------------------------------------------------------
SCS v3.2.7 - Splitting Conic Solver
(c) Brendan O'Donoghue, Stanford University, 2012
------------------------------------------------------------------
problem: variables n: 35, constraints m: 62
cones: z: primal zero / dual free vars: 8
l: linear vars: 54
settings: eps_abs: 1.0e-004, eps_rel: 1.0e-004, eps_infeas: 1.0e-007
alpha: 1.50, scale: 1.00e-001, adaptive_scale: 1
max_iters: 100000, normalize: 1, rho_x: 1.00e-006
acceleration_lookback: 10, acceleration_interval: 10
compiled with openmp parallelization enabled
lin-sys: sparse-direct-amd-qdldl
nnz(A): 94, nnz(P): 0
------------------------------------------------------------------
iter | pri res | dua res | gap | obj | scale | time (s)
------------------------------------------------------------------
0|1.53e+001 1.59e+000 7.79e+001 -3.92e+001 1.00e-001 3.83e-004
75|5.81e-007 1.18e-007 6.02e-008 -3.87e-001 1.00e-001 1.08e-003
------------------------------------------------------------------
status: solved
timings: total: 1.09e-003s = setup: 1.12e-004s + solve: 9.74e-004s
lin-sys: 8.84e-005s, cones: 1.37e-005s, accel: 5.10e-006s
------------------------------------------------------------------
objective = -0.386766
------------------------------------------------------------------
π π = [1.0, 0.0]
π¬[:, d] = JuMP.VariableRef[π¬[1,6], π¬[2,6]]
------------------------------------------------------------------
SCS v3.2.7 - Splitting Conic Solver
(c) Brendan O'Donoghue, Stanford University, 2012
------------------------------------------------------------------
problem: variables n: 42, constraints m: 74
cones: z: primal zero / dual free vars: 10
l: linear vars: 64
settings: eps_abs: 1.0e-004, eps_rel: 1.0e-004, eps_infeas: 1.0e-007
alpha: 1.50, scale: 1.00e-001, adaptive_scale: 1
max_iters: 100000, normalize: 1, rho_x: 1.00e-006
acceleration_lookback: 10, acceleration_interval: 10
compiled with openmp parallelization enabled
lin-sys: sparse-direct-amd-qdldl
nnz(A): 114, nnz(P): 0
------------------------------------------------------------------
iter | pri res | dua res | gap | obj | scale | time (s)
------------------------------------------------------------------
0|1.00e+001 1.00e+000 5.26e+001 -2.65e+001 1.00e-001 3.92e-004
50|7.14e-005 2.38e-005 2.06e-005 -1.68e-001 1.00e-001 1.08e-003
------------------------------------------------------------------
status: solved
timings: total: 1.08e-003s = setup: 1.00e-004s + solve: 9.82e-004s
lin-sys: 5.67e-005s, cones: 1.06e-005s, accel: 3.60e-006s
------------------------------------------------------------------
objective = -0.168130
------------------------------------------------------------------
π π = [0.0, 1.0]
π¬[:, d] = JuMP.VariableRef[π¬[1,6], π¬[2,6]]
------------------------------------------------------------------
SCS v3.2.7 - Splitting Conic Solver
(c) Brendan O'Donoghue, Stanford University, 2012
------------------------------------------------------------------
problem: variables n: 42, constraints m: 74
cones: z: primal zero / dual free vars: 10
l: linear vars: 64
settings: eps_abs: 1.0e-004, eps_rel: 1.0e-004, eps_infeas: 1.0e-007
alpha: 1.50, scale: 1.00e-001, adaptive_scale: 1
max_iters: 100000, normalize: 1, rho_x: 1.00e-006
acceleration_lookback: 10, acceleration_interval: 10
compiled with openmp parallelization enabled
lin-sys: sparse-direct-amd-qdldl
nnz(A): 114, nnz(P): 0
------------------------------------------------------------------
iter | pri res | dua res | gap | obj | scale | time (s)
------------------------------------------------------------------
0|1.73e+001 1.79e+000 1.09e+002 -5.49e+001 1.00e-001 3.86e-004
75|6.81e-006 6.67e-007 3.49e-006 -4.37e-001 1.00e-001 1.32e-003
------------------------------------------------------------------
status: solved
timings: total: 1.33e-003s = setup: 8.27e-005s + solve: 1.24e-003s
lin-sys: 8.40e-005s, cones: 1.42e-005s, accel: 5.00e-006s
------------------------------------------------------------------
objective = -0.436880
------------------------------------------------------------------
π π = [-1.0, 0.0]
π¬[:, d] = JuMP.VariableRef[π¬[1,6], π¬[2,6]]
------------------------------------------------------------------
SCS v3.2.7 - Splitting Conic Solver
(c) Brendan O'Donoghue, Stanford University, 2012
------------------------------------------------------------------
problem: variables n: 42, constraints m: 74
cones: z: primal zero / dual free vars: 10
l: linear vars: 64
settings: eps_abs: 1.0e-004, eps_rel: 1.0e-004, eps_infeas: 1.0e-007
alpha: 1.50, scale: 1.00e-001, adaptive_scale: 1
max_iters: 100000, normalize: 1, rho_x: 1.00e-006
acceleration_lookback: 10, acceleration_interval: 10
compiled with openmp parallelization enabled
lin-sys: sparse-direct-amd-qdldl
nnz(A): 114, nnz(P): 0
------------------------------------------------------------------
iter | pri res | dua res | gap | obj | scale | time (s)
------------------------------------------------------------------
0|1.00e+001 1.00e+000 5.26e+001 -2.65e+001 1.00e-001 1.81e-004
50|7.14e-005 2.38e-005 2.06e-005 -1.68e-001 1.00e-001 4.23e-004
------------------------------------------------------------------
status: solved
timings: total: 4.25e-004s = setup: 8.31e-005s + solve: 3.42e-004s
lin-sys: 5.63e-005s, cones: 1.01e-005s, accel: 3.70e-006s
------------------------------------------------------------------
objective = -0.168130
------------------------------------------------------------------
π π = [0.0, -1.0]
π¬[:, d] = JuMP.VariableRef[π¬[1,6], π¬[2,6]]
------------------------------------------------------------------
SCS v3.2.7 - Splitting Conic Solver
(c) Brendan O'Donoghue, Stanford University, 2012
------------------------------------------------------------------
problem: variables n: 42, constraints m: 74
cones: z: primal zero / dual free vars: 10
l: linear vars: 64
settings: eps_abs: 1.0e-004, eps_rel: 1.0e-004, eps_infeas: 1.0e-007
alpha: 1.50, scale: 1.00e-001, adaptive_scale: 1
max_iters: 100000, normalize: 1, rho_x: 1.00e-006
acceleration_lookback: 10, acceleration_interval: 10
compiled with openmp parallelization enabled
lin-sys: sparse-direct-amd-qdldl
nnz(A): 114, nnz(P): 0
------------------------------------------------------------------
iter | pri res | dua res | gap | obj | scale | time (s)
------------------------------------------------------------------
0|1.73e+001 1.79e+000 1.09e+002 -5.49e+001 1.00e-001 1.78e-004
75|6.81e-006 6.67e-007 3.49e-006 -4.37e-001 1.00e-001 5.42e-004
------------------------------------------------------------------
status: solved
timings: total: 5.43e-004s = setup: 8.10e-005s + solve: 4.62e-004s
lin-sys: 8.40e-005s, cones: 1.44e-005s, accel: 4.40e-006s
------------------------------------------------------------------
objective = -0.436880
------------------------------------------------------------------
π π = [1.0, 0.0]
π¬[:, d] = JuMP.VariableRef[π¬[1,7], π¬[2,7]]
------------------------------------------------------------------
SCS v3.2.7 - Splitting Conic Solver
(c) Brendan O'Donoghue, Stanford University, 2012
------------------------------------------------------------------
problem: variables n: 49, constraints m: 86
cones: z: primal zero / dual free vars: 12
l: linear vars: 74
settings: eps_abs: 1.0e-004, eps_rel: 1.0e-004, eps_infeas: 1.0e-007
alpha: 1.50, scale: 1.00e-001, adaptive_scale: 1
max_iters: 100000, normalize: 1, rho_x: 1.00e-006
acceleration_lookback: 10, acceleration_interval: 10
compiled with openmp parallelization enabled
lin-sys: sparse-direct-amd-qdldl
nnz(A): 134, nnz(P): 0
------------------------------------------------------------------
iter | pri res | dua res | gap | obj | scale | time (s)
------------------------------------------------------------------
0|1.00e+001 1.00e+000 5.79e+001 -2.91e+001 1.00e-001 2.26e-004
50|5.56e-005 2.22e-005 2.09e-005 -1.55e-001 1.00e-001 5.83e-004
------------------------------------------------------------------
status: solved
timings: total: 5.84e-004s = setup: 1.08e-004s + solve: 4.76e-004s
lin-sys: 6.85e-005s, cones: 2.71e-005s, accel: 4.10e-006s
------------------------------------------------------------------
objective = -0.155017
------------------------------------------------------------------
π π = [0.0, 1.0]
π¬[:, d] = JuMP.VariableRef[π¬[1,7], π¬[2,7]]
------------------------------------------------------------------
SCS v3.2.7 - Splitting Conic Solver
(c) Brendan O'Donoghue, Stanford University, 2012
------------------------------------------------------------------
problem: variables n: 49, constraints m: 86
cones: z: primal zero / dual free vars: 12
l: linear vars: 74
settings: eps_abs: 1.0e-004, eps_rel: 1.0e-004, eps_infeas: 1.0e-007
alpha: 1.50, scale: 1.00e-001, adaptive_scale: 1
max_iters: 100000, normalize: 1, rho_x: 1.00e-006
acceleration_lookback: 10, acceleration_interval: 10
compiled with openmp parallelization enabled
lin-sys: sparse-direct-amd-qdldl
nnz(A): 134, nnz(P): 0
------------------------------------------------------------------
iter | pri res | dua res | gap | obj | scale | time (s)
------------------------------------------------------------------
0|1.86e+001 1.92e+000 1.45e+002 -7.27e+001 1.00e-001 2.63e-004
75|4.14e-005 8.23e-006 1.75e-005 -4.70e-001 1.00e-001 7.58e-004
------------------------------------------------------------------
status: solved
timings: total: 7.60e-004s = setup: 9.18e-005s + solve: 6.68e-004s
lin-sys: 1.16e-004s, cones: 1.61e-005s, accel: 5.50e-006s
------------------------------------------------------------------
objective = -0.469831
------------------------------------------------------------------
π π = [-1.0, 0.0]
π¬[:, d] = JuMP.VariableRef[π¬[1,7], π¬[2,7]]
------------------------------------------------------------------
SCS v3.2.7 - Splitting Conic Solver
(c) Brendan O'Donoghue, Stanford University, 2012
------------------------------------------------------------------
problem: variables n: 49, constraints m: 86
cones: z: primal zero / dual free vars: 12
l: linear vars: 74
settings: eps_abs: 1.0e-004, eps_rel: 1.0e-004, eps_infeas: 1.0e-007
alpha: 1.50, scale: 1.00e-001, adaptive_scale: 1
max_iters: 100000, normalize: 1, rho_x: 1.00e-006
acceleration_lookback: 10, acceleration_interval: 10
compiled with openmp parallelization enabled
lin-sys: sparse-direct-amd-qdldl
nnz(A): 134, nnz(P): 0
------------------------------------------------------------------
iter | pri res | dua res | gap | obj | scale | time (s)
------------------------------------------------------------------
0|1.00e+001 1.00e+000 5.79e+001 -2.91e+001 1.00e-001 3.63e-004
50|5.56e-005 2.22e-005 2.09e-005 -1.55e-001 1.00e-001 8.30e-004
------------------------------------------------------------------
status: solved
timings: total: 8.32e-004s = setup: 9.19e-005s + solve: 7.40e-004s
lin-sys: 8.20e-005s, cones: 1.07e-005s, accel: 3.30e-006s
------------------------------------------------------------------
objective = -0.155017
------------------------------------------------------------------
π π = [0.0, -1.0]
π¬[:, d] = JuMP.VariableRef[π¬[1,7], π¬[2,7]]
------------------------------------------------------------------
SCS v3.2.7 - Splitting Conic Solver
(c) Brendan O'Donoghue, Stanford University, 2012
------------------------------------------------------------------
problem: variables n: 49, constraints m: 86
cones: z: primal zero / dual free vars: 12
l: linear vars: 74
settings: eps_abs: 1.0e-004, eps_rel: 1.0e-004, eps_infeas: 1.0e-007
alpha: 1.50, scale: 1.00e-001, adaptive_scale: 1
max_iters: 100000, normalize: 1, rho_x: 1.00e-006
acceleration_lookback: 10, acceleration_interval: 10
compiled with openmp parallelization enabled
lin-sys: sparse-direct-amd-qdldl
nnz(A): 134, nnz(P): 0
------------------------------------------------------------------
iter | pri res | dua res | gap | obj | scale | time (s)
------------------------------------------------------------------
0|1.86e+001 1.92e+000 1.45e+002 -7.27e+001 1.00e-001 1.90e-004
75|4.14e-005 8.23e-006 1.75e-005 -4.70e-001 1.00e-001 5.71e-004
------------------------------------------------------------------
status: solved
timings: total: 5.72e-004s = setup: 9.16e-005s + solve: 4.80e-004s
lin-sys: 1.00e-004s, cones: 1.58e-005s, accel: 5.30e-006s
------------------------------------------------------------------
objective = -0.469831
------------------------------------------------------------------
π π = [1.0, 0.0]
π¬[:, d] = JuMP.VariableRef[π¬[1,8], π¬[2,8]]
------------------------------------------------------------------
SCS v3.2.7 - Splitting Conic Solver
(c) Brendan O'Donoghue, Stanford University, 2012
------------------------------------------------------------------
problem: variables n: 56, constraints m: 98
cones: z: primal zero / dual free vars: 14
l: linear vars: 84
settings: eps_abs: 1.0e-004, eps_rel: 1.0e-004, eps_infeas: 1.0e-007
alpha: 1.50, scale: 1.00e-001, adaptive_scale: 1
max_iters: 100000, normalize: 1, rho_x: 1.00e-006
acceleration_lookback: 10, acceleration_interval: 10
compiled with openmp parallelization enabled
lin-sys: sparse-direct-amd-qdldl
nnz(A): 154, nnz(P): 0
------------------------------------------------------------------
iter | pri res | dua res | gap | obj | scale | time (s)
------------------------------------------------------------------
0|1.00e+001 1.00e+000 6.20e+001 -3.11e+001 1.00e-001 2.75e-004
50|9.94e-005 1.53e-005 5.91e-006 -1.41e-001 1.00e-001 7.81e-004
------------------------------------------------------------------
status: solved
timings: total: 7.83e-004s = setup: 1.11e-004s + solve: 6.72e-004s
lin-sys: 1.05e-004s, cones: 1.25e-005s, accel: 4.20e-006s
------------------------------------------------------------------
objective = -0.140943
------------------------------------------------------------------
π π = [0.0, 1.0]
π¬[:, d] = JuMP.VariableRef[π¬[1,8], π¬[2,8]]
------------------------------------------------------------------
SCS v3.2.7 - Splitting Conic Solver
(c) Brendan O'Donoghue, Stanford University, 2012
------------------------------------------------------------------
problem: variables n: 56, constraints m: 98
cones: z: primal zero / dual free vars: 14
l: linear vars: 84
settings: eps_abs: 1.0e-004, eps_rel: 1.0e-004, eps_infeas: 1.0e-007
alpha: 1.50, scale: 1.00e-001, adaptive_scale: 1
max_iters: 100000, normalize: 1, rho_x: 1.00e-006
acceleration_lookback: 10, acceleration_interval: 10
compiled with openmp parallelization enabled
lin-sys: sparse-direct-amd-qdldl
nnz(A): 154, nnz(P): 0
------------------------------------------------------------------
iter | pri res | dua res | gap | obj | scale | time (s)
------------------------------------------------------------------
0|1.93e+001 1.99e+000 1.83e+002 -9.18e+001 1.00e-001 2.79e-004
100|5.11e-007 6.16e-008 2.78e-007 -4.87e-001 1.00e-001 8.76e-004
------------------------------------------------------------------
status: solved
timings: total: 8.78e-004s = setup: 9.80e-005s + solve: 7.80e-004s
lin-sys: 1.67e-004s, cones: 2.24e-005s, accel: 7.10e-006s
------------------------------------------------------------------
objective = -0.486884
------------------------------------------------------------------
π π = [-1.0, 0.0]
π¬[:, d] = JuMP.VariableRef[π¬[1,8], π¬[2,8]]
------------------------------------------------------------------
SCS v3.2.7 - Splitting Conic Solver
(c) Brendan O'Donoghue, Stanford University, 2012
------------------------------------------------------------------
problem: variables n: 56, constraints m: 98
cones: z: primal zero / dual free vars: 14
l: linear vars: 84
settings: eps_abs: 1.0e-004, eps_rel: 1.0e-004, eps_infeas: 1.0e-007
alpha: 1.50, scale: 1.00e-001, adaptive_scale: 1
max_iters: 100000, normalize: 1, rho_x: 1.00e-006
acceleration_lookback: 10, acceleration_interval: 10
compiled with openmp parallelization enabled
lin-sys: sparse-direct-amd-qdldl
nnz(A): 154, nnz(P): 0
------------------------------------------------------------------
iter | pri res | dua res | gap | obj | scale | time (s)
------------------------------------------------------------------
0|1.00e+001 1.00e+000 6.20e+001 -3.11e+001 1.00e-001 3.07e-004
50|9.94e-005 1.53e-005 5.91e-006 -1.41e-001 1.00e-001 6.05e-004
------------------------------------------------------------------
status: solved
timings: total: 6.07e-004s = setup: 1.63e-004s + solve: 4.44e-004s
lin-sys: 8.16e-005s, cones: 1.31e-005s, accel: 4.80e-006s
------------------------------------------------------------------
objective = -0.140943
------------------------------------------------------------------
π π = [0.0, -1.0]
π¬[:, d] = JuMP.VariableRef[π¬[1,8], π¬[2,8]]
------------------------------------------------------------------
SCS v3.2.7 - Splitting Conic Solver
(c) Brendan O'Donoghue, Stanford University, 2012
------------------------------------------------------------------
problem: variables n: 56, constraints m: 98
cones: z: primal zero / dual free vars: 14
l: linear vars: 84
settings: eps_abs: 1.0e-004, eps_rel: 1.0e-004, eps_infeas: 1.0e-007
alpha: 1.50, scale: 1.00e-001, adaptive_scale: 1
max_iters: 100000, normalize: 1, rho_x: 1.00e-006
acceleration_lookback: 10, acceleration_interval: 10
compiled with openmp parallelization enabled
lin-sys: sparse-direct-amd-qdldl
nnz(A): 154, nnz(P): 0
------------------------------------------------------------------
iter | pri res | dua res | gap | obj | scale | time (s)
------------------------------------------------------------------
0|1.93e+001 1.99e+000 1.83e+002 -9.18e+001 1.00e-001 2.25e-004
100|5.11e-007 6.16e-008 2.78e-007 -4.87e-001 1.00e-001 7.82e-004
------------------------------------------------------------------
status: solved
timings: total: 7.83e-004s = setup: 1.15e-004s + solve: 6.68e-004s
lin-sys: 1.53e-004s, cones: 2.32e-005s, accel: 7.90e-006s
------------------------------------------------------------------
objective = -0.486884
------------------------------------------------------------------
π π = [1.0, 0.0]
π¬[:, d] = JuMP.VariableRef[π¬[1,9], π¬[2,9]]
------------------------------------------------------------------
SCS v3.2.7 - Splitting Conic Solver
(c) Brendan O'Donoghue, Stanford University, 2012
------------------------------------------------------------------
problem: variables n: 63, constraints m: 110
cones: z: primal zero / dual free vars: 16
l: linear vars: 94
settings: eps_abs: 1.0e-004, eps_rel: 1.0e-004, eps_infeas: 1.0e-007
alpha: 1.50, scale: 1.00e-001, adaptive_scale: 1
max_iters: 100000, normalize: 1, rho_x: 1.00e-006
acceleration_lookback: 10, acceleration_interval: 10
compiled with openmp parallelization enabled
lin-sys: sparse-direct-amd-qdldl
nnz(A): 174, nnz(P): 0
------------------------------------------------------------------
iter | pri res | dua res | gap | obj | scale | time (s)
------------------------------------------------------------------
0|1.00e+001 1.00e+000 6.50e+001 -3.26e+001 1.00e-001 3.23e-004
50|1.45e-004 1.02e-005 4.64e-006 -1.26e-001 1.00e-001 7.58e-004
------------------------------------------------------------------
status: solved
timings: total: 7.59e-004s = setup: 1.25e-004s + solve: 6.34e-004s
lin-sys: 8.82e-005s, cones: 1.35e-005s, accel: 4.80e-006s
------------------------------------------------------------------
objective = -0.126358
------------------------------------------------------------------
π π = [0.0, 1.0]
π¬[:, d] = JuMP.VariableRef[π¬[1,9], π¬[2,9]]
------------------------------------------------------------------
SCS v3.2.7 - Splitting Conic Solver
(c) Brendan O'Donoghue, Stanford University, 2012
------------------------------------------------------------------
problem: variables n: 63, constraints m: 110
cones: z: primal zero / dual free vars: 16
l: linear vars: 94
settings: eps_abs: 1.0e-004, eps_rel: 1.0e-004, eps_infeas: 1.0e-007
alpha: 1.50, scale: 1.00e-001, adaptive_scale: 1
max_iters: 100000, normalize: 1, rho_x: 1.00e-006
acceleration_lookback: 10, acceleration_interval: 10
compiled with openmp parallelization enabled
lin-sys: sparse-direct-amd-qdldl
nnz(A): 174, nnz(P): 0
------------------------------------------------------------------
iter | pri res | dua res | gap | obj | scale | time (s)
------------------------------------------------------------------
0|1.95e+001 2.00e+000 2.21e+002 -1.11e+002 1.00e-001 3.44e-004
100|2.42e-005 4.29e-006 3.30e-006 -4.90e-001 1.00e-001 1.13e-003
------------------------------------------------------------------
status: solved
timings: total: 1.13e-003s = setup: 1.31e-004s + solve: 9.97e-004s
lin-sys: 1.99e-004s, cones: 2.47e-005s, accel: 7.90e-006s
------------------------------------------------------------------
objective = -0.489652
------------------------------------------------------------------
π π = [-1.0, 0.0]
π¬[:, d] = JuMP.VariableRef[π¬[1,9], π¬[2,9]]
------------------------------------------------------------------
SCS v3.2.7 - Splitting Conic Solver
(c) Brendan O'Donoghue, Stanford University, 2012
------------------------------------------------------------------
problem: variables n: 63, constraints m: 110
cones: z: primal zero / dual free vars: 16
l: linear vars: 94
settings: eps_abs: 1.0e-004, eps_rel: 1.0e-004, eps_infeas: 1.0e-007
alpha: 1.50, scale: 1.00e-001, adaptive_scale: 1
max_iters: 100000, normalize: 1, rho_x: 1.00e-006
acceleration_lookback: 10, acceleration_interval: 10
compiled with openmp parallelization enabled
lin-sys: sparse-direct-amd-qdldl
nnz(A): 174, nnz(P): 0
------------------------------------------------------------------
iter | pri res | dua res | gap | obj | scale | time (s)
------------------------------------------------------------------
0|1.00e+001 1.00e+000 6.50e+001 -3.26e+001 1.00e-001 2.04e-004
50|1.45e-004 1.02e-005 4.64e-006 -1.26e-001 1.00e-001 4.84e-004
------------------------------------------------------------------
status: solved
timings: total: 4.85e-004s = setup: 1.06e-004s + solve: 3.79e-004s
lin-sys: 8.69e-005s, cones: 1.32e-005s, accel: 3.80e-006s
------------------------------------------------------------------
objective = -0.126358
------------------------------------------------------------------
π π = [0.0, -1.0]
π¬[:, d] = JuMP.VariableRef[π¬[1,9], π¬[2,9]]
------------------------------------------------------------------
SCS v3.2.7 - Splitting Conic Solver
(c) Brendan O'Donoghue, Stanford University, 2012
------------------------------------------------------------------
problem: variables n: 63, constraints m: 110
cones: z: primal zero / dual free vars: 16
l: linear vars: 94
settings: eps_abs: 1.0e-004, eps_rel: 1.0e-004, eps_infeas: 1.0e-007
alpha: 1.50, scale: 1.00e-001, adaptive_scale: 1
max_iters: 100000, normalize: 1, rho_x: 1.00e-006
acceleration_lookback: 10, acceleration_interval: 10
compiled with openmp parallelization enabled
lin-sys: sparse-direct-amd-qdldl
nnz(A): 174, nnz(P): 0
------------------------------------------------------------------
iter | pri res | dua res | gap | obj | scale | time (s)
------------------------------------------------------------------
0|1.95e+001 2.00e+000 2.21e+002 -1.11e+002 1.00e-001 2.03e-004
100|2.42e-005 4.29e-006 3.30e-006 -4.90e-001 1.00e-001 7.65e-004
------------------------------------------------------------------
status: solved
timings: total: 7.67e-004s = setup: 1.05e-004s + solve: 6.62e-004s
lin-sys: 1.73e-004s, cones: 2.53e-005s, accel: 8.30e-006s
------------------------------------------------------------------
objective = -0.489652
------------------------------------------------------------------
π π = [1.0, 0.0]
π¬[:, d] = JuMP.VariableRef[π¬[1,10], π¬[2,10]]
------------------------------------------------------------------
SCS v3.2.7 - Splitting Conic Solver
(c) Brendan O'Donoghue, Stanford University, 2012
------------------------------------------------------------------
problem: variables n: 70, constraints m: 122
cones: z: primal zero / dual free vars: 18
l: linear vars: 104
settings: eps_abs: 1.0e-004, eps_rel: 1.0e-004, eps_infeas: 1.0e-007
alpha: 1.50, scale: 1.00e-001, adaptive_scale: 1
max_iters: 100000, normalize: 1, rho_x: 1.00e-006
acceleration_lookback: 10, acceleration_interval: 10
compiled with openmp parallelization enabled
lin-sys: sparse-direct-amd-qdldl
nnz(A): 194, nnz(P): 0
------------------------------------------------------------------
iter | pri res | dua res | gap | obj | scale | time (s)
------------------------------------------------------------------
0|1.00e+001 1.00e+000 6.71e+001 -3.36e+001 1.00e-001 3.13e-004
50|1.47e-004 5.37e-006 6.84e-006 -1.12e-001 1.00e-001 6.32e-004
------------------------------------------------------------------
status: solved
timings: total: 6.34e-004s = setup: 1.43e-004s + solve: 4.91e-004s
lin-sys: 9.70e-005s, cones: 1.44e-005s, accel: 4.60e-006s
------------------------------------------------------------------
objective = -0.111650
------------------------------------------------------------------
π π = [0.0, 1.0]
π¬[:, d] = JuMP.VariableRef[π¬[1,10], π¬[2,10]]
------------------------------------------------------------------
SCS v3.2.7 - Splitting Conic Solver
(c) Brendan O'Donoghue, Stanford University, 2012
------------------------------------------------------------------
problem: variables n: 70, constraints m: 122
cones: z: primal zero / dual free vars: 18
l: linear vars: 104
settings: eps_abs: 1.0e-004, eps_rel: 1.0e-004, eps_infeas: 1.0e-007
alpha: 1.50, scale: 1.00e-001, adaptive_scale: 1
max_iters: 100000, normalize: 1, rho_x: 1.00e-006
acceleration_lookback: 10, acceleration_interval: 10
compiled with openmp parallelization enabled
lin-sys: sparse-direct-amd-qdldl
nnz(A): 194, nnz(P): 0
------------------------------------------------------------------
iter | pri res | dua res | gap | obj | scale | time (s)
------------------------------------------------------------------
0|1.96e+001 1.96e+000 2.58e+002 -1.30e+002 1.00e-001 2.78e-004
100|5.21e-005 5.07e-006 5.00e-008 -4.84e-001 1.00e-001 1.06e-003
------------------------------------------------------------------
status: solved
timings: total: 1.06e-003s = setup: 1.21e-004s + solve: 9.37e-004s
lin-sys: 1.89e-004s, cones: 2.73e-005s, accel: 8.20e-006s
------------------------------------------------------------------
objective = -0.483758
------------------------------------------------------------------
π π = [-1.0, 0.0]
π¬[:, d] = JuMP.VariableRef[π¬[1,10], π¬[2,10]]
------------------------------------------------------------------
SCS v3.2.7 - Splitting Conic Solver
(c) Brendan O'Donoghue, Stanford University, 2012
------------------------------------------------------------------
problem: variables n: 70, constraints m: 122
cones: z: primal zero / dual free vars: 18
l: linear vars: 104
settings: eps_abs: 1.0e-004, eps_rel: 1.0e-004, eps_infeas: 1.0e-007
alpha: 1.50, scale: 1.00e-001, adaptive_scale: 1
max_iters: 100000, normalize: 1, rho_x: 1.00e-006
acceleration_lookback: 10, acceleration_interval: 10
compiled with openmp parallelization enabled
lin-sys: sparse-direct-amd-qdldl
nnz(A): 194, nnz(P): 0
------------------------------------------------------------------
iter | pri res | dua res | gap | obj | scale | time (s)
------------------------------------------------------------------
0|1.00e+001 1.00e+000 6.71e+001 -3.36e+001 1.00e-001 2.13e-004
50|1.47e-004 5.37e-006 6.84e-006 -1.12e-001 1.00e-001 5.03e-004
------------------------------------------------------------------
status: solved
timings: total: 5.05e-004s = setup: 1.19e-004s + solve: 3.86e-004s
lin-sys: 9.57e-005s, cones: 1.35e-005s, accel: 4.10e-006s
------------------------------------------------------------------
objective = -0.111650
------------------------------------------------------------------
π π = [0.0, -1.0]
π¬[:, d] = JuMP.VariableRef[π¬[1,10], π¬[2,10]]
------------------------------------------------------------------
SCS v3.2.7 - Splitting Conic Solver
(c) Brendan O'Donoghue, Stanford University, 2012
------------------------------------------------------------------
problem: variables n: 70, constraints m: 122
cones: z: primal zero / dual free vars: 18
l: linear vars: 104
settings: eps_abs: 1.0e-004, eps_rel: 1.0e-004, eps_infeas: 1.0e-007
alpha: 1.50, scale: 1.00e-001, adaptive_scale: 1
max_iters: 100000, normalize: 1, rho_x: 1.00e-006
acceleration_lookback: 10, acceleration_interval: 10
compiled with openmp parallelization enabled
lin-sys: sparse-direct-amd-qdldl
nnz(A): 194, nnz(P): 0
------------------------------------------------------------------
iter | pri res | dua res | gap | obj | scale | time (s)
------------------------------------------------------------------
0|1.96e+001 1.96e+000 2.58e+002 -1.30e+002 1.00e-001 2.22e-004
100|5.21e-005 5.07e-006 5.00e-008 -4.84e-001 1.00e-001 8.07e-004
------------------------------------------------------------------
status: solved
timings: total: 8.09e-004s = setup: 1.26e-004s + solve: 6.83e-004s
lin-sys: 1.91e-004s, cones: 2.65e-005s, accel: 8.70e-006s
------------------------------------------------------------------
objective = -0.483758
------------------------------------------------------------------
π π = [1.0, 0.0]
π¬[:, d] = JuMP.VariableRef[π¬[1,11], π¬[2,11]]
------------------------------------------------------------------
SCS v3.2.7 - Splitting Conic Solver
(c) Brendan O'Donoghue, Stanford University, 2012
------------------------------------------------------------------
problem: variables n: 77, constraints m: 134
cones: z: primal zero / dual free vars: 20
l: linear vars: 114
settings: eps_abs: 1.0e-004, eps_rel: 1.0e-004, eps_infeas: 1.0e-007
alpha: 1.50, scale: 1.00e-001, adaptive_scale: 1
max_iters: 100000, normalize: 1, rho_x: 1.00e-006
acceleration_lookback: 10, acceleration_interval: 10
compiled with openmp parallelization enabled
lin-sys: sparse-direct-amd-qdldl
nnz(A): 214, nnz(P): 0
------------------------------------------------------------------
iter | pri res | dua res | gap | obj | scale | time (s)
------------------------------------------------------------------
0|1.00e+001 1.00e+000 6.85e+001 -3.43e+001 1.00e-001 6.79e-004
50|1.35e-004 2.87e-006 1.14e-006 -9.73e-002 1.00e-001 1.24e-003
------------------------------------------------------------------
status: solved
timings: total: 1.25e-003s = setup: 3.64e-004s + solve: 8.81e-004s
lin-sys: 1.29e-004s, cones: 2.28e-005s, accel: 2.11e-005s
------------------------------------------------------------------
objective = -0.097268
------------------------------------------------------------------
π π = [0.0, 1.0]
π¬[:, d] = JuMP.VariableRef[π¬[1,11], π¬[2,11]]
------------------------------------------------------------------
SCS v3.2.7 - Splitting Conic Solver
(c) Brendan O'Donoghue, Stanford University, 2012
------------------------------------------------------------------
problem: variables n: 77, constraints m: 134
cones: z: primal zero / dual free vars: 20
l: linear vars: 114
settings: eps_abs: 1.0e-004, eps_rel: 1.0e-004, eps_infeas: 1.0e-007
alpha: 1.50, scale: 1.00e-001, adaptive_scale: 1
max_iters: 100000, normalize: 1, rho_x: 1.00e-006
acceleration_lookback: 10, acceleration_interval: 10
compiled with openmp parallelization enabled
lin-sys: sparse-direct-amd-qdldl
nnz(A): 214, nnz(P): 0
------------------------------------------------------------------
iter | pri res | dua res | gap | obj | scale | time (s)
------------------------------------------------------------------
0|1.96e+001 1.96e+000 2.93e+002 -1.47e+002 1.00e-001 2.86e-004
100|8.22e-005 2.47e-005 1.84e-005 -4.71e-001 1.00e-001 1.07e-003
------------------------------------------------------------------
status: solved
timings: total: 1.07e-003s = setup: 1.49e-004s + solve: 9.26e-004s
lin-sys: 2.10e-004s, cones: 2.85e-005s, accel: 9.10e-006s
------------------------------------------------------------------
objective = -0.471429
------------------------------------------------------------------
π π = [-1.0, 0.0]
π¬[:, d] = JuMP.VariableRef[π¬[1,11], π¬[2,11]]
------------------------------------------------------------------
SCS v3.2.7 - Splitting Conic Solver
(c) Brendan O'Donoghue, Stanford University, 2012
------------------------------------------------------------------
problem: variables n: 77, constraints m: 134
cones: z: primal zero / dual free vars: 20
l: linear vars: 114
settings: eps_abs: 1.0e-004, eps_rel: 1.0e-004, eps_infeas: 1.0e-007
alpha: 1.50, scale: 1.00e-001, adaptive_scale: 1
max_iters: 100000, normalize: 1, rho_x: 1.00e-006
acceleration_lookback: 10, acceleration_interval: 10
compiled with openmp parallelization enabled
lin-sys: sparse-direct-amd-qdldl
nnz(A): 214, nnz(P): 0
------------------------------------------------------------------
iter | pri res | dua res | gap | obj | scale | time (s)
------------------------------------------------------------------
0|1.00e+001 1.00e+000 6.85e+001 -3.43e+001 1.00e-001 2.50e-004
50|1.35e-004 2.87e-006 1.14e-006 -9.73e-002 1.00e-001 5.60e-004
------------------------------------------------------------------
status: solved
timings: total: 5.61e-004s = setup: 1.28e-004s + solve: 4.34e-004s
lin-sys: 1.06e-004s, cones: 1.47e-005s, accel: 4.10e-006s
------------------------------------------------------------------
objective = -0.097268
------------------------------------------------------------------
π π = [0.0, -1.0]
π¬[:, d] = JuMP.VariableRef[π¬[1,11], π¬[2,11]]
------------------------------------------------------------------
SCS v3.2.7 - Splitting Conic Solver
(c) Brendan O'Donoghue, Stanford University, 2012
------------------------------------------------------------------
problem: variables n: 77, constraints m: 134
cones: z: primal zero / dual free vars: 20
l: linear vars: 114
settings: eps_abs: 1.0e-004, eps_rel: 1.0e-004, eps_infeas: 1.0e-007
alpha: 1.50, scale: 1.00e-001, adaptive_scale: 1
max_iters: 100000, normalize: 1, rho_x: 1.00e-006
acceleration_lookback: 10, acceleration_interval: 10
compiled with openmp parallelization enabled
lin-sys: sparse-direct-amd-qdldl
nnz(A): 214, nnz(P): 0
------------------------------------------------------------------
iter | pri res | dua res | gap | obj | scale | time (s)
------------------------------------------------------------------
0|1.96e+001 1.96e+000 2.93e+002 -1.47e+002 1.00e-001 2.31e-004
100|8.22e-005 2.47e-005 1.84e-005 -4.71e-001 1.00e-001 9.42e-004
------------------------------------------------------------------
status: solved
timings: total: 9.44e-004s = setup: 1.27e-004s + solve: 8.17e-004s
lin-sys: 2.10e-004s, cones: 3.16e-005s, accel: 9.90e-006s
------------------------------------------------------------------
objective = -0.471429
------------------------------------------------------------------
π π = [1.0, 0.0]
π¬[:, d] = JuMP.VariableRef[π¬[1,12], π¬[2,12]]
------------------------------------------------------------------
SCS v3.2.7 - Splitting Conic Solver
(c) Brendan O'Donoghue, Stanford University, 2012
------------------------------------------------------------------
problem: variables n: 84, constraints m: 146
cones: z: primal zero / dual free vars: 22
l: linear vars: 124
settings: eps_abs: 1.0e-004, eps_rel: 1.0e-004, eps_infeas: 1.0e-007
alpha: 1.50, scale: 1.00e-001, adaptive_scale: 1
max_iters: 100000, normalize: 1, rho_x: 1.00e-006
acceleration_lookback: 10, acceleration_interval: 10
compiled with openmp parallelization enabled
lin-sys: sparse-direct-amd-qdldl
nnz(A): 234, nnz(P): 0
------------------------------------------------------------------
iter | pri res | dua res | gap | obj | scale | time (s)
------------------------------------------------------------------
0|1.00e+001 1.00e+000 6.93e+001 -3.47e+001 1.00e-001 3.31e-004
50|1.31e-004 1.63e-006 4.96e-007 -8.35e-002 1.00e-001 7.92e-004
------------------------------------------------------------------
status: solved
timings: total: 7.94e-004s = setup: 1.57e-004s + solve: 6.37e-004s
lin-sys: 1.16e-004s, cones: 1.66e-005s, accel: 4.90e-006s
------------------------------------------------------------------
objective = -0.083489
------------------------------------------------------------------
π π = [0.0, 1.0]
π¬[:, d] = JuMP.VariableRef[π¬[1,12], π¬[2,12]]
------------------------------------------------------------------
SCS v3.2.7 - Splitting Conic Solver
(c) Brendan O'Donoghue, Stanford University, 2012
------------------------------------------------------------------
problem: variables n: 84, constraints m: 146
cones: z: primal zero / dual free vars: 22
l: linear vars: 124
settings: eps_abs: 1.0e-004, eps_rel: 1.0e-004, eps_infeas: 1.0e-007
alpha: 1.50, scale: 1.00e-001, adaptive_scale: 1
max_iters: 100000, normalize: 1, rho_x: 1.00e-006
acceleration_lookback: 10, acceleration_interval: 10
compiled with openmp parallelization enabled
lin-sys: sparse-direct-amd-qdldl
nnz(A): 234, nnz(P): 0
------------------------------------------------------------------
iter | pri res | dua res | gap | obj | scale | time (s)
------------------------------------------------------------------
0|1.96e+001 1.96e+000 3.23e+002 -1.62e+002 1.00e-001 3.02e-004
125|1.00e-006 3.59e-007 9.35e-007 -4.54e-001 7.13e-001 1.20e-003
------------------------------------------------------------------
status: solved
timings: total: 1.20e-003s = setup: 1.39e-004s + solve: 1.06e-003s
lin-sys: 2.94e-004s, cones: 4.06e-005s, accel: 1.09e-005s
------------------------------------------------------------------
objective = -0.453699
------------------------------------------------------------------
π π = [-1.0, 0.0]
π¬[:, d] = JuMP.VariableRef[π¬[1,12], π¬[2,12]]
------------------------------------------------------------------
SCS v3.2.7 - Splitting Conic Solver
(c) Brendan O'Donoghue, Stanford University, 2012
------------------------------------------------------------------
problem: variables n: 84, constraints m: 146
cones: z: primal zero / dual free vars: 22
l: linear vars: 124
settings: eps_abs: 1.0e-004, eps_rel: 1.0e-004, eps_infeas: 1.0e-007
alpha: 1.50, scale: 1.00e-001, adaptive_scale: 1
max_iters: 100000, normalize: 1, rho_x: 1.00e-006
acceleration_lookback: 10, acceleration_interval: 10
compiled with openmp parallelization enabled
lin-sys: sparse-direct-amd-qdldl
nnz(A): 234, nnz(P): 0
------------------------------------------------------------------
iter | pri res | dua res | gap | obj | scale | time (s)
------------------------------------------------------------------
0|1.00e+001 1.00e+000 6.93e+001 -3.47e+001 1.00e-001 7.21e-004
50|1.31e-004 1.63e-006 4.96e-007 -8.35e-002 1.00e-001 1.23e-003
------------------------------------------------------------------
status: solved
timings: total: 1.24e-003s = setup: 4.01e-004s + solve: 8.36e-004s
lin-sys: 1.33e-004s, cones: 2.19e-005s, accel: 1.43e-005s
------------------------------------------------------------------
objective = -0.083489
------------------------------------------------------------------
π π = [0.0, -1.0]
π¬[:, d] = JuMP.VariableRef[π¬[1,12], π¬[2,12]]
------------------------------------------------------------------
SCS v3.2.7 - Splitting Conic Solver
(c) Brendan O'Donoghue, Stanford University, 2012
------------------------------------------------------------------
problem: variables n: 84, constraints m: 146
cones: z: primal zero / dual free vars: 22
l: linear vars: 124
settings: eps_abs: 1.0e-004, eps_rel: 1.0e-004, eps_infeas: 1.0e-007
alpha: 1.50, scale: 1.00e-001, adaptive_scale: 1
max_iters: 100000, normalize: 1, rho_x: 1.00e-006
acceleration_lookback: 10, acceleration_interval: 10
compiled with openmp parallelization enabled
lin-sys: sparse-direct-amd-qdldl
nnz(A): 234, nnz(P): 0
------------------------------------------------------------------
iter | pri res | dua res | gap | obj | scale | time (s)
------------------------------------------------------------------
0|1.96e+001 1.96e+000 3.23e+002 -1.62e+002 1.00e-001 2.64e-004
125|1.00e-006 3.59e-007 9.35e-007 -4.54e-001 7.13e-001 1.09e-003
------------------------------------------------------------------
status: solved
timings: total: 1.09e-003s = setup: 1.52e-004s + solve: 9.35e-004s
lin-sys: 2.88e-004s, cones: 3.95e-005s, accel: 1.14e-005s
------------------------------------------------------------------
objective = -0.453699
------------------------------------------------------------------
π π = [1.0, 0.0]
π¬[:, d] = JuMP.VariableRef[π¬[1,13], π¬[2,13]]
------------------------------------------------------------------
SCS v3.2.7 - Splitting Conic Solver
(c) Brendan O'Donoghue, Stanford University, 2012
------------------------------------------------------------------
problem: variables n: 91, constraints m: 158
cones: z: primal zero / dual free vars: 24
l: linear vars: 134
settings: eps_abs: 1.0e-004, eps_rel: 1.0e-004, eps_infeas: 1.0e-007
alpha: 1.50, scale: 1.00e-001, adaptive_scale: 1
max_iters: 100000, normalize: 1, rho_x: 1.00e-006
acceleration_lookback: 10, acceleration_interval: 10
compiled with openmp parallelization enabled
lin-sys: sparse-direct-amd-qdldl
nnz(A): 254, nnz(P): 0
------------------------------------------------------------------
iter | pri res | dua res | gap | obj | scale | time (s)
------------------------------------------------------------------
0|1.00e+001 1.00e+000 6.97e+001 -3.49e+001 1.00e-001 3.37e-004
50|1.28e-004 1.64e-006 4.12e-007 -7.06e-002 1.00e-001 8.20e-004
------------------------------------------------------------------
status: solved
timings: total: 8.22e-004s = setup: 1.63e-004s + solve: 6.58e-004s
lin-sys: 1.26e-004s, cones: 1.73e-005s, accel: 5.20e-006s
------------------------------------------------------------------
objective = -0.070597
------------------------------------------------------------------
π π = [0.0, 1.0]
π¬[:, d] = JuMP.VariableRef[π¬[1,13], π¬[2,13]]
------------------------------------------------------------------
SCS v3.2.7 - Splitting Conic Solver
(c) Brendan O'Donoghue, Stanford University, 2012
------------------------------------------------------------------
problem: variables n: 91, constraints m: 158
cones: z: primal zero / dual free vars: 24
l: linear vars: 134
settings: eps_abs: 1.0e-004, eps_rel: 1.0e-004, eps_infeas: 1.0e-007
alpha: 1.50, scale: 1.00e-001, adaptive_scale: 1
max_iters: 100000, normalize: 1, rho_x: 1.00e-006
acceleration_lookback: 10, acceleration_interval: 10
compiled with openmp parallelization enabled
lin-sys: sparse-direct-amd-qdldl
nnz(A): 254, nnz(P): 0
------------------------------------------------------------------
iter | pri res | dua res | gap | obj | scale | time (s)
------------------------------------------------------------------
0|1.96e+001 1.96e+000 3.49e+002 -1.75e+002 1.00e-001 3.23e-004
125|2.23e-006 5.13e-007 2.01e-006 -4.32e-001 6.74e-001 1.49e-003
------------------------------------------------------------------
status: solved
timings: total: 1.50e-003s = setup: 1.44e-004s + solve: 1.35e-003s
lin-sys: 3.21e-004s, cones: 5.50e-005s, accel: 1.19e-005s
------------------------------------------------------------------
objective = -0.431772
------------------------------------------------------------------
π π = [-1.0, 0.0]
π¬[:, d] = JuMP.VariableRef[π¬[1,13], π¬[2,13]]
------------------------------------------------------------------
SCS v3.2.7 - Splitting Conic Solver
(c) Brendan O'Donoghue, Stanford University, 2012
------------------------------------------------------------------
problem: variables n: 91, constraints m: 158
cones: z: primal zero / dual free vars: 24
l: linear vars: 134
settings: eps_abs: 1.0e-004, eps_rel: 1.0e-004, eps_infeas: 1.0e-007
alpha: 1.50, scale: 1.00e-001, adaptive_scale: 1
max_iters: 100000, normalize: 1, rho_x: 1.00e-006
acceleration_lookback: 10, acceleration_interval: 10
compiled with openmp parallelization enabled
lin-sys: sparse-direct-amd-qdldl
nnz(A): 254, nnz(P): 0
------------------------------------------------------------------
iter | pri res | dua res | gap | obj | scale | time (s)
------------------------------------------------------------------
0|1.00e+001 1.00e+000 6.97e+001 -3.49e+001 1.00e-001 2.43e-004
50|1.28e-004 1.64e-006 4.12e-007 -7.06e-002 1.00e-001 5.75e-004
------------------------------------------------------------------
status: solved
timings: total: 5.76e-004s = setup: 1.44e-004s + solve: 4.32e-004s
lin-sys: 1.25e-004s, cones: 1.85e-005s, accel: 4.40e-006s
------------------------------------------------------------------
objective = -0.070597
------------------------------------------------------------------
π π = [0.0, -1.0]
π¬[:, d] = JuMP.VariableRef[π¬[1,13], π¬[2,13]]
------------------------------------------------------------------
SCS v3.2.7 - Splitting Conic Solver
(c) Brendan O'Donoghue, Stanford University, 2012
------------------------------------------------------------------
problem: variables n: 91, constraints m: 158
cones: z: primal zero / dual free vars: 24
l: linear vars: 134
settings: eps_abs: 1.0e-004, eps_rel: 1.0e-004, eps_infeas: 1.0e-007
alpha: 1.50, scale: 1.00e-001, adaptive_scale: 1
max_iters: 100000, normalize: 1, rho_x: 1.00e-006
acceleration_lookback: 10, acceleration_interval: 10
compiled with openmp parallelization enabled
lin-sys: sparse-direct-amd-qdldl
nnz(A): 254, nnz(P): 0
------------------------------------------------------------------
iter | pri res | dua res | gap | obj | scale | time (s)
------------------------------------------------------------------
0|1.96e+001 1.96e+000 3.49e+002 -1.75e+002 1.00e-001 2.40e-004
125|2.23e-006 5.13e-007 2.01e-006 -4.32e-001 6.74e-001 1.18e-003
------------------------------------------------------------------
status: solved
timings: total: 1.18e-003s = setup: 1.41e-004s + solve: 1.04e-003s
lin-sys: 3.13e-004s, cones: 4.48e-005s, accel: 1.39e-005s
------------------------------------------------------------------
objective = -0.431772
------------------------------------------------------------------
π π = [1.0, 0.0]
π¬[:, d] = JuMP.VariableRef[π¬[1,14], π¬[2,14]]
------------------------------------------------------------------
SCS v3.2.7 - Splitting Conic Solver
(c) Brendan O'Donoghue, Stanford University, 2012
------------------------------------------------------------------
problem: variables n: 98, constraints m: 170
cones: z: primal zero / dual free vars: 26
l: linear vars: 144
settings: eps_abs: 1.0e-004, eps_rel: 1.0e-004, eps_infeas: 1.0e-007
alpha: 1.50, scale: 1.00e-001, adaptive_scale: 1
max_iters: 100000, normalize: 1, rho_x: 1.00e-006
acceleration_lookback: 10, acceleration_interval: 10
compiled with openmp parallelization enabled
lin-sys: sparse-direct-amd-qdldl
nnz(A): 274, nnz(P): 0
------------------------------------------------------------------
iter | pri res | dua res | gap | obj | scale | time (s)
------------------------------------------------------------------
0|1.00e+001 1.00e+000 7.00e+001 -3.50e+001 1.00e-001 3.50e-004
50|1.28e-004 1.77e-006 8.22e-007 -5.88e-002 1.00e-001 8.78e-004
------------------------------------------------------------------
status: solved
timings: total: 8.79e-004s = setup: 1.79e-004s + solve: 7.01e-004s
lin-sys: 1.37e-004s, cones: 1.93e-005s, accel: 5.70e-006s
------------------------------------------------------------------
objective = -0.058802
------------------------------------------------------------------
π π = [0.0, 1.0]
π¬[:, d] = JuMP.VariableRef[π¬[1,14], π¬[2,14]]
------------------------------------------------------------------
SCS v3.2.7 - Splitting Conic Solver
(c) Brendan O'Donoghue, Stanford University, 2012
------------------------------------------------------------------
problem: variables n: 98, constraints m: 170
cones: z: primal zero / dual free vars: 26
l: linear vars: 144
settings: eps_abs: 1.0e-004, eps_rel: 1.0e-004, eps_infeas: 1.0e-007
alpha: 1.50, scale: 1.00e-001, adaptive_scale: 1
max_iters: 100000, normalize: 1, rho_x: 1.00e-006
acceleration_lookback: 10, acceleration_interval: 10
compiled with openmp parallelization enabled
lin-sys: sparse-direct-amd-qdldl
nnz(A): 274, nnz(P): 0
------------------------------------------------------------------
iter | pri res | dua res | gap | obj | scale | time (s)
------------------------------------------------------------------
0|1.96e+001 1.96e+000 3.70e+002 -1.85e+002 1.00e-001 3.43e-004
125|2.45e-006 4.56e-007 2.02e-006 -4.07e-001 6.67e-001 1.42e-003
------------------------------------------------------------------
status: solved
timings: total: 1.42e-003s = setup: 1.52e-004s + solve: 1.27e-003s
lin-sys: 3.42e-004s, cones: 4.35e-005s, accel: 1.28e-005s
------------------------------------------------------------------
objective = -0.406684
------------------------------------------------------------------
π π = [-1.0, 0.0]
π¬[:, d] = JuMP.VariableRef[π¬[1,14], π¬[2,14]]
------------------------------------------------------------------
SCS v3.2.7 - Splitting Conic Solver
(c) Brendan O'Donoghue, Stanford University, 2012
------------------------------------------------------------------
problem: variables n: 98, constraints m: 170
cones: z: primal zero / dual free vars: 26
l: linear vars: 144
settings: eps_abs: 1.0e-004, eps_rel: 1.0e-004, eps_infeas: 1.0e-007
alpha: 1.50, scale: 1.00e-001, adaptive_scale: 1
max_iters: 100000, normalize: 1, rho_x: 1.00e-006
acceleration_lookback: 10, acceleration_interval: 10
compiled with openmp parallelization enabled
lin-sys: sparse-direct-amd-qdldl
nnz(A): 274, nnz(P): 0
------------------------------------------------------------------
iter | pri res | dua res | gap | obj | scale | time (s)
------------------------------------------------------------------
0|1.00e+001 1.00e+000 7.00e+001 -3.50e+001 1.00e-001 2.54e-004
50|1.28e-004 1.77e-006 8.22e-007 -5.88e-002 1.00e-001 6.01e-004
------------------------------------------------------------------
status: solved
timings: total: 6.02e-004s = setup: 1.52e-004s + solve: 4.50e-004s
lin-sys: 1.36e-004s, cones: 1.99e-005s, accel: 5.40e-006s
------------------------------------------------------------------
objective = -0.058802
------------------------------------------------------------------
π π = [0.0, -1.0]
π¬[:, d] = JuMP.VariableRef[π¬[1,14], π¬[2,14]]
------------------------------------------------------------------
SCS v3.2.7 - Splitting Conic Solver
(c) Brendan O'Donoghue, Stanford University, 2012
------------------------------------------------------------------
problem: variables n: 98, constraints m: 170
cones: z: primal zero / dual free vars: 26
l: linear vars: 144
settings: eps_abs: 1.0e-004, eps_rel: 1.0e-004, eps_infeas: 1.0e-007
alpha: 1.50, scale: 1.00e-001, adaptive_scale: 1
max_iters: 100000, normalize: 1, rho_x: 1.00e-006
acceleration_lookback: 10, acceleration_interval: 10
compiled with openmp parallelization enabled
lin-sys: sparse-direct-amd-qdldl
nnz(A): 274, nnz(P): 0
------------------------------------------------------------------
iter | pri res | dua res | gap | obj | scale | time (s)
------------------------------------------------------------------
0|1.96e+001 1.96e+000 3.70e+002 -1.85e+002 1.00e-001 2.46e-004
125|2.45e-006 4.56e-007 2.02e-006 -4.07e-001 6.67e-001 1.10e-003
------------------------------------------------------------------
status: solved
timings: total: 1.10e-003s = setup: 1.47e-004s + solve: 9.51e-004s
lin-sys: 3.34e-004s, cones: 4.37e-005s, accel: 1.18e-005s
------------------------------------------------------------------
objective = -0.406684
------------------------------------------------------------------
π π = [1.0, 0.0]
π¬[:, d] = JuMP.VariableRef[π¬[1,15], π¬[2,15]]
------------------------------------------------------------------
SCS v3.2.7 - Splitting Conic Solver
(c) Brendan O'Donoghue, Stanford University, 2012
------------------------------------------------------------------
problem: variables n: 105, constraints m: 182
cones: z: primal zero / dual free vars: 28
l: linear vars: 154
settings: eps_abs: 1.0e-004, eps_rel: 1.0e-004, eps_infeas: 1.0e-007
alpha: 1.50, scale: 1.00e-001, adaptive_scale: 1
max_iters: 100000, normalize: 1, rho_x: 1.00e-006
acceleration_lookback: 10, acceleration_interval: 10
compiled with openmp parallelization enabled
lin-sys: sparse-direct-amd-qdldl
nnz(A): 294, nnz(P): 0
------------------------------------------------------------------
iter | pri res | dua res | gap | obj | scale | time (s)
------------------------------------------------------------------
0|1.00e+001 1.00e+000 7.02e+001 -3.51e+001 1.00e-001 3.06e-004
50|1.28e-004 1.76e-006 8.88e-007 -5.29e-002 1.00e-001 7.15e-004
------------------------------------------------------------------
status: solved
timings: total: 7.17e-004s = setup: 1.78e-004s + solve: 5.39e-004s
lin-sys: 1.46e-004s, cones: 2.02e-005s, accel: 6.40e-006s
------------------------------------------------------------------
objective = -0.052903
------------------------------------------------------------------
π π = [0.0, 1.0]
π¬[:, d] = JuMP.VariableRef[π¬[1,15], π¬[2,15]]
------------------------------------------------------------------
SCS v3.2.7 - Splitting Conic Solver
(c) Brendan O'Donoghue, Stanford University, 2012
------------------------------------------------------------------
problem: variables n: 105, constraints m: 182
cones: z: primal zero / dual free vars: 28
l: linear vars: 154
settings: eps_abs: 1.0e-004, eps_rel: 1.0e-004, eps_infeas: 1.0e-007
alpha: 1.50, scale: 1.00e-001, adaptive_scale: 1
max_iters: 100000, normalize: 1, rho_x: 1.00e-006
acceleration_lookback: 10, acceleration_interval: 10
compiled with openmp parallelization enabled
lin-sys: sparse-direct-amd-qdldl
nnz(A): 294, nnz(P): 0
------------------------------------------------------------------
iter | pri res | dua res | gap | obj | scale | time (s)
------------------------------------------------------------------
0|1.96e+001 1.96e+000 3.87e+002 -1.94e+002 1.00e-001 3.31e-004
125|1.67e-006 2.48e-007 1.19e-006 -3.79e-001 6.75e-001 1.46e-003
------------------------------------------------------------------
status: solved
timings: total: 1.46e-003s = setup: 1.59e-004s + solve: 1.30e-003s
lin-sys: 3.66e-004s, cones: 4.80e-005s, accel: 1.33e-005s
------------------------------------------------------------------
objective = -0.379455
------------------------------------------------------------------
π π = [-1.0, 0.0]
π¬[:, d] = JuMP.VariableRef[π¬[1,15], π¬[2,15]]
------------------------------------------------------------------
SCS v3.2.7 - Splitting Conic Solver
(c) Brendan O'Donoghue, Stanford University, 2012
------------------------------------------------------------------
problem: variables n: 105, constraints m: 182
cones: z: primal zero / dual free vars: 28
l: linear vars: 154
settings: eps_abs: 1.0e-004, eps_rel: 1.0e-004, eps_infeas: 1.0e-007
alpha: 1.50, scale: 1.00e-001, adaptive_scale: 1
max_iters: 100000, normalize: 1, rho_x: 1.00e-006
acceleration_lookback: 10, acceleration_interval: 10
compiled with openmp parallelization enabled
lin-sys: sparse-direct-amd-qdldl
nnz(A): 294, nnz(P): 0
------------------------------------------------------------------
iter | pri res | dua res | gap | obj | scale | time (s)
------------------------------------------------------------------
0|1.00e+001 1.00e+000 7.02e+001 -3.51e+001 1.00e-001 2.56e-004
50|1.28e-004 1.76e-006 8.88e-007 -5.29e-002 1.00e-001 6.20e-004
------------------------------------------------------------------
status: solved
timings: total: 6.22e-004s = setup: 1.59e-004s + solve: 4.63e-004s
lin-sys: 1.45e-004s, cones: 1.95e-005s, accel: 5.70e-006s
------------------------------------------------------------------
objective = -0.052903
------------------------------------------------------------------
π π = [0.0, -1.0]
π¬[:, d] = JuMP.VariableRef[π¬[1,15], π¬[2,15]]
------------------------------------------------------------------
SCS v3.2.7 - Splitting Conic Solver
(c) Brendan O'Donoghue, Stanford University, 2012
------------------------------------------------------------------
problem: variables n: 105, constraints m: 182
cones: z: primal zero / dual free vars: 28
l: linear vars: 154
settings: eps_abs: 1.0e-004, eps_rel: 1.0e-004, eps_infeas: 1.0e-007
alpha: 1.50, scale: 1.00e-001, adaptive_scale: 1
max_iters: 100000, normalize: 1, rho_x: 1.00e-006
acceleration_lookback: 10, acceleration_interval: 10
compiled with openmp parallelization enabled
lin-sys: sparse-direct-amd-qdldl
nnz(A): 294, nnz(P): 0
------------------------------------------------------------------
iter | pri res | dua res | gap | obj | scale | time (s)
------------------------------------------------------------------
0|1.96e+001 1.96e+000 3.87e+002 -1.94e+002 1.00e-001 2.57e-004
125|1.67e-006 2.48e-007 1.19e-006 -3.79e-001 6.75e-001 1.16e-003
------------------------------------------------------------------
status: solved
timings: total: 1.16e-003s = setup: 1.56e-004s + solve: 1.00e-003s
lin-sys: 3.60e-004s, cones: 4.62e-005s, accel: 1.24e-005s
------------------------------------------------------------------
objective = -0.379455
------------------------------------------------------------------
π π = [1.0, 0.0]
π¬[:, d] = JuMP.VariableRef[π¬[1,16], π¬[2,16]]
------------------------------------------------------------------
SCS v3.2.7 - Splitting Conic Solver
(c) Brendan O'Donoghue, Stanford University, 2012
------------------------------------------------------------------
problem: variables n: 112, constraints m: 194
cones: z: primal zero / dual free vars: 30
l: linear vars: 164
settings: eps_abs: 1.0e-004, eps_rel: 1.0e-004, eps_infeas: 1.0e-007
alpha: 1.50, scale: 1.00e-001, adaptive_scale: 1
max_iters: 100000, normalize: 1, rho_x: 1.00e-006
acceleration_lookback: 10, acceleration_interval: 10
compiled with openmp parallelization enabled
lin-sys: sparse-direct-amd-qdldl
nnz(A): 314, nnz(P): 0
------------------------------------------------------------------
iter | pri res | dua res | gap | obj | scale | time (s)
------------------------------------------------------------------
0|1.00e+001 1.00e+000 7.03e+001 -3.52e+001 1.00e-001 3.51e-004
50|1.27e-004 1.76e-006 1.05e-006 -6.82e-002 1.00e-001 8.08e-004
------------------------------------------------------------------
status: solved
timings: total: 8.10e-004s = setup: 1.98e-004s + solve: 6.12e-004s
lin-sys: 1.55e-004s, cones: 2.15e-005s, accel: 5.90e-006s
------------------------------------------------------------------
objective = -0.068204
------------------------------------------------------------------
π π = [0.0, 1.0]
π¬[:, d] = JuMP.VariableRef[π¬[1,16], π¬[2,16]]
------------------------------------------------------------------
SCS v3.2.7 - Splitting Conic Solver
(c) Brendan O'Donoghue, Stanford University, 2012
------------------------------------------------------------------
problem: variables n: 112, constraints m: 194
cones: z: primal zero / dual free vars: 30
l: linear vars: 164
settings: eps_abs: 1.0e-004, eps_rel: 1.0e-004, eps_infeas: 1.0e-007
alpha: 1.50, scale: 1.00e-001, adaptive_scale: 1
max_iters: 100000, normalize: 1, rho_x: 1.00e-006
acceleration_lookback: 10, acceleration_interval: 10
compiled with openmp parallelization enabled
lin-sys: sparse-direct-amd-qdldl
nnz(A): 314, nnz(P): 0
------------------------------------------------------------------
iter | pri res | dua res | gap | obj | scale | time (s)
------------------------------------------------------------------
0|1.96e+001 1.96e+000 3.99e+002 -2.00e+002 1.00e-001 3.23e-004
125|6.46e-007 7.21e-008 3.85e-007 -3.51e-001 6.90e-001 1.38e-003
------------------------------------------------------------------
status: solved
timings: total: 1.38e-003s = setup: 1.66e-004s + solve: 1.22e-003s
lin-sys: 3.80e-004s, cones: 4.92e-005s, accel: 1.30e-005s
------------------------------------------------------------------
objective = -0.351046
------------------------------------------------------------------
π π = [-1.0, 0.0]
π¬[:, d] = JuMP.VariableRef[π¬[1,16], π¬[2,16]]
------------------------------------------------------------------
SCS v3.2.7 - Splitting Conic Solver
(c) Brendan O'Donoghue, Stanford University, 2012
------------------------------------------------------------------
problem: variables n: 112, constraints m: 194
cones: z: primal zero / dual free vars: 30
l: linear vars: 164
settings: eps_abs: 1.0e-004, eps_rel: 1.0e-004, eps_infeas: 1.0e-007
alpha: 1.50, scale: 1.00e-001, adaptive_scale: 1
max_iters: 100000, normalize: 1, rho_x: 1.00e-006
acceleration_lookback: 10, acceleration_interval: 10
compiled with openmp parallelization enabled
lin-sys: sparse-direct-amd-qdldl
nnz(A): 314, nnz(P): 0
------------------------------------------------------------------
iter | pri res | dua res | gap | obj | scale | time (s)
------------------------------------------------------------------
0|1.00e+001 1.00e+000 7.03e+001 -3.52e+001 1.00e-001 3.29e-004
50|1.27e-004 1.76e-006 1.05e-006 -6.82e-002 1.00e-001 8.24e-004
------------------------------------------------------------------
status: solved
timings: total: 8.26e-004s = setup: 1.66e-004s + solve: 6.60e-004s
lin-sys: 1.54e-004s, cones: 2.06e-005s, accel: 5.60e-006s
------------------------------------------------------------------
objective = -0.068204
------------------------------------------------------------------
π π = [0.0, -1.0]
π¬[:, d] = JuMP.VariableRef[π¬[1,16], π¬[2,16]]
------------------------------------------------------------------
SCS v3.2.7 - Splitting Conic Solver
(c) Brendan O'Donoghue, Stanford University, 2012
------------------------------------------------------------------
problem: variables n: 112, constraints m: 194
cones: z: primal zero / dual free vars: 30
l: linear vars: 164
settings: eps_abs: 1.0e-004, eps_rel: 1.0e-004, eps_infeas: 1.0e-007
alpha: 1.50, scale: 1.00e-001, adaptive_scale: 1
max_iters: 100000, normalize: 1, rho_x: 1.00e-006
acceleration_lookback: 10, acceleration_interval: 10
compiled with openmp parallelization enabled
lin-sys: sparse-direct-amd-qdldl
nnz(A): 314, nnz(P): 0
------------------------------------------------------------------
iter | pri res | dua res | gap | obj | scale | time (s)
------------------------------------------------------------------
0|1.96e+001 1.96e+000 3.99e+002 -2.00e+002 1.00e-001 3.25e-004
125|6.46e-007 7.21e-008 3.85e-007 -3.51e-001 6.90e-001 1.37e-003
------------------------------------------------------------------
status: solved
timings: total: 1.37e-003s = setup: 1.64e-004s + solve: 1.21e-003s
lin-sys: 3.81e-004s, cones: 4.83e-005s, accel: 1.40e-005s
------------------------------------------------------------------
objective = -0.351046
------------------------------------------------------------------
π π = [1.0, 0.0]
π¬[:, d] = JuMP.VariableRef[π¬[1,17], π¬[2,17]]
------------------------------------------------------------------
SCS v3.2.7 - Splitting Conic Solver
(c) Brendan O'Donoghue, Stanford University, 2012
------------------------------------------------------------------
problem: variables n: 119, constraints m: 206
cones: z: primal zero / dual free vars: 32
l: linear vars: 174
settings: eps_abs: 1.0e-004, eps_rel: 1.0e-004, eps_infeas: 1.0e-007
alpha: 1.50, scale: 1.00e-001, adaptive_scale: 1
max_iters: 100000, normalize: 1, rho_x: 1.00e-006
acceleration_lookback: 10, acceleration_interval: 10
compiled with openmp parallelization enabled
lin-sys: sparse-direct-amd-qdldl
nnz(A): 334, nnz(P): 0
------------------------------------------------------------------
iter | pri res | dua res | gap | obj | scale | time (s)
------------------------------------------------------------------
0|1.00e+001 1.00e+000 7.05e+001 -3.53e+001 1.00e-001 6.41e-004
50|1.28e-004 1.72e-006 5.21e-007 -8.11e-002 1.00e-001 1.39e-003
------------------------------------------------------------------
status: solved
timings: total: 1.40e-003s = setup: 3.17e-004s + solve: 1.08e-003s
lin-sys: 1.89e-004s, cones: 3.23e-005s, accel: 3.14e-005s
------------------------------------------------------------------
objective = -0.081135
------------------------------------------------------------------
π π = [0.0, 1.0]
π¬[:, d] = JuMP.VariableRef[π¬[1,17], π¬[2,17]]
------------------------------------------------------------------
SCS v3.2.7 - Splitting Conic Solver
(c) Brendan O'Donoghue, Stanford University, 2012
------------------------------------------------------------------
problem: variables n: 119, constraints m: 206
cones: z: primal zero / dual free vars: 32
l: linear vars: 174
settings: eps_abs: 1.0e-004, eps_rel: 1.0e-004, eps_infeas: 1.0e-007
alpha: 1.50, scale: 1.00e-001, adaptive_scale: 1
max_iters: 100000, normalize: 1, rho_x: 1.00e-006
acceleration_lookback: 10, acceleration_interval: 10
compiled with openmp parallelization enabled
lin-sys: sparse-direct-amd-qdldl
nnz(A): 334, nnz(P): 0
------------------------------------------------------------------
iter | pri res | dua res | gap | obj | scale | time (s)
------------------------------------------------------------------
0|1.96e+001 1.96e+000 4.08e+002 -2.04e+002 1.00e-001 4.46e-004
100|3.61e-005 1.22e-006 2.85e-006 -3.22e-001 1.00e-001 1.65e-003
------------------------------------------------------------------
status: solved
timings: total: 1.66e-003s = setup: 2.02e-004s + solve: 1.45e-003s
lin-sys: 3.29e-004s, cones: 4.32e-005s, accel: 1.20e-005s
------------------------------------------------------------------
objective = -0.322311
------------------------------------------------------------------
π π = [-1.0, 0.0]
π¬[:, d] = JuMP.VariableRef[π¬[1,17], π¬[2,17]]
------------------------------------------------------------------
SCS v3.2.7 - Splitting Conic Solver
(c) Brendan O'Donoghue, Stanford University, 2012
------------------------------------------------------------------
problem: variables n: 119, constraints m: 206
cones: z: primal zero / dual free vars: 32
l: linear vars: 174
settings: eps_abs: 1.0e-004, eps_rel: 1.0e-004, eps_infeas: 1.0e-007
alpha: 1.50, scale: 1.00e-001, adaptive_scale: 1
max_iters: 100000, normalize: 1, rho_x: 1.00e-006
acceleration_lookback: 10, acceleration_interval: 10
compiled with openmp parallelization enabled
lin-sys: sparse-direct-amd-qdldl
nnz(A): 334, nnz(P): 0
------------------------------------------------------------------
iter | pri res | dua res | gap | obj | scale | time (s)
------------------------------------------------------------------
0|1.00e+001 1.00e+000 7.05e+001 -3.53e+001 1.00e-001 3.36e-004
50|1.28e-004 1.72e-006 5.21e-007 -8.11e-002 1.00e-001 7.58e-004
------------------------------------------------------------------
status: solved
timings: total: 7.60e-004s = setup: 1.80e-004s + solve: 5.80e-004s
lin-sys: 1.76e-004s, cones: 2.15e-005s, accel: 5.70e-006s
------------------------------------------------------------------
objective = -0.081135
------------------------------------------------------------------
π π = [0.0, -1.0]
π¬[:, d] = JuMP.VariableRef[π¬[1,17], π¬[2,17]]
------------------------------------------------------------------
SCS v3.2.7 - Splitting Conic Solver
(c) Brendan O'Donoghue, Stanford University, 2012
------------------------------------------------------------------
problem: variables n: 119, constraints m: 206
cones: z: primal zero / dual free vars: 32
l: linear vars: 174
settings: eps_abs: 1.0e-004, eps_rel: 1.0e-004, eps_infeas: 1.0e-007
alpha: 1.50, scale: 1.00e-001, adaptive_scale: 1
max_iters: 100000, normalize: 1, rho_x: 1.00e-006
acceleration_lookback: 10, acceleration_interval: 10
compiled with openmp parallelization enabled
lin-sys: sparse-direct-amd-qdldl
nnz(A): 334, nnz(P): 0
------------------------------------------------------------------
iter | pri res | dua res | gap | obj | scale | time (s)
------------------------------------------------------------------
0|1.96e+001 1.96e+000 4.08e+002 -2.04e+002 1.00e-001 2.83e-004
100|3.61e-005 1.22e-006 2.85e-006 -3.22e-001 1.00e-001 1.04e-003
------------------------------------------------------------------
status: solved
timings: total: 1.04e-003s = setup: 1.81e-004s + solve: 8.59e-004s
lin-sys: 3.26e-004s, cones: 4.18e-005s, accel: 1.23e-005s
------------------------------------------------------------------
objective = -0.322311
------------------------------------------------------------------
π π = [1.0, 0.0]
π¬[:, d] = JuMP.VariableRef[π¬[1,18], π¬[2,18]]
------------------------------------------------------------------
SCS v3.2.7 - Splitting Conic Solver
(c) Brendan O'Donoghue, Stanford University, 2012
------------------------------------------------------------------
problem: variables n: 126, constraints m: 218
cones: z: primal zero / dual free vars: 34
l: linear vars: 184
settings: eps_abs: 1.0e-004, eps_rel: 1.0e-004, eps_infeas: 1.0e-007
alpha: 1.50, scale: 1.00e-001, adaptive_scale: 1
max_iters: 100000, normalize: 1, rho_x: 1.00e-006
acceleration_lookback: 10, acceleration_interval: 10
compiled with openmp parallelization enabled
lin-sys: sparse-direct-amd-qdldl
nnz(A): 354, nnz(P): 0
------------------------------------------------------------------
iter | pri res | dua res | gap | obj | scale | time (s)
------------------------------------------------------------------
0|1.00e+001 1.00e+000 7.08e+001 -3.54e+001 1.00e-001 3.08e-004
50|1.27e-004 1.82e-006 1.32e-006 -9.17e-002 1.00e-001 8.60e-004
------------------------------------------------------------------
status: solved
timings: total: 8.62e-004s = setup: 1.96e-004s + solve: 6.67e-004s
lin-sys: 1.74e-004s, cones: 2.25e-005s, accel: 6.10e-006s
------------------------------------------------------------------
objective = -0.091675
------------------------------------------------------------------
π π = [0.0, 1.0]
π¬[:, d] = JuMP.VariableRef[π¬[1,18], π¬[2,18]]
------------------------------------------------------------------
SCS v3.2.7 - Splitting Conic Solver
(c) Brendan O'Donoghue, Stanford University, 2012
------------------------------------------------------------------
problem: variables n: 126, constraints m: 218
cones: z: primal zero / dual free vars: 34
l: linear vars: 184
settings: eps_abs: 1.0e-004, eps_rel: 1.0e-004, eps_infeas: 1.0e-007
alpha: 1.50, scale: 1.00e-001, adaptive_scale: 1
max_iters: 100000, normalize: 1, rho_x: 1.00e-006
acceleration_lookback: 10, acceleration_interval: 10
compiled with openmp parallelization enabled
lin-sys: sparse-direct-amd-qdldl
nnz(A): 354, nnz(P): 0
------------------------------------------------------------------
iter | pri res | dua res | gap | obj | scale | time (s)
------------------------------------------------------------------
0|1.96e+001 1.96e+000 4.13e+002 -2.07e+002 1.00e-001 4.15e-004
100|4.91e-006 3.10e-007 4.25e-007 -2.94e-001 1.00e-001 1.61e-003
------------------------------------------------------------------
status: solved
timings: total: 1.62e-003s = setup: 1.83e-004s + solve: 1.43e-003s
lin-sys: 4.08e-004s, cones: 5.52e-005s, accel: 6.01e-005s
------------------------------------------------------------------
objective = -0.294001
------------------------------------------------------------------
π π = [-1.0, 0.0]
π¬[:, d] = JuMP.VariableRef[π¬[1,18], π¬[2,18]]
------------------------------------------------------------------
SCS v3.2.7 - Splitting Conic Solver
(c) Brendan O'Donoghue, Stanford University, 2012
------------------------------------------------------------------
problem: variables n: 126, constraints m: 218
cones: z: primal zero / dual free vars: 34
l: linear vars: 184
settings: eps_abs: 1.0e-004, eps_rel: 1.0e-004, eps_infeas: 1.0e-007
alpha: 1.50, scale: 1.00e-001, adaptive_scale: 1
max_iters: 100000, normalize: 1, rho_x: 1.00e-006
acceleration_lookback: 10, acceleration_interval: 10
compiled with openmp parallelization enabled
lin-sys: sparse-direct-amd-qdldl
nnz(A): 354, nnz(P): 0
------------------------------------------------------------------
iter | pri res | dua res | gap | obj | scale | time (s)
------------------------------------------------------------------
0|1.00e+001 1.00e+000 7.08e+001 -3.54e+001 1.00e-001 4.27e-004
50|1.27e-004 1.82e-006 1.32e-006 -9.17e-002 1.00e-001 9.43e-004
------------------------------------------------------------------
status: solved
timings: total: 9.45e-004s = setup: 2.24e-004s + solve: 7.22e-004s
lin-sys: 1.74e-004s, cones: 2.29e-005s, accel: 6.70e-006s
------------------------------------------------------------------
objective = -0.091675
------------------------------------------------------------------
π π = [0.0, -1.0]
π¬[:, d] = JuMP.VariableRef[π¬[1,18], π¬[2,18]]
------------------------------------------------------------------
SCS v3.2.7 - Splitting Conic Solver
(c) Brendan O'Donoghue, Stanford University, 2012
------------------------------------------------------------------
problem: variables n: 126, constraints m: 218
cones: z: primal zero / dual free vars: 34
l: linear vars: 184
settings: eps_abs: 1.0e-004, eps_rel: 1.0e-004, eps_infeas: 1.0e-007
alpha: 1.50, scale: 1.00e-001, adaptive_scale: 1
max_iters: 100000, normalize: 1, rho_x: 1.00e-006
acceleration_lookback: 10, acceleration_interval: 10
compiled with openmp parallelization enabled
lin-sys: sparse-direct-amd-qdldl
nnz(A): 354, nnz(P): 0
------------------------------------------------------------------
iter | pri res | dua res | gap | obj | scale | time (s)
------------------------------------------------------------------
0|1.96e+001 1.96e+000 4.13e+002 -2.07e+002 1.00e-001 3.50e-004
100|4.91e-006 3.10e-007 4.25e-007 -2.94e-001 1.00e-001 1.27e-003
------------------------------------------------------------------
status: solved
timings: total: 1.27e-003s = setup: 1.88e-004s + solve: 1.08e-003s
lin-sys: 3.43e-004s, cones: 4.36e-005s, accel: 1.24e-005s
------------------------------------------------------------------
objective = -0.294001
------------------------------------------------------------------
π π = [1.0, 0.0]
π¬[:, d] = JuMP.VariableRef[π¬[1,19], π¬[2,19]]
------------------------------------------------------------------
SCS v3.2.7 - Splitting Conic Solver
(c) Brendan O'Donoghue, Stanford University, 2012
------------------------------------------------------------------
problem: variables n: 133, constraints m: 230
cones: z: primal zero / dual free vars: 36
l: linear vars: 194
settings: eps_abs: 1.0e-004, eps_rel: 1.0e-004, eps_infeas: 1.0e-007
alpha: 1.50, scale: 1.00e-001, adaptive_scale: 1
max_iters: 100000, normalize: 1, rho_x: 1.00e-006
acceleration_lookback: 10, acceleration_interval: 10
compiled with openmp parallelization enabled
lin-sys: sparse-direct-amd-qdldl
nnz(A): 374, nnz(P): 0
------------------------------------------------------------------
iter | pri res | dua res | gap | obj | scale | time (s)
------------------------------------------------------------------
0|1.00e+001 1.00e+000 7.13e+001 -3.57e+001 1.00e-001 4.11e-004
50|1.27e-004 4.34e-006 2.95e-006 -9.99e-002 1.00e-001 9.74e-004
------------------------------------------------------------------
status: solved
timings: total: 9.76e-004s = setup: 2.06e-004s + solve: 7.70e-004s
lin-sys: 1.84e-004s, cones: 2.44e-005s, accel: 6.40e-006s
------------------------------------------------------------------
objective = -0.099856
------------------------------------------------------------------
π π = [0.0, 1.0]
π¬[:, d] = JuMP.VariableRef[π¬[1,19], π¬[2,19]]
------------------------------------------------------------------
SCS v3.2.7 - Splitting Conic Solver
(c) Brendan O'Donoghue, Stanford University, 2012
------------------------------------------------------------------
problem: variables n: 133, constraints m: 230
cones: z: primal zero / dual free vars: 36
l: linear vars: 194
settings: eps_abs: 1.0e-004, eps_rel: 1.0e-004, eps_infeas: 1.0e-007
alpha: 1.50, scale: 1.00e-001, adaptive_scale: 1
max_iters: 100000, normalize: 1, rho_x: 1.00e-006
acceleration_lookback: 10, acceleration_interval: 10
compiled with openmp parallelization enabled
lin-sys: sparse-direct-amd-qdldl
nnz(A): 374, nnz(P): 0
------------------------------------------------------------------
iter | pri res | dua res | gap | obj | scale | time (s)
------------------------------------------------------------------
0|1.96e+001 1.96e+000 4.17e+002 -2.08e+002 1.00e-001 3.65e-004
100|2.32e-006 3.11e-007 1.14e-007 -2.67e-001 1.00e-001 1.45e-003
------------------------------------------------------------------
status: solved
timings: total: 1.45e-003s = setup: 1.88e-004s + solve: 1.26e-003s
lin-sys: 3.69e-004s, cones: 5.75e-005s, accel: 1.35e-005s
------------------------------------------------------------------
objective = -0.266778
------------------------------------------------------------------
π π = [-1.0, 0.0]
π¬[:, d] = JuMP.VariableRef[π¬[1,19], π¬[2,19]]
------------------------------------------------------------------
SCS v3.2.7 - Splitting Conic Solver
(c) Brendan O'Donoghue, Stanford University, 2012
------------------------------------------------------------------
problem: variables n: 133, constraints m: 230
cones: z: primal zero / dual free vars: 36
l: linear vars: 194
settings: eps_abs: 1.0e-004, eps_rel: 1.0e-004, eps_infeas: 1.0e-007
alpha: 1.50, scale: 1.00e-001, adaptive_scale: 1
max_iters: 100000, normalize: 1, rho_x: 1.00e-006
acceleration_lookback: 10, acceleration_interval: 10
compiled with openmp parallelization enabled
lin-sys: sparse-direct-amd-qdldl
nnz(A): 374, nnz(P): 0
------------------------------------------------------------------
iter | pri res | dua res | gap | obj | scale | time (s)
------------------------------------------------------------------
0|1.00e+001 1.00e+000 7.13e+001 -3.57e+001 1.00e-001 8.23e-004
50|1.27e-004 4.34e-006 2.95e-006 -9.99e-002 1.00e-001 1.42e-003
------------------------------------------------------------------
status: solved
timings: total: 1.43e-003s = setup: 4.48e-004s + solve: 9.78e-004s
lin-sys: 2.03e-004s, cones: 3.29e-005s, accel: 3.17e-005s
------------------------------------------------------------------
objective = -0.099856
------------------------------------------------------------------
π π = [0.0, -1.0]
π¬[:, d] = JuMP.VariableRef[π¬[1,19], π¬[2,19]]
------------------------------------------------------------------
SCS v3.2.7 - Splitting Conic Solver
(c) Brendan O'Donoghue, Stanford University, 2012
------------------------------------------------------------------
problem: variables n: 133, constraints m: 230
cones: z: primal zero / dual free vars: 36
l: linear vars: 194
settings: eps_abs: 1.0e-004, eps_rel: 1.0e-004, eps_infeas: 1.0e-007
alpha: 1.50, scale: 1.00e-001, adaptive_scale: 1
max_iters: 100000, normalize: 1, rho_x: 1.00e-006
acceleration_lookback: 10, acceleration_interval: 10
compiled with openmp parallelization enabled
lin-sys: sparse-direct-amd-qdldl
nnz(A): 374, nnz(P): 0
------------------------------------------------------------------
iter | pri res | dua res | gap | obj | scale | time (s)
------------------------------------------------------------------
0|1.96e+001 1.96e+000 4.17e+002 -2.08e+002 1.00e-001 3.97e-004
100|2.32e-006 3.11e-007 1.14e-007 -2.67e-001 1.00e-001 1.40e-003
------------------------------------------------------------------
status: solved
timings: total: 1.40e-003s = setup: 2.10e-004s + solve: 1.19e-003s
lin-sys: 3.63e-004s, cones: 4.62e-005s, accel: 1.37e-005s
------------------------------------------------------------------
objective = -0.266778
------------------------------------------------------------------
π π = [1.0, 0.0]
π¬[:, d] = JuMP.VariableRef[π¬[1,20], π¬[2,20]]
------------------------------------------------------------------
SCS v3.2.7 - Splitting Conic Solver
(c) Brendan O'Donoghue, Stanford University, 2012
------------------------------------------------------------------
problem: variables n: 140, constraints m: 242
cones: z: primal zero / dual free vars: 38
l: linear vars: 204
settings: eps_abs: 1.0e-004, eps_rel: 1.0e-004, eps_infeas: 1.0e-007
alpha: 1.50, scale: 1.00e-001, adaptive_scale: 1
max_iters: 100000, normalize: 1, rho_x: 1.00e-006
acceleration_lookback: 10, acceleration_interval: 10
compiled with openmp parallelization enabled
lin-sys: sparse-direct-amd-qdldl
nnz(A): 394, nnz(P): 0
------------------------------------------------------------------
iter | pri res | dua res | gap | obj | scale | time (s)
------------------------------------------------------------------
0|1.00e+001 1.00e+000 7.18e+001 -3.59e+001 1.00e-001 4.11e-004
50|1.32e-004 2.08e-005 2.14e-006 -1.06e-001 1.00e-001 1.02e-003
------------------------------------------------------------------
status: solved
timings: total: 1.02e-003s = setup: 2.19e-004s + solve: 8.03e-004s
lin-sys: 1.94e-004s, cones: 2.47e-005s, accel: 7.10e-006s
------------------------------------------------------------------
objective = -0.105753
------------------------------------------------------------------
π π = [0.0, 1.0]
π¬[:, d] = JuMP.VariableRef[π¬[1,20], π¬[2,20]]
------------------------------------------------------------------
SCS v3.2.7 - Splitting Conic Solver
(c) Brendan O'Donoghue, Stanford University, 2012
------------------------------------------------------------------
problem: variables n: 140, constraints m: 242
cones: z: primal zero / dual free vars: 38
l: linear vars: 204
settings: eps_abs: 1.0e-004, eps_rel: 1.0e-004, eps_infeas: 1.0e-007
alpha: 1.50, scale: 1.00e-001, adaptive_scale: 1
max_iters: 100000, normalize: 1, rho_x: 1.00e-006
acceleration_lookback: 10, acceleration_interval: 10
compiled with openmp parallelization enabled
lin-sys: sparse-direct-amd-qdldl
nnz(A): 394, nnz(P): 0
------------------------------------------------------------------
iter | pri res | dua res | gap | obj | scale | time (s)
------------------------------------------------------------------
0|1.96e+001 1.96e+000 4.19e+002 -2.09e+002 1.00e-001 3.82e-004
100|3.69e-006 1.37e-008 2.09e-008 -2.41e-001 1.00e-001 1.53e-003
------------------------------------------------------------------
status: solved
timings: total: 1.53e-003s = setup: 2.01e-004s + solve: 1.33e-003s
lin-sys: 3.83e-004s, cones: 5.22e-005s, accel: 1.38e-005s
------------------------------------------------------------------
objective = -0.241186
------------------------------------------------------------------
π π = [-1.0, 0.0]
π¬[:, d] = JuMP.VariableRef[π¬[1,20], π¬[2,20]]
------------------------------------------------------------------
SCS v3.2.7 - Splitting Conic Solver
(c) Brendan O'Donoghue, Stanford University, 2012
------------------------------------------------------------------
problem: variables n: 140, constraints m: 242
cones: z: primal zero / dual free vars: 38
l: linear vars: 204
settings: eps_abs: 1.0e-004, eps_rel: 1.0e-004, eps_infeas: 1.0e-007
alpha: 1.50, scale: 1.00e-001, adaptive_scale: 1
max_iters: 100000, normalize: 1, rho_x: 1.00e-006
acceleration_lookback: 10, acceleration_interval: 10
compiled with openmp parallelization enabled
lin-sys: sparse-direct-amd-qdldl
nnz(A): 394, nnz(P): 0
------------------------------------------------------------------
iter | pri res | dua res | gap | obj | scale | time (s)
------------------------------------------------------------------
0|1.00e+001 1.00e+000 7.18e+001 -3.59e+001 1.00e-001 3.61e-004
50|1.32e-004 2.08e-005 2.14e-006 -1.06e-001 1.00e-001 7.86e-004
------------------------------------------------------------------
status: solved
timings: total: 7.89e-004s = setup: 1.91e-004s + solve: 5.98e-004s
lin-sys: 1.92e-004s, cones: 2.67e-005s, accel: 6.50e-006s
------------------------------------------------------------------
objective = -0.105753
------------------------------------------------------------------
π π = [0.0, -1.0]
π¬[:, d] = JuMP.VariableRef[π¬[1,20], π¬[2,20]]
------------------------------------------------------------------
SCS v3.2.7 - Splitting Conic Solver
(c) Brendan O'Donoghue, Stanford University, 2012
------------------------------------------------------------------
problem: variables n: 140, constraints m: 242
cones: z: primal zero / dual free vars: 38
l: linear vars: 204
settings: eps_abs: 1.0e-004, eps_rel: 1.0e-004, eps_infeas: 1.0e-007
alpha: 1.50, scale: 1.00e-001, adaptive_scale: 1
max_iters: 100000, normalize: 1, rho_x: 1.00e-006
acceleration_lookback: 10, acceleration_interval: 10
compiled with openmp parallelization enabled
lin-sys: sparse-direct-amd-qdldl
nnz(A): 394, nnz(P): 0
------------------------------------------------------------------
iter | pri res | dua res | gap | obj | scale | time (s)
------------------------------------------------------------------
0|1.96e+001 1.96e+000 4.19e+002 -2.09e+002 1.00e-001 3.59e-004
100|3.69e-006 1.37e-008 2.10e-008 -2.41e-001 1.00e-001 1.24e-003
------------------------------------------------------------------
status: solved
timings: total: 1.24e-003s = setup: 2.29e-004s + solve: 1.01e-003s
lin-sys: 3.86e-004s, cones: 5.36e-005s, accel: 1.61e-005s
------------------------------------------------------------------
objective = -0.241186
------------------------------------------------------------------
π π = [1.0, 0.0]
π¬[:, d] = JuMP.VariableRef[π¬[1,21], π¬[2,21]]
------------------------------------------------------------------
SCS v3.2.7 - Splitting Conic Solver
(c) Brendan O'Donoghue, Stanford University, 2012
------------------------------------------------------------------
problem: variables n: 147, constraints m: 254
cones: z: primal zero / dual free vars: 40
l: linear vars: 214
settings: eps_abs: 1.0e-004, eps_rel: 1.0e-004, eps_infeas: 1.0e-007
alpha: 1.50, scale: 1.00e-001, adaptive_scale: 1
max_iters: 100000, normalize: 1, rho_x: 1.00e-006
acceleration_lookback: 10, acceleration_interval: 10
compiled with openmp parallelization enabled
lin-sys: sparse-direct-amd-qdldl
nnz(A): 414, nnz(P): 0
------------------------------------------------------------------
iter | pri res | dua res | gap | obj | scale | time (s)
------------------------------------------------------------------
0|1.00e+001 1.00e+000 7.23e+001 -3.62e+001 1.00e-001 4.46e-004
75|1.52e-005 2.66e-007 1.43e-007 -1.10e-001 1.00e-001 1.34e-003
------------------------------------------------------------------
status: solved
timings: total: 1.34e-003s = setup: 2.29e-004s + solve: 1.11e-003s
lin-sys: 3.04e-004s, cones: 3.89e-005s, accel: 9.70e-006s
------------------------------------------------------------------
objective = -0.109536
------------------------------------------------------------------
π π = [0.0, 1.0]
π¬[:, d] = JuMP.VariableRef[π¬[1,21], π¬[2,21]]
------------------------------------------------------------------
SCS v3.2.7 - Splitting Conic Solver
(c) Brendan O'Donoghue, Stanford University, 2012
------------------------------------------------------------------
problem: variables n: 147, constraints m: 254
cones: z: primal zero / dual free vars: 40
l: linear vars: 214
settings: eps_abs: 1.0e-004, eps_rel: 1.0e-004, eps_infeas: 1.0e-007
alpha: 1.50, scale: 1.00e-001, adaptive_scale: 1
max_iters: 100000, normalize: 1, rho_x: 1.00e-006
acceleration_lookback: 10, acceleration_interval: 10
compiled with openmp parallelization enabled
lin-sys: sparse-direct-amd-qdldl
nnz(A): 414, nnz(P): 0
------------------------------------------------------------------
iter | pri res | dua res | gap | obj | scale | time (s)
------------------------------------------------------------------
0|1.96e+001 1.96e+000 4.20e+002 -2.10e+002 1.00e-001 3.84e-004
100|3.19e-006 7.10e-008 4.50e-008 -2.18e-001 1.00e-001 1.56e-003
------------------------------------------------------------------
status: solved
timings: total: 1.56e-003s = setup: 2.06e-004s + solve: 1.35e-003s
lin-sys: 3.96e-004s, cones: 7.82e-005s, accel: 1.42e-005s
------------------------------------------------------------------
objective = -0.217659
------------------------------------------------------------------
π π = [-1.0, 0.0]
π¬[:, d] = JuMP.VariableRef[π¬[1,21], π¬[2,21]]
------------------------------------------------------------------
SCS v3.2.7 - Splitting Conic Solver
(c) Brendan O'Donoghue, Stanford University, 2012
------------------------------------------------------------------
problem: variables n: 147, constraints m: 254
cones: z: primal zero / dual free vars: 40
l: linear vars: 214
settings: eps_abs: 1.0e-004, eps_rel: 1.0e-004, eps_infeas: 1.0e-007
alpha: 1.50, scale: 1.00e-001, adaptive_scale: 1
max_iters: 100000, normalize: 1, rho_x: 1.00e-006
acceleration_lookback: 10, acceleration_interval: 10
compiled with openmp parallelization enabled
lin-sys: sparse-direct-amd-qdldl
nnz(A): 414, nnz(P): 0
------------------------------------------------------------------
iter | pri res | dua res | gap | obj | scale | time (s)
------------------------------------------------------------------
0|1.00e+001 1.00e+000 7.23e+001 -3.62e+001 1.00e-001 3.05e-004
75|1.52e-005 2.66e-007 1.43e-007 -1.10e-001 1.00e-001 9.44e-004
------------------------------------------------------------------
status: solved
timings: total: 9.46e-004s = setup: 2.03e-004s + solve: 7.42e-004s
lin-sys: 3.05e-004s, cones: 3.84e-005s, accel: 9.70e-006s
------------------------------------------------------------------
objective = -0.109536
------------------------------------------------------------------
π π = [0.0, -1.0]
π¬[:, d] = JuMP.VariableRef[π¬[1,21], π¬[2,21]]
------------------------------------------------------------------
SCS v3.2.7 - Splitting Conic Solver
(c) Brendan O'Donoghue, Stanford University, 2012
------------------------------------------------------------------
problem: variables n: 147, constraints m: 254
cones: z: primal zero / dual free vars: 40
l: linear vars: 214
settings: eps_abs: 1.0e-004, eps_rel: 1.0e-004, eps_infeas: 1.0e-007
alpha: 1.50, scale: 1.00e-001, adaptive_scale: 1
max_iters: 100000, normalize: 1, rho_x: 1.00e-006
acceleration_lookback: 10, acceleration_interval: 10
compiled with openmp parallelization enabled
lin-sys: sparse-direct-amd-qdldl
nnz(A): 414, nnz(P): 0
------------------------------------------------------------------
iter | pri res | dua res | gap | obj | scale | time (s)
------------------------------------------------------------------
0|1.96e+001 1.96e+000 4.20e+002 -2.10e+002 1.00e-001 6.65e-004
100|3.19e-006 7.10e-008 4.50e-008 -2.18e-001 1.00e-001 1.88e-003
------------------------------------------------------------------
status: solved
timings: total: 1.89e-003s = setup: 3.69e-004s + solve: 1.52e-003s
lin-sys: 4.43e-004s, cones: 5.96e-005s, accel: 7.18e-005s
------------------------------------------------------------------
objective = -0.217659
------------------------------------------------------------------
Test passed!
You found reachable sets with a maximum of
vertices (per time
Created
May 29, 2025 08:06
-
-
Save nov05/c5a84b3d17738d5672cb1ab70d9cf7b0 to your computer and use it in GitHub Desktop.
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
β Wrong PCA result: