Package evaluation to test Boscia on Julia 1.14.0-DEV.2186 (48ff18f4cd*) started at 2026-05-14T19:03:37.471 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Activating project at `~/.julia/environments/v1.14` Set-up completed after 16.35s ################################################################################ # Installation # Installing Boscia... Resolving package versions... Updating `~/.julia/environments/v1.14/Project.toml` [36b166db] + Boscia v0.2.12 Updating `~/.julia/environments/v1.14/Manifest.toml` [7d9fca2a] + Arpack v0.5.4 [0a1fb500] + BlockDiagonals v0.2.0 [f7b14807] + Bonobo v0.1.5 [36b166db] + Boscia v0.2.12 [d360d2e6] + ChainRulesCore v1.26.1 [523fee87] + CodecBzip2 v0.8.5 [944b1d66] + CodecZlib v0.7.8 [bbf7d656] + CommonSubexpressions v0.3.1 [34da2185] + Compat v4.18.1 [187b0558] + ConstructionBase v1.6.0 [864edb3b] + DataStructures v0.19.4 [163ba53b] + DiffResults v1.1.0 [b552c78f] + DiffRules v1.15.1 [ffbed154] + DocStringExtensions v0.9.5 [e2ba6199] + ExprTools v0.1.10 [1a297f60] + FillArrays v1.16.0 [f6369f11] + ForwardDiff v1.3.3 [f55ce6ea] + FrankWolfe v0.6.4 [c145ed77] + GenericSchur v0.5.6 [e91730f6] + Hungarian v0.7.0 [92d709cd] + IrrationalConstants v0.2.6 [692b3bcd] + JLLWrappers v1.8.0 [682c06a0] + JSON v1.5.2 [2ab3a3ac] + LogExpFunctions v0.3.29 [1914dd2f] + MacroTools v0.5.16 [b8f27783] + MathOptInterface v1.51.0 [3b969827] + MathOptSetDistances v0.2.12 [d8a4904e] + MutableArithmetics v1.7.1 [77ba4419] + NaNMath v1.1.3 [d9ec5142] + NamedTupleTools v0.14.3 [bac558e1] + OrderedCollections v1.8.1 [69de0a69] + Parsers v2.8.4 [aea7be01] + PrecompileTools v1.3.4 [21216c6a] + Preferences v1.5.2 [92933f4c] + ProgressMeter v1.11.0 ⌅ [dc4f5ac2] + ProximalCore v0.1.2 [efcf1570] + Setfield v1.1.2 [276daf66] + SpecialFunctions v2.7.2 [90137ffa] + StaticArrays v1.9.18 [1e83bf80] + StaticArraysCore v1.4.4 [10745b16] + Statistics v1.11.1 [ec057cc2] + StructUtils v2.8.1 [a759f4b9] + TimerOutputs v0.5.29 [3bb67fe8] + TranscodingStreams v0.11.3 ⌅ [68821587] + Arpack_jll v3.5.2+0 [6e34b625] + Bzip2_jll v1.0.9+0 [efe28fd5] + OpenSpecFun_jll v0.5.6+0 [56f22d72] + Artifacts v1.11.0 [2a0f44e3] + Base64 v1.11.0 [ade2ca70] + Dates v1.11.0 [8ba89e20] + Distributed v1.11.0 [9fa8497b] + Future v1.11.0 [b77e0a4c] + InteractiveUtils v1.11.0 [ac6e5ff7] + JuliaSyntaxHighlighting v1.13.0 [8f399da3] + Libdl v1.11.0 [37e2e46d] + LinearAlgebra v1.13.0 [56ddb016] + Logging v1.11.0 [d6f4376e] + Markdown v1.11.0 [de0858da] + Printf v1.11.0 [9a3f8284] + Random v1.11.0 [ea8e919c] + SHA v1.13.0 [9e88b42a] + Serialization v1.11.0 [6462fe0b] + Sockets v1.11.0 [2f01184e] + SparseArrays v1.13.0 [f489334b] + StyledStrings v1.13.0 [fa267f1f] + TOML v1.0.3 [8dfed614] + Test v1.11.0 [cf7118a7] + UUIDs v1.11.0 [4ec0a83e] + Unicode v1.11.0 [e66e0078] + CompilerSupportLibraries_jll v1.5.1+0 [4536629a] + OpenBLAS_jll v0.3.33+0 [05823500] + OpenLibm_jll v0.8.7+0 [bea87d4a] + SuiteSparse_jll v7.10.1+0 [83775a58] + Zlib_jll v1.3.2+0 [8e850b90] + libblastrampoline_jll v5.15.0+0 Info Packages marked with ⌅ have new versions available but compatibility constraints restrict them from upgrading. To see why use `status --outdated -m` Installation completed after 5.97s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... Precompiling package dependencies... Precompiling project... WARNING: Method definition eigencopy_oftype(LinearAlgebra.UpperHessenberg{T, S} where S<:AbstractArray{T, 2} where T, Any) in module LinearAlgebra at /source/usr/share/julia/stdlib/v1.14/LinearAlgebra/src/hessenberg.jl:429 overwritten in module GenericLinearAlgebra at /home/pkgeval/.julia/packages/GenericLinearAlgebra/WvuVM/src/eigenGeneral.jl:15. ERROR: Method overwriting is not permitted during Module precompilation. Use `__precompile__(false)` to opt-out of precompilation. 2.1 s ? GenericLinearAlgebra 1.5 s ✓ Bonobo 2.4 s ✓ LEMON_jll 12.9 s ✓ MathOptSetDistances ERROR: LoadError: Precompiled image Base.PkgId(Base.UUID("14197337-ba66-59df-a3e3-ca00e7dcff7a"), "GenericLinearAlgebra") not available with flags CacheFlags(; use_pkgimages=false, debug_level=1, check_bounds=1, inline=true, opt_level=0) Stacktrace:  [1] error(s::String)  @ Base ./error.jl:56  [2] __require_prelocked(pkg::Base.PkgId, env::String)  @ Base ./loading.jl:2818  [3] _require_prelocked(uuidkey::Base.PkgId, env::String)  @ Base ./loading.jl:2672  [4] macro expansion  @ ./loading.jl:2599 [inlined]  [5] string(::String, ::Union{Char, SubString{String}, String, Symbol}, ::Symbol, ::String)  @ Base ./lock.jl:376 [inlined]  [6] __require(into::Module, mod::Symbol)  @ Base ./loading.jl:2563  [7] require  @ ./loading.jl:2539 [inlined]  [8] eval_import_path(at::Module, from::Nothing, path::Expr, keyword::String)  @ Base ./module.jl:36 [inlined]  [9] eval_import_path_all(at::Module, path::Expr, keyword::String)  @ Base ./module.jl:60  [10] _eval_using(to::Module, path::Expr, flags::UInt8)  @ Base ./module.jl:137 [inlined]  [11] top-level scope  @ ~/.julia/packages/DoubleFloats/dMOXI/src/DoubleFloats.jl:45  [12] include(mod::Module, _path::String)  @ Base ./Base.jl:326  [13] include_package_for_output(pkg::Base.PkgId, input::String, syntax_version::VersionNumber, depot_path::Vector{String}, dl_load_path::Vector{String}, load_path::Vector{String}, concrete_deps::Vector{Pair{Base.PkgId, UInt128}}, source::Nothing)  @ Base ./loading.jl:3271  [14] top-level scope  @ stdin:5  [15] eval(m::Module, e::Any)  @ Core ./boot.jl:517  [16] include_string(mapexpr::typeof(identity), mod::Module, code::String, filename::String)  @ Base ./loading.jl:3113  [17] push!(a::Vector{SubString{String}}, item::String)  @ Base ./loading.jl:3123 [inlined]  [18] exec_options(opts::Base.JLOptions)  @ Base ./client.jl:350  [19] _start()  @ Base ./client.jl:593 in expression starting at /home/pkgeval/.julia/packages/DoubleFloats/dMOXI/src/DoubleFloats.jl:1 in expression starting at stdin:5 ✗ DoubleFloats 16.7 s ✓ LEMONGraphs 16.2 s ✓ Boscia 29.8 s ✓ GraphsMatching 11.4 s ✓ Boscia → BosciaHiGHSExt 13.5 s ✓ Boscia → BosciaSCIPExt 19.2 s ✓ CombinatorialLinearOracles 9 dependencies successfully precompiled in 131 seconds. 167 already precompiled. 1 dependency failed but may be precompilable after restarting julia 1 dependency had output during precompilation: ┌ GenericLinearAlgebra │ WARNING: Method definition eigencopy_oftype(LinearAlgebra.UpperHessenberg{T, S} where S<:AbstractArray{T, 2} where T, Any) in module LinearAlgebra at /source/usr/share/julia/stdlib/v1.14/LinearAlgebra/src/hessenberg.jl:429 overwritten in module GenericLinearAlgebra at /home/pkgeval/.julia/packages/GenericLinearAlgebra/WvuVM/src/eigenGeneral.jl:15. │ ERROR: Method overwriting is not permitted during Module precompilation. Use `__precompile__(false)` to opt-out of precompilation. └ Precompilation completed after 161.63s ################################################################################ # Testing # Testing Boscia Status `/tmp/jl_44FOv4/Project.toml` [4c88cf16] Aqua v0.8.14 [f7b14807] Bonobo v0.1.5 [36b166db] Boscia v0.2.12 [336ed68f] CSV v0.10.16 [0002e35e] CombinatorialLinearOracles v0.1.5 [31c24e10] Distributions v0.25.125 [497a8b3b] DoubleFloats v1.7.1 [f55ce6ea] FrankWolfe v0.6.4 [86223c79] Graphs v1.14.0 [87dc4568] HiGHS v1.23.0 [b8f27783] MathOptInterface v1.51.0 [3b969827] MathOptSetDistances v0.2.12 [82193955] SCIP v0.12.8 [860ef19b] StableRNGs v1.0.4 [10745b16] Statistics v1.11.1 [fd094767] Suppressor v0.2.8 [ade2ca70] Dates v1.11.0 [37e2e46d] LinearAlgebra v1.13.0 [de0858da] Printf v1.11.0 [9a3f8284] Random v1.11.0 [2f01184e] SparseArrays v1.13.0 [8dfed614] Test v1.11.0 Status `/tmp/jl_44FOv4/Manifest.toml` [66dad0bd] AliasTables v1.1.3 [4c88cf16] Aqua v0.8.14 [ec485272] ArnoldiMethod v0.4.0 [7d9fca2a] Arpack v0.5.4 [0a1fb500] BlockDiagonals v0.2.0 [f7b14807] Bonobo v0.1.5 [36b166db] Boscia v0.2.12 [336ed68f] CSV v0.10.16 [d360d2e6] ChainRulesCore v1.26.1 [523fee87] CodecBzip2 v0.8.5 [944b1d66] CodecZlib v0.7.8 [0002e35e] CombinatorialLinearOracles v0.1.5 [bbf7d656] CommonSubexpressions v0.3.1 [34da2185] Compat v4.18.1 [187b0558] ConstructionBase v1.6.0 [1f15a43c] CxxWrap v0.17.5 [9a962f9c] DataAPI v1.16.0 [864edb3b] DataStructures v0.19.4 [e2d170a0] DataValueInterfaces v1.0.0 [163ba53b] DiffResults v1.1.0 [b552c78f] DiffRules v1.15.1 [31c24e10] Distributions v0.25.125 [ffbed154] DocStringExtensions v0.9.5 [497a8b3b] DoubleFloats v1.7.1 [e2ba6199] ExprTools v0.1.10 [48062228] FilePathsBase v0.9.24 [1a297f60] FillArrays v1.16.0 [f6369f11] ForwardDiff v1.3.3 [f55ce6ea] FrankWolfe v0.6.4 [14197337] GenericLinearAlgebra v0.4.0 [c145ed77] GenericSchur v0.5.6 [86223c79] Graphs v1.14.0 [c3af3a8c] GraphsMatching v0.2.1 [87dc4568] HiGHS v1.23.0 [e91730f6] Hungarian v0.7.0 [34004b35] HypergeometricFunctions v0.3.28 [d25df0c9] Inflate v0.1.5 [842dd82b] InlineStrings v1.4.5 [92d709cd] IrrationalConstants v0.2.6 [82899510] IteratorInterfaceExtensions v1.0.0 [692b3bcd] JLLWrappers v1.8.0 [682c06a0] JSON v1.5.2 [4076af6c] JuMP v1.30.1 [14b1564f] LEMONGraphs v0.1.1 [2ab3a3ac] LogExpFunctions v0.3.29 [1914dd2f] MacroTools v0.5.16 [8c4f8055] MathOptIIS v0.2.0 [b8f27783] MathOptInterface v1.51.0 [3b969827] MathOptSetDistances v0.2.12 [e1d29d7a] Missings v1.2.0 [d8a4904e] MutableArithmetics v1.7.1 [77ba4419] NaNMath v1.1.3 [d9ec5142] NamedTupleTools v0.14.3 [bac558e1] OrderedCollections v1.8.1 [90014a1f] PDMats v0.11.37 [69de0a69] Parsers v2.8.4 [2dfb63ee] PooledArrays v1.4.3 [aea7be01] PrecompileTools v1.3.4 [21216c6a] Preferences v1.5.2 [92933f4c] ProgressMeter v1.11.0 ⌅ [dc4f5ac2] ProximalCore v0.1.2 [43287f4e] PtrArrays v1.4.0 [1fd47b50] QuadGK v2.11.3 [be4d8f0f] Quadmath v1.0.1 [189a3867] Reexport v1.2.2 [79098fc4] Rmath v0.9.0 [82193955] SCIP v0.12.8 [91c51154] SentinelArrays v1.4.9 [efcf1570] Setfield v1.1.2 [699a6c99] SimpleTraits v0.9.5 [a2af1166] SortingAlgorithms v1.2.2 [276daf66] SpecialFunctions v2.7.2 [860ef19b] StableRNGs v1.0.4 [90137ffa] StaticArrays v1.9.18 [1e83bf80] StaticArraysCore v1.4.4 [10745b16] Statistics v1.11.1 [82ae8749] StatsAPI v1.8.0 [2913bbd2] StatsBase v0.34.10 [4c63d2b9] StatsFuns v1.5.2 [ec057cc2] StructUtils v2.8.1 [fd094767] Suppressor v0.2.8 [3783bdb8] TableTraits v1.0.1 [bd369af6] Tables v1.12.1 [a759f4b9] TimerOutputs v0.5.29 [3bb67fe8] TranscodingStreams v0.11.3 [ea10d353] WeakRefStrings v1.4.3 [76eceee3] WorkerUtilities v1.6.1 [ae81ac8f] ASL_jll v0.1.3+0 ⌅ [68821587] Arpack_jll v3.5.2+0 [6e34b625] Bzip2_jll v1.0.9+0 [8fd58aa0] HiGHS_jll v1.14.0+0 [e33a78d0] Hwloc_jll v2.13.0+1 ⌅ [9cc047cb] Ipopt_jll v300.1400.1900+0 [9f9b04fa] LEMON_jll v1.3.5+0 [94ce4f54] Libiconv_jll v1.18.0+0 [d00139f3] METIS_jll v5.1.3+0 ⌅ [d7ed1dd3] MUMPS_seq_jll v500.800.100+0 [68e3532b] Ncurses_jll v6.6.0+2 [656ef2d0] OpenBLAS32_jll v0.3.33+1 [efe28fd5] OpenSpecFun_jll v0.5.6+0 [05236dd9] Readline_jll v8.3.3+0 [f50d1b31] Rmath_jll v0.5.1+0 [fc9abe76] SCIP_PaPILO_jll v1000.0.2+0 [e5ac4fe4] SCIP_jll v1000.0.2+0 ⌅ [319450e9] SPRAL_jll v2025.5.20+0 ⌅ [02c8fc9c] XML2_jll v2.13.9+0 [a65dc6b1] Xorg_libpciaccess_jll v0.19.0+0 [508c9074] bliss_jll v0.77.0+1 [28df3c45] boost_jll v1.87.0+0 [3eaa8342] libcxxwrap_julia_jll v0.14.9+0 [1317d2d5] oneTBB_jll v2022.3.0+0 [0dad84c5] ArgTools v1.1.2 [56f22d72] Artifacts v1.11.0 [2a0f44e3] Base64 v1.11.0 [ade2ca70] Dates v1.11.0 [8ba89e20] Distributed v1.11.0 [f43a241f] Downloads v1.7.0 [7b1f6079] FileWatching v1.11.0 [9fa8497b] Future v1.11.0 [b77e0a4c] InteractiveUtils v1.11.0 [ac6e5ff7] JuliaSyntaxHighlighting v1.13.0 [4af54fe1] LazyArtifacts v1.11.0 [b27032c2] LibCURL v1.0.0 [76f85450] LibGit2 v1.11.0 [8f399da3] Libdl v1.11.0 [37e2e46d] LinearAlgebra v1.13.0 [56ddb016] Logging v1.11.0 [d6f4376e] Markdown v1.11.0 [a63ad114] Mmap v1.11.0 [ca575930] NetworkOptions v1.3.0 [44cfe95a] Pkg v1.14.0 [de0858da] Printf v1.11.0 [9a3f8284] Random v1.11.0 [ea8e919c] SHA v1.13.0 [9e88b42a] Serialization v1.11.0 [6462fe0b] Sockets v1.11.0 [2f01184e] SparseArrays v1.13.0 [f489334b] StyledStrings v1.13.0 [4607b0f0] SuiteSparse [fa267f1f] TOML v1.0.3 [a4e569a6] Tar v1.10.0 [8dfed614] Test v1.11.0 [cf7118a7] UUIDs v1.11.0 [4ec0a83e] Unicode v1.11.0 [e66e0078] CompilerSupportLibraries_jll v1.5.1+0 [781609d7] GMP_jll v6.3.0+2 [deac9b47] LibCURL_jll v8.20.0+1 [e37daf67] LibGit2_jll v1.9.3+0 [29816b5a] LibSSH2_jll v1.11.101+0 [3a97d323] MPFR_jll v4.2.2+0 [14a3606d] MozillaCACerts_jll v2026.3.19 [4536629a] OpenBLAS_jll v0.3.33+0 [05823500] OpenLibm_jll v0.8.7+0 [458c3c95] OpenSSL_jll v3.5.6+0 [efcefdf7] PCRE2_jll v10.47.0+0 [bea87d4a] SuiteSparse_jll v7.10.1+0 [83775a58] Zlib_jll v1.3.2+0 [3161d3a3] Zstd_jll v1.5.7+1 [8e850b90] libblastrampoline_jll v5.15.0+0 [8e850ede] nghttp2_jll v1.69.0+0 [3f19e933] p7zip_jll v17.8.0+0 Info Packages marked with ⌅ have new versions available but compatibility constraints restrict them from upgrading. Testing Running tests... Interface Tests seed = 0xab2c264fe99f7a7b WARNING: Use of Boscia.CubeSimpleBLMO is deprecated, use CubeLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/EgUlC/test/interface_test.jl:97 [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution x = [0.0, 0.0, 0.0, 0.0, 0.8333333015441894, 0.8333333015441894, 5.0333333015441895, 2.3333333969116206, 4.933333301544189, 10.533333396911619] Objective f(x) = -63.31166666666664 Status = TIME_LIMIT_REACHED WARNING: Use of Boscia.UnitSimplexSimpleBLMO is deprecated, use UnitSimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/EgUlC/test/interface_test.jl:986 Solution x = [0.0, 0.0, 0.0, 1.9999999999999996, 0.0, 0.0, 4.199999999999999, 1.4999999403953552, 4.1, 0.5999999999999999] Objective f(x) = -20.529999999999998 Status = TIME_LIMIT_REACHED Callback Tests seed = 0x175c9dcfbd95e628 LMO Tests seed = 0xc56de302b562b2b3 WARNING: Use of Boscia.ProbabilitySimplexSimpleBLMO is deprecated, use ProbabilitySimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/EgUlC/test/LMO_test.jl:218 WARNING: Use of Boscia.UnitSimplexSimpleBLMO is deprecated, use UnitSimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/EgUlC/test/LMO_test.jl:254 Indicator Tests seed = 0x425bd69132f13497 Heuristics Tests seed = 0xecb6ad20f1dc1792 WARNING: Use of Boscia.ProbabilitySimplexSimpleBLMO is deprecated, use ProbabilitySimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/EgUlC/test/heuristics.jl:27 WARNING: Use of Boscia.UnitSimplexSimpleBLMO is deprecated, use UnitSimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/EgUlC/test/heuristics.jl:58 WARNING: Use of Boscia.UnitSimplexSimpleBLMO is deprecated, use UnitSimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/EgUlC/test/heuristics.jl:86 WARNING: Use of Boscia.UnitSimplexSimpleBLMO is deprecated, use UnitSimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/EgUlC/test/heuristics.jl:124 WARNING: Use of Boscia.UnitSimplexSimpleBLMO is deprecated, use UnitSimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/EgUlC/test/heuristics.jl:124 [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution WARNING: Use of Boscia.ProbabilitySimplexSimpleBLMO is deprecated, use ProbabilitySimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/EgUlC/test/heuristics.jl:193 Sparse Regression Tests seed = 0x33887f1f9c00ab7f Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 100 Number of integer variables: 50 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 2.281439e+00 2.538621e+00 2.571816e-01 1.127278e-01 2.407700e+01 1.246002e-01 10081 52 17 19 9 1 67 12 2.519010e+00 2.538621e+00 1.961041e-02 7.784966e-03 2.916100e+01 2.709098e+00 5 3 304 0 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-6 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 6.591699e+00 -7.242394e-01 7.315939e+00 0.000000e+00 Inf 1 LD 2 2.538621e+00 2.538621e+00 0.000000e+00 2.329497e+00 8.585544e-01 1 Last 2 2.538621e+00 2.538621e+00 0.000000e+00 2.499294e+00 8.002261e-01 1 ---------------------------------------------------------------------------------------------------------------- PP 2 2.538621e+00 2.538621e+00 0.000000e+00 2.502571e+00 7.991780e-01 1 ---------------------------------------------------------------------------------------------------------------- fw_status = FrankWolfe.STATUS_OPTIMAL [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 2.5386208598853957 Dual Bound: 2.519010448287035 Dual Gap (relative): 0.007784966359189273 Search Statistics. Total number of nodes processed: 79 Total number of lmo calls: 309 Total time (s): 34.237 LMO calls / sec: 9.025323480445133 Nodes / sec: 2.307445161667202 LMO calls / node: 3.911392405063291 Total number of global tightenings: 36 Global tightenings / node: 0.54 Total number of local tightenings: 55 Local tightenings / node: 0.82 Total number of potential local tightenings: 55 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-03 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 100 Number of integer variables: 50 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 1.419854e+00 1.523308e+00 1.034543e-01 7.286267e-02 2.112800e+01 1.419917e-01 9648 73 16 25 8 1 11 4 1.514370e+00 1.523308e+00 8.937653e-03 5.901894e-03 2.141400e+01 7.004763e-01 4 2 84 0 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-6 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 5.895523e+00 -1.097991e+00 6.993514e+00 0.000000e+00 Inf 1 LD 2 1.523308e+00 1.523308e+00 0.000000e+00 1.545158e-01 1.294366e+01 1 Last 2 1.523308e+00 1.523308e+00 0.000000e+00 3.099896e-01 6.451829e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 2 1.523308e+00 1.523308e+00 0.000000e+00 3.130654e-01 6.388441e+00 1 ---------------------------------------------------------------------------------------------------------------- fw_status = FrankWolfe.STATUS_OPTIMAL [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 1.5233080930478557 Dual Bound: 1.5143704398606728 Dual Gap (relative): 0.0059018935868857 Search Statistics. Total number of nodes processed: 15 Total number of lmo calls: 89 Total time (s): 24.185 LMO calls / sec: 3.6799669216456485 Nodes / sec: 0.6202191440975812 LMO calls / node: 5.933333333333334 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 0 Local tightenings / node: 0.0 Total number of potential local tightenings: 0 Non zero entries: 21th entry: 0.163360483627235 48th entry: 0.163360483627235 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-03 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 100 Number of integer variables: 50 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 1.436226e+00 1.523308e+00 8.708225e-02 6.063270e-02 9.800000e-02 3.061224e+01 91 69 16 25 8 1 9 3 1.509945e+00 1.523308e+00 1.336329e-02 8.850183e-03 4.160000e-01 2.884615e+01 19 13 75 6 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-6 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 5.895523e+00 -1.097991e+00 6.993514e+00 0.000000e+00 Inf 1 LD 2 1.523308e+00 1.523308e+00 0.000000e+00 1.651625e-03 1.210929e+03 1 Last 2 1.523308e+00 1.523308e+00 0.000000e+00 7.401913e-03 2.702004e+02 1 ---------------------------------------------------------------------------------------------------------------- PP 2 1.523308e+00 1.523308e+00 0.000000e+00 1.030679e-02 1.940469e+02 1 ---------------------------------------------------------------------------------------------------------------- fw_status = FrankWolfe.STATUS_OPTIMAL [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 1.5233080930478557 Dual Bound: 1.509944804584711 Dual Gap (relative): 0.008850183412379833 Search Statistics. Total number of nodes processed: 12 Total number of lmo calls: 80 Total time (s): 0.438 LMO calls / sec: 182.64840182648402 Nodes / sec: 27.397260273972602 LMO calls / node: 6.666666666666667 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 0 Local tightenings / node: 0.0 Total number of potential local tightenings: 0 Poisson Tests seed = 0x17eee1e785f1caad Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 61 Number of integer variables: 30 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -1.446544e+02 -1.238688e+02 2.078563e+01 1.678036e-01 2.162700e+01 1.387155e-01 10789 91 36 472 23 1 * 17 18 -1.445666e+02 -1.247434e+02 1.982312e+01 1.589111e-01 4.298800e+01 8.141807e-01 1058 96 620 655 33 9 * 22 23 -1.445591e+02 -1.252400e+02 1.931918e+01 1.542573e-01 5.397700e+01 8.336884e-01 653 84 814 387 32 18 * 24 25 -1.445579e+02 -1.283578e+02 1.620015e+01 1.262109e-01 5.544100e+01 8.838224e-01 834 86 877 522 39 8 51 52 -1.444245e+02 -1.283578e+02 1.606674e+01 1.251715e-01 1.200060e+02 8.582904e-01 1421 73 1877 908 26 7 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-6 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 3.234197e+02 -3.493789e+02 6.727986e+02 0.000000e+00 Inf 1 LD 2 -1.400676e+02 -1.496572e+02 9.589603e+00 2.144860e-01 9.324618e+00 2 LD 107 -1.420299e+02 -1.437224e+02 1.692473e+00 6.258386e-01 1.709706e+02 5 LD 128 -1.420857e+02 -1.425585e+02 4.727732e-01 6.600454e-01 1.939261e+02 8 LD 221 -1.420928e+02 -1.422881e+02 1.952603e-01 7.844552e-01 2.817242e+02 9 LD 302 -1.420943e+02 -1.421660e+02 7.165043e-02 8.898381e-01 3.393876e+02 10 LD 363 -1.420945e+02 -1.421204e+02 2.592152e-02 9.650222e-01 3.761572e+02 10 LD 441 -1.420945e+02 -1.421066e+02 1.205379e-02 1.088857e+00 4.050120e+02 10 LD 500 -1.420945e+02 -1.421000e+02 5.511361e-03 1.147782e+00 4.356229e+02 11 LD 564 -1.420945e+02 -1.420969e+02 2.427887e-03 1.202852e+00 4.688856e+02 12 LD 617 -1.420945e+02 -1.420957e+02 1.211090e-03 1.250930e+00 4.932331e+02 13 LD 670 -1.420945e+02 -1.420948e+02 2.763235e-04 1.305758e+00 5.131118e+02 14 LD 742 -1.420945e+02 -1.420946e+02 1.372140e-04 1.373534e+00 5.402123e+02 14 LD 791 -1.420945e+02 -1.420946e+02 5.020230e-05 1.420095e+00 5.570049e+02 14 LD 874 -1.420945e+02 -1.420945e+02 2.446613e-05 1.536971e+00 5.686508e+02 15 LD 912 -1.420945e+02 -1.420945e+02 9.369491e-06 1.565809e+00 5.824467e+02 15 LD 969 -1.420945e+02 -1.420945e+02 3.227330e-06 1.606446e+00 6.031950e+02 15 P 1000 -1.420945e+02 -1.420945e+02 3.227330e-06 1.630728e+00 6.132229e+02 15 P 2000 -1.420945e+02 -1.420945e+02 3.227330e-06 2.529437e+00 7.906899e+02 15 P 3000 -1.420945e+02 -1.420945e+02 3.227330e-06 3.164815e+00 9.479228e+02 15 P 4000 -1.420945e+02 -1.420945e+02 3.227330e-06 3.924838e+00 1.019150e+03 15 P 5000 -1.420945e+02 -1.420945e+02 3.227330e-06 4.446485e+00 1.124484e+03 15 P 6000 -1.420945e+02 -1.420945e+02 3.227330e-06 5.022472e+00 1.194631e+03 15 P 7000 -1.420945e+02 -1.420945e+02 3.227330e-06 5.621745e+00 1.245165e+03 15 P 8000 -1.420945e+02 -1.420945e+02 3.227330e-06 6.315922e+00 1.266640e+03 15 P 9000 -1.420945e+02 -1.420945e+02 3.227330e-06 6.967136e+00 1.291779e+03 15 P 10000 -1.420945e+02 -1.420945e+02 3.227330e-06 7.656994e+00 1.305995e+03 15 Last 10001 -1.420945e+02 -1.420945e+02 3.227330e-06 7.662053e+00 1.305264e+03 15 ---------------------------------------------------------------------------------------------------------------- PP 10001 -1.420945e+02 -1.420945e+02 6.130922e-06 7.665416e+00 1.304691e+03 15 ---------------------------------------------------------------------------------------------------------------- fw_status = FrankWolfe.STATUS_MAXITER Solution Statistics. Solution Status: Time limit reached Primal Objective: -142.0945087053022 Dual Bound: -144.42449808390865 Dual Gap (relative): 0.016397462504612 Search Statistics. Total number of nodes processed: 103 Total number of lmo calls: 1912 Total time (s): 130.596 LMO calls / sec: 14.6405709210083 Nodes / sec: 0.7886918435480412 LMO calls / node: 18.563106796116504 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 0 Local tightenings / node: 0.0 Total number of potential local tightenings: 0 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Partial strong branching FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-03 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 61 Number of integer variables: 30 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -1.426466e+02 -1.365828e+02 6.063779e+00 4.439636e-02 2.734100e+01 1.097253e-01 10913 215 42 266 27 1 * 13 14 -1.421619e+02 -1.376859e+02 4.475996e+00 3.250873e-02 4.370900e+01 6.177218e-01 393 128 342 188 25 5 100 91 -1.400268e+02 -1.376859e+02 2.340813e+00 1.700111e-02 1.320500e+02 1.446422e+00 117 49 2265 62 23 7 200 173 -1.394659e+02 -1.376859e+02 1.779962e+00 1.292770e-02 2.257230e+02 1.652468e+00 283 93 4236 148 19 7 300 231 -1.390963e+02 -1.376859e+02 1.410392e+00 1.024355e-02 3.016350e+02 1.760406e+00 258 77 5934 133 20 4 305 234 -1.390596e+02 -1.376859e+02 1.373633e+00 9.976569e-03 3.058700e+02 1.762187e+00 280 91 6035 140 17 3 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-6 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 -7.598208e+01 -1.629865e+02 8.700441e+01 0.000000e+00 Inf 1 LD 2 -1.376859e+02 -1.376859e+02 0.000000e+00 1.584164e-01 1.262495e+01 1 Last 2 -1.376859e+02 -1.376859e+02 0.000000e+00 3.116658e-01 6.417130e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 2 -1.376859e+02 -1.376859e+02 0.000000e+00 3.153870e-01 6.341415e+00 1 ---------------------------------------------------------------------------------------------------------------- fw_status = FrankWolfe.STATUS_OPTIMAL [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: -137.68593764918603 Dual Bound: -139.0595709014223 Dual Gap (relative): 0.009976568963318388 Search Statistics. Total number of nodes processed: 539 Total number of lmo calls: 6040 Total time (s): 308.922 LMO calls / sec: 19.551860987563202 Nodes / sec: 1.744776998724597 LMO calls / node: 11.205936920222635 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 0 Local tightenings / node: 0.0 Total number of potential local tightenings: 0 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 41 Number of integer variables: 20 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 1.757520e+02 3.565316e+02 1.807796e+02 1.028606e+00 2.190600e+01 1.369488e-01 10630 126 25 69 12 1 * 2 3 1.757520e+02 3.403188e+02 1.645668e+02 9.363580e-01 2.209900e+01 2.262546e-01 188 104 46 58 13 1 * 7 8 2.115592e+02 3.385493e+02 1.269901e+02 6.002579e-01 2.303100e+01 6.512961e-01 209 83 138 52 10 1 * 10 11 2.149067e+02 3.345031e+02 1.195964e+02 5.565039e-01 2.353000e+01 8.924777e-01 155 80 191 50 10 1 * 55 56 2.635248e+02 3.338553e+02 7.033053e+01 2.668839e-01 3.072800e+01 3.612341e+00 100 48 903 34 6 1 100 97 2.848233e+02 3.338553e+02 4.903203e+01 1.721490e-01 3.676400e+01 5.358503e+00 88 44 1527 29 5 0 200 129 3.104730e+02 3.338553e+02 2.338231e+01 7.531192e-02 4.456700e+01 7.382144e+00 13 8 2441 2 0 0 * 278 101 3.190669e+02 3.333254e+02 1.425855e+01 4.468829e-02 4.755200e+01 8.012281e+00 10 6 2878 2 0 0 300 85 3.227202e+02 3.333254e+02 1.060527e+01 3.286213e-02 4.811600e+01 8.043063e+00 21 11 2968 6 0 0 373 24 3.300562e+02 3.333254e+02 3.269225e+00 9.905055e-03 4.965500e+01 8.035445e+00 5 4 3234 0 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-6 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 3.338553e+02 3.224160e+02 1.143928e+01 0.000000e+00 Inf 1 LD 2 3.333254e+02 3.333254e+02 2.745668e-06 1.642350e-01 1.217767e+01 2 LD 4 3.333254e+02 3.333254e+02 9.700246e-07 4.249710e-01 9.412408e+00 2 Last 4 3.333254e+02 3.333254e+02 9.700246e-07 4.319290e-01 9.260782e+00 2 ---------------------------------------------------------------------------------------------------------------- PP 4 3.333254e+02 3.333254e+02 9.700246e-07 4.356553e-01 9.181572e+00 2 ---------------------------------------------------------------------------------------------------------------- fw_status = FrankWolfe.STATUS_OPTIMAL [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 333.3254333941235 Dual Bound: 330.056208521995 Dual Gap (relative): 0.009905054920094313 Search Statistics. Total number of nodes processed: 399 Total number of lmo calls: 3240 Total time (s): 52.889 LMO calls / sec: 61.2603755034128 Nodes / sec: 7.544101798105466 LMO calls / node: 8.1203007518797 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 0 Local tightenings / node: 0.0 Total number of potential local tightenings: 0 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Partial strong branching FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 41 Number of integer variables: 20 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 1.757520e+02 3.565316e+02 1.807796e+02 1.028606e+00 2.555100e+01 1.174122e-01 10373 126 25 69 12 1 * 2 3 1.757520e+02 3.449411e+02 1.691891e+02 9.626584e-01 2.671000e+01 1.871958e-01 184 98 45 59 12 1 * 4 5 1.931351e+02 3.414603e+02 1.483252e+02 7.679867e-01 2.893500e+01 3.110420e-01 212 93 88 86 11 1 * 5 6 1.993638e+02 3.376250e+02 1.382612e+02 6.935120e-01 2.998700e+01 3.668256e-01 183 85 106 53 11 2 * 14 15 2.253002e+02 3.360384e+02 1.107382e+02 4.915142e-01 3.895200e+01 7.445061e-01 226 89 268 86 10 2 * 31 32 2.513665e+02 3.338553e+02 8.248876e+01 3.281613e-01 5.345600e+01 1.178539e+00 98 54 533 32 7 1 100 87 2.847389e+02 3.338553e+02 4.911643e+01 1.724964e-01 9.687900e+01 1.930243e+00 97 51 1398 35 6 2 200 117 3.072940e+02 3.338553e+02 2.656129e+01 8.643610e-02 1.328930e+02 2.385378e+00 32 18 2213 13 4 0 * 271 108 3.173187e+02 3.333254e+02 1.600670e+01 5.044361e-02 1.477390e+02 2.578872e+00 11 6 2560 2 0 0 300 91 3.216158e+02 3.333254e+02 1.170959e+01 3.640864e-02 1.510950e+02 2.601013e+00 19 11 2681 2 0 0 395 14 3.305272e+02 3.333254e+02 2.798262e+00 8.466057e-03 1.568030e+02 2.621123e+00 32 18 3016 7 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Secant EPSILON: 1.0e-6 MAXITERATION: 10000 TYPE: Float64 GRADIENT_TYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{FrankWolfe.MathOptLMO{SCIP.Optimizer}, DateTime} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 3.338553e+02 3.224160e+02 1.143928e+01 0.000000e+00 Inf 1 LD 2 3.333254e+02 3.333254e+02 2.745668e-06 1.712528e-01 1.167864e+01 2 LD 4 3.333254e+02 3.333254e+02 9.700246e-07 4.412852e-01 9.064433e+00 2 Last 4 3.333254e+02 3.333254e+02 9.700246e-07 4.482031e-01 8.924526e+00 2 ---------------------------------------------------------------------------------------------------------------- PP 4 3.333254e+02 3.333254e+02 9.700246e-07 4.518905e-01 8.851703e+00 2 ---------------------------------------------------------------------------------------------------------------- fw_status = FrankWolfe.STATUS_OPTIMAL [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 333.3254333941235 Dual Bound: 330.52717139167726 Dual Gap (relative): 0.008466057391482228 Search Statistics. Total number of nodes processed: 411 Total number of lmo calls: 3022 Total time (s): 159.898 LMO calls / sec: 18.89954846214462 Nodes / sec: 2.5703886227470014 LMO calls / node: 7.35279805352798 Total number of global tightenings: 0 Global tightenings / node: 0.0 Total number of local tightenings: 0 Local tightenings / node: 0.0 Total number of potential local tightenings: 0 Mean Risk Test seed = 0xa27573746a1219e6 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 30 Number of integer variables: 30 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -1.611803e+01 3.134152e+01 4.745955e+01 Inf 2.442200e+01 1.228401e-01 11824 137 50 10001 24 15 * 2 3 -1.611803e+01 2.634066e+01 4.245869e+01 Inf 2.464500e+01 2.028809e-01 218 52 69 4641 19 22 * 3 4 -1.365799e+01 2.516441e+01 3.882240e+01 Inf 2.512800e+01 2.785737e-01 448 86 113 8294 22 10 * 19 20 -5.275314e+00 2.302151e+01 2.829683e+01 Inf 2.954400e+01 1.320065e+00 517 114 617 10001 21 14 * 30 31 -2.681332e+00 2.231410e+01 2.499543e+01 Inf 3.202500e+01 1.904762e+00 81 36 966 834 17 46 100 85 5.151608e+00 2.231410e+01 1.716249e+01 3.331482e+00 4.463500e+01 4.144729e+00 349 27 2903 10001 18 5 159 136 9.392249e+00 2.231410e+01 1.292185e+01 1.375799e+00 6.000200e+01 4.916503e+00 16 12 4747 12 7 2 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Time limit reached Primal Objective: 22.314099374532844 Dual Bound: 9.39224927710793 Dual Gap (relative): 1.3757993124096282 Search Statistics. Total number of nodes processed: 295 Total number of lmo calls: 4747 Total time (s): 60.81 LMO calls / sec: 78.06281861535932 Nodes / sec: 4.851175793455024 LMO calls / node: 16.091525423728815 Total number of global tightenings: 23 Global tightenings / node: 0.14 Total number of local tightenings: 925 Local tightenings / node: 5.82 Total number of potential local tightenings: 1304 Time Limit Test seed = 0x3fed04a4657e23d7 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 15 Number of integer variables: 15 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 -1.014154e+00 0.000000e+00 1.014154e+00 Inf 2.072300e+01 1.447667e-01 10763 56 23 1037 10 3 31 0 -8.734234e-03 0.000000e+00 8.734234e-03 Inf 2.241100e+01 1.383249e+00 3 1 348 2 0 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tree empty) Primal Objective: 0.0 Dual Bound: -0.008734234464525337 Dual Gap (relative): Inf Search Statistics. Total number of nodes processed: 31 Total number of lmo calls: 348 Total time (s): 23.521 LMO calls / sec: 14.795289315930445 Nodes / sec: 1.3179711746949534 LMO calls / node: 11.225806451612904 Total number of global tightenings: 6 Global tightenings / node: 0.19 Total number of local tightenings: 38 Local tightenings / node: 1.23 Total number of potential local tightenings: 45 Strong Convexity and Sharpness Tests seed = 0xafe9ded70432963f WARNING: Use of Boscia.UnitSimplexSimpleBLMO is deprecated, use UnitSimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/EgUlC/test/strong_convexity_and_sharpness.jl:29 WARNING: Use of Boscia.ProbabilitySimplexSimpleBLMO is deprecated, use ProbabilitySimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/EgUlC/test/strong_convexity_and_sharpness.jl:29 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Secant Lazification: true Lazification Tolerance: 2 Absolute dual gap tolerance: 1.000000e-06 Relative dual gap tolerance: 1.000000e-02 Frank-Wolfe subproblem tolerance: 1.000000e-02 Frank-Wolfe dual gap decay factor: 8.000000e-01 Additional kwargs: Total number of variables: 20 Number of integer variables: 20 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Iter Open Bound Incumbent Gap (abs) Gap (rel) Time (s) Nodes/sec FW (ms) LMO (ms) LMO (calls c) FW (its) #activeset #shadow ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- * 1 2 2.131865e+02 2.135595e+02 3.730383e-01 1.749822e-03 1.530200e+01 1.960528e-01 5876 0 6 4 2 1 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 213.55950962438558 Dual Bound: 213.1864713472845 Dual Gap (relative): 0.00174982152827788 Search Statistics. Total number of nodes processed: 3 Total number of lmo calls: 6 Total time (s): 16.258 LMO calls / sec: 0.3690490835281093 Nodes / sec: 0.18452454176405464 LMO calls / node: 2.0 Total number of global tightenings: 9 Global tightenings / node: 9.0 Total number of local tightenings: 9 Local tightenings / node: 9.0 Total number of potential local tightenings: 18 WARNING: Use of Boscia.UnitSimplexSimpleBLMO is deprecated, use UnitSimplexLMO instead. likely near /home/pkgeval/.julia/packages/Boscia/EgUlC/test/strong_convexity_and_sharpness.jl:135 ====================================================================================== Information request received. A stacktrace will print followed by a 1.0 second profile. --trace-compile is enabled during profile collection. ====================================================================================== cmd: /opt/julia/bin/julia 1 running 0 of 1 signal (10): User defined signal 1 epoll_pwait at /lib/x86_64-linux-gnu/libc.so.6 (unknown line) uv__io_poll at /workspace/srcdir/libuv/src/unix/linux.c:1404 uv_run at /workspace/srcdir/libuv/src/unix/core.c:430 ijl_task_get_next at /source/src/scheduler.c:457:34 wait at ./task.jl:1246:44 wait_forever at ./task.jl:1168:5 jfptr_wait_forever_0.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4127:23 [inlined] ijl_apply_generic at /source/src/gf.c:4353:12 jl_apply at /source/src/julia.h:2328:12 [inlined] start_task at /source/src/task.c:1275:19 unknown function (ip: (nil)) at (unknown file) ============================================================== Profile collected. A report will print at the next yield point. Disabling --trace-compile ============================================================== ┌ Warning: There were no samples collected in one or more groups. │ This may be due to idle threads, or you may need to run your │ program longer (perhaps by running it multiple times), │ or adjust the delay between samples with `Profile.init()`. └ @ Profile /opt/julia/share/julia/stdlib/v1.14/Profile/src/Profile.jl:1361 Overhead ╎ [+additional indent] Count File:Line Function ========================================================= Thread 1 (default) Task 0x00007b414fbd5780 Total snapshots: 467. Utilization: 0% ╎467 @Base/task.jl:1168 wait_forever() 466╎ 467 @Base/task.jl:1246 wait() PkgEval terminated after 2722.83s: test duration exceeded the time limit