Convex

← Back to package list

If you think that there is an error in how your package is being tested or represented, please file an issue at NewPkgEval.jl, making sure to read the FAQ first.

Results with Julia v1.2.0

Testing was successful. Last evaluation was ago and took 7 minutes, 13 seconds.

Click here to download the log file.

 Resolving package versions...
 Installed Parsers ──────────── v0.3.10
 Installed Compat ───────────── v2.2.0
 Installed AbstractTrees ────── v0.2.1
 Installed BenchmarkTools ───── v0.4.3
 Installed OrderedCollections ─ v1.1.0
 Installed MathProgBase ─────── v0.7.7
 Installed JSON ─────────────── v0.21.0
 Installed Convex ───────────── v0.12.6
  Updating `~/.julia/environments/v1.2/Project.toml`
  [f65535da] + Convex v0.12.6
  Updating `~/.julia/environments/v1.2/Manifest.toml`
  [1520ce14] + AbstractTrees v0.2.1
  [6e4b80f9] + BenchmarkTools v0.4.3
  [34da2185] + Compat v2.2.0
  [f65535da] + Convex v0.12.6
  [682c06a0] + JSON v0.21.0
  [fdba3010] + MathProgBase v0.7.7
  [bac558e1] + OrderedCollections v1.1.0
  [69de0a69] + Parsers v0.3.10
  [2a0f44e3] + Base64 
  [ade2ca70] + Dates 
  [8bb1440f] + DelimitedFiles 
  [8ba89e20] + Distributed 
  [b77e0a4c] + InteractiveUtils 
  [76f85450] + LibGit2 
  [8f399da3] + Libdl 
  [37e2e46d] + LinearAlgebra 
  [56ddb016] + Logging 
  [d6f4376e] + Markdown 
  [a63ad114] + Mmap 
  [44cfe95a] + Pkg 
  [de0858da] + Printf 
  [3fa0cd96] + REPL 
  [9a3f8284] + Random 
  [ea8e919c] + SHA 
  [9e88b42a] + Serialization 
  [1a1011a3] + SharedArrays 
  [6462fe0b] + Sockets 
  [2f01184e] + SparseArrays 
  [10745b16] + Statistics 
  [8dfed614] + Test 
  [cf7118a7] + UUIDs 
  [4ec0a83e] + Unicode 
   Testing Convex
 Resolving package versions...
 Installed ECOS ────────────────── v0.10.1
 Installed SCS ─────────────────── v0.6.2
 Installed BinaryProvider ──────── v0.5.8
 Installed GLPKMathProgInterface ─ v0.4.4
 Installed MathOptInterface ────── v0.9.7
 Installed GLPK ────────────────── v0.12.0
  Building ECOS → `~/.julia/packages/ECOS/TOZeI/deps/build.log`
  Building SCS ─→ `~/.julia/packages/SCS/Y9wx3/deps/build.log`
  Building GLPK → `~/.julia/packages/GLPK/J1b5G/deps/build.log`
    Status `/tmp/jl_YmuqZp/Manifest.toml`
  [1520ce14] AbstractTrees v0.2.1
  [6e4b80f9] BenchmarkTools v0.4.3
  [b99e7846] BinaryProvider v0.5.8
  [34da2185] Compat v2.2.0
  [f65535da] Convex v0.12.6
  [e2685f51] ECOS v0.10.1
  [60bf3e95] GLPK v0.12.0
  [3c7084bd] GLPKMathProgInterface v0.4.4
  [682c06a0] JSON v0.21.0
  [b8f27783] MathOptInterface v0.9.7
  [fdba3010] MathProgBase v0.7.7
  [bac558e1] OrderedCollections v1.1.0
  [69de0a69] Parsers v0.3.10
  [c946c3f1] SCS v0.6.2
  [2a0f44e3] Base64  [`@stdlib/Base64`]
  [ade2ca70] Dates  [`@stdlib/Dates`]
  [8bb1440f] DelimitedFiles  [`@stdlib/DelimitedFiles`]
  [8ba89e20] Distributed  [`@stdlib/Distributed`]
  [b77e0a4c] InteractiveUtils  [`@stdlib/InteractiveUtils`]
  [76f85450] LibGit2  [`@stdlib/LibGit2`]
  [8f399da3] Libdl  [`@stdlib/Libdl`]
  [37e2e46d] LinearAlgebra  [`@stdlib/LinearAlgebra`]
  [56ddb016] Logging  [`@stdlib/Logging`]
  [d6f4376e] Markdown  [`@stdlib/Markdown`]
  [a63ad114] Mmap  [`@stdlib/Mmap`]
  [44cfe95a] Pkg  [`@stdlib/Pkg`]
  [de0858da] Printf  [`@stdlib/Printf`]
  [3fa0cd96] REPL  [`@stdlib/REPL`]
  [9a3f8284] Random  [`@stdlib/Random`]
  [ea8e919c] SHA  [`@stdlib/SHA`]
  [9e88b42a] Serialization  [`@stdlib/Serialization`]
  [1a1011a3] SharedArrays  [`@stdlib/SharedArrays`]
  [6462fe0b] Sockets  [`@stdlib/Sockets`]
  [2f01184e] SparseArrays  [`@stdlib/SparseArrays`]
  [10745b16] Statistics  [`@stdlib/Statistics`]
  [8dfed614] Test  [`@stdlib/Test`]
  [cf7118a7] UUIDs  [`@stdlib/UUIDs`]
  [4ec0a83e] Unicode  [`@stdlib/Unicode`]
┌ Warning: Rational norm generating 18 intermediate constraints.
│ 	Increasing :max_iters or decreasing solver tolerance
│ 	may give more accurate solutions
└ @ Convex ~/.julia/packages/Convex/Aro4K/src/atoms/second_order_cone/rationalnorm.jl:88
Test Summary: | Pass  Total
ProblemDepot  |   87     87
Solution object has dual value, checking for dual correctness.
Solution object has dual value, checking for dual correctness.
Solution object has dual value, checking for dual correctness.
Solution object has dual value, checking for dual correctness.
┌ Warning: Problem status Infeasible; solution may be inaccurate.
└ @ Convex ~/.julia/packages/Convex/Aro4K/src/solution.jl:51
┌ Warning: Rational norm generating 18 intermediate constraints.
│ 	Increasing :max_iters or decreasing solver tolerance
│ 	may give more accurate solutions
└ @ Convex ~/.julia/packages/Convex/Aro4K/src/atoms/second_order_cone/rationalnorm.jl:88
┌ Warning: Problem status UnknownError; solution may be inaccurate.
└ @ Convex ~/.julia/packages/Convex/Aro4K/src/solution.jl:51
┌ Warning: Problem not DCP compliant: objective is not DCP
└ @ Convex ~/.julia/packages/Convex/Aro4K/src/problems.jl:86
┌ Warning: Problem status UnknownError; solution may be inaccurate.
└ @ Convex ~/.julia/packages/Convex/Aro4K/src/solution.jl:51
Solution object has dual value, checking for dual correctness.
Solution object has dual value, checking for dual correctness.
Solution object has dual value, checking for dual correctness.
Solution object has dual value, checking for dual correctness.
┌ Warning: Problem status Infeasible; solution may be inaccurate.
└ @ Convex ~/.julia/packages/Convex/Aro4K/src/solution.jl:51
┌ Warning: Rational norm generating 18 intermediate constraints.
│ 	Increasing :max_iters or decreasing solver tolerance
│ 	may give more accurate solutions
└ @ Convex ~/.julia/packages/Convex/Aro4K/src/atoms/second_order_cone/rationalnorm.jl:88
┌ Warning: Problem not DCP compliant: objective is not DCP
└ @ Convex ~/.julia/packages/Convex/Aro4K/src/problems.jl:86
Call to SCS(accelerate) failed with code 17, falling back to using no acceleration
Call to SCS(accelerate) failed with code 11, falling back to using no acceleration
Call to SCS(accelerate) failed with code 17, falling back to using no acceleration
Call to SCS(accelerate) failed with code 17, falling back to using no acceleration
glp_intopt: optimal basis to initial LP relaxation not provided
┌ Warning: Problem status Infeasible; solution may be inaccurate.
└ @ Convex ~/.julia/packages/Convex/Aro4K/src/solution.jl:51
Test Summary: | Pass  Total
Convex        | 1042   1042
   Testing Convex tests passed 

Results with Julia v1.3.0

Testing was successful. Last evaluation was ago and took 7 minutes, 14 seconds.

Click here to download the log file.

 Resolving package versions...
 Installed AbstractTrees ────── v0.2.1
 Installed Compat ───────────── v2.2.0
 Installed Parsers ──────────── v0.3.10
 Installed OrderedCollections ─ v1.1.0
 Installed BenchmarkTools ───── v0.4.3
 Installed MathProgBase ─────── v0.7.7
 Installed JSON ─────────────── v0.21.0
 Installed Convex ───────────── v0.12.6
  Updating `~/.julia/environments/v1.3/Project.toml`
  [f65535da] + Convex v0.12.6
  Updating `~/.julia/environments/v1.3/Manifest.toml`
  [1520ce14] + AbstractTrees v0.2.1
  [6e4b80f9] + BenchmarkTools v0.4.3
  [34da2185] + Compat v2.2.0
  [f65535da] + Convex v0.12.6
  [682c06a0] + JSON v0.21.0
  [fdba3010] + MathProgBase v0.7.7
  [bac558e1] + OrderedCollections v1.1.0
  [69de0a69] + Parsers v0.3.10
  [2a0f44e3] + Base64 
  [ade2ca70] + Dates 
  [8bb1440f] + DelimitedFiles 
  [8ba89e20] + Distributed 
  [b77e0a4c] + InteractiveUtils 
  [76f85450] + LibGit2 
  [8f399da3] + Libdl 
  [37e2e46d] + LinearAlgebra 
  [56ddb016] + Logging 
  [d6f4376e] + Markdown 
  [a63ad114] + Mmap 
  [44cfe95a] + Pkg 
  [de0858da] + Printf 
  [3fa0cd96] + REPL 
  [9a3f8284] + Random 
  [ea8e919c] + SHA 
  [9e88b42a] + Serialization 
  [1a1011a3] + SharedArrays 
  [6462fe0b] + Sockets 
  [2f01184e] + SparseArrays 
  [10745b16] + Statistics 
  [8dfed614] + Test 
  [cf7118a7] + UUIDs 
  [4ec0a83e] + Unicode 
   Testing Convex
 Resolving package versions...
 Installed BinaryProvider ──────── v0.5.8
 Installed GLPKMathProgInterface ─ v0.4.4
 Installed ECOS ────────────────── v0.10.1
 Installed GLPK ────────────────── v0.12.0
 Installed MathOptInterface ────── v0.9.7
 Installed SCS ─────────────────── v0.6.2
  Building ECOS → `~/.julia/packages/ECOS/TOZeI/deps/build.log`
  Building SCS ─→ `~/.julia/packages/SCS/Y9wx3/deps/build.log`
  Building GLPK → `~/.julia/packages/GLPK/J1b5G/deps/build.log`
    Status `/tmp/jl_5VkaAC/Manifest.toml`
  [1520ce14] AbstractTrees v0.2.1
  [6e4b80f9] BenchmarkTools v0.4.3
  [b99e7846] BinaryProvider v0.5.8
  [34da2185] Compat v2.2.0
  [f65535da] Convex v0.12.6
  [e2685f51] ECOS v0.10.1
  [60bf3e95] GLPK v0.12.0
  [3c7084bd] GLPKMathProgInterface v0.4.4
  [682c06a0] JSON v0.21.0
  [b8f27783] MathOptInterface v0.9.7
  [fdba3010] MathProgBase v0.7.7
  [bac558e1] OrderedCollections v1.1.0
  [69de0a69] Parsers v0.3.10
  [c946c3f1] SCS v0.6.2
  [2a0f44e3] Base64  [`@stdlib/Base64`]
  [ade2ca70] Dates  [`@stdlib/Dates`]
  [8bb1440f] DelimitedFiles  [`@stdlib/DelimitedFiles`]
  [8ba89e20] Distributed  [`@stdlib/Distributed`]
  [b77e0a4c] InteractiveUtils  [`@stdlib/InteractiveUtils`]
  [76f85450] LibGit2  [`@stdlib/LibGit2`]
  [8f399da3] Libdl  [`@stdlib/Libdl`]
  [37e2e46d] LinearAlgebra  [`@stdlib/LinearAlgebra`]
  [56ddb016] Logging  [`@stdlib/Logging`]
  [d6f4376e] Markdown  [`@stdlib/Markdown`]
  [a63ad114] Mmap  [`@stdlib/Mmap`]
  [44cfe95a] Pkg  [`@stdlib/Pkg`]
  [de0858da] Printf  [`@stdlib/Printf`]
  [3fa0cd96] REPL  [`@stdlib/REPL`]
  [9a3f8284] Random  [`@stdlib/Random`]
  [ea8e919c] SHA  [`@stdlib/SHA`]
  [9e88b42a] Serialization  [`@stdlib/Serialization`]
  [1a1011a3] SharedArrays  [`@stdlib/SharedArrays`]
  [6462fe0b] Sockets  [`@stdlib/Sockets`]
  [2f01184e] SparseArrays  [`@stdlib/SparseArrays`]
  [10745b16] Statistics  [`@stdlib/Statistics`]
  [8dfed614] Test  [`@stdlib/Test`]
  [cf7118a7] UUIDs  [`@stdlib/UUIDs`]
  [4ec0a83e] Unicode  [`@stdlib/Unicode`]
┌ Warning: Rational norm generating 18 intermediate constraints.
│ 	Increasing :max_iters or decreasing solver tolerance
│ 	may give more accurate solutions
└ @ Convex ~/.julia/packages/Convex/Aro4K/src/atoms/second_order_cone/rationalnorm.jl:88
Test Summary: | Pass  Total
ProblemDepot  |   87     87
Solution object has dual value, checking for dual correctness.
Solution object has dual value, checking for dual correctness.
Solution object has dual value, checking for dual correctness.
Solution object has dual value, checking for dual correctness.
┌ Warning: Problem status Infeasible; solution may be inaccurate.
└ @ Convex ~/.julia/packages/Convex/Aro4K/src/solution.jl:51
┌ Warning: Rational norm generating 18 intermediate constraints.
│ 	Increasing :max_iters or decreasing solver tolerance
│ 	may give more accurate solutions
└ @ Convex ~/.julia/packages/Convex/Aro4K/src/atoms/second_order_cone/rationalnorm.jl:88
┌ Warning: Problem status UnknownError; solution may be inaccurate.
└ @ Convex ~/.julia/packages/Convex/Aro4K/src/solution.jl:51
┌ Warning: Problem not DCP compliant: objective is not DCP
└ @ Convex ~/.julia/packages/Convex/Aro4K/src/problems.jl:86
┌ Warning: Problem status UnknownError; solution may be inaccurate.
└ @ Convex ~/.julia/packages/Convex/Aro4K/src/solution.jl:51
Solution object has dual value, checking for dual correctness.
Solution object has dual value, checking for dual correctness.
Solution object has dual value, checking for dual correctness.
Solution object has dual value, checking for dual correctness.
┌ Warning: Problem status Infeasible; solution may be inaccurate.
└ @ Convex ~/.julia/packages/Convex/Aro4K/src/solution.jl:51
┌ Warning: Rational norm generating 18 intermediate constraints.
│ 	Increasing :max_iters or decreasing solver tolerance
│ 	may give more accurate solutions
└ @ Convex ~/.julia/packages/Convex/Aro4K/src/atoms/second_order_cone/rationalnorm.jl:88
┌ Warning: Problem not DCP compliant: objective is not DCP
└ @ Convex ~/.julia/packages/Convex/Aro4K/src/problems.jl:86
Call to SCS(accelerate) failed with code 17, falling back to using no acceleration
Call to SCS(accelerate) failed with code 11, falling back to using no acceleration
Call to SCS(accelerate) failed with code 17, falling back to using no acceleration
Call to SCS(accelerate) failed with code 17, falling back to using no acceleration
glp_intopt: optimal basis to initial LP relaxation not provided
┌ Warning: Problem status Infeasible; solution may be inaccurate.
└ @ Convex ~/.julia/packages/Convex/Aro4K/src/solution.jl:51
Test Summary: | Pass  Total
Convex        | 1042   1042
   Testing Convex tests passed 

Results with Julia v1.3.1-pre-7704df0a5a

Testing was successful. Last evaluation was ago and took 6 minutes, 15 seconds.

Click here to download the log file.

 Resolving package versions...
 Installed Compat ───────────── v2.2.0
 Installed AbstractTrees ────── v0.2.1
 Installed Parsers ──────────── v0.3.10
 Installed BenchmarkTools ───── v0.4.3
 Installed OrderedCollections ─ v1.1.0
 Installed MathProgBase ─────── v0.7.7
 Installed JSON ─────────────── v0.21.0
 Installed Convex ───────────── v0.12.6
  Updating `~/.julia/environments/v1.3/Project.toml`
  [f65535da] + Convex v0.12.6
  Updating `~/.julia/environments/v1.3/Manifest.toml`
  [1520ce14] + AbstractTrees v0.2.1
  [6e4b80f9] + BenchmarkTools v0.4.3
  [34da2185] + Compat v2.2.0
  [f65535da] + Convex v0.12.6
  [682c06a0] + JSON v0.21.0
  [fdba3010] + MathProgBase v0.7.7
  [bac558e1] + OrderedCollections v1.1.0
  [69de0a69] + Parsers v0.3.10
  [2a0f44e3] + Base64 
  [ade2ca70] + Dates 
  [8bb1440f] + DelimitedFiles 
  [8ba89e20] + Distributed 
  [b77e0a4c] + InteractiveUtils 
  [76f85450] + LibGit2 
  [8f399da3] + Libdl 
  [37e2e46d] + LinearAlgebra 
  [56ddb016] + Logging 
  [d6f4376e] + Markdown 
  [a63ad114] + Mmap 
  [44cfe95a] + Pkg 
  [de0858da] + Printf 
  [3fa0cd96] + REPL 
  [9a3f8284] + Random 
  [ea8e919c] + SHA 
  [9e88b42a] + Serialization 
  [1a1011a3] + SharedArrays 
  [6462fe0b] + Sockets 
  [2f01184e] + SparseArrays 
  [10745b16] + Statistics 
  [8dfed614] + Test 
  [cf7118a7] + UUIDs 
  [4ec0a83e] + Unicode 
   Testing Convex
 Resolving package versions...
 Installed BinaryProvider ──────── v0.5.8
 Installed MathOptInterface ────── v0.9.7
 Installed GLPKMathProgInterface ─ v0.4.4
 Installed ECOS ────────────────── v0.10.1
 Installed SCS ─────────────────── v0.6.2
 Installed GLPK ────────────────── v0.12.0
  Building ECOS → `~/.julia/packages/ECOS/TOZeI/deps/build.log`
  Building SCS ─→ `~/.julia/packages/SCS/Y9wx3/deps/build.log`
  Building GLPK → `~/.julia/packages/GLPK/J1b5G/deps/build.log`
    Status `/tmp/jl_cY8zCX/Manifest.toml`
  [1520ce14] AbstractTrees v0.2.1
  [6e4b80f9] BenchmarkTools v0.4.3
  [b99e7846] BinaryProvider v0.5.8
  [34da2185] Compat v2.2.0
  [f65535da] Convex v0.12.6
  [e2685f51] ECOS v0.10.1
  [60bf3e95] GLPK v0.12.0
  [3c7084bd] GLPKMathProgInterface v0.4.4
  [682c06a0] JSON v0.21.0
  [b8f27783] MathOptInterface v0.9.7
  [fdba3010] MathProgBase v0.7.7
  [bac558e1] OrderedCollections v1.1.0
  [69de0a69] Parsers v0.3.10
  [c946c3f1] SCS v0.6.2
  [2a0f44e3] Base64  [`@stdlib/Base64`]
  [ade2ca70] Dates  [`@stdlib/Dates`]
  [8bb1440f] DelimitedFiles  [`@stdlib/DelimitedFiles`]
  [8ba89e20] Distributed  [`@stdlib/Distributed`]
  [b77e0a4c] InteractiveUtils  [`@stdlib/InteractiveUtils`]
  [76f85450] LibGit2  [`@stdlib/LibGit2`]
  [8f399da3] Libdl  [`@stdlib/Libdl`]
  [37e2e46d] LinearAlgebra  [`@stdlib/LinearAlgebra`]
  [56ddb016] Logging  [`@stdlib/Logging`]
  [d6f4376e] Markdown  [`@stdlib/Markdown`]
  [a63ad114] Mmap  [`@stdlib/Mmap`]
  [44cfe95a] Pkg  [`@stdlib/Pkg`]
  [de0858da] Printf  [`@stdlib/Printf`]
  [3fa0cd96] REPL  [`@stdlib/REPL`]
  [9a3f8284] Random  [`@stdlib/Random`]
  [ea8e919c] SHA  [`@stdlib/SHA`]
  [9e88b42a] Serialization  [`@stdlib/Serialization`]
  [1a1011a3] SharedArrays  [`@stdlib/SharedArrays`]
  [6462fe0b] Sockets  [`@stdlib/Sockets`]
  [2f01184e] SparseArrays  [`@stdlib/SparseArrays`]
  [10745b16] Statistics  [`@stdlib/Statistics`]
  [8dfed614] Test  [`@stdlib/Test`]
  [cf7118a7] UUIDs  [`@stdlib/UUIDs`]
  [4ec0a83e] Unicode  [`@stdlib/Unicode`]
┌ Warning: Rational norm generating 18 intermediate constraints.
│ 	Increasing :max_iters or decreasing solver tolerance
│ 	may give more accurate solutions
└ @ Convex ~/.julia/packages/Convex/Aro4K/src/atoms/second_order_cone/rationalnorm.jl:88
Test Summary: | Pass  Total
ProblemDepot  |   87     87
Solution object has dual value, checking for dual correctness.
Solution object has dual value, checking for dual correctness.
Solution object has dual value, checking for dual correctness.
Solution object has dual value, checking for dual correctness.
┌ Warning: Problem status Infeasible; solution may be inaccurate.
└ @ Convex ~/.julia/packages/Convex/Aro4K/src/solution.jl:51
┌ Warning: Rational norm generating 18 intermediate constraints.
│ 	Increasing :max_iters or decreasing solver tolerance
│ 	may give more accurate solutions
└ @ Convex ~/.julia/packages/Convex/Aro4K/src/atoms/second_order_cone/rationalnorm.jl:88
┌ Warning: Problem status UnknownError; solution may be inaccurate.
└ @ Convex ~/.julia/packages/Convex/Aro4K/src/solution.jl:51
┌ Warning: Problem not DCP compliant: objective is not DCP
└ @ Convex ~/.julia/packages/Convex/Aro4K/src/problems.jl:86
┌ Warning: Problem status UnknownError; solution may be inaccurate.
└ @ Convex ~/.julia/packages/Convex/Aro4K/src/solution.jl:51
Solution object has dual value, checking for dual correctness.
Solution object has dual value, checking for dual correctness.
Solution object has dual value, checking for dual correctness.
Solution object has dual value, checking for dual correctness.
┌ Warning: Problem status Infeasible; solution may be inaccurate.
└ @ Convex ~/.julia/packages/Convex/Aro4K/src/solution.jl:51
┌ Warning: Rational norm generating 18 intermediate constraints.
│ 	Increasing :max_iters or decreasing solver tolerance
│ 	may give more accurate solutions
└ @ Convex ~/.julia/packages/Convex/Aro4K/src/atoms/second_order_cone/rationalnorm.jl:88
┌ Warning: Problem not DCP compliant: objective is not DCP
└ @ Convex ~/.julia/packages/Convex/Aro4K/src/problems.jl:86
Call to SCS(accelerate) failed with code 17, falling back to using no acceleration
Call to SCS(accelerate) failed with code 11, falling back to using no acceleration
Call to SCS(accelerate) failed with code 17, falling back to using no acceleration
Call to SCS(accelerate) failed with code 17, falling back to using no acceleration
glp_intopt: optimal basis to initial LP relaxation not provided
┌ Warning: Problem status Infeasible; solution may be inaccurate.
└ @ Convex ~/.julia/packages/Convex/Aro4K/src/solution.jl:51
Test Summary: | Pass  Total
Convex        | 1042   1042
   Testing Convex tests passed