Last updated on 2019-12-14 00:54:01 CET.
| Flavor | Version | Tinstall | Tcheck | Ttotal | Status | Flags |
|---|---|---|---|---|---|---|
| r-devel-linux-x86_64-debian-clang | 0.99-7 | 137.17 | 417.88 | 555.05 | OK | |
| r-devel-linux-x86_64-debian-gcc | 0.99-7 | 98.96 | 304.53 | 403.49 | OK | |
| r-devel-linux-x86_64-fedora-clang | 0.99-7 | 712.50 | NOTE | |||
| r-devel-linux-x86_64-fedora-gcc | 0.99-7 | 649.08 | OK | |||
| r-devel-windows-ix86+x86_64 | 0.99-7 | 211.00 | 678.00 | 889.00 | NOTE | |
| r-devel-windows-ix86+x86_64-gcc8 | 0.99-7 | 256.00 | 948.00 | 1204.00 | NOTE | |
| r-patched-linux-x86_64 | 0.99-7 | 104.64 | 358.03 | 462.67 | OK | |
| r-patched-solaris-x86 | 0.99-7 | 575.50 | ERROR | |||
| r-release-linux-x86_64 | 0.99-7 | 106.75 | 358.05 | 464.80 | OK | |
| r-release-windows-ix86+x86_64 | 0.99-7 | 204.00 | 586.00 | 790.00 | NOTE | |
| r-release-osx-x86_64 | 0.99-7 | NOTE | ||||
| r-oldrel-windows-ix86+x86_64 | 0.99-7 | 178.00 | 592.00 | 770.00 | NOTE | |
| r-oldrel-osx-x86_64 | 0.99-7 | NOTE |
Version: 0.99-7
Check: installed package size
Result: NOTE
installed size is 9.0Mb
sub-directories of 1Mb or more:
R 1.8Mb
libs 5.2Mb
Flavors: r-devel-linux-x86_64-fedora-clang, r-devel-windows-ix86+x86_64, r-devel-windows-ix86+x86_64-gcc8, r-release-windows-ix86+x86_64, r-release-osx-x86_64, r-oldrel-windows-ix86+x86_64, r-oldrel-osx-x86_64
Version: 0.99-7
Check: examples
Result: ERROR
Running examples in ‘CVXR-Ex.R’ failed
The error most likely occurred in:
> ### Name: diag,Expression-method
> ### Title: Matrix Diagonal
> ### Aliases: diag,Expression-method diag
>
> ### ** Examples
>
> C <- Variable(3,3)
> obj <- Maximize(C[1,3])
> constraints <- list(diag(C) == 1, C[1,2] == 0.6, C[2,3] == -0.3, C == Semidef(3))
> prob <- Problem(obj, constraints)
> result <- solve(prob)
*** caught segfault ***
address 0, cause 'memory not mapped'
Traceback:
1: (function (A, b, obj, cone, control = scs_control()) { control <- update_default_controls(control) n_variables <- NCOL(A) n_constraints <- NROW(A) if (inherits(A, "dgCMatrix")) { Ai <- [email protected] Ap <- [email protected] Ax <- [email protected] } else { csc <- make_csc_matrix(A) Ai <- csc[["matind"]] Ap <- csc[["matbeg"]] Ax <- csc[["values"]] } data <- list(m = n_constraints, n = n_variables, c = obj, Ai = Ai, Ap = Ap, Ax = Ax, b = b) ret <- .Call("scsr", data, cone, control, PACKAGE = "scs") return(ret)})(A = new("dgCMatrix", i = c(0L, 5L, 6L, 7L, 3L, 8L, 1L, 9L, 10L, 11L, 4L, 12L, 2L, 13L, 5L, 14L, 6L, 8L, 15L, 7L, 11L, 16L, 9L, 17L, 10L, 12L, 18L, 13L, 19L), p = c(0L, 2L, 3L, 4L, 6L, 8L, 9L, 10L, 12L, 14L, 16L, 19L, 22L, 24L, 27L, 29L), Dim = c(20L, 15L), Dimnames = list(NULL, NULL), x = c(1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, -1, -1, -1, -1, -1.4142135623731, -1, -1, -1.4142135623731, -1, -1, -1, -1, -1.4142135623731, -1, -1), factors = list()), b = c(1, 1, 1, 0.6, -0.3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0), obj = c(0, 0, 0, 0, 0, 0, -1, 0, 0, 0, 0, 0, 0, 0, 0), cone = list(f = 14, l = 0, ep = 0, s = 3), control = list(verbose = FALSE, acceleration_lookback = 10L))
2: do.call(scs::scs, c(scs_args, list(control = solver_opts)))
3: Solver.solve(solver, objective, constraints, [email protected]_data, warm_start, verbose, ...)
4: Solver.solve(solver, objective, constraints, [email protected]_data, warm_start, verbose, ...)
5: CVXR::psolve(a, b, ...)
6: CVXR::psolve(a, b, ...)
7: solve.Problem(prob)
8: solve(prob)
An irrecoverable exception occurred. R is aborting now ...
Flavor: r-patched-solaris-x86
Version: 0.99-7
Check: tests
Result: ERROR
Running ‘group01.R’ [75s/114s]
Running ‘group02.R’ [11s/37s]
Running ‘group03.R’ [94s/105s]
Running ‘group04.R’ [11s/36s]
Running the tests in ‘tests/group01.R’ failed.
Complete output:
> library(testthat)
> library(CVXR)
Attaching package: 'CVXR'
The following object is masked from 'package:stats':
power
>
> test_check("CVXR", filter="^g01")
WARN: m less than n, problem likely degenerate
WARN: m less than n, problem likely degenerate
[1] "ECOS"
[1] "SCS"
[1] "ECOS"
[1] "SCS"
----------------------------------------------------------------------------
SCS v2.1.1 - Splitting Conic Solver
(c) Brendan O'Donoghue, Stanford University, 2012
----------------------------------------------------------------------------
Lin-sys: sparse-direct, nnz in A = 20
eps = 1.00e-04, alpha = 1.50, max_iters = 5000, normalize = 1, scale = 1.00
acceleration_lookback = 10, rho_x = 1.00e-03
Variables n = 10, constraints m = 20
Cones: linear vars: 5
soc vars: 15, soc blks: 5
Setup time: 3.54e-04s
----------------------------------------------------------------------------
Iter | pri res | dua res | rel gap | pri obj | dua obj | kap/tau | time (s)
----------------------------------------------------------------------------
0| 2.49e+19 4.97e+18 8.31e-01 -5.24e+19 -4.84e+18 7.44e+19 4.44e-05
86| 2.29e-06 2.71e-06 5.13e-06 2.84e-07 -4.85e-06 1.68e-16 2.40e-03
----------------------------------------------------------------------------
Status: Solved
Timing: Solve time: 2.40e-03s
Lin-sys: nnz in L factor: 50, avg solve time: 1.19e-06s
Cones: avg projection time: 8.23e-07s
Acceleration: avg step time: 2.24e-05s
----------------------------------------------------------------------------
Error metrics:
dist(s, K) = 4.1834e-11, dist(y, K*) = 0.0000e+00, s'y/|s||y| = -1.9488e-11
primal res: |Ax + s - b|_2 / (1 + |b|_2) = 2.2864e-06
dual res: |A'y + c|_2 / (1 + |c|_2) = 2.7129e-06
rel gap: |c'x + b'y| / (1 + |c'x| + |b'y|) = 5.1317e-06
----------------------------------------------------------------------------
c'x = 0.0000, -b'y = -0.0000
============================================================================
----------------------------------------------------------------------------
SCS v2.1.1 - Splitting Conic Solver
(c) Brendan O'Donoghue, Stanford University, 2012
----------------------------------------------------------------------------
Lin-sys: sparse-direct, nnz in A = 150
eps = 1.00e-05, alpha = 1.50, max_iters = 5000, normalize = 1, scale = 1.00
acceleration_lookback = 10, rho_x = 1.00e-03
Variables n = 100, constraints m = 151
Cones: primal zero / dual free vars: 1
exp vars: 150, dual exp vars: 0
Setup time: 5.18e-04s
----------------------------------------------------------------------------
Iter | pri res | dua res | rel gap | pri obj | dua obj | kap/tau | time (s)
----------------------------------------------------------------------------
0| 6.72e-01 1.11e+00 4.38e-01 -7.88e+00 -2.78e+00 0.00e+00 2.92e-03
40| 3.23e-10 7.17e-10 5.32e-11 -1.00e+00 -1.00e+00 4.34e-16 5.61e-02
----------------------------------------------------------------------------
Status: Solved
Timing: Solve time: 5.61e-02s
Lin-sys: nnz in L factor: 401, avg solve time: 6.35e-06s
Cones: avg projection time: 1.24e-03s
Acceleration: avg step time: 1.10e-04s
----------------------------------------------------------------------------
Error metrics:
dist(s, K) = 1.5720e-27, dist(y, K*) = 0.0000e+00, s'y/|s||y| = 1.3458e-10
primal res: |Ax + s - b|_2 / (1 + |b|_2) = 3.2286e-10
dual res: |A'y + c|_2 / (1 + |c|_2) = 7.1702e-10
rel gap: |c'x + b'y| / (1 + |c'x| + |b'y|) = 5.3231e-11
----------------------------------------------------------------------------
c'x = -1.0000, -b'y = -1.0000
============================================================================
ECOS 2.0.7 - (C) embotech GmbH, Zurich Switzerland, 2012-15. Web: www.embotech.com/ECOS
It pcost dcost gap pres dres k/t mu step sigma IR | BT
0 +0.000e+00 -6.561e-01 +2e+02 1e+00 4e-01 1e+00 1e+00 --- --- 0 0 - | - -
1 -2.887e+00 -2.583e+00 +4e+00 4e-01 2e-02 4e-01 3e-02 0.9791 9e-03 1 1 1 | 1 0
2 -2.026e+00 -1.964e+00 +1e+00 1e-01 5e-03 8e-02 7e-03 0.7833 3e-02 1 1 1 | 1 1
3 -1.316e+00 -1.291e+00 +3e-01 5e-02 2e-03 3e-02 2e-03 0.6266 5e-02 1 1 1 | 2 2
4 -1.076e+00 -1.071e+00 +8e-02 1e-02 5e-04 7e-03 5e-04 0.7833 5e-02 1 1 1 | 2 1
5 -1.030e+00 -1.028e+00 +3e-02 5e-03 2e-04 3e-03 2e-04 0.6266 5e-02 1 1 1 | 2 2
6 -1.007e+00 -1.006e+00 +7e-03 1e-03 4e-05 6e-04 4e-05 0.7833 9e-03 1 1 1 | 1 1
7 -1.003e+00 -1.002e+00 +3e-03 5e-04 2e-05 2e-04 2e-05 0.6266 5e-02 1 1 1 | 2 2
8 -1.001e+00 -1.001e+00 +6e-04 1e-04 4e-06 5e-05 4e-06 0.7833 9e-03 1 1 1 | 1 1
9 -1.000e+00 -1.000e+00 +2e-04 4e-05 2e-06 2e-05 2e-06 0.6266 5e-02 1 1 1 | 2 2
10 -1.000e+00 -1.000e+00 +5e-05 1e-05 4e-07 4e-06 4e-07 0.7833 1e-02 1 1 1 | 1 1
11 -1.000e+00 -1.000e+00 +2e-05 4e-06 1e-07 2e-06 1e-07 0.6266 5e-02 1 1 1 | 2 2
12 -1.000e+00 -1.000e+00 +5e-06 9e-07 3e-08 4e-07 3e-08 0.7833 9e-03 1 0 0 | 1 1
13 -1.000e+00 -1.000e+00 +2e-06 4e-07 1e-08 1e-07 1e-08 0.6266 5e-02 1 0 0 | 2 2
14 -1.000e+00 -1.000e+00 +4e-07 8e-08 3e-09 3e-08 3e-09 0.7833 9e-03 2 0 0 | 1 1
15 -1.000e+00 -1.000e+00 +2e-07 3e-08 1e-09 1e-08 1e-09 0.6266 5e-02 2 0 0 | 2 2
16 -1.000e+00 -1.000e+00 +4e-08 7e-09 3e-10 3e-09 3e-10 0.7833 9e-03 2 0 0 | 1 1
17 -1.000e+00 -1.000e+00 +2e-08 3e-09 1e-10 1e-09 1e-10 0.6266 5e-02 1 0 0 | 2 2
18 -1.000e+00 -1.000e+00 +4e-09 7e-10 2e-11 2e-10 2e-11 0.7833 9e-03 1 0 0 | 1 1
OPTIMAL (within feastol=6.6e-10, reltol=3.5e-09, abstol=3.5e-09).
Runtime: 0.005102 seconds.
[1] 5
ECOS 2.0.7 - (C) embotech GmbH, Zurich Switzerland, 2012-15. Web: www.embotech.com/ECOS
It pcost dcost gap pres dres k/t mu step sigma IR | BT
0 +0.000e+00 -3.281e+00 +2e+01 1e+00 2e-01 1e+00 1e+00 --- --- 0 0 - | - -
1 -3.384e+00 -4.263e+00 +3e+00 3e-01 7e-02 5e-01 2e-01 0.7833 9e-03 1 1 1 | 1 1
2 -2.123e+00 -2.333e+00 +6e-01 9e-02 2e-02 1e-01 4e-02 0.7833 9e-03 1 1 1 | 1 1
3 -1.587e+00 -1.638e+00 +1e-01 3e-02 5e-03 3e-02 8e-03 0.7833 9e-03 1 1 1 | 1 1
4 -1.624e+00 -1.635e+00 +3e-02 5e-03 1e-03 7e-03 2e-03 0.7820 8e-04 1 1 1 | 0 1
5 -1.610e+00 -1.613e+00 +6e-03 1e-03 2e-04 2e-03 4e-04 0.7833 9e-03 1 1 1 | 1 1
6 -1.610e+00 -1.611e+00 +1e-03 3e-04 5e-05 3e-04 9e-05 0.7822 4e-04 2 1 1 | 0 1
7 -1.609e+00 -1.610e+00 +3e-04 7e-05 1e-05 9e-05 2e-05 0.7833 9e-03 1 1 1 | 1 1
8 -1.609e+00 -1.610e+00 +6e-05 1e-05 2e-06 2e-05 4e-06 0.7824 9e-04 2 0 1 | 0 1
9 -1.609e+00 -1.609e+00 +1e-05 3e-06 6e-07 4e-06 9e-07 0.7833 9e-03 2 0 0 | 1 1
10 -1.609e+00 -1.609e+00 +3e-06 7e-07 1e-07 9e-07 2e-07 0.7822 8e-04 2 0 0 | 0 1
11 -1.609e+00 -1.609e+00 +6e-07 2e-07 3e-08 2e-07 4e-08 0.7833 9e-03 2 0 0 | 1 1
12 -1.609e+00 -1.609e+00 +2e-07 4e-08 6e-09 5e-08 1e-08 0.7833 2e-04 1 0 0 | 0 1
13 -1.609e+00 -1.609e+00 +3e-08 7e-09 1e-09 1e-08 2e-09 0.7833 9e-03 2 0 0 | 1 1
14 -1.609e+00 -1.609e+00 +3e-09 7e-10 6e-11 3e-10 2e-10 0.9791 9e-03 1 0 0 | 1 0
OPTIMAL (within feastol=7.1e-10, reltol=1.8e-09, abstol=2.9e-09).
Runtime: 0.001050 seconds.
----------------------------------------------------------------------------
SCS v2.1.1 - Splitting Conic Solver
(c) Brendan O'Donoghue, Stanford University, 2012
----------------------------------------------------------------------------
Lin-sys: sparse-direct, nnz in A = 15
eps = 1.00e-05, alpha = 1.50, max_iters = 5000, normalize = 1, scale = 1.00
acceleration_lookback = 10, rho_x = 1.00e-03
Variables n = 10, constraints m = 16
Cones: primal zero / dual free vars: 1
exp vars: 15, dual exp vars: 0
Setup time: 1.82e-04s
----------------------------------------------------------------------------
Iter | pri res | dua res | rel gap | pri obj | dua obj | kap/tau | time (s)
----------------------------------------------------------------------------
0| 2.83e+19 1.63e+19 7.40e-01 -8.97e+19 -1.34e+19 9.66e+19 3.01e-04
20| 1.33e-09 2.42e-09 6.50e-10 -1.61e+00 -1.61e+00 5.97e-17 6.42e-03
----------------------------------------------------------------------------
Status: Solved
Timing: Solve time: 6.43e-03s
Lin-sys: nnz in L factor: 41, avg solve time: 1.16e-06s
Cones: avg projection time: 2.80e-04s
Acceleration: avg step time: 1.94e-05s
----------------------------------------------------------------------------
Error metrics:
dist(s, K) = 1.6612e-17, dist(y, K*) = 0.0000e+00, s'y/|s||y| = -4.4250e-10
primal res: |Ax + s - b|_2 / (1 + |b|_2) = 1.3252e-09
dual res: |A'y + c|_2 / (1 + |c|_2) = 2.4178e-09
rel gap: |c'x + b'y| / (1 + |c'x| + |b'y|) = 6.5026e-10
----------------------------------------------------------------------------
c'x = -1.6094, -b'y = -1.6094
============================================================================
[1] 10
ECOS 2.0.7 - (C) embotech GmbH, Zurich Switzerland, 2012-15. Web: www.embotech.com/ECOS
It pcost dcost gap pres dres k/t mu step sigma IR | BT
0 +0.000e+00 -6.561e+00 +3e+01 1e+00 2e-01 1e+00 1e+00 --- --- 0 0 - | - -
1 -6.375e+00 -8.297e+00 +7e+00 3e-01 7e-02 5e-01 2e-01 0.7833 9e-03 1 1 1 | 1 1
2 -3.908e+00 -4.394e+00 +1e+00 1e-01 2e-02 1e-01 4e-02 0.7833 9e-03 1 1 1 | 1 1
3 -2.395e+00 -2.523e+00 +2e-01 4e-02 5e-03 5e-02 7e-03 0.7833 9e-03 1 1 1 | 1 1
4 -2.352e+00 -2.378e+00 +5e-02 7e-03 1e-03 1e-02 2e-03 0.7833 7e-04 1 1 1 | 0 1
5 -2.305e+00 -2.311e+00 +1e-02 2e-03 3e-04 2e-03 4e-04 0.7833 9e-03 1 1 1 | 1 1
6 -2.305e+00 -2.306e+00 +3e-03 4e-04 5e-05 5e-04 9e-05 0.7833 8e-04 1 1 1 | 0 1
7 -2.303e+00 -2.303e+00 +5e-04 9e-05 1e-05 1e-04 2e-05 0.7833 9e-03 2 1 1 | 1 1
8 -2.303e+00 -2.303e+00 +1e-04 2e-05 2e-06 3e-05 4e-06 0.7833 1e-03 2 1 0 | 0 1
9 -2.303e+00 -2.303e+00 +2e-05 4e-06 6e-07 6e-06 8e-07 0.7833 9e-03 1 1 0 | 1 1
10 -2.303e+00 -2.303e+00 +6e-06 9e-07 1e-07 1e-06 2e-07 0.7833 9e-04 2 0 0 | 0 1
11 -2.303e+00 -2.303e+00 +1e-06 2e-07 3e-08 3e-07 4e-08 0.7833 9e-03 1 0 0 | 1 1
12 -2.303e+00 -2.303e+00 +3e-07 5e-08 6e-09 7e-08 1e-08 0.7833 1e-04 1 0 0 | 0 1
13 -2.303e+00 -2.303e+00 +6e-08 1e-08 1e-09 1e-08 2e-09 0.7833 9e-03 2 0 0 | 1 1
14 -2.303e+00 -2.303e+00 +5e-09 7e-10 5e-11 4e-10 2e-10 0.9791 9e-03 1 0 0 | 1 0
OPTIMAL (within feastol=7.4e-10, reltol=2.2e-09, abstol=5.1e-09).
Runtime: 0.001217 seconds.
----------------------------------------------------------------------------
SCS v2.1.1 - Splitting Conic Solver
(c) Brendan O'Donoghue, Stanford University, 2012
----------------------------------------------------------------------------
Lin-sys: sparse-direct, nnz in A = 30
eps = 1.00e-05, alpha = 1.50, max_iters = 5000, normalize = 1, scale = 1.00
acceleration_lookback = 10, rho_x = 1.00e-03
Variables n = 20, constraints m = 31
Cones: primal zero / dual free vars: 1
exp vars: 30, dual exp vars: 0
Setup time: 2.53e-04s
----------------------------------------------------------------------------
Iter | pri res | dua res | rel gap | pri obj | dua obj | kap/tau | time (s)
----------------------------------------------------------------------------
0| 4.26e+19 2.33e+19 6.67e-01 -2.29e+20 -4.56e+19 2.75e+20 5.66e-04
20| 1.68e-10 2.52e-10 2.12e-10 -2.30e+00 -2.30e+00 8.00e-16 1.23e-02
----------------------------------------------------------------------------
Status: Solved
Timing: Solve time: 1.23e-02s
Lin-sys: nnz in L factor: 81, avg solve time: 1.79e-06s
Cones: avg projection time: 5.46e-04s
Acceleration: avg step time: 2.87e-05s
----------------------------------------------------------------------------
Error metrics:
dist(s, K) = 3.2503e-17, dist(y, K*) = 0.0000e+00, s'y/|s||y| = 1.8929e-10
primal res: |Ax + s - b|_2 / (1 + |b|_2) = 1.6831e-10
dual res: |A'y + c|_2 / (1 + |c|_2) = 2.5182e-10
rel gap: |c'x + b'y| / (1 + |c'x| + |b'y|) = 2.1238e-10
----------------------------------------------------------------------------
c'x = -2.3026, -b'y = -2.3026
============================================================================
[1] 25
ECOS 2.0.7 - (C) embotech GmbH, Zurich Switzerland, 2012-15. Web: www.embotech.com/ECOS
It pcost dcost gap pres dres k/t mu step sigma IR | BT
0 +0.000e+00 -1.640e+01 +8e+01 1e+00 2e-01 1e+00 1e+00 --- --- 0 0 - | - -
1 -1.513e+01 -2.022e+01 +2e+01 3e-01 7e-02 5e-01 2e-01 0.7833 9e-03 1 1 1 | 1 1
2 -8.736e+00 -1.010e+01 +3e+00 1e-01 2e-02 2e-01 4e-02 0.7833 9e-03 1 1 1 | 1 1
3 -4.185e+00 -4.589e+00 +6e-01 5e-02 6e-03 7e-02 8e-03 0.7833 9e-03 1 1 1 | 1 1
4 -3.377e+00 -3.469e+00 +1e-01 1e-02 1e-03 2e-02 2e-03 0.7833 9e-03 1 1 1 | 1 1
5 -3.222e+00 -3.224e+00 +3e-03 2e-04 3e-05 3e-04 4e-05 0.9791 1e-04 1 1 1 | 0 0
6 -3.219e+00 -3.219e+00 +8e-05 7e-06 8e-07 9e-06 1e-06 0.9791 9e-03 1 1 1 | 1 0
7 -3.219e+00 -3.219e+00 +2e-05 4e-06 4e-07 5e-06 3e-07 0.6266 5e-02 2 1 1 | 2 2
8 -3.219e+00 -3.219e+00 +6e-06 8e-07 9e-08 1e-06 8e-08 0.7833 1e-04 1 1 0 | 0 1
9 -3.219e+00 -3.219e+00 +1e-06 2e-07 2e-08 3e-07 2e-08 0.7833 9e-03 2 1 0 | 1 1
10 -3.219e+00 -3.219e+00 +3e-07 4e-08 5e-09 5e-08 4e-09 0.7833 1e-04 1 0 0 | 0 1
11 -3.219e+00 -3.219e+00 +5e-08 8e-09 1e-09 1e-08 7e-10 0.7833 9e-03 2 0 0 | 1 1
12 -3.219e+00 -3.219e+00 +5e-09 6e-10 3e-11 3e-10 7e-11 0.9791 9e-03 1 0 0 | 1 0
OPTIMAL (within feastol=6.0e-10, reltol=1.7e-09, abstol=5.4e-09).
Runtime: 0.002076 seconds.
----------------------------------------------------------------------------
SCS v2.1.1 - Splitting Conic Solver
(c) Brendan O'Donoghue, Stanford University, 2012
----------------------------------------------------------------------------
Lin-sys: sparse-direct, nnz in A = 75
eps = 1.00e-05, alpha = 1.50, max_iters = 5000, normalize = 1, scale = 1.00
acceleration_lookback = 10, rho_x = 1.00e-03
Variables n = 50, constraints m = 76
Cones: primal zero / dual free vars: 1
exp vars: 75, dual exp vars: 0
Setup time: 4.13e-04s
----------------------------------------------------------------------------
Iter | pri res | dua res | rel gap | pri obj | dua obj | kap/tau | time (s)
----------------------------------------------------------------------------
0| 7.23e+19 3.82e+19 6.52e-01 -8.32e+20 -1.75e+20 1.10e+21 1.34e-03
17| 6.82e-11 9.13e-11 2.52e-10 -3.22e+00 -3.22e+00 1.17e-15 2.39e-02
----------------------------------------------------------------------------
Status: Solved
Timing: Solve time: 2.39e-02s
Lin-sys: nnz in L factor: 201, avg solve time: 3.70e-06s
Cones: avg projection time: 1.26e-03s
Acceleration: avg step time: 5.55e-05s
----------------------------------------------------------------------------
Error metrics:
dist(s, K) = 1.5383e-16, dist(y, K*) = 0.0000e+00, s'y/|s||y| = 6.5815e-11
primal res: |Ax + s - b|_2 / (1 + |b|_2) = 6.8234e-11
dual res: |A'y + c|_2 / (1 + |c|_2) = 9.1269e-11
rel gap: |c'x + b'y| / (1 + |c'x| + |b'y|) = 2.5214e-10
----------------------------------------------------------------------------
c'x = -3.2189, -b'y = -3.2189
============================================================================
[1] 5
ECOS 2.0.7 - (C) embotech GmbH, Zurich Switzerland, 2012-15. Web: www.embotech.com/ECOS
It pcost dcost gap pres dres k/t mu step sigma IR | BT
0 +0.000e+00 -1.450e+00 +2e+01 1e+00 2e-01 1e+00 1e+00 --- --- 0 0 - | - -
1 +2.499e+00 +2.167e+00 +3e+00 3e-01 6e-02 4e-01 2e-01 0.7833 9e-03 1 1 1 | 1 1
2 +5.310e+00 +5.257e+00 +6e-01 1e-01 2e-02 2e-01 4e-02 0.7833 9e-03 1 1 1 | 1 1
3 +5.878e+00 +5.866e+00 +1e-01 2e-02 4e-03 4e-02 1e-02 0.7833 9e-03 1 1 1 | 1 1
4 +6.067e+00 +6.065e+00 +3e-02 6e-03 1e-03 9e-03 2e-03 0.7833 9e-03 1 1 1 | 1 1
5 +6.095e+00 +6.094e+00 +7e-03 1e-03 2e-04 2e-03 5e-04 0.7828 3e-04 1 1 1 | 0 1
6 +6.105e+00 +6.105e+00 +1e-03 3e-04 5e-05 5e-04 1e-04 0.7833 9e-03 2 1 1 | 1 1
7 +6.106e+00 +6.106e+00 +3e-04 6e-05 1e-05 1e-04 2e-05 0.7833 8e-04 2 1 1 | 0 1
8 +6.107e+00 +6.107e+00 +7e-05 1e-05 3e-06 2e-05 5e-06 0.7833 9e-03 1 1 1 | 1 1
9 +6.107e+00 +6.107e+00 +2e-05 3e-06 5e-07 5e-06 1e-06 0.7833 9e-04 2 0 0 | 0 1
10 +6.107e+00 +6.107e+00 +3e-06 7e-07 1e-07 1e-06 2e-07 0.7833 9e-03 1 0 0 | 1 1
11 +6.107e+00 +6.107e+00 +8e-07 1e-07 2e-08 3e-07 6e-08 0.7833 4e-04 1 0 0 | 0 1
12 +6.107e+00 +6.107e+00 +1e-07 3e-08 6e-09 6e-08 1e-08 0.7833 9e-03 2 0 0 | 1 1
13 +6.107e+00 +6.107e+00 +4e-08 7e-09 1e-09 1e-08 3e-09 0.7833 1e-04 0 0 0 | 0 1
OPTIMAL (within feastol=7.3e-09, reltol=6.4e-09, abstol=3.9e-08).
Runtime: 0.000806 seconds.
----------------------------------------------------------------------------
SCS v2.1.1 - Splitting Conic Solver
(c) Brendan O'Donoghue, Stanford University, 2012
----------------------------------------------------------------------------
Lin-sys: sparse-direct, nnz in A = 15
eps = 1.00e-05, alpha = 1.50, max_iters = 5000, normalize = 1, scale = 1.00
acceleration_lookback = 10, rho_x = 1.00e-03
Variables n = 10, constraints m = 16
Cones: primal zero / dual free vars: 1
exp vars: 15, dual exp vars: 0
Setup time: 2.15e-04s
----------------------------------------------------------------------------
Iter | pri res | dua res | rel gap | pri obj | dua obj | kap/tau | time (s)
----------------------------------------------------------------------------
0| 2.01e+19 3.36e+19 1.00e+00 -8.97e+19 2.03e+20 9.66e+19 1.86e-04
17| 7.31e-12 1.51e-11 9.17e-12 6.11e+00 6.11e+00 7.90e-16 4.90e-03
----------------------------------------------------------------------------
Status: Solved
Timing: Solve time: 4.91e-03s
Lin-sys: nnz in L factor: 41, avg solve time: 1.24e-06s
Cones: avg projection time: 2.46e-04s
Acceleration: avg step time: 1.95e-05s
----------------------------------------------------------------------------
Error metrics:
dist(s, K) = 1.1844e-17, dist(y, K*) = 0.0000e+00, s'y/|s||y| = 1.6007e-11
primal res: |Ax + s - b|_2 / (1 + |b|_2) = 7.3103e-12
dual res: |A'y + c|_2 / (1 + |c|_2) = 1.5147e-11
rel gap: |c'x + b'y| / (1 + |c'x| + |b'y|) = 9.1720e-12
----------------------------------------------------------------------------
c'x = 6.1070, -b'y = 6.1070
============================================================================
[1] 10
ECOS 2.0.7 - (C) embotech GmbH, Zurich Switzerland, 2012-15. Web: www.embotech.com/ECOS
It pcost dcost gap pres dres k/t mu step sigma IR | BT
0 +0.000e+00 -2.900e+00 +3e+01 1e+00 2e-01 1e+00 1e+00 --- --- 0 0 - | - -
1 +4.551e+00 +3.800e+00 +7e+00 3e-01 6e-02 4e-01 2e-01 0.7833 9e-03 1 1 1 | 1 1
2 +9.819e+00 +9.634e+00 +1e+00 1e-01 2e-02 1e-01 4e-02 0.7833 9e-03 1 1 1 | 1 1
3 +1.066e+01 +1.062e+01 +3e-01 2e-02 4e-03 3e-02 1e-02 0.7833 1e-02 1 1 1 | 1 1
4 +1.099e+01 +1.098e+01 +6e-02 5e-03 1e-03 8e-03 2e-03 0.7833 9e-03 1 1 1 | 1 1
5 +1.103e+01 +1.103e+01 +1e-02 1e-03 2e-04 2e-03 5e-04 0.7833 6e-04 2 1 1 | 0 1
6 +1.105e+01 +1.105e+01 +3e-03 3e-04 5e-05 4e-04 1e-04 0.7833 9e-03 1 1 1 | 1 1
7 +1.105e+01 +1.105e+01 +7e-04 5e-05 9e-06 9e-05 2e-05 0.7833 1e-03 2 1 1 | 0 1
8 +1.105e+01 +1.105e+01 +1e-04 1e-05 2e-06 2e-05 5e-06 0.7833 9e-03 2 1 1 | 1 1
9 +1.105e+01 +1.105e+01 +3e-05 3e-06 5e-07 5e-06 1e-06 0.7833 1e-03 2 0 0 | 0 1
10 +1.105e+01 +1.105e+01 +7e-06 7e-07 1e-07 1e-06 2e-07 0.7833 9e-03 1 0 0 | 1 1
11 +1.105e+01 +1.105e+01 +2e-06 1e-07 2e-08 2e-07 6e-08 0.7833 4e-04 2 0 0 | 0 1
12 +1.105e+01 +1.105e+01 +3e-07 3e-08 6e-09 5e-08 1e-08 0.7833 9e-03 1 0 0 | 1 1
13 +1.105e+01 +1.105e+01 +8e-08 7e-09 1e-09 1e-08 3e-09 0.7833 1e-04 0 0 0 | 0 1
OPTIMAL (within feastol=7.1e-09, reltol=7.4e-09, abstol=8.2e-08).
Runtime: 0.001146 seconds.
----------------------------------------------------------------------------
SCS v2.1.1 - Splitting Conic Solver
(c) Brendan O'Donoghue, Stanford University, 2012
----------------------------------------------------------------------------
Lin-sys: sparse-direct, nnz in A = 30
eps = 1.00e-05, alpha = 1.50, max_iters = 5000, normalize = 1, scale = 1.00
acceleration_lookback = 10, rho_x = 1.00e-03
Variables n = 20, constraints m = 31
Cones: primal zero / dual free vars: 1
exp vars: 30, dual exp vars: 0
Setup time: 2.54e-04s
----------------------------------------------------------------------------
Iter | pri res | dua res | rel gap | pri obj | dua obj | kap/tau | time (s)
----------------------------------------------------------------------------
0| 3.04e+19 5.26e+19 1.00e+00 -2.29e+20 5.40e+20 2.75e+20 3.18e-04
16| 9.44e-11 9.52e-11 3.78e-11 1.11e+01 1.11e+01 7.80e-16 8.93e-03
----------------------------------------------------------------------------
Status: Solved
Timing: Solve time: 8.93e-03s
Lin-sys: nnz in L factor: 81, avg solve time: 1.87e-06s
Cones: avg projection time: 4.88e-04s
Acceleration: avg step time: 2.85e-05s
----------------------------------------------------------------------------
Error metrics:
dist(s, K) = 6.0899e-17, dist(y, K*) = 0.0000e+00, s'y/|s||y| = -1.5817e-10
primal res: |Ax + s - b|_2 / (1 + |b|_2) = 9.4385e-11
dual res: |A'y + c|_2 / (1 + |c|_2) = 9.5185e-11
rel gap: |c'x + b'y| / (1 + |c'x| + |b'y|) = 3.7829e-11
----------------------------------------------------------------------------
c'x = 11.0517, -b'y = 11.0517
============================================================================
[1] 25
ECOS 2.0.7 - (C) embotech GmbH, Zurich Switzerland, 2012-15. Web: www.embotech.com/ECOS
It pcost dcost gap pres dres k/t mu step sigma IR | BT
0 +0.000e+00 -7.249e+00 +8e+01 1e+00 2e-01 1e+00 1e+00 --- --- 0 0 - | - -
1 +1.072e+01 +8.729e+00 +2e+01 3e-01 6e-02 4e-01 2e-01 0.7833 9e-03 1 1 1 | 1 1
2 +2.340e+01 +2.285e+01 +3e+00 1e-01 2e-02 1e-01 4e-02 0.7833 9e-03 1 1 1 | 1 1
3 +2.513e+01 +2.500e+01 +8e-01 2e-02 4e-03 3e-02 1e-02 0.7833 1e-02 1 1 1 | 1 1
4 +2.590e+01 +2.587e+01 +2e-01 5e-03 1e-03 8e-03 2e-03 0.7833 9e-03 1 1 1 | 1 1
5 +2.597e+01 +2.597e+01 +4e-02 1e-03 2e-04 2e-03 5e-04 0.7833 8e-04 1 1 1 | 0 1
6 +2.602e+01 +2.601e+01 +7e-03 3e-04 5e-05 4e-04 1e-04 0.7833 9e-03 2 1 1 | 1 1
7 +2.602e+01 +2.602e+01 +2e-03 5e-05 9e-06 8e-05 2e-05 0.7833 1e-03 1 1 1 | 0 1
8 +2.602e+01 +2.602e+01 +4e-04 1e-05 2e-06 2e-05 5e-06 0.7833 9e-03 2 1 1 | 1 1
9 +2.602e+01 +2.602e+01 +9e-05 3e-06 5e-07 4e-06 1e-06 0.7833 1e-03 1 0 0 | 0 1
10 +2.602e+01 +2.602e+01 +2e-05 6e-07 1e-07 1e-06 2e-07 0.7833 9e-03 2 0 0 | 1 1
11 +2.602e+01 +2.602e+01 +4e-06 1e-07 2e-08 2e-07 6e-08 0.7833 5e-04 1 0 0 | 0 1
12 +2.602e+01 +2.602e+01 +8e-07 3e-08 6e-09 5e-08 1e-08 0.7833 9e-03 2 0 0 | 1 1
13 +2.602e+01 +2.602e+01 +8e-08 2e-09 1e-10 1e-09 1e-09 0.9791 1e-02 0 0 0 | 1 0
OPTIMAL (within feastol=2.1e-09, reltol=3.1e-09, abstol=8.0e-08).
Runtime: 0.002101 seconds.
----------------------------------------------------------------------------
SCS v2.1.1 - Splitting Conic Solver
(c) Brendan O'Donoghue, Stanford University, 2012
----------------------------------------------------------------------------
Lin-sys: sparse-direct, nnz in A = 75
eps = 1.00e-05, alpha = 1.50, max_iters = 5000, normalize = 1, scale = 1.00
acceleration_lookback = 10, rho_x = 1.00e-03
Variables n = 50, constraints m = 76
Cones: primal zero / dual free vars: 1
exp vars: 75, dual exp vars: 0
Setup time: 3.57e-04s
----------------------------------------------------------------------------
Iter | pri res | dua res | rel gap | pri obj | dua obj | kap/tau | time (s)
----------------------------------------------------------------------------
0| 5.17e+19 9.30e+19 1.00e+00 -8.32e+20 2.09e+21 1.10e+21 7.20e-04
20| 6.39e-10 1.01e-09 2.44e-10 2.60e+01 2.60e+01 4.36e-15 2.58e-02
----------------------------------------------------------------------------
Status: Solved
Timing: Solve time: 2.58e-02s
Lin-sys: nnz in L factor: 201, avg solve time: 3.59e-06s
Cones: avg projection time: 1.16e-03s
Acceleration: avg step time: 5.77e-05s
----------------------------------------------------------------------------
Error metrics:
dist(s, K) = 7.1067e-17, dist(y, K*) = 0.0000e+00, s'y/|s||y| = -4.8843e-10
primal res: |Ax + s - b|_2 / (1 + |b|_2) = 6.3860e-10
dual res: |A'y + c|_2 / (1 + |c|_2) = 1.0107e-09
rel gap: |c'x + b'y| / (1 + |c'x| + |b'y|) = 2.4404e-10
----------------------------------------------------------------------------
c'x = 26.0203, -b'y = 26.0203
============================================================================
[1] 5
ECOS 2.0.7 - (C) embotech GmbH, Zurich Switzerland, 2012-15. Web: www.embotech.com/ECOS
It pcost dcost gap pres dres k/t mu step sigma IR | BT
0 +0.000e+00 -1.450e+00 +2e+01 1e+00 3e-01 1e+00 1e+00 --- --- 0 0 - | - -
1 +7.390e-01 +4.608e-01 +3e+00 5e-01 9e-02 5e-01 2e-01 0.7833 9e-03 1 1 1 | 1 1
2 +4.537e+00 +4.598e+00 +6e-01 2e-01 3e-02 4e-01 4e-02 0.7833 9e-03 1 1 1 | 1 1
3 +6.622e+00 +6.751e+00 +1e-01 7e-02 1e-02 2e-01 8e-03 0.7833 9e-03 1 1 1 | 1 1
4 +7.597e+00 +7.679e+00 +2e-02 3e-02 4e-03 1e-01 2e-03 0.7833 9e-03 1 1 1 | 1 1
5 +7.926e+00 +7.953e+00 +4e-03 7e-03 1e-03 4e-02 3e-04 0.7833 9e-03 1 1 1 | 1 1
6 +8.019e+00 +8.026e+00 +9e-04 2e-03 3e-04 9e-03 7e-05 0.7833 9e-03 2 1 1 | 1 1
7 +8.046e+00 +8.046e+00 +3e-05 6e-05 8e-06 3e-04 2e-06 0.9791 9e-03 2 1 1 | 1 0
8 +8.047e+00 +8.047e+00 +6e-06 1e-05 2e-06 7e-05 4e-07 0.7833 9e-03 1 1 1 | 1 1
9 +8.047e+00 +8.047e+00 +1e-06 3e-06 4e-07 1e-05 1e-07 0.7833 2e-02 2 1 1 | 1 1
10 +8.047e+00 +8.047e+00 +3e-07 7e-07 1e-07 3e-06 2e-08 0.7833 9e-03 2 0 1 | 1 1
11 +8.047e+00 +8.047e+00 +7e-08 2e-07 2e-08 7e-07 5e-09 0.7833 1e-04 2 0 0 | 0 1
12 +8.047e+00 +8.047e+00 +1e-08 3e-08 5e-09 2e-07 1e-09 0.7833 9e-03 1 0 0 | 1 1
13 +8.047e+00 +8.047e+00 +1e-09 2e-09 1e-10 4e-09 9e-11 0.9791 9e-03 0 0 0 | 1 0
OPTIMAL (within feastol=2.2e-09, reltol=1.8e-10, abstol=1.4e-09).
Runtime: 0.000714 seconds.
----------------------------------------------------------------------------
SCS v2.1.1 - Splitting Conic Solver
(c) Brendan O'Donoghue, Stanford University, 2012
----------------------------------------------------------------------------
Lin-sys: sparse-direct, nnz in A = 15
eps = 1.00e-04, alpha = 1.50, max_iters = 5000, normalize = 1, scale = 1.00
acceleration_lookback = 10, rho_x = 1.00e-03
Variables n = 10, constraints m = 16
Cones: primal zero / dual free vars: 1
exp vars: 15, dual exp vars: 0
Setup time: 1.77e-04s
----------------------------------------------------------------------------
Iter | pri res | dua res | rel gap | pri obj | dua obj | kap/tau | time (s)
----------------------------------------------------------------------------
0| 2.19e+19 3.38e+19 1.00e+00 -8.97e+19 1.41e+20 9.66e+19 3.16e-04
20| 9.21e-09 8.21e-09 8.51e-09 8.05e+00 8.05e+00 1.58e-16 3.41e-03
----------------------------------------------------------------------------
Status: Solved
Timing: Solve time: 3.41e-03s
Lin-sys: nnz in L factor: 41, avg solve time: 1.20e-06s
Cones: avg projection time: 1.37e-04s
Acceleration: avg step time: 1.95e-05s
----------------------------------------------------------------------------
Error metrics:
dist(s, K) = 7.5323e-17, dist(y, K*) = 0.0000e+00, s'y/|s||y| = -4.5330e-10
primal res: |Ax + s - b|_2 / (1 + |b|_2) = 9.2095e-09
dual res: |A'y + c|_2 / (1 + |c|_2) = 8.2102e-09
rel gap: |c'x + b'y| / (1 + |c'x| + |b'y|) = 8.5104e-09
----------------------------------------------------------------------------
c'x = 8.0472, -b'y = 8.0472
============================================================================
[1] 10
ECOS 2.0.7 - (C) embotech GmbH, Zurich Switzerland, 2012-15. Web: www.embotech.com/ECOS
It pcost dcost gap pres dres k/t mu step sigma IR | BT
0 +0.000e+00 -2.900e+00 +3e+01 1e+00 3e-01 1e+00 1e+00 --- --- 0 0 - | - -
1 +2.479e+00 +1.719e+00 +7e+00 5e-01 9e-02 6e-01 2e-01 0.7833 9e-03 1 1 1 | 1 1
2 +1.081e+01 +1.072e+01 +1e+00 2e-01 3e-02 4e-01 4e-02 0.7833 9e-03 1 1 1 | 1 1
3 +1.649e+01 +1.668e+01 +2e-01 9e-02 1e-02 4e-01 8e-03 0.7833 9e-03 1 1 1 | 1 1
4 +2.019e+01 +2.044e+01 +4e-02 4e-02 7e-03 3e-01 1e-03 0.7833 9e-03 1 1 1 | 1 1
5 +2.207e+01 +2.223e+01 +7e-03 2e-02 2e-03 2e-01 3e-04 0.7833 9e-03 1 1 1 | 1 1
6 +2.276e+01 +2.282e+01 +1e-03 5e-03 7e-04 7e-02 5e-05 0.7833 9e-03 1 1 1 | 1 1
7 +2.296e+01 +2.298e+01 +3e-04 1e-03 2e-04 2e-02 1e-05 0.7833 9e-03 2 1 1 | 1 1
8 +2.302e+01 +2.302e+01 +9e-06 4e-05 6e-06 6e-04 3e-07 0.9791 9e-03 1 1 1 | 1 0
9 +2.303e+01 +2.303e+01 +2e-06 9e-06 1e-06 1e-04 8e-08 0.7833 1e-02 2 1 1 | 1 1
10 +2.303e+01 +2.303e+01 +4e-07 2e-06 3e-07 3e-05 2e-08 0.7833 9e-03 1 1 1 | 1 1
11 +2.303e+01 +2.303e+01 +1e-07 5e-07 7e-08 6e-06 4e-09 0.7833 1e-02 2 1 0 | 1 1
12 +2.303e+01 +2.303e+01 +2e-08 1e-07 2e-08 1e-06 7e-10 0.7833 9e-03 1 0 0 | 1 1
13 +2.303e+01 +2.303e+01 +6e-09 2e-08 3e-09 3e-07 2e-10 0.7833 1e-04 1 0 0 | 0 1
14 +2.303e+01 +2.303e+01 +1e-09 5e-09 7e-10 6e-08 4e-11 0.7833 9e-03 0 0 0 | 1 1
OPTIMAL (within feastol=4.7e-09, reltol=4.2e-11, abstol=9.6e-10).
Runtime: 0.001127 seconds.
----------------------------------------------------------------------------
SCS v2.1.1 - Splitting Conic Solver
(c) Brendan O'Donoghue, Stanford University, 2012
----------------------------------------------------------------------------
Lin-sys: sparse-direct, nnz in A = 30
eps = 1.00e-04, alpha = 1.50, max_iters = 5000, normalize = 1, scale = 1.00
acceleration_lookback = 10, rho_x = 1.00e-03
Variables n = 20, constraints m = 31
Cones: primal zero / dual free vars: 1
exp vars: 30, dual exp vars: 0
Setup time: 2.37e-04s
----------------------------------------------------------------------------
Iter | pri res | dua res | rel gap | pri obj | dua obj | kap/tau | time (s)
----------------------------------------------------------------------------
0| 3.24e+19 5.09e+19 1.00e+00 -2.29e+20 4.07e+20 2.75e+20 5.86e-04
18| 3.44e-10 4.15e-10 5.46e-11 2.30e+01 2.30e+01 5.15e-16 5.31e-03
----------------------------------------------------------------------------
Status: Solved
Timing: Solve time: 5.32e-03s
Lin-sys: nnz in L factor: 81, avg solve time: 1.81e-06s
Cones: avg projection time: 2.43e-04s
Acceleration: avg step time: 2.87e-05s
----------------------------------------------------------------------------
Error metrics:
dist(s, K) = 2.5968e-16, dist(y, K*) = 0.0000e+00, s'y/|s||y| = -1.4725e-10
primal res: |Ax + s - b|_2 / (1 + |b|_2) = 3.4449e-10
dual res: |A'y + c|_2 / (1 + |c|_2) = 4.1531e-10
rel gap: |c'x + b'y| / (1 + |c'x| + |b'y|) = 5.4586e-11
----------------------------------------------------------------------------
c'x = 23.0259, -b'y = 23.0259
============================================================================
[1] 25
ECOS 2.0.7 - (C) embotech GmbH, Zurich Switzerland, 2012-15. Web: www.embotech.com/ECOS
It pcost dcost gap pres dres k/t mu step sigma IR | BT
0 +0.000e+00 -7.249e+00 +8e+01 1e+00 3e-01 1e+00 1e+00 --- --- 0 0 - | - -
1 +7.770e+00 +5.523e+00 +2e+01 5e-01 9e-02 6e-01 2e-01 0.7833 9e-03 1 1 1 | 1 1
2 +2.985e+01 +2.920e+01 +3e+00 2e-01 4e-02 5e-01 4e-02 0.7833 9e-03 1 1 1 | 1 1
3 +4.686e+01 +4.688e+01 +6e-01 1e-01 2e-02 5e-01 8e-03 0.7833 9e-03 1 1 1 | 1 1
4 +6.052e+01 +6.092e+01 +1e-01 6e-02 9e-03 6e-01 1e-03 0.7833 9e-03 1 1 1 | 1 1
5 +7.063e+01 +7.118e+01 +2e-02 3e-02 5e-03 7e-01 2e-04 0.7833 9e-03 1 1 1 | 1 1
6 +7.669e+01 +7.714e+01 +3e-03 1e-02 2e-03 5e-01 5e-05 0.7833 9e-03 1 1 1 | 1 1
7 +7.933e+01 +7.954e+01 +6e-04 4e-03 6e-04 2e-01 9e-06 0.7833 9e-03 1 1 1 | 1 1
8 +8.018e+01 +8.024e+01 +1e-04 1e-03 2e-04 7e-02 2e-06 0.7833 9e-03 1 1 1 | 1 1
9 +8.040e+01 +8.042e+01 +3e-05 3e-04 4e-05 2e-02 4e-07 0.7833 9e-03 2 1 1 | 1 1
10 +8.047e+01 +8.047e+01 +8e-07 8e-06 1e-06 4e-04 1e-08 0.9791 9e-03 2 1 1 | 1 0
11 +8.047e+01 +8.047e+01 +2e-07 2e-06 3e-07 9e-05 2e-09 0.7833 9e-03 1 1 1 | 1 1
12 +8.047e+01 +8.047e+01 +9e-09 8e-08 8e-09 2e-06 1e-10 0.9791 9e-03 1 1 1 | 1 0
13 +8.047e+01 +8.047e+01 +3e-09 3e-08 5e-09 1e-06 4e-11 0.5013 2e-01 2 0 0 | 4 3
14 +8.047e+01 +8.047e+01 +3e-10 2e-09 1e-10 2e-08 4e-12 0.9791 9e-03 0 0 0 | 1 0
OPTIMAL (within feastol=2.2e-09, reltol=3.5e-12, abstol=2.8e-10).
Runtime: 0.002332 seconds.
----------------------------------------------------------------------------
SCS v2.1.1 - Splitting Conic Solver
(c) Brendan O'Donoghue, Stanford University, 2012
----------------------------------------------------------------------------
Lin-sys: sparse-direct, nnz in A = 75
eps = 1.00e-04, alpha = 1.50, max_iters = 5000, normalize = 1, scale = 1.00
acceleration_lookback = 10, rho_x = 1.00e-03
Variables n = 50, constraints m = 76
Cones: primal zero / dual free vars: 1
exp vars: 75, dual exp vars: 0
Setup time: 4.03e-04s
----------------------------------------------------------------------------
Iter | pri res | dua res | rel gap | pri obj | dua obj | kap/tau | time (s)
----------------------------------------------------------------------------
0| 5.44e+19 8.72e+19 1.00e+00 -8.32e+20 1.69e+21 1.10e+21 1.42e-03
20| 1.47e-09 1.04e-09 4.08e-10 8.05e+01 8.05e+01 1.57e-15 1.31e-02
----------------------------------------------------------------------------
Status: Solved
Timing: Solve time: 1.31e-02s
Lin-sys: nnz in L factor: 201, avg solve time: 3.66e-06s
Cones: avg projection time: 5.52e-04s
Acceleration: avg step time: 5.76e-05s
----------------------------------------------------------------------------
Error metrics:
dist(s, K) = 8.4767e-16, dist(y, K*) = 0.0000e+00, s'y/|s||y| = -1.4831e-10
primal res: |Ax + s - b|_2 / (1 + |b|_2) = 1.4661e-09
dual res: |A'y + c|_2 / (1 + |c|_2) = 1.0442e-09
rel gap: |c'x + b'y| / (1 + |c'x| + |b'y|) = 4.0802e-10
----------------------------------------------------------------------------
c'x = 80.4719, -b'y = 80.4719
============================================================================
*** caught segfault ***
address 0, cause 'memory not mapped'
Traceback:
1: (function (A, b, obj, cone, control = scs_control()) { control <- update_default_controls(control) n_variables <- NCOL(A) n_constraints <- NROW(A) if (inherits(A, "dgCMatrix")) { Ai <- [email protected] Ap <- [email protected] Ax <- [email protected] } else { csc <- make_csc_matrix(A) Ai <- csc[["matind"]] Ap <- csc[["matbeg"]] Ax <- csc[["values"]] } data <- list(m = n_constraints, n = n_variables, c = obj, Ai = Ai, Ap = Ap, Ax = Ax, b = b) ret <- .Call("scsr", data, cone, control, PACKAGE = "scs") return(ret)})(A = new("dgCMatrix", i = c(0L, 5L, 6L, 7L, 3L, 8L, 1L, 9L, 10L, 11L, 4L, 12L, 2L, 13L, 5L, 14L, 6L, 8L, 15L, 7L, 11L, 16L, 9L, 17L, 10L, 12L, 18L, 13L, 19L), p = c(0L, 2L, 3L, 4L, 6L, 8L, 9L, 10L, 12L, 14L, 16L, 19L, 22L, 24L, 27L, 29L), Dim = c(20L, 15L), Dimnames = list(NULL, NULL), x = c(1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, -1, -1, -1, -1, -1.4142135623731, -1, -1, -1.4142135623731, -1, -1, -1, -1, -1.4142135623731, -1, -1), factors = list()), b = c(1, 1, 1, 0.6, -0.3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0), obj = c(0, 0, 0, 0, 0, 0, -1, 0, 0, 0, 0, 0, 0, 0, 0), cone = list(f = 14, l = 0, ep = 0, s = 3), control = list(verbose = FALSE, acceleration_lookback = 10L))
2: do.call(scs::scs, c(scs_args, list(control = solver_opts)))
3: Solver.solve(solver, objective, constraints, [email protected]_data, warm_start, verbose, ...)
4: Solver.solve(solver, objective, constraints, [email protected]_data, warm_start, verbose, ...)
5: CVXR::psolve(a, b, ...)
6: CVXR::psolve(a, b, ...)
7: solve.Problem(prob)
8: solve(prob)
9: solve(prob)
10: eval(code, test_env)
11: eval(code, test_env)
12: withCallingHandlers({ eval(code, test_env) if (!handled && !is.null(test)) { skip_empty() }}, expectation = handle_expectation, skip = handle_skip, warning = handle_warning, message = handle_message, error = handle_error)
13: doTryCatch(return(expr), name, parentenv, handler)
14: tryCatchOne(expr, names, parentenv, handlers[[1L]])
15: tryCatchList(expr, names[-nh], parentenv, handlers[-nh])
16: doTryCatch(return(expr), name, parentenv, handler)
17: tryCatchOne(tryCatchList(expr, names[-nh], parentenv, handlers[-nh]), names[nh], parentenv, handlers[[nh]])
18: tryCatchList(expr, classes, parentenv, handlers)
19: tryCatch(withCallingHandlers({ eval(code, test_env) if (!handled && !is.null(test)) { skip_empty() }}, expectation = handle_expectation, skip = handle_skip, warning = handle_warning, message = handle_message, error = handle_error), error = handle_fatal, skip = function(e) { })
20: test_code(desc, code, env = parent.frame())
21: test_that("Test a problem with diag", { C <- Variable(3, 3) obj <- Maximize(C[1, 3]) constraints <- list(diag(C) == 1, C[1, 2] == 0.6, C[2, 3] == -0.3, C == Semidef(3)) prob <- Problem(obj, constraints) result <- solve(prob) expect_equal(result$value, 0.583151, tolerance = 0.01)})
22: eval(code, test_env)
23: eval(code, test_env)
24: withCallingHandlers({ eval(code, test_env) if (!handled && !is.null(test)) { skip_empty() }}, expectation = handle_expectation, skip = handle_skip, warning = handle_warning, message = handle_message, error = handle_error)
25: doTryCatch(return(expr), name, parentenv, handler)
26: tryCatchOne(expr, names, parentenv, handlers[[1L]])
27: tryCatchList(expr, names[-nh], parentenv, handlers[-nh])
28: doTryCatch(return(expr), name, parentenv, handler)
29: tryCatchOne(tryCatchList(expr, names[-nh], parentenv, handlers[-nh]), names[nh], parentenv, handlers[[nh]])
30: tryCatchList(expr, classes, parentenv, handlers)
31: tryCatch(withCallingHandlers({ eval(code, test_env) if (!handled && !is.null(test)) { skip_empty() }}, expectation = handle_expectation, skip = handle_skip, warning = handle_warning, message = handle_message, error = handle_error), error = handle_fatal, skip = function(e) { })
32: test_code(NULL, exprs, env)
33: source_file(path, new.env(parent = env), chdir = TRUE, wrap = wrap)
34: force(code)
35: doWithOneRestart(return(expr), restart)
36: withOneRestart(expr, restarts[[1L]])
37: withRestarts(testthat_abort_reporter = function() NULL, force(code))
38: with_reporter(reporter = reporter, start_end_reporter = start_end_reporter, { reporter$start_file(basename(path)) lister$start_file(basename(path)) source_file(path, new.env(parent = env), chdir = TRUE, wrap = wrap) reporter$.end_context() reporter$end_file() })
39: FUN(X[[i]], ...)
40: lapply(paths, test_file, env = env, reporter = current_reporter, start_end_reporter = FALSE, load_helpers = FALSE, wrap = wrap)
41: force(code)
42: doWithOneRestart(return(expr), restart)
43: withOneRestart(expr, restarts[[1L]])
44: withRestarts(testthat_abort_reporter = function() NULL, force(code))
45: with_reporter(reporter = current_reporter, results <- lapply(paths, test_file, env = env, reporter = current_reporter, start_end_reporter = FALSE, load_helpers = FALSE, wrap = wrap))
46: test_files(paths, reporter = reporter, env = env, stop_on_failure = stop_on_failure, stop_on_warning = stop_on_warning, wrap = wrap)
47: test_dir(path = test_path, reporter = reporter, env = env, filter = filter, ..., stop_on_failure = stop_on_failure, stop_on_warning = stop_on_warning, wrap = wrap)
48: test_package_dir(package = package, test_path = test_path, filter = filter, reporter = reporter, ..., stop_on_failure = stop_on_failure, stop_on_warning = stop_on_warning, wrap = wrap)
49: test_check("CVXR", filter = "^g01")
An irrecoverable exception occurred. R is aborting now ...
Running the tests in ‘tests/group02.R’ failed.
Complete output:
> library(testthat)
> library(CVXR)
Attaching package: 'CVXR'
The following object is masked from 'package:stats':
power
>
> test_check("CVXR", filter="^g02")
[1] "optimal value with ECOS: 5.9999999955101"
[1] "optimal value with SCS: 5.99999999978914"
*** caught segfault ***
address 0, cause 'memory not mapped'
Traceback:
1: (function (A, b, obj, cone, control = scs_control()) { control <- update_default_controls(control) n_variables <- NCOL(A) n_constraints <- NROW(A) if (inherits(A, "dgCMatrix")) { Ai <- [email protected] Ap <- [email protected] Ax <- [email protected] } else { csc <- make_csc_matrix(A) Ai <- csc[["matind"]] Ap <- csc[["matbeg"]] Ax <- csc[["values"]] } data <- list(m = n_constraints, n = n_variables, c = obj, Ai = Ai, Ap = Ap, Ax = Ax, b = b) ret <- .Call("scsr", data, cone, control, PACKAGE = "scs") return(ret)})(A = new("dgCMatrix", i = c(11L, 23L, 26L, 29L, 32L, 38L, 50L, 12L, 15L, 24L, 27L, 30L, 33L, 39L, 51L, 13L, 15L, 26L, 29L, 32L, 35L, 38L, 14L, 27L, 30L, 33L, 36L, 39L, 52L, 23L, 26L, 29L, 32L, 35L, 38L, 24L, 27L, 30L, 33L, 36L, 39L, 3L, 40L, 4L, 5L, 41L, 7L, 42L, 9L, 43L, 6L, 44L, 8L, 45L, 10L, 46L, 11L, 47L, 12L, 13L, 48L, 14L, 49L, 1L, 7L, 0L, 8L, 9L, 2L, 10L, 1L, 3L, 55L, 2L, 6L, 58L, 53L, 56L, 16L, 22L, 17L, 25L, 18L, 28L, 19L, 31L, 20L, 34L, 21L, 37L), p = c(0L, 7L, 15L, 22L, 29L, 35L, 41L, 43L, 46L, 48L, 50L, 52L, 54L, 56L, 58L, 61L, 63L, 65L, 67L, 68L, 70L, 73L, 76L, 77L, 78L, 80L, 82L, 84L, 86L, 88L, 90L), Dim = c(59L, 30L), Dimnames = list(NULL, NULL), x = c(-1, -0.55, -0.25, 0.2, 0.25, -0.4, -1, -1, -1, -0.55, -0.25, 0.2, 0.25, -0.4, -1.4142135623731, -1, 1, -0.35, -0.2, 0.1, 0.3, 0.2, -1, -0.35, -0.2, 0.1, 0.3, 0.2, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 1, -1, 1, 1, -1.4142135623731, 1, -1.4142135623731, 1, -1.4142135623731, 1, -1, 1, -1.4142135623731, 1, -1.4142135623731, 1, -1, 1, 1, -1.4142135623731, 1, -1, -1, -1, 1, -1, -1, -1, -1, 1, -1, -1, 1, -1, -1, -1, -1, 1, -1, 1, -1, 1, -1, 1, -1, 1, -1, 1, -1), factors = list()), b = c(0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0), obj = c(0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, -1, -1, 0, 0, 0, 0, 0, 0), cone = list( f = 16, l = 6, ep = 2, q = c(3, 3, 3, 3, 3, 3), s = c(4, 2)), control = list(verbose = FALSE, acceleration_lookback = 10L))
2: do.call(scs::scs, c(scs_args, list(control = solver_opts)))
3: Solver.solve(solver, objective, constraints, [email protected]_data, warm_start, verbose, ...)
4: Solver.solve(solver, objective, constraints, [email protected]_data, warm_start, verbose, ...)
5: CVXR::psolve(a, b, ...)
6: CVXR::psolve(a, b, ...)
7: solve.Problem(p)
8: solve(p)
9: solve(p)
10: eval(code, test_env)
11: eval(code, test_env)
12: withCallingHandlers({ eval(code, test_env) if (!handled && !is.null(test)) { skip_empty() }}, expectation = handle_expectation, skip = handle_skip, warning = handle_warning, message = handle_message, error = handle_error)
13: doTryCatch(return(expr), name, parentenv, handler)
14: tryCatchOne(expr, names, parentenv, handlers[[1L]])
15: tryCatchList(expr, names[-nh], parentenv, handlers[-nh])
16: doTryCatch(return(expr), name, parentenv, handler)
17: tryCatchOne(tryCatchList(expr, names[-nh], parentenv, handlers[-nh]), names[nh], parentenv, handlers[[nh]])
18: tryCatchList(expr, classes, parentenv, handlers)
19: tryCatch(withCallingHandlers({ eval(code, test_env) if (!handled && !is.null(test)) { skip_empty() }}, expectation = handle_expectation, skip = handle_skip, warning = handle_warning, message = handle_message, error = handle_error), error = handle_fatal, skip = function(e) { })
20: test_code(desc, code, env = parent.frame())
21: test_that("Test log determinant", { x <- t(data.frame(c(0.55, 0.25, -0.2, -0.25, -0, 0.4), c(0, 0.35, 0.2, -0.1, -0.3, -0.2))) n <- nrow(x) m <- ncol(x) A <- Variable(n, n) b <- Variable(n) obj <- Maximize(log_det(A)) constraints <- lapply(1:m, function(i) { p_norm(A %*% as.matrix(x[, i]) + b) <= 1 }) p <- Problem(obj, constraints) result <- solve(p) expect_equal(result$value, 1.9746, tolerance = 0.01)})
22: eval(code, test_env)
23: eval(code, test_env)
24: withCallingHandlers({ eval(code, test_env) if (!handled && !is.null(test)) { skip_empty() }}, expectation = handle_expectation, skip = handle_skip, warning = handle_warning, message = handle_message, error = handle_error)
25: doTryCatch(return(expr), name, parentenv, handler)
26: tryCatchOne(expr, names, parentenv, handlers[[1L]])
27: tryCatchList(expr, names[-nh], parentenv, handlers[-nh])
28: doTryCatch(return(expr), name, parentenv, handler)
29: tryCatchOne(tryCatchList(expr, names[-nh], parentenv, handlers[-nh]), names[nh], parentenv, handlers[[nh]])
30: tryCatchList(expr, classes, parentenv, handlers)
31: tryCatch(withCallingHandlers({ eval(code, test_env) if (!handled && !is.null(test)) { skip_empty() }}, expectation = handle_expectation, skip = handle_skip, warning = handle_warning, message = handle_message, error = handle_error), error = handle_fatal, skip = function(e) { })
32: test_code(NULL, exprs, env)
33: source_file(path, new.env(parent = env), chdir = TRUE, wrap = wrap)
34: force(code)
35: doWithOneRestart(return(expr), restart)
36: withOneRestart(expr, restarts[[1L]])
37: withRestarts(testthat_abort_reporter = function() NULL, force(code))
38: with_reporter(reporter = reporter, start_end_reporter = start_end_reporter, { reporter$start_file(basename(path)) lister$start_file(basename(path)) source_file(path, new.env(parent = env), chdir = TRUE, wrap = wrap) reporter$.end_context() reporter$end_file() })
39: FUN(X[[i]], ...)
40: lapply(paths, test_file, env = env, reporter = current_reporter, start_end_reporter = FALSE, load_helpers = FALSE, wrap = wrap)
41: force(code)
42: doWithOneRestart(return(expr), restart)
43: withOneRestart(expr, restarts[[1L]])
44: withRestarts(testthat_abort_reporter = function() NULL, force(code))
45: with_reporter(reporter = current_reporter, results <- lapply(paths, test_file, env = env, reporter = current_reporter, start_end_reporter = FALSE, load_helpers = FALSE, wrap = wrap))
46: test_files(paths, reporter = reporter, env = env, stop_on_failure = stop_on_failure, stop_on_warning = stop_on_warning, wrap = wrap)
47: test_dir(path = test_path, reporter = reporter, env = env, filter = filter, ..., stop_on_failure = stop_on_failure, stop_on_warning = stop_on_warning, wrap = wrap)
48: test_package_dir(package = package, test_path = test_path, filter = filter, reporter = reporter, ..., stop_on_failure = stop_on_failure, stop_on_warning = stop_on_warning, wrap = wrap)
49: test_check("CVXR", filter = "^g02")
An irrecoverable exception occurred. R is aborting now ...
Running the tests in ‘tests/group04.R’ failed.
Complete output:
> library(testthat)
> library(CVXR)
Attaching package: 'CVXR'
The following object is masked from 'package:stats':
power
>
> test_check("CVXR", filter="^g04")
----------------------------------------------------------------------------
SCS v2.1.1 - Splitting Conic Solver
(c) Brendan O'Donoghue, Stanford University, 2012
----------------------------------------------------------------------------
Lin-sys: sparse-direct, nnz in A = 15
eps = 1.00e-05, alpha = 1.50, max_iters = 5000, normalize = 1, scale = 1.00
acceleration_lookback = 10, rho_x = 1.00e-03
Variables n = 6, constraints m = 15
Cones: primal zero / dual free vars: 9
sd vars: 6, sd blks: 1
Setup time: 4.09e-04s
----------------------------------------------------------------------------
Iter | pri res | dua res | rel gap | pri obj | dua obj | kap/tau | time (s)
----------------------------------------------------------------------------
*** caught segfault ***
address 0, cause 'memory not mapped'
Traceback:
1: (function (A, b, obj, cone, control = scs_control()) { control <- update_default_controls(control) n_variables <- NCOL(A) n_constraints <- NROW(A) if (inherits(A, "dgCMatrix")) { Ai <- [email protected] Ap <- [email protected] Ax <- [email protected] } else { csc <- make_csc_matrix(A) Ai <- csc[["matind"]] Ap <- csc[["matbeg"]] Ax <- csc[["values"]] } data <- list(m = n_constraints, n = n_variables, c = obj, Ai = Ai, Ap = Ap, Ax = Ax, b = b) ret <- .Call("scsr", data, cone, control, PACKAGE = "scs") return(ret)})(A = new("dgCMatrix", i = c(0L, 9L, 1L, 3L, 10L, 2L, 6L, 11L, 4L, 12L, 5L, 7L, 13L, 8L, 14L), p = c(0L, 2L, 5L, 8L, 10L, 13L, 15L), Dim = c(15L, 6L), Dimnames = list(NULL, NULL), x = c(1, -1, 1, 1, -1.4142135623731, 1, 1, -1.4142135623731, 1, -1, 1, 1, -1.4142135623731, 1, -1), factors = list()), b = c(1, 4, 7, 2, 5, 8, 3, 6, 9, 0, 0, 0, 0, 0, 0), obj = c(0, 0, 0, 0, 0, 0), cone = list(f = 9, l = 0, ep = 0, s = 3), control = list(verbose = TRUE, acceleration_lookback = 10L))
2: do.call(scs::scs, c(scs_args, list(control = solver_opts)))
3: Solver.solve(solver, objective, constraints, [email protected]_data, warm_start, verbose, ...)
4: Solver.solve(solver, objective, constraints, [email protected]_data, warm_start, verbose, ...)
5: CVXR::psolve(a, b, ...)
6: CVXR::psolve(a, b, ...)
7: solve.Problem(prob, verbose = TRUE, solver = "SCS")
8: solve(prob, verbose = TRUE, solver = "SCS")
9: solve(prob, verbose = TRUE, solver = "SCS")
10: eval(code, test_env)
11: eval(code, test_env)
12: withCallingHandlers({ eval(code, test_env) if (!handled && !is.null(test)) { skip_empty() }}, expectation = handle_expectation, skip = handle_skip, warning = handle_warning, message = handle_message, error = handle_error)
13: doTryCatch(return(expr), name, parentenv, handler)
14: tryCatchOne(expr, names, parentenv, handlers[[1L]])
15: tryCatchList(expr, names[-nh], parentenv, handlers[-nh])
16: doTryCatch(return(expr), name, parentenv, handler)
17: tryCatchOne(tryCatchList(expr, names[-nh], parentenv, handlers[-nh]), names[nh], parentenv, handlers[[nh]])
18: tryCatchList(expr, classes, parentenv, handlers)
19: tryCatch(withCallingHandlers({ eval(code, test_env) if (!handled && !is.null(test)) { skip_empty() }}, expectation = handle_expectation, skip = handle_skip, warning = handle_warning, message = handle_message, error = handle_error), error = handle_fatal, skip = function(e) { })
20: test_code(desc, code, env = parent.frame())
21: test_that("Test sdp variable", { const <- Constant(rbind(c(1, 2, 3), c(4, 5, 6), c(7, 8, 9))) X <- Semidef(3) prob <- Problem(Minimize(0), list(X == const)) result <- solve(prob, verbose = TRUE, solver = "SCS") expect_equal(tolower(result$status), "infeasible")})
22: eval(code, test_env)
23: eval(code, test_env)
24: withCallingHandlers({ eval(code, test_env) if (!handled && !is.null(test)) { skip_empty() }}, expectation = handle_expectation, skip = handle_skip, warning = handle_warning, message = handle_message, error = handle_error)
25: doTryCatch(return(expr), name, parentenv, handler)
26: tryCatchOne(expr, names, parentenv, handlers[[1L]])
27: tryCatchList(expr, names[-nh], parentenv, handlers[-nh])
28: doTryCatch(return(expr), name, parentenv, handler)
29: tryCatchOne(tryCatchList(expr, names[-nh], parentenv, handlers[-nh]), names[nh], parentenv, handlers[[nh]])
30: tryCatchList(expr, classes, parentenv, handlers)
31: tryCatch(withCallingHandlers({ eval(code, test_env) if (!handled && !is.null(test)) { skip_empty() }}, expectation = handle_expectation, skip = handle_skip, warning = handle_warning, message = handle_message, error = handle_error), error = handle_fatal, skip = function(e) { })
32: test_code(NULL, exprs, env)
33: source_file(path, new.env(parent = env), chdir = TRUE, wrap = wrap)
34: force(code)
35: doWithOneRestart(return(expr), restart)
36: withOneRestart(expr, restarts[[1L]])
37: withRestarts(testthat_abort_reporter = function() NULL, force(code))
38: with_reporter(reporter = reporter, start_end_reporter = start_end_reporter, { reporter$start_file(basename(path)) lister$start_file(basename(path)) source_file(path, new.env(parent = env), chdir = TRUE, wrap = wrap) reporter$.end_context() reporter$end_file() })
39: FUN(X[[i]], ...)
40: lapply(paths, test_file, env = env, reporter = current_reporter, start_end_reporter = FALSE, load_helpers = FALSE, wrap = wrap)
41: force(code)
42: doWithOneRestart(return(expr), restart)
43: withOneRestart(expr, restarts[[1L]])
44: withRestarts(testthat_abort_reporter = function() NULL, force(code))
45: with_reporter(reporter = current_reporter, results <- lapply(paths, test_file, env = env, reporter = current_reporter, start_end_reporter = FALSE, load_helpers = FALSE, wrap = wrap))
46: test_files(paths, reporter = reporter, env = env, stop_on_failure = stop_on_failure, stop_on_warning = stop_on_warning, wrap = wrap)
47: test_dir(path = test_path, reporter = reporter, env = env, filter = filter, ..., stop_on_failure = stop_on_failure, stop_on_warning = stop_on_warning, wrap = wrap)
48: test_package_dir(package = package, test_path = test_path, filter = filter, reporter = reporter, ..., stop_on_failure = stop_on_failure, stop_on_warning = stop_on_warning, wrap = wrap)
49: test_check("CVXR", filter = "^g04")
An irrecoverable exception occurred. R is aborting now ...
Flavor: r-patched-solaris-x86