Package evaluation of Boscia on Julia 1.13.0-DEV.774 (40c6d1b7c1*) started at 2025-06-24T19:30:32.875 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Set-up completed after 8.51s ################################################################################ # Installation # Installing Boscia... Resolving package versions... Updating `~/.julia/environments/v1.13/Project.toml` [36b166db] + Boscia v0.1.37 Updating `~/.julia/environments/v1.13/Manifest.toml` [7d9fca2a] + Arpack v0.5.4 [6e4b80f9] + BenchmarkTools v1.6.0 ⌅ [0a1fb500] + BlockDiagonals v0.1.42 [f7b14807] + Bonobo v0.1.3 [36b166db] + Boscia v0.1.37 [d360d2e6] + ChainRulesCore v1.25.2 [523fee87] + CodecBzip2 v0.8.5 [944b1d66] + CodecZlib v0.7.8 [861a8166] + Combinatorics v1.0.3 [bbf7d656] + CommonSubexpressions v0.3.1 [34da2185] + Compat v4.16.0 [187b0558] + ConstructionBase v1.6.0 [864edb3b] + DataStructures v0.18.22 [163ba53b] + DiffResults v1.1.0 [b552c78f] + DiffRules v1.15.1 [ffbed154] + DocStringExtensions v0.9.5 [e2ba6199] + ExprTools v0.1.10 [1a297f60] + FillArrays v1.13.0 [26cc04aa] + FiniteDifferences v0.12.32 [f6369f11] + ForwardDiff v1.0.1 [f55ce6ea] + FrankWolfe v0.5.1 [14197337] + GenericLinearAlgebra v0.3.17 [c145ed77] + GenericSchur v0.5.5 [e91730f6] + Hungarian v0.7.0 [b99e6be6] + Hypatia v0.8.2 [92d709cd] + IrrationalConstants v0.2.4 [42fd0dbc] + IterativeSolvers v0.9.4 [692b3bcd] + JLLWrappers v1.7.0 [682c06a0] + JSON v0.21.4 [0f8b85d8] + JSON3 v1.14.3 [7a12625a] + LinearMaps v3.11.4 [2ab3a3ac] + LogExpFunctions v0.3.29 [1914dd2f] + MacroTools v0.5.16 [b8f27783] + MathOptInterface v1.41.0 [3b969827] + MathOptSetDistances v0.2.11 [d8a4904e] + MutableArithmetics v1.6.4 [77ba4419] + NaNMath v1.1.3 [d9ec5142] + NamedTupleTools v0.14.3 [bac558e1] + OrderedCollections v1.8.1 [69de0a69] + Parsers v2.8.3 [3a141323] + PolynomialRoots v1.0.0 [aea7be01] + PrecompileTools v1.3.2 [21216c6a] + Preferences v1.4.3 [92933f4c] + ProgressMeter v1.10.4 [dc4f5ac2] + ProximalCore v0.1.2 [3cdcf5f2] + RecipesBase v1.3.4 [ae029012] + Requires v1.3.1 [708f8203] + Richardson v1.4.2 [efcf1570] + Setfield v1.1.2 [276daf66] + SpecialFunctions v2.5.1 [90137ffa] + StaticArrays v1.9.13 [1e83bf80] + StaticArraysCore v1.4.3 [10745b16] + Statistics v1.11.1 [856f2bd8] + StructTypes v1.11.0 [a759f4b9] + TimerOutputs v0.5.29 [3bb67fe8] + TranscodingStreams v0.11.3 ⌅ [68821587] + Arpack_jll v3.5.1+1 [6e34b625] + Bzip2_jll v1.0.9+0 [efe28fd5] + OpenSpecFun_jll v0.5.6+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.12.0 [b27032c2] + LibCURL v0.6.4 [76f85450] + LibGit2 v1.11.0 [8f399da3] + Libdl v1.11.0 [37e2e46d] + LinearAlgebra v1.12.0 [56ddb016] + Logging v1.11.0 [d6f4376e] + Markdown v1.11.0 [a63ad114] + Mmap v1.11.0 [ca575930] + NetworkOptions v1.3.0 [44cfe95a] + Pkg v1.13.0 [de0858da] + Printf v1.11.0 [9abbd945] + Profile v1.11.0 [9a3f8284] + Random v1.11.0 [ea8e919c] + SHA v0.7.0 [9e88b42a] + Serialization v1.11.0 [6462fe0b] + Sockets v1.11.0 [2f01184e] + SparseArrays v1.12.0 [f489334b] + StyledStrings v1.11.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.3.0+1 [deac9b47] + LibCURL_jll v8.14.1+1 [e37daf67] + LibGit2_jll v1.9.1+0 [29816b5a] + LibSSH2_jll v1.11.3+1 [14a3606d] + MozillaCACerts_jll v2025.5.20 [4536629a] + OpenBLAS_jll v0.3.29+0 [05823500] + OpenLibm_jll v0.8.5+0 [458c3c95] + OpenSSL_jll v3.5.0+0 [efcefdf7] + PCRE2_jll v10.45.0+0 [bea87d4a] + SuiteSparse_jll v7.10.1+0 [83775a58] + Zlib_jll v1.3.1+2 [8e850b90] + libblastrampoline_jll v5.13.1+0 [8e850ede] + nghttp2_jll v1.65.0+0 [3f19e933] + p7zip_jll v17.5.0+2 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 4.28s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... Precompiling package dependencies... Precompilation completed after 126.12s ################################################################################ # Testing # Testing Boscia Status `/tmp/jl_h8cYjs/Project.toml` [4c88cf16] Aqua v0.8.13 [f7b14807] Bonobo v0.1.3 [36b166db] Boscia v0.1.37 [864edb3b] DataStructures v0.18.22 [31c24e10] Distributions v0.25.120 [497a8b3b] DoubleFloats v1.4.3 [f55ce6ea] FrankWolfe v0.5.1 [87dc4568] HiGHS v1.18.1 [b8f27783] MathOptInterface v1.41.0 [3b969827] MathOptSetDistances v0.2.11 [82193955] SCIP v0.12.7 [860ef19b] StableRNGs v1.0.3 [10745b16] Statistics v1.11.1 [ade2ca70] Dates v1.11.0 [37e2e46d] LinearAlgebra v1.12.0 [de0858da] Printf v1.11.0 [9a3f8284] Random v1.11.0 [2f01184e] SparseArrays v1.12.0 [8dfed614] Test v1.11.0 Status `/tmp/jl_h8cYjs/Manifest.toml` [66dad0bd] AliasTables v1.1.3 [4c88cf16] Aqua v0.8.13 [7d9fca2a] Arpack v0.5.4 [6e4b80f9] BenchmarkTools v1.6.0 ⌅ [0a1fb500] BlockDiagonals v0.1.42 [f7b14807] Bonobo v0.1.3 [36b166db] Boscia v0.1.37 [d360d2e6] ChainRulesCore v1.25.2 [523fee87] CodecBzip2 v0.8.5 [944b1d66] CodecZlib v0.7.8 [861a8166] Combinatorics v1.0.3 [bbf7d656] CommonSubexpressions v0.3.1 [34da2185] Compat v4.16.0 [187b0558] ConstructionBase v1.6.0 [9a962f9c] DataAPI v1.16.0 [864edb3b] DataStructures v0.18.22 [163ba53b] DiffResults v1.1.0 [b552c78f] DiffRules v1.15.1 [31c24e10] Distributions v0.25.120 [ffbed154] DocStringExtensions v0.9.5 [497a8b3b] DoubleFloats v1.4.3 [e2ba6199] ExprTools v0.1.10 [1a297f60] FillArrays v1.13.0 [26cc04aa] FiniteDifferences v0.12.32 [f6369f11] ForwardDiff v1.0.1 [f55ce6ea] FrankWolfe v0.5.1 [14197337] GenericLinearAlgebra v0.3.17 [c145ed77] GenericSchur v0.5.5 [87dc4568] HiGHS v1.18.1 [e91730f6] Hungarian v0.7.0 [b99e6be6] Hypatia v0.8.2 [34004b35] HypergeometricFunctions v0.3.28 [92d709cd] IrrationalConstants v0.2.4 [42fd0dbc] IterativeSolvers v0.9.4 [692b3bcd] JLLWrappers v1.7.0 [682c06a0] JSON v0.21.4 [0f8b85d8] JSON3 v1.14.3 [7a12625a] LinearMaps v3.11.4 [2ab3a3ac] LogExpFunctions v0.3.29 [1914dd2f] MacroTools v0.5.16 [b8f27783] MathOptInterface v1.41.0 [3b969827] MathOptSetDistances v0.2.11 [e1d29d7a] Missings v1.2.0 [d8a4904e] MutableArithmetics v1.6.4 [77ba4419] NaNMath v1.1.3 [d9ec5142] NamedTupleTools v0.14.3 [bac558e1] OrderedCollections v1.8.1 [90014a1f] PDMats v0.11.35 [69de0a69] Parsers v2.8.3 [3a141323] PolynomialRoots v1.0.0 [f27b6e38] Polynomials v4.0.21 [aea7be01] PrecompileTools v1.3.2 [21216c6a] Preferences v1.4.3 [92933f4c] ProgressMeter v1.10.4 [dc4f5ac2] ProximalCore v0.1.2 [43287f4e] PtrArrays v1.3.0 [1fd47b50] QuadGK v2.11.2 [be4d8f0f] Quadmath v0.5.13 [3cdcf5f2] RecipesBase v1.3.4 [189a3867] Reexport v1.2.2 [ae029012] Requires v1.3.1 [708f8203] Richardson v1.4.2 [79098fc4] Rmath v0.8.0 [82193955] SCIP v0.12.7 [efcf1570] Setfield v1.1.2 [a2af1166] SortingAlgorithms v1.2.1 [276daf66] SpecialFunctions v2.5.1 [860ef19b] StableRNGs v1.0.3 [90137ffa] StaticArrays v1.9.13 [1e83bf80] StaticArraysCore v1.4.3 [10745b16] Statistics v1.11.1 [82ae8749] StatsAPI v1.7.1 [2913bbd2] StatsBase v0.34.5 [4c63d2b9] StatsFuns v1.5.0 [856f2bd8] StructTypes v1.11.0 [a759f4b9] TimerOutputs v0.5.29 [3bb67fe8] TranscodingStreams v0.11.3 [ae81ac8f] ASL_jll v0.1.3+0 ⌅ [68821587] Arpack_jll v3.5.1+1 [6e34b625] Bzip2_jll v1.0.9+0 [8fd58aa0] HiGHS_jll v1.11.0+1 [e33a78d0] Hwloc_jll v2.12.1+0 ⌅ [9cc047cb] Ipopt_jll v300.1400.1400+0 [d00139f3] METIS_jll v5.1.3+0 ⌅ [d7ed1dd3] MUMPS_seq_jll v500.600.201+0 [68e3532b] Ncurses_jll v6.5.1+0 [656ef2d0] OpenBLAS32_jll v0.3.29+0 [efe28fd5] OpenSpecFun_jll v0.5.6+0 [05236dd9] Readline_jll v8.2.13+0 [f50d1b31] Rmath_jll v0.5.1+0 [fc9abe76] SCIP_PaPILO_jll v900.200.200+0 [e5ac4fe4] SCIP_jll v900.200.200+0 ⌅ [319450e9] SPRAL_jll v2024.1.18+0 [508c9074] bliss_jll v0.77.0+1 [28df3c45] boost_jll v1.87.0+0 [1317d2d5] oneTBB_jll v2022.0.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.12.0 [b27032c2] LibCURL v0.6.4 [76f85450] LibGit2 v1.11.0 [8f399da3] Libdl v1.11.0 [37e2e46d] LinearAlgebra v1.12.0 [56ddb016] Logging v1.11.0 [d6f4376e] Markdown v1.11.0 [a63ad114] Mmap v1.11.0 [ca575930] NetworkOptions v1.3.0 [44cfe95a] Pkg v1.13.0 [de0858da] Printf v1.11.0 [9abbd945] Profile v1.11.0 [9a3f8284] Random v1.11.0 [ea8e919c] SHA v0.7.0 [9e88b42a] Serialization v1.11.0 [6462fe0b] Sockets v1.11.0 [2f01184e] SparseArrays v1.12.0 [f489334b] StyledStrings v1.11.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.3.0+1 [781609d7] GMP_jll v6.3.0+2 [deac9b47] LibCURL_jll v8.14.1+1 [e37daf67] LibGit2_jll v1.9.1+0 [29816b5a] LibSSH2_jll v1.11.3+1 [14a3606d] MozillaCACerts_jll v2025.5.20 [4536629a] OpenBLAS_jll v0.3.29+0 [05823500] OpenLibm_jll v0.8.5+0 [458c3c95] OpenSSL_jll v3.5.0+0 [efcefdf7] PCRE2_jll v10.45.0+0 [bea87d4a] SuiteSparse_jll v7.10.1+0 [83775a58] Zlib_jll v1.3.1+2 [8e850b90] libblastrampoline_jll v5.13.1+0 [8e850ede] nghttp2_jll v1.65.0+0 [3f19e933] p7zip_jll v17.5.0+2 Info Packages marked with ⌅ have new versions available but compatibility constraints restrict them from upgrading. Testing Running tests... Precompiling packages... 5596.8 ms ✓ StatsBase 2828.8 ms ✓ HypergeometricFunctions 3230.2 ms ✓ StatsFuns 10958.6 ms ✓ Distributions 4 dependencies successfully precompiled in 25 seconds. 43 already precompiled. Precompiling packages... 3725.3 ms ✓ StatsFuns → StatsFunsChainRulesCoreExt 1 dependency successfully precompiled in 5 seconds. 23 already precompiled. Precompiling packages... 5160.6 ms ✓ Distributions → DistributionsTestExt 1 dependency successfully precompiled in 6 seconds. 49 already precompiled. Precompiling packages... 5376.3 ms ✓ Distributions → DistributionsChainRulesCoreExt 1 dependency successfully precompiled in 7 seconds. 52 already precompiled. seed = 0x3c3950bff27a1de1 [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Decompostion-Invariant-Frank-Wolfe Line Search Method: Adaptive Lazification: true Lazification Tolerance: 2.0 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 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Decomposition-Invariant Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Adaptive EPSILON: 0.01 MAXITERATION: 10000 TYPE: Float64 GRADIENstep_typeYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{Boscia.MathOptBLMO{SCIP.Optimizer}} [ Info: In memory_mode memory iterates are written back into x0! ------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec ------------------------------------------------------------------------------------------------- I 1 5.220000e+00 -7.980000e+00 1.320000e+01 0.000000e+00 Inf LD 4 6.986929e-01 -1.906923e+00 2.605616e+00 9.419690e+00 4.246424e-01 LD 7 4.177870e-02 -4.111743e-01 4.529530e-01 9.464330e+00 7.396192e-01 LD 10 5.522479e-04 -5.522837e-02 5.578061e-02 9.507019e+00 1.051854e+00 LD 14 8.355764e-06 -9.012697e-03 9.021053e-03 9.562333e+00 1.464078e+00 Last 14 8.355764e-06 -9.012697e-03 9.021053e-03 9.595453e+00 1.459024e+00 ------------------------------------------------------------------------------------------------- * 1 2 -9.012697e-03 4.200000e-01 4.290127e-01 Inf 1.479200e+01 2.028123e-01 13422 23 25 14 1 0 Decomposition-Invariant Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Adaptive EPSILON: 0.008 MAXITERATION: 10000 TYPE: Float64 GRADIENstep_typeYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{Boscia.MathOptBLMO{SCIP.Optimizer}} [ Info: In memory_mode memory iterates are written back into x0! ------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec ------------------------------------------------------------------------------------------------- I 1 5.220000e+00 -7.680000e+00 1.290000e+01 0.000000e+00 Inf LD 3 1.191533e+00 -1.989654e+00 3.181187e+00 2.703227e-02 1.109785e+02 LD 6 7.021222e-02 -4.037270e-01 4.739392e-01 6.885732e-02 8.713670e+01 LD 9 4.682475e-02 -8.970643e-03 5.579539e-02 1.132564e-01 7.946574e+01 LD 16 4.500934e-02 4.133469e-02 3.674652e-03 2.166140e-01 7.386412e+01 Last 16 4.500934e-02 4.133469e-02 3.674652e-03 2.330067e-01 6.866755e+01 ------------------------------------------------------------------------------------------------- Decomposition-Invariant Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Adaptive EPSILON: 0.008 MAXITERATION: 10000 TYPE: Float64 GRADIENstep_typeYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{Boscia.MathOptBLMO{SCIP.Optimizer}} [ Info: In memory_mode memory iterates are written back into x0! ------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec ------------------------------------------------------------------------------------------------- I 1 5.420000e+00 -7.480000e+00 1.290000e+01 0.000000e+00 Inf LD 4 8.036476e-01 -1.333584e+00 2.137232e+00 4.224854e-02 9.467784e+01 LD 7 2.694206e-01 -5.488855e-02 3.243091e-01 8.255659e-02 8.479032e+01 LD 9 2.457211e-01 2.289513e-01 1.676984e-02 1.020583e-01 8.818485e+01 LD 12 2.450018e-01 2.434489e-01 1.552882e-03 1.309585e-01 9.163205e+01 Last 12 2.450018e-01 2.434489e-01 1.552882e-03 1.415939e-01 8.474939e+01 ------------------------------------------------------------------------------------------------- Decomposition-Invariant Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Adaptive EPSILON: 0.0064 MAXITERATION: 10000 TYPE: Float64 GRADIENstep_typeYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{Boscia.MathOptBLMO{SCIP.Optimizer}} [ Info: In memory_mode memory iterates are written back into x0! ------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec ------------------------------------------------------------------------------------------------- I 1 5.220000e+00 -7.380000e+00 1.260000e+01 0.000000e+00 Inf LD 4 4.876404e-01 -1.108416e+00 1.596057e+00 2.857699e-02 1.399728e+02 LD 7 1.001834e-01 -9.197009e-02 1.921534e-01 5.762968e-02 1.214652e+02 LD 9 9.011386e-02 8.315424e-02 6.959614e-03 7.659590e-02 1.174998e+02 LD 14 9.000140e-02 8.855801e-02 1.443385e-03 1.242641e-01 1.126633e+02 Last 14 9.000140e-02 8.855801e-02 1.443385e-03 1.352606e-01 1.035039e+02 ------------------------------------------------------------------------------------------------- Decomposition-Invariant Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Adaptive EPSILON: 0.0064 MAXITERATION: 10000 TYPE: Float64 GRADIENstep_typeYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{Boscia.MathOptBLMO{SCIP.Optimizer}} [ Info: In memory_mode memory iterates are written back into x0! ------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec ------------------------------------------------------------------------------------------------- I 1 5.420000e+00 -7.180000e+00 1.260000e+01 0.000000e+00 Inf LD 3 1.242008e+00 -1.525674e+00 2.767682e+00 2.850724e-02 1.052364e+02 LD 7 3.141474e-01 -4.169108e-02 3.558385e-01 8.764988e-02 7.986320e+01 LD 13 2.904000e-01 2.666266e-01 2.377333e-02 1.507425e-01 8.623976e+01 LD 21 2.900025e-01 2.881787e-01 1.823819e-03 2.366041e-01 8.875584e+01 Last 21 2.900025e-01 2.881787e-01 1.823819e-03 2.486518e-01 8.445544e+01 ------------------------------------------------------------------------------------------------- Decomposition-Invariant Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Adaptive EPSILON: 0.00512 MAXITERATION: 10000 TYPE: Float64 GRADIENstep_typeYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{Boscia.MathOptBLMO{SCIP.Optimizer}} [ Info: In memory_mode memory iterates are written back into x0! ------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec ------------------------------------------------------------------------------------------------- I 1 5.220000e+00 -7.080000e+00 1.230000e+01 0.000000e+00 Inf LD 4 7.220374e-01 -1.335262e+00 2.057300e+00 4.286210e-02 9.332254e+01 LD 8 1.364878e-01 8.658203e-02 4.990582e-02 1.018337e-01 7.855944e+01 LD 11 1.350004e-01 1.339694e-01 1.030949e-03 1.444348e-01 7.615895e+01 Last 11 1.350004e-01 1.339694e-01 1.030949e-03 1.599735e-01 6.876138e+01 ------------------------------------------------------------------------------------------------- Decomposition-Invariant Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Adaptive EPSILON: 0.00512 MAXITERATION: 10000 TYPE: Float64 GRADIENstep_typeYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{Boscia.MathOptBLMO{SCIP.Optimizer}} [ Info: In memory_mode memory iterates are written back into x0! ------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec ------------------------------------------------------------------------------------------------- I 1 5.420000e+00 -6.880000e+00 1.230000e+01 0.000000e+00 Inf LD 4 8.348150e-01 -9.817068e-01 1.816522e+00 4.266520e-02 9.375322e+01 LD 7 3.564904e-01 8.577947e-02 2.707109e-01 8.466618e-02 8.267764e+01 LD 10 3.350321e-01 3.295467e-01 5.485388e-03 1.277609e-01 7.827120e+01 LD 17 3.350006e-01 3.341410e-01 8.596316e-04 2.320296e-01 7.326651e+01 Last 17 3.350006e-01 3.341410e-01 8.596316e-04 2.487883e-01 6.833118e+01 ------------------------------------------------------------------------------------------------- Decomposition-Invariant Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Adaptive EPSILON: 0.004096000000000001 MAXITERATION: 10000 TYPE: Float64 GRADIENstep_typeYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{Boscia.MathOptBLMO{SCIP.Optimizer}} [ Info: In memory_mode memory iterates are written back into x0! ------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec ------------------------------------------------------------------------------------------------- I 1 5.220000e+00 -6.780000e+00 1.200000e+01 0.000000e+00 Inf LD 3 7.264720e-01 -1.086472e+00 1.812944e+00 2.942233e-02 1.019634e+02 LD 9 2.199767e-01 -5.275890e-02 2.727356e-01 1.252837e-01 7.183697e+01 LD 18 1.807048e-01 1.073579e-01 7.334686e-02 2.603025e-01 6.915031e+01 LD 24 1.800411e-01 1.659019e-01 1.413925e-02 3.511784e-01 6.834133e+01 LD 28 1.800028e-01 1.776984e-01 2.304347e-03 4.113293e-01 6.807198e+01 Last 28 1.800028e-01 1.776984e-01 2.304347e-03 4.280402e-01 6.541442e+01 ------------------------------------------------------------------------------------------------- Decomposition-Invariant Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Adaptive EPSILON: 0.004096000000000001 MAXITERATION: 10000 TYPE: Float64 GRADIENstep_typeYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{Boscia.MathOptBLMO{SCIP.Optimizer}} [ Info: In memory_mode memory iterates are written back into x0! ------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec ------------------------------------------------------------------------------------------------- I 1 5.420000e+00 -6.580000e+00 1.200000e+01 0.000000e+00 Inf LD 3 1.602359e+00 -1.562359e+00 3.164717e+00 3.116134e-02 9.627313e+01 LD 6 3.907227e-01 2.734791e-01 1.172436e-01 7.763085e-02 7.728886e+01 LD 14 3.801674e-01 3.519366e-01 2.823082e-02 2.041974e-01 6.856112e+01 LD 18 3.800125e-01 3.752824e-01 4.730095e-03 2.656084e-01 6.776894e+01 LD 24 3.800006e-01 3.792379e-01 7.627473e-04 3.605263e-01 6.656934e+01 Last 24 3.800006e-01 3.792379e-01 7.627473e-04 3.772913e-01 6.361132e+01 ------------------------------------------------------------------------------------------------- Decomposition-Invariant Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Adaptive EPSILON: 0.0032768000000000007 MAXITERATION: 10000 TYPE: Float64 GRADIENstep_typeYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{Boscia.MathOptBLMO{SCIP.Optimizer}} [ Info: In memory_mode memory iterates are written back into x0! ------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec ------------------------------------------------------------------------------------------------- I 1 5.220000e+00 -6.480000e+00 1.170000e+01 0.000000e+00 Inf LD 4 6.762540e-01 -8.419506e-01 1.518205e+00 4.344014e-02 9.208072e+01 LD 7 2.441754e-01 2.952834e-02 2.146471e-01 8.692437e-02 8.052978e+01 LD 10 2.250728e-01 2.100528e-01 1.501995e-02 1.307026e-01 7.650958e+01 LD 15 2.250023e-01 2.223591e-01 2.643159e-03 2.029143e-01 7.392284e+01 Last 15 2.250023e-01 2.223591e-01 2.643159e-03 2.197287e-01 6.826601e+01 ------------------------------------------------------------------------------------------------- Decomposition-Invariant Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Adaptive EPSILON: 0.0032768000000000007 MAXITERATION: 10000 TYPE: Float64 GRADIENstep_typeYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{Boscia.MathOptBLMO{SCIP.Optimizer}} [ Info: In memory_mode memory iterates are written back into x0! ------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec ------------------------------------------------------------------------------------------------- I 1 5.420000e+00 -6.280000e+00 1.170000e+01 0.000000e+00 Inf LD 3 1.191628e+00 -9.809964e-01 2.172625e+00 2.894498e-02 1.036449e+02 LD 6 4.766872e-01 -1.169566e-01 5.936438e-01 7.316716e-02 8.200400e+01 LD 13 4.290548e-01 3.665880e-01 6.246677e-02 1.782371e-01 7.293656e+01 LD 23 4.250699e-01 4.164272e-01 8.642720e-03 3.278606e-01 7.015176e+01 LD 33 4.250013e-01 4.229507e-01 2.050622e-03 4.774747e-01 6.911361e+01 Last 33 4.250013e-01 4.229507e-01 2.050622e-03 4.934334e-01 6.687833e+01 ------------------------------------------------------------------------------------------------- Decomposition-Invariant Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Adaptive EPSILON: 0.002621440000000001 MAXITERATION: 10000 TYPE: Float64 GRADIENstep_typeYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{Boscia.MathOptBLMO{SCIP.Optimizer}} [ Info: In memory_mode memory iterates are written back into x0! ------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec ------------------------------------------------------------------------------------------------- I 1 5.220000e+00 -6.180000e+00 1.140000e+01 0.000000e+00 Inf LD 3 7.956284e-01 -7.727118e-01 1.568340e+00 2.861092e-02 1.048551e+02 LD 7 3.203280e-01 6.490706e-02 2.554209e-01 9.031734e-02 7.750450e+01 LD 20 2.709746e-01 2.461936e-01 2.478097e-02 2.782237e-01 7.188461e+01 LD 34 2.700116e-01 2.630976e-01 6.913980e-03 4.882999e-01 6.962935e+01 LD 43 2.700006e-01 2.694575e-01 5.431507e-04 6.270048e-01 6.858002e+01 Last 43 2.700006e-01 2.694575e-01 5.431507e-04 6.433616e-01 6.683644e+01 ------------------------------------------------------------------------------------------------- Decomposition-Invariant Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Adaptive EPSILON: 0.002621440000000001 MAXITERATION: 10000 TYPE: Float64 GRADIENstep_typeYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{Boscia.MathOptBLMO{SCIP.Optimizer}} [ Info: In memory_mode memory iterates are written back into x0! ------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec ------------------------------------------------------------------------------------------------- I 1 5.420000e+00 -5.980000e+00 1.140000e+01 0.000000e+00 Inf LD 3 1.506491e+00 -1.171403e+00 2.677894e+00 2.889676e-02 1.038179e+02 LD 6 4.820322e-01 3.730044e-01 1.090278e-01 7.506402e-02 7.993177e+01 LD 17 4.703241e-01 4.574703e-01 1.285381e-02 2.444462e-01 6.954494e+01 Last 17 4.703241e-01 4.574703e-01 1.285381e-02 2.627998e-01 6.468803e+01 ------------------------------------------------------------------------------------------------- Decomposition-Invariant Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Adaptive EPSILON: 0.0064 MAXITERATION: 10000 TYPE: Float64 GRADIENstep_typeYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{Boscia.MathOptBLMO{SCIP.Optimizer}} [ Info: In memory_mode memory iterates are written back into x0! ------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec ------------------------------------------------------------------------------------------------- I 1 5.420000e+00 -7.180000e+00 1.260000e+01 0.000000e+00 Inf LD 4 6.972198e-01 -9.273708e-01 1.624591e+00 4.487200e-02 8.914245e+01 LD 7 3.009277e-01 1.014106e-01 1.995172e-01 8.862461e-02 7.898483e+01 LD 9 2.901335e-01 2.822875e-01 7.846009e-03 1.182920e-01 7.608290e+01 LD 14 2.900014e-01 2.887634e-01 1.238055e-03 1.902634e-01 7.358222e+01 Last 14 2.900014e-01 2.887634e-01 1.238055e-03 2.071179e-01 6.759436e+01 ------------------------------------------------------------------------------------------------- Decomposition-Invariant Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Adaptive EPSILON: 0.0064 MAXITERATION: 10000 TYPE: Float64 GRADIENstep_typeYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{Boscia.MathOptBLMO{SCIP.Optimizer}} [ Info: In memory_mode memory iterates are written back into x0! ------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec ------------------------------------------------------------------------------------------------- I 1 5.620000e+00 -6.980000e+00 1.260000e+01 0.000000e+00 Inf LD 3 1.450131e+00 -1.332124e+00 2.782255e+00 2.834836e-02 1.058262e+02 LD 7 5.134192e-01 1.690925e-01 3.443267e-01 8.593395e-02 8.145791e+01 LD 13 4.904059e-01 4.664487e-01 2.395723e-02 1.749309e-01 7.431506e+01 Last 13 4.904059e-01 4.664487e-01 2.395723e-02 1.910648e-01 6.803975e+01 ------------------------------------------------------------------------------------------------- Decomposition-Invariant Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Adaptive EPSILON: 0.002097152000000001 MAXITERATION: 10000 TYPE: Float64 GRADIENstep_typeYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{Boscia.MathOptBLMO{SCIP.Optimizer}} [ Info: In memory_mode memory iterates are written back into x0! ------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec ------------------------------------------------------------------------------------------------- I 1 5.220000e+00 -5.880000e+00 1.110000e+01 0.000000e+00 Inf LD 3 4.816832e-01 -8.134336e-02 5.630265e-01 2.942776e-02 1.019446e+02 LD 18 3.283361e-01 2.485801e-01 7.975605e-02 5.521050e-01 3.260250e+01 LD 45 3.152261e-01 3.078697e-01 7.356376e-03 9.416408e-01 4.778893e+01 LD 72 3.150035e-01 3.141449e-01 8.585150e-04 1.318788e+00 5.459556e+01 Last 72 3.150035e-01 3.141449e-01 8.585150e-04 1.334028e+00 5.397190e+01 ------------------------------------------------------------------------------------------------- Decomposition-Invariant Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Adaptive EPSILON: 0.002097152000000001 MAXITERATION: 10000 TYPE: Float64 GRADIENstep_typeYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{Boscia.MathOptBLMO{SCIP.Optimizer}} [ Info: In memory_mode memory iterates are written back into x0! ------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec ------------------------------------------------------------------------------------------------- I 1 5.420000e+00 -5.680000e+00 1.110000e+01 0.000000e+00 Inf LD 3 1.589891e+00 -1.117944e+00 2.707835e+00 2.996931e-02 1.001024e+02 LD 6 5.307028e-01 4.220046e-01 1.086982e-01 7.318507e-02 8.198393e+01 LD 18 5.154376e-01 5.049421e-01 1.049543e-02 2.436943e-01 7.386303e+01 Last 18 5.154376e-01 5.049421e-01 1.049543e-02 2.596520e-01 6.932355e+01 ------------------------------------------------------------------------------------------------- Decomposition-Invariant Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Adaptive EPSILON: 0.00512 MAXITERATION: 10000 TYPE: Float64 GRADIENstep_typeYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{Boscia.MathOptBLMO{SCIP.Optimizer}} [ Info: In memory_mode memory iterates are written back into x0! ------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec ------------------------------------------------------------------------------------------------- I 1 5.420000e+00 -6.880000e+00 1.230000e+01 0.000000e+00 Inf LD 4 6.193826e-01 -5.620230e-01 1.181406e+00 4.279349e-02 9.347216e+01 LD 7 3.390315e-01 2.313993e-01 1.076322e-01 8.483432e-02 8.251378e+01 LD 9 3.350194e-01 3.312068e-01 3.812556e-03 1.131056e-01 7.957164e+01 Last 9 3.350194e-01 3.312068e-01 3.812556e-03 1.288259e-01 6.986173e+01 ------------------------------------------------------------------------------------------------- Decomposition-Invariant Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Adaptive EPSILON: 0.00512 MAXITERATION: 10000 TYPE: Float64 GRADIENstep_typeYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{Boscia.MathOptBLMO{SCIP.Optimizer}} [ Info: In memory_mode memory iterates are written back into x0! ------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec ------------------------------------------------------------------------------------------------- I 1 5.620000e+00 -6.680000e+00 1.230000e+01 0.000000e+00 Inf LD 4 1.120960e+00 -9.334059e-01 2.054366e+00 3.877469e-02 1.031601e+02 LD 8 5.364746e-01 4.867887e-01 4.968592e-02 9.039627e-02 8.849923e+01 Last 8 5.364746e-01 4.867887e-01 4.968592e-02 1.057665e-01 7.563829e+01 ------------------------------------------------------------------------------------------------- Decomposition-Invariant Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Adaptive EPSILON: 0.00512 MAXITERATION: 10000 TYPE: Float64 GRADIENstep_typeYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{Boscia.MathOptBLMO{SCIP.Optimizer}} [ Info: In memory_mode memory iterates are written back into x0! ------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec ------------------------------------------------------------------------------------------------- I 1 5.420000e+00 -6.880000e+00 1.230000e+01 0.000000e+00 Inf LD 3 1.033475e+00 -1.184670e+00 2.218145e+00 2.715263e-02 1.104865e+02 LD 9 3.664551e-01 1.176437e-01 2.488114e-01 1.058943e-01 8.499040e+01 LD 15 3.357707e-01 3.056553e-01 3.011537e-02 1.869381e-01 8.024047e+01 LD 21 3.350092e-01 3.319214e-01 3.087804e-03 2.730867e-01 7.689864e+01 Last 21 3.350092e-01 3.319214e-01 3.087804e-03 2.892316e-01 7.260617e+01 ------------------------------------------------------------------------------------------------- Decomposition-Invariant Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Adaptive EPSILON: 0.00512 MAXITERATION: 10000 TYPE: Float64 GRADIENstep_typeYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{Boscia.MathOptBLMO{SCIP.Optimizer}} [ Info: In memory_mode memory iterates are written back into x0! ------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec ------------------------------------------------------------------------------------------------- I 1 5.620000e+00 -6.680000e+00 1.230000e+01 0.000000e+00 Inf LD 4 8.735762e-01 -4.748669e-01 1.348443e+00 4.179197e-02 9.571216e+01 LD 7 5.420516e-01 3.957352e-01 1.463164e-01 8.284578e-02 8.449435e+01 LD 9 5.350666e-01 5.252868e-01 9.779778e-03 1.096298e-01 8.209450e+01 Last 9 5.350666e-01 5.252868e-01 9.779778e-03 1.250899e-01 7.194825e+01 ------------------------------------------------------------------------------------------------- Decomposition-Invariant Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Adaptive EPSILON: 0.001677721600000001 MAXITERATION: 10000 TYPE: Float64 GRADIENstep_typeYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{Boscia.MathOptBLMO{SCIP.Optimizer}} [ Info: In memory_mode memory iterates are written back into x0! ------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec ------------------------------------------------------------------------------------------------- I 1 5.220000e+00 -5.580000e+00 1.080000e+01 0.000000e+00 Inf LD 3 1.559811e+00 -1.376425e+00 2.936236e+00 2.761514e-02 1.086361e+02 LD 6 3.934840e-01 2.368713e-01 1.566127e-01 6.857694e-02 8.749297e+01 LD 9 3.601747e-01 3.533499e-01 6.824837e-03 1.072547e-01 8.391242e+01 LD 12 3.600000e-01 3.599490e-01 5.104447e-05 1.455914e-01 8.242246e+01 Last 12 3.600000e-01 3.599490e-01 5.104447e-05 1.601937e-01 7.490930e+01 ------------------------------------------------------------------------------------------------- Decomposition-Invariant Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Adaptive EPSILON: 0.001677721600000001 MAXITERATION: 10000 TYPE: Float64 GRADIENstep_typeYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{Boscia.MathOptBLMO{SCIP.Optimizer}} [ Info: In memory_mode memory iterates are written back into x0! ------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec ------------------------------------------------------------------------------------------------- I 1 5.420000e+00 -5.380000e+00 1.080000e+01 0.000000e+00 Inf LD 3 1.652085e+00 -1.044043e+00 2.696128e+00 2.794280e-02 1.073622e+02 LD 6 5.831936e-01 4.621976e-01 1.209960e-01 6.751205e-02 8.887303e+01 Last 6 5.831936e-01 4.621976e-01 1.209960e-01 8.336005e-02 7.197692e+01 ------------------------------------------------------------------------------------------------- Decomposition-Invariant Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Adaptive EPSILON: 0.004096000000000001 MAXITERATION: 10000 TYPE: Float64 GRADIENstep_typeYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{Boscia.MathOptBLMO{SCIP.Optimizer}} [ Info: In memory_mode memory iterates are written back into x0! ------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec ------------------------------------------------------------------------------------------------- I 1 5.420000e+00 -6.580000e+00 1.200000e+01 0.000000e+00 Inf LD 3 1.269058e+00 -1.229058e+00 2.498117e+00 2.794143e-02 1.073674e+02 LD 6 4.245503e-01 -1.570720e-01 5.816222e-01 6.961507e-02 8.618824e+01 LD 10 3.851292e-01 2.416896e-01 1.434396e-01 1.261450e-01 7.927384e+01 LD 16 3.801578e-01 3.645191e-01 1.563875e-02 2.094113e-01 7.640468e+01 LD 24 3.800016e-01 3.783340e-01 1.667596e-03 3.157886e-01 7.600021e+01 Last 24 3.800016e-01 3.783340e-01 1.667596e-03 3.299288e-01 7.274297e+01 ------------------------------------------------------------------------------------------------- Decomposition-Invariant Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Adaptive EPSILON: 0.004096000000000001 MAXITERATION: 10000 TYPE: Float64 GRADIENstep_typeYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{Boscia.MathOptBLMO{SCIP.Optimizer}} [ Info: In memory_mode memory iterates are written back into x0! ------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec ------------------------------------------------------------------------------------------------- I 1 5.620000e+00 -6.380000e+00 1.200000e+01 0.000000e+00 Inf LD 3 1.836902e+00 -1.396902e+00 3.233804e+00 2.501476e-02 1.199292e+02 LD 6 5.919506e-01 4.745238e-01 1.174268e-01 6.240189e-02 9.615093e+01 Last 6 5.919506e-01 4.745238e-01 1.174268e-01 7.655742e-02 7.837255e+01 ------------------------------------------------------------------------------------------------- Decomposition-Invariant Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Adaptive EPSILON: 0.004096000000000001 MAXITERATION: 10000 TYPE: Float64 GRADIENstep_typeYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{Boscia.MathOptBLMO{SCIP.Optimizer}} [ Info: In memory_mode memory iterates are written back into x0! ------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec ------------------------------------------------------------------------------------------------- I 1 5.420000e+00 -6.580000e+00 1.200000e+01 0.000000e+00 Inf LD 3 1.059033e+00 -1.019033e+00 2.078065e+00 2.522470e-02 1.189311e+02 LD 8 4.437747e-01 -1.336635e-01 5.774382e-01 9.075843e-02 8.814608e+01 LD 13 3.836203e-01 2.106643e-01 1.729560e-01 1.594109e-01 8.155027e+01 LD 18 3.803986e-01 3.605904e-01 1.980823e-02 2.231331e-01 8.066933e+01 LD 28 3.800035e-01 3.749876e-01 5.015836e-03 3.485153e-01 8.034080e+01 LD 32 3.800007e-01 3.785828e-01 1.417884e-03 3.976868e-01 8.046533e+01 Last 32 3.800007e-01 3.785828e-01 1.417884e-03 4.119443e-01 7.768041e+01 ------------------------------------------------------------------------------------------------- Decomposition-Invariant Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Adaptive EPSILON: 0.004096000000000001 MAXITERATION: 10000 TYPE: Float64 GRADIENstep_typeYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{Boscia.MathOptBLMO{SCIP.Optimizer}} [ Info: In memory_mode memory iterates are written back into x0! ------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec ------------------------------------------------------------------------------------------------- I 1 5.620000e+00 -6.380000e+00 1.200000e+01 0.000000e+00 Inf LD 3 1.478951e+00 -1.038951e+00 2.517902e+00 2.570650e-02 1.167020e+02 LD 6 6.221232e-01 6.995473e-02 5.521684e-01 6.253484e-02 9.594651e+01 LD 11 5.829442e-01 5.262590e-01 5.668524e-02 1.257175e-01 8.749776e+01 Last 11 5.829442e-01 5.262590e-01 5.668524e-02 1.396610e-01 7.876215e+01 ------------------------------------------------------------------------------------------------- Decomposition-Invariant Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Adaptive EPSILON: 0.004096000000000001 MAXITERATION: 10000 TYPE: Float64 GRADIENstep_typeYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{Boscia.MathOptBLMO{SCIP.Optimizer}} [ Info: In memory_mode memory iterates are written back into x0! ------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec ------------------------------------------------------------------------------------------------- I 1 5.420000e+00 -6.580000e+00 1.200000e+01 0.000000e+00 Inf LD 3 1.200957e+00 -1.160957e+00 2.361915e+00 2.511608e-02 1.194454e+02 LD 6 4.444170e-01 -3.510189e-01 7.954359e-01 6.349669e-02 9.449311e+01 LD 11 3.883000e-01 2.852011e-01 1.030990e-01 1.292814e-01 8.508571e+01 LD 20 3.800911e-01 3.707247e-01 9.366377e-03 2.508190e-01 7.973877e+01 LD 30 3.800007e-01 3.789284e-01 1.072348e-03 3.875516e-01 7.740905e+01 Last 30 3.800007e-01 3.789284e-01 1.072348e-03 4.026160e-01 7.451269e+01 ------------------------------------------------------------------------------------------------- Decomposition-Invariant Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Adaptive EPSILON: 0.004096000000000001 MAXITERATION: 10000 TYPE: Float64 GRADIENstep_typeYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{Boscia.MathOptBLMO{SCIP.Optimizer}} [ Info: In memory_mode memory iterates are written back into x0! ------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec ------------------------------------------------------------------------------------------------- I 1 5.620000e+00 -6.380000e+00 1.200000e+01 0.000000e+00 Inf LD 4 8.707857e-01 -2.641553e-01 1.134941e+00 3.497334e-02 1.143729e+02 LD 7 5.849311e-01 4.761525e-01 1.087786e-01 7.433091e-02 9.417347e+01 Last 7 5.849311e-01 4.761525e-01 1.087786e-01 9.000239e-02 7.777571e+01 ------------------------------------------------------------------------------------------------- Decomposition-Invariant Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Adaptive EPSILON: 0.0013421772800000008 MAXITERATION: 10000 TYPE: Float64 GRADIENstep_typeYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{Boscia.MathOptBLMO{SCIP.Optimizer}} [ Info: In memory_mode memory iterates are written back into x0! ------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec ------------------------------------------------------------------------------------------------- I 1 5.220000e+00 -4.680000e+00 9.900000e+00 0.000000e+00 Inf LD 3 8.133416e-01 6.135316e-01 1.998100e-01 2.688125e-02 1.116019e+02 LD 5 7.650010e-01 7.645213e-01 4.797272e-04 5.255156e-02 9.514466e+01 Last 5 7.650010e-01 7.645213e-01 4.797272e-04 6.766510e-02 7.389333e+01 ------------------------------------------------------------------------------------------------- Decomposition-Invariant Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Adaptive EPSILON: 0.0013421772800000008 MAXITERATION: 10000 TYPE: Float64 GRADIENstep_typeYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{Boscia.MathOptBLMO{SCIP.Optimizer}} [ Info: In memory_mode memory iterates are written back into x0! ------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec ------------------------------------------------------------------------------------------------- I 1 4.820000e+00 -5.080000e+00 9.900000e+00 0.000000e+00 Inf LD 3 1.255219e+00 -9.677667e-01 2.222986e+00 2.652886e-02 1.130844e+02 LD 6 3.783251e-01 2.975313e-01 8.079376e-02 6.643288e-02 9.031672e+01 LD 9 3.650192e-01 3.629262e-01 2.093029e-03 1.049299e-01 8.577155e+01 LD 11 3.650001e-01 3.648694e-01 1.306652e-04 1.312724e-01 8.379524e+01 Last 11 3.650001e-01 3.648694e-01 1.306652e-04 1.468919e-01 7.488500e+01 ------------------------------------------------------------------------------------------------- Decomposition-Invariant Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Adaptive EPSILON: 0.0010737418240000006 MAXITERATION: 10000 TYPE: Float64 GRADIENstep_typeYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{Boscia.MathOptBLMO{SCIP.Optimizer}} [ Info: In memory_mode memory iterates are written back into x0! ------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec ------------------------------------------------------------------------------------------------- I 1 4.820000e+00 -4.180000e+00 9.000000e+00 0.000000e+00 Inf LD 3 1.702082e+00 -5.938421e-01 2.295924e+00 2.743797e-02 1.093375e+02 LD 6 7.912301e-01 6.836084e-01 1.076217e-01 6.671517e-02 8.993456e+01 Last 6 7.912301e-01 6.836084e-01 1.076217e-01 8.192024e-02 7.324198e+01 ------------------------------------------------------------------------------------------------- Decomposition-Invariant Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Adaptive EPSILON: 0.0010737418240000006 MAXITERATION: 10000 TYPE: Float64 GRADIENstep_typeYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{Boscia.MathOptBLMO{SCIP.Optimizer}} [ Info: In memory_mode memory iterates are written back into x0! ------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec ------------------------------------------------------------------------------------------------- I 1 4.420000e+00 -4.580000e+00 9.000000e+00 0.000000e+00 Inf LD 3 7.020339e-01 -2.197290e-01 9.217628e-01 2.643918e-02 1.134680e+02 LD 6 3.702013e-01 3.634541e-01 6.747212e-03 6.565123e-02 9.139204e+01 LD 8 3.700001e-01 3.698665e-01 1.335804e-04 9.128820e-02 8.763455e+01 Last 8 3.700001e-01 3.698665e-01 1.335804e-04 1.053494e-01 7.593775e+01 ------------------------------------------------------------------------------------------------- Decomposition-Invariant Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Adaptive EPSILON: 0.0008589934592000006 MAXITERATION: 10000 TYPE: Float64 GRADIENstep_typeYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{Boscia.MathOptBLMO{SCIP.Optimizer}} [ Info: In memory_mode memory iterates are written back into x0! ------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec ------------------------------------------------------------------------------------------------- I 1 4.420000e+00 -3.680000e+00 8.100000e+00 0.000000e+00 Inf LD 3 1.533344e+00 -3.528057e-01 1.886150e+00 2.546633e-02 1.178026e+02 LD 6 7.878171e-01 7.141508e-01 7.366633e-02 6.657403e-02 9.012523e+01 Last 6 7.878171e-01 7.141508e-01 7.366633e-02 8.220755e-02 7.298599e+01 ------------------------------------------------------------------------------------------------- Decomposition-Invariant Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Adaptive EPSILON: 0.0008589934592000006 MAXITERATION: 10000 TYPE: Float64 GRADIENstep_typeYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{Boscia.MathOptBLMO{SCIP.Optimizer}} [ Info: In memory_mode memory iterates are written back into x0! ------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec ------------------------------------------------------------------------------------------------- I 1 4.020000e+00 -4.080000e+00 8.100000e+00 0.000000e+00 Inf LD 3 6.100580e-01 -6.575302e-02 6.758110e-01 2.602419e-02 1.152774e+02 LD 6 3.750429e-01 3.721796e-01 2.863279e-03 6.525984e-02 9.194016e+01 LD 11 3.750000e-01 3.749357e-01 6.428308e-05 1.322854e-01 8.315354e+01 Last 11 3.750000e-01 3.749357e-01 6.428308e-05 1.473846e-01 7.463465e+01 ------------------------------------------------------------------------------------------------- Decomposition-Invariant Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Adaptive EPSILON: 0.0006871947673600005 MAXITERATION: 10000 TYPE: Float64 GRADIENstep_typeYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{Boscia.MathOptBLMO{SCIP.Optimizer}} [ Info: In memory_mode memory iterates are written back into x0! ------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec ------------------------------------------------------------------------------------------------- I 1 4.020000e+00 -3.180000e+00 7.200000e+00 0.000000e+00 Inf LD 3 9.369466e-01 4.645874e-01 4.723592e-01 2.751917e-02 1.090149e+02 LD 5 7.827944e-01 7.560607e-01 2.673377e-02 5.629425e-02 8.881901e+01 Last 6 7.827944e-01 7.560607e-01 2.673377e-02 8.750936e-02 6.856409e+01 ------------------------------------------------------------------------------------------------- Decomposition-Invariant Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Adaptive EPSILON: 0.0006871947673600005 MAXITERATION: 10000 TYPE: Float64 GRADIENstep_typeYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{Boscia.MathOptBLMO{SCIP.Optimizer}} [ Info: In memory_mode memory iterates are written back into x0! ------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec ------------------------------------------------------------------------------------------------- I 1 3.620000e+00 -3.580000e+00 7.200000e+00 0.000000e+00 Inf LD 3 1.080820e+00 -6.556804e-01 1.736501e+00 2.808008e-02 1.068373e+02 LD 6 3.933004e-01 3.205687e-01 7.273173e-02 7.187976e-02 8.347273e+01 LD 9 3.800322e-01 3.776994e-01 2.332757e-03 1.138267e-01 7.906756e+01 LD 12 3.800001e-01 3.798939e-01 1.061883e-04 1.580627e-01 7.591924e+01 Last 12 3.800001e-01 3.798939e-01 1.061883e-04 1.747754e-01 6.865954e+01 ------------------------------------------------------------------------------------------------- Decomposition-Invariant Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Adaptive EPSILON: 0.0032768000000000007 MAXITERATION: 10000 TYPE: Float64 GRADIENstep_typeYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{Boscia.MathOptBLMO{SCIP.Optimizer}} [ Info: In memory_mode memory iterates are written back into x0! ------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec ------------------------------------------------------------------------------------------------- I 1 5.420000e+00 -6.280000e+00 1.170000e+01 0.000000e+00 Inf LD 4 7.244550e-01 -3.678276e-01 1.092283e+00 4.251862e-02 9.407642e+01 LD 7 4.310180e-01 3.223866e-01 1.086313e-01 8.540324e-02 8.196410e+01 LD 10 4.250062e-01 4.184884e-01 6.517740e-03 1.285423e-01 7.779543e+01 LD 17 4.250004e-01 4.228928e-01 2.107648e-03 2.316978e-01 7.337145e+01 Last 17 4.250004e-01 4.228928e-01 2.107648e-03 2.486922e-01 6.835759e+01 ------------------------------------------------------------------------------------------------- Decomposition-Invariant Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Adaptive EPSILON: 0.0032768000000000007 MAXITERATION: 10000 TYPE: Float64 GRADIENstep_typeYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{Boscia.MathOptBLMO{SCIP.Optimizer}} [ Info: In memory_mode memory iterates are written back into x0! ------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec ------------------------------------------------------------------------------------------------- I 1 5.620000e+00 -6.080000e+00 1.170000e+01 0.000000e+00 Inf LD 3 1.057460e+00 -3.858088e-01 1.443269e+00 2.748869e-02 1.091358e+02 LD 10 6.531697e-01 1.982074e-01 4.549623e-01 1.278040e-01 7.824479e+01 LD 16 6.282609e-01 5.114548e-01 1.168061e-01 2.146530e-01 7.453892e+01 Last 16 6.282609e-01 5.114548e-01 1.168061e-01 2.306779e-01 6.936077e+01 ------------------------------------------------------------------------------------------------- Decomposition-Invariant Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Adaptive EPSILON: 0.0032768000000000007 MAXITERATION: 10000 TYPE: Float64 GRADIENstep_typeYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{Boscia.MathOptBLMO{SCIP.Optimizer}} [ Info: In memory_mode memory iterates are written back into x0! ------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec ------------------------------------------------------------------------------------------------- I 1 5.420000e+00 -6.280000e+00 1.170000e+01 0.000000e+00 Inf LD 3 9.268319e-01 -6.817798e-01 1.608612e+00 2.891656e-02 1.037468e+02 LD 10 4.555538e-01 3.516301e-02 4.203908e-01 1.344933e-01 7.435314e+01 LD 16 4.282500e-01 3.195623e-01 1.086877e-01 2.239995e-01 7.142871e+01 LD 21 4.252783e-01 4.120350e-01 1.324333e-02 2.986383e-01 7.031917e+01 LD 33 4.250021e-01 4.237562e-01 1.245924e-03 5.074182e-01 6.503512e+01 Last 33 4.250021e-01 4.237562e-01 1.245924e-03 5.241084e-01 6.296408e+01 ------------------------------------------------------------------------------------------------- Decomposition-Invariant Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Adaptive EPSILON: 0.0032768000000000007 MAXITERATION: 10000 TYPE: Float64 GRADIENstep_typeYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{Boscia.MathOptBLMO{SCIP.Optimizer}} [ Info: In memory_mode memory iterates are written back into x0! ------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec ------------------------------------------------------------------------------------------------- I 1 5.620000e+00 -6.080000e+00 1.170000e+01 0.000000e+00 Inf LD 3 1.072431e+00 -4.120385e-01 1.484469e+00 2.851400e-02 1.052115e+02 LD 10 6.526687e-01 2.279763e-01 4.246924e-01 1.310212e-01 7.632354e+01 LD 15 6.282050e-01 5.755972e-01 5.260786e-02 2.063558e-01 7.268999e+01 Last 15 6.282050e-01 5.755972e-01 5.260786e-02 2.233786e-01 6.715058e+01 ------------------------------------------------------------------------------------------------- Decomposition-Invariant Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Adaptive EPSILON: 0.0032768000000000007 MAXITERATION: 10000 TYPE: Float64 GRADIENstep_typeYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{Boscia.MathOptBLMO{SCIP.Optimizer}} [ Info: In memory_mode memory iterates are written back into x0! ------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec ------------------------------------------------------------------------------------------------- I 1 5.420000e+00 -6.280000e+00 1.170000e+01 0.000000e+00 Inf LD 3 1.141433e+00 -9.258551e-01 2.067288e+00 2.717065e-02 1.104133e+02 LD 7 4.622770e-01 2.115183e-01 2.507587e-01 8.753950e-02 7.996390e+01 LD 15 4.260685e-01 3.915498e-01 3.451870e-02 2.102784e-01 7.133401e+01 LD 25 4.250220e-01 4.166064e-01 8.415552e-03 3.597293e-01 6.949671e+01 LD 30 4.250019e-01 4.239408e-01 1.061171e-03 4.347326e-01 6.900793e+01 Last 30 4.250019e-01 4.239408e-01 1.061171e-03 4.517832e-01 6.640354e+01 ------------------------------------------------------------------------------------------------- Decomposition-Invariant Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Adaptive EPSILON: 0.0032768000000000007 MAXITERATION: 10000 TYPE: Float64 GRADIENstep_typeYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{Boscia.MathOptBLMO{SCIP.Optimizer}} [ Info: In memory_mode memory iterates are written back into x0! ------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec ------------------------------------------------------------------------------------------------- I 1 5.620000e+00 -6.080000e+00 1.170000e+01 0.000000e+00 Inf LD 3 1.831871e+00 -1.254299e+00 3.086170e+00 2.895131e-02 1.036222e+02 LD 6 6.384376e-01 5.201530e-01 1.182846e-01 7.380655e-02 8.129359e+01 Last 6 6.384376e-01 5.201530e-01 1.182846e-01 9.077670e-02 6.609625e+01 ------------------------------------------------------------------------------------------------- Decomposition-Invariant Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Adaptive EPSILON: 0.0032768000000000007 MAXITERATION: 10000 TYPE: Float64 GRADIENstep_typeYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{Boscia.MathOptBLMO{SCIP.Optimizer}} [ Info: In memory_mode memory iterates are written back into x0! ------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec ------------------------------------------------------------------------------------------------- I 1 5.420000e+00 -6.280000e+00 1.170000e+01 0.000000e+00 Inf LD 3 1.027912e+00 -7.991991e-01 1.827111e+00 2.857295e-02 1.049944e+02 LD 7 4.782612e-01 1.306215e-01 3.476397e-01 8.725187e-02 8.022751e+01 LD 14 4.275753e-01 3.839779e-01 4.359742e-02 1.922794e-01 7.281070e+01 LD 24 4.250337e-01 4.202360e-01 4.797660e-03 3.447335e-01 6.961900e+01 LD 35 4.250005e-01 4.243648e-01 6.357372e-04 5.057399e-01 6.920553e+01 Last 35 4.250005e-01 4.243648e-01 6.357372e-04 5.216319e-01 6.709712e+01 ------------------------------------------------------------------------------------------------- Decomposition-Invariant Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Adaptive EPSILON: 0.0032768000000000007 MAXITERATION: 10000 TYPE: Float64 GRADIENstep_typeYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{Boscia.MathOptBLMO{SCIP.Optimizer}} [ Info: In memory_mode memory iterates are written back into x0! ------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec ------------------------------------------------------------------------------------------------- I 1 5.620000e+00 -6.080000e+00 1.170000e+01 0.000000e+00 Inf LD 4 9.920202e-01 -2.939320e-01 1.285952e+00 4.542281e-02 8.806149e+01 LD 7 6.359493e-01 4.811728e-01 1.547765e-01 8.924229e-02 7.843815e+01 Last 7 6.359493e-01 4.811728e-01 1.547765e-01 1.062245e-01 6.589817e+01 ------------------------------------------------------------------------------------------------- Decomposition-Invariant Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Adaptive EPSILON: 0.0005497558138880005 MAXITERATION: 10000 TYPE: Float64 GRADIENstep_typeYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{Boscia.MathOptBLMO{SCIP.Optimizer}} [ Info: In memory_mode memory iterates are written back into x0! ------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec ------------------------------------------------------------------------------------------------- I 1 3.620000e+00 -2.680000e+00 6.300000e+00 0.000000e+00 Inf LD 3 8.814875e-01 5.722875e-01 3.091999e-01 2.780408e-02 1.078978e+02 LD 5 7.858502e-01 7.732396e-01 1.261064e-02 5.690757e-02 8.786178e+01 Last 6 7.858502e-01 7.732396e-01 1.261064e-02 8.856119e-02 6.774976e+01 ------------------------------------------------------------------------------------------------- Decomposition-Invariant Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Adaptive EPSILON: 0.0005497558138880005 MAXITERATION: 10000 TYPE: Float64 GRADIENstep_typeYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{Boscia.MathOptBLMO{SCIP.Optimizer}} [ Info: In memory_mode memory iterates are written back into x0! ------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec ------------------------------------------------------------------------------------------------- I 1 3.220000e+00 -3.080000e+00 6.300000e+00 0.000000e+00 Inf LD 3 9.355069e-01 -4.431235e-01 1.378630e+00 2.791128e-02 1.074834e+02 LD 6 3.925531e-01 3.449286e-01 4.762458e-02 7.207759e-02 8.324363e+01 LD 9 3.850089e-01 3.838750e-01 1.133925e-03 1.138097e-01 7.907936e+01 LD 12 3.850000e-01 3.849721e-01 2.790628e-05 6.190667e-01 1.938402e+01 Last 12 3.850000e-01 3.849721e-01 2.790628e-05 6.349674e-01 1.889861e+01 ------------------------------------------------------------------------------------------------- Decomposition-Invariant Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Adaptive EPSILON: 0.0004398046511104004 MAXITERATION: 10000 TYPE: Float64 GRADIENstep_typeYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{Boscia.MathOptBLMO{SCIP.Optimizer}} [ Info: In memory_mode memory iterates are written back into x0! ------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec ------------------------------------------------------------------------------------------------- I 1 3.220000e+00 -2.180000e+00 5.400000e+00 0.000000e+00 Inf LD 3 1.209073e+00 1.466751e-01 1.062398e+00 2.836933e-02 1.057480e+02 LD 6 7.939781e-01 7.641730e-01 2.980516e-02 7.005415e-02 8.564803e+01 Last 6 7.939781e-01 7.641730e-01 2.980516e-02 9.102839e-02 6.591350e+01 ------------------------------------------------------------------------------------------------- Decomposition-Invariant Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Adaptive EPSILON: 0.0004398046511104004 MAXITERATION: 10000 TYPE: Float64 GRADIENstep_typeYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{Boscia.MathOptBLMO{SCIP.Optimizer}} [ Info: In memory_mode memory iterates are written back into x0! ------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec ------------------------------------------------------------------------------------------------- I 1 2.820000e+00 -2.580000e+00 5.400000e+00 0.000000e+00 Inf LD 3 4.851850e-01 1.879404e-01 2.972446e-01 3.078235e-02 9.745846e+01 LD 5 3.911267e-01 3.772458e-01 1.388081e-02 6.052029e-02 8.261692e+01 LD 7 3.900001e-01 3.898863e-01 1.138497e-04 9.074298e-02 7.714095e+01 Last 7 3.900001e-01 3.898863e-01 1.138497e-04 1.083950e-01 6.457860e+01 ------------------------------------------------------------------------------------------------- Decomposition-Invariant Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Adaptive EPSILON: 0.00035184372088832035 MAXITERATION: 10000 TYPE: Float64 GRADIENstep_typeYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{Boscia.MathOptBLMO{SCIP.Optimizer}} [ Info: In memory_mode memory iterates are written back into x0! ------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec ------------------------------------------------------------------------------------------------- I 1 2.820000e+00 -1.680000e+00 4.500000e+00 0.000000e+00 Inf LD 3 1.204833e+00 1.827242e-01 1.022108e+00 2.761801e-02 1.086248e+02 LD 6 8.013753e-01 7.633754e-01 3.799989e-02 6.973364e-02 8.604168e+01 Last 6 8.013753e-01 7.633754e-01 3.799989e-02 8.464148e-02 7.088723e+01 ------------------------------------------------------------------------------------------------- Decomposition-Invariant Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Adaptive EPSILON: 0.00035184372088832035 MAXITERATION: 10000 TYPE: Float64 GRADIENstep_typeYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{Boscia.MathOptBLMO{SCIP.Optimizer}} [ Info: In memory_mode memory iterates are written back into x0! ------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec ------------------------------------------------------------------------------------------------- I 1 2.420000e+00 -2.080000e+00 4.500000e+00 0.000000e+00 Inf LD 3 5.169168e-01 1.626672e-01 3.542496e-01 2.653537e-02 1.130567e+02 LD 6 3.950149e-01 3.937660e-01 1.248827e-03 6.557175e-02 9.150282e+01 LD 11 3.950000e-01 3.949738e-01 2.617780e-05 1.272702e-01 8.643026e+01 Last 11 3.950000e-01 3.949738e-01 2.617780e-05 1.417664e-01 7.759244e+01 ------------------------------------------------------------------------------------------------- Decomposition-Invariant Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Adaptive EPSILON: 0.0002814749767106563 MAXITERATION: 10000 TYPE: Float64 GRADIENstep_typeYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{Boscia.MathOptBLMO{SCIP.Optimizer}} [ Info: In memory_mode memory iterates are written back into x0! ------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec ------------------------------------------------------------------------------------------------- I 1 2.420000e+00 -1.180000e+00 3.600000e+00 0.000000e+00 Inf LD 3 8.722107e-01 6.517836e-01 2.204271e-01 2.559082e-02 1.172296e+02 LD 5 8.011009e-01 7.895143e-01 1.158657e-02 5.065005e-02 9.871659e+01 Last 6 8.011009e-01 7.895143e-01 1.158657e-02 7.531355e-02 7.966694e+01 ------------------------------------------------------------------------------------------------- Decomposition-Invariant Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Adaptive EPSILON: 0.0002814749767106563 MAXITERATION: 10000 TYPE: Float64 GRADIENstep_typeYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{Boscia.MathOptBLMO{SCIP.Optimizer}} [ Info: In memory_mode memory iterates are written back into x0! ------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec ------------------------------------------------------------------------------------------------- I 1 2.020000e+00 -1.580000e+00 3.600000e+00 0.000000e+00 Inf LD 3 7.412061e-01 -1.064226e-01 8.476287e-01 2.540062e-02 1.181074e+02 LD 6 4.059825e-01 3.721404e-01 3.384212e-02 6.161927e-02 9.737214e+01 LD 9 4.000122e-01 3.989989e-01 1.013286e-03 9.821553e-02 9.163520e+01 LD 12 4.000000e-01 3.999593e-01 4.067540e-05 1.347467e-01 8.905597e+01 Last 12 4.000000e-01 3.999593e-01 4.067540e-05 1.491670e-01 8.044675e+01 ------------------------------------------------------------------------------------------------- Decomposition-Invariant Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Adaptive EPSILON: 0.00022517998136852504 MAXITERATION: 10000 TYPE: Float64 GRADIENstep_typeYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{Boscia.MathOptBLMO{SCIP.Optimizer}} [ Info: In memory_mode memory iterates are written back into x0! ------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec ------------------------------------------------------------------------------------------------- I 1 2.020000e+00 -6.800000e-01 2.700000e+00 0.000000e+00 Inf LD 3 1.034257e+00 4.584594e-01 5.757977e-01 2.462101e-02 1.218472e+02 LD 6 8.078807e-01 7.889723e-01 1.890842e-02 6.110301e-02 9.819484e+01 Last 6 8.078807e-01 7.889723e-01 1.890842e-02 7.541310e-02 7.956177e+01 ------------------------------------------------------------------------------------------------- Decomposition-Invariant Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Adaptive EPSILON: 0.00022517998136852504 MAXITERATION: 10000 TYPE: Float64 GRADIENstep_typeYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{Boscia.MathOptBLMO{SCIP.Optimizer}} [ Info: In memory_mode memory iterates are written back into x0! ------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec ------------------------------------------------------------------------------------------------- I 1 1.620000e+00 -1.080000e+00 2.700000e+00 0.000000e+00 Inf LD 3 4.660291e-01 2.834585e-01 1.825707e-01 2.461237e-02 1.218899e+02 LD 5 4.061607e-01 3.954939e-01 1.066681e-02 4.923466e-02 1.015545e+02 LD 7 4.050021e-01 4.046464e-01 3.556525e-04 7.342876e-02 9.533050e+01 LD 12 4.050000e-01 4.049938e-01 6.227348e-06 1.319702e-01 9.092962e+01 Last 12 4.050000e-01 4.049938e-01 6.227348e-06 1.478984e-01 8.113677e+01 ------------------------------------------------------------------------------------------------- Decomposition-Invariant Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Adaptive EPSILON: 0.00018014398509482005 MAXITERATION: 10000 TYPE: Float64 GRADIENstep_typeYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{Boscia.MathOptBLMO{SCIP.Optimizer}} [ Info: In memory_mode memory iterates are written back into x0! ------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec ------------------------------------------------------------------------------------------------- I 1 1.620000e+00 -1.800000e-01 1.800000e+00 0.000000e+00 Inf LD 3 8.389076e-01 7.470879e-01 9.181970e-02 2.430137e-02 1.234498e+02 LD 5 8.102821e-01 8.063585e-01 3.923688e-03 4.906037e-02 1.019153e+02 Last 6 8.102821e-01 8.063585e-01 3.923688e-03 7.676583e-02 7.815978e+01 ------------------------------------------------------------------------------------------------- Decomposition-Invariant Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Adaptive EPSILON: 0.00018014398509482005 MAXITERATION: 10000 TYPE: Float64 GRADIENstep_typeYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{Boscia.MathOptBLMO{SCIP.Optimizer}} [ Info: In memory_mode memory iterates are written back into x0! ------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec ------------------------------------------------------------------------------------------------- I 1 1.220000e+00 -5.800000e-01 1.800000e+00 0.000000e+00 Inf LD 3 5.694640e-01 1.706701e-01 3.987940e-01 2.633925e-02 1.138985e+02 LD 6 4.122814e-01 3.981658e-01 1.411566e-02 6.389816e-02 9.389942e+01 LD 9 4.100030e-01 4.096528e-01 3.501587e-04 1.006124e-01 8.945220e+01 LD 12 4.100000e-01 4.099905e-01 9.503930e-06 1.385557e-01 8.660775e+01 Last 12 4.100000e-01 4.099905e-01 9.503930e-06 1.527643e-01 7.855237e+01 ------------------------------------------------------------------------------------------------- Decomposition-Invariant Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Adaptive EPSILON: 0.00014411518807585605 MAXITERATION: 10000 TYPE: Float64 GRADIENstep_typeYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{Boscia.MathOptBLMO{SCIP.Optimizer}} [ Info: In memory_mode memory iterates are written back into x0! ------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec ------------------------------------------------------------------------------------------------- I 1 1.220000e+00 3.200000e-01 9.000000e-01 0.000000e+00 Inf LD 3 8.859180e-01 7.064209e-01 1.794971e-01 2.512715e-02 1.193928e+02 LD 6 8.157063e-01 8.105351e-01 5.171221e-03 6.333316e-02 9.473710e+01 Last 6 8.157063e-01 8.105351e-01 5.171221e-03 7.766280e-02 7.725707e+01 ------------------------------------------------------------------------------------------------- Decomposition-Invariant Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Adaptive EPSILON: 0.00014411518807585605 MAXITERATION: 10000 TYPE: Float64 GRADIENstep_typeYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{Boscia.MathOptBLMO{SCIP.Optimizer}} [ Info: In memory_mode memory iterates are written back into x0! ------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec ------------------------------------------------------------------------------------------------- I 1 8.200000e-01 -8.000000e-02 9.000000e-01 0.000000e+00 Inf LD 3 4.315703e-01 3.802252e-01 5.134511e-02 2.468095e-02 1.215512e+02 LD 5 4.152140e-01 4.127173e-01 2.496651e-03 4.870135e-02 1.026666e+02 LD 7 4.150000e-01 4.149686e-01 3.144229e-05 7.296367e-02 9.593815e+01 Last 7 4.150000e-01 4.149686e-01 3.144229e-05 8.894370e-02 7.870147e+01 ------------------------------------------------------------------------------------------------- Decomposition-Invariant Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Adaptive EPSILON: 0.00011529215046068484 MAXITERATION: 10000 TYPE: Float64 GRADIENstep_typeYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{Boscia.MathOptBLMO{SCIP.Optimizer}} [ Info: In memory_mode memory iterates are written back into x0! ------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec ------------------------------------------------------------------------------------------------- I 1 8.200000e-01 8.200000e-01 0.000000e+00 0.000000e+00 Inf Last 1 8.200000e-01 8.200000e-01 0.000000e+00 1.485087e-02 6.733613e+01 ------------------------------------------------------------------------------------------------- Decomposition-Invariant Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Adaptive EPSILON: 0.00011529215046068484 MAXITERATION: 10000 TYPE: Float64 GRADIENstep_typeYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{Boscia.MathOptBLMO{SCIP.Optimizer}} [ Info: In memory_mode memory iterates are written back into x0! ------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec ------------------------------------------------------------------------------------------------- I 1 4.200000e-01 4.200000e-01 0.000000e+00 0.000000e+00 Inf Last 1 4.200000e-01 4.200000e-01 0.000000e+00 1.514198e-02 6.604158e+01 ------------------------------------------------------------------------------------------------- 61 0 4.200000e-01 4.200000e-01 0.000000e+00 0.000000e+00 3.119400e+01 1.955504e+00 21 4 1723 1 1 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tree empty) Primal Objective: 0.42 Dual Bound: 0.42 Dual Gap (relative): 0.0 Search Statistics. Total number of nodes processed: 61 Total number of lmo calls: 1723 Total time (s): 31.195 LMO calls / sec: 55.23321045039269 Nodes / sec: 1.9554415771758293 LMO calls / node: 28.24590163934426 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: Agnostic(2) Lazification: true Lazification Tolerance: 2.0 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 -1.221692e-03 4.200000e-01 4.212217e-01 Inf 1.055000e+00 2.843602e+00 1053 7 9 34 2 1 2 3 -1.221692e-03 4.200000e-01 4.212217e-01 Inf 1.074000e+00 4.655493e+00 15 8 17 78 2 1 3 4 4.076618e-02 4.200000e-01 3.792338e-01 9.302659e+00 1.088000e+00 6.433824e+00 12 6 26 72 2 1 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Node limit reached Primal Objective: 0.42 Dual Bound: 0.0407661767662532 Dual Gap (relative): 9.302658559526282 Search Statistics. Total number of nodes processed: 7 Total number of lmo calls: 26 Total time (s): 1.089 LMO calls / sec: 23.875114784205692 Nodes / sec: 6.4279155188246095 LMO calls / node: 3.7142857142857144 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 seed = 0x0c4db8a8f39d38f1 seed = 0xac4da5ce67c20a20 seed = 0x46fb5d65bcc7609a Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Adaptive Lazification: true Lazification Tolerance: 2.0 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.314708e+00 2.525518e+00 2.108099e-01 9.107407e-02 1.689300e+01 1.775884e-01 7583 63 14 36 5 0 * 3 4 2.337704e+00 2.484997e+00 1.472935e-01 6.300777e-02 1.699400e+01 4.119101e-01 51 35 35 37 5 1 17 4 2.468139e+00 2.484997e+00 1.685801e-02 6.830251e-03 1.746400e+01 1.202474e+00 16 10 131 6 2 1 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Adaptive EPSILON: 1.0e-7 MAXITERATION: 10000 TYPE: Float64 GRADIENTTYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{Boscia.MathOptBLMO{SCIP.Optimizer}} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 4.459443e+00 9.350975e-01 3.524346e+00 0.000000e+00 Inf 1 LD 2 2.899727e+00 2.239301e+00 6.604257e-01 1.864649e+00 1.072588e+00 2 LD 5 2.484997e+00 2.484997e+00 0.000000e+00 2.136883e+00 2.339857e+00 1 Last 5 2.484997e+00 2.484997e+00 0.000000e+00 2.146492e+00 2.329382e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 5 2.484997e+00 2.484997e+00 0.000000e+00 2.151645e+00 2.323803e+00 1 ---------------------------------------------------------------------------------------------------------------- [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 2.484997206430533 Dual Bound: 2.468139195635373 Dual Gap (relative): 0.0068302512374388835 Search Statistics. Total number of nodes processed: 21 Total number of lmo calls: 137 Total time (s): 21.362 LMO calls / sec: 6.413257185656774 Nodes / sec: 0.9830540211590676 LMO calls / node: 6.523809523809524 Total number of global tightenings: 41 Global tightenings / node: 2.41 Total number of local tightenings: 50 Local tightenings / node: 2.94 Total number of potential local tightenings: 50 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Adaptive Lazification: true Lazification Tolerance: 2.0 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 8.693567e-01 1.151297e+00 2.819407e-01 3.243096e-01 1.668600e+01 1.797914e-01 7400 228 30 101 16 1 100 21 1.104285e+00 1.151297e+00 4.701283e-02 4.257311e-02 2.229900e+01 5.426252e+00 170 132 791 119 22 15 151 18 1.141693e+00 1.151297e+00 9.604198e-03 8.412240e-03 2.424700e+01 6.969934e+00 24 18 1109 6 2 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Adaptive EPSILON: 1.0e-7 MAXITERATION: 10000 TYPE: Float64 GRADIENTTYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{Boscia.MathOptBLMO{SCIP.Optimizer}} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 4.204387e+00 -1.500375e+00 5.704762e+00 0.000000e+00 Inf 1 LD 3 1.340573e+00 1.043106e+00 2.974674e-01 2.627566e-01 1.141741e+01 2 LD 6 1.151297e+00 1.151297e+00 0.000000e+00 4.296606e-01 1.396451e+01 1 Last 6 1.151297e+00 1.151297e+00 0.000000e+00 4.393187e-01 1.365751e+01 1 ---------------------------------------------------------------------------------------------------------------- PP 6 1.151297e+00 1.151297e+00 0.000000e+00 4.446220e-01 1.349461e+01 1 ---------------------------------------------------------------------------------------------------------------- [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 1.1512974429466265 Dual Bound: 1.1416932453128412 Dual Gap (relative): 0.008412240041898108 Search Statistics. Total number of nodes processed: 169 Total number of lmo calls: 1115 Total time (s): 26.395 LMO calls / sec: 42.242849024436445 Nodes / sec: 6.402727789354045 LMO calls / node: 6.597633136094674 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: 17th entry: 0.16335629912245989 29th entry: 0.16335629912245989 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Adaptive Lazification: true Lazification Tolerance: 2.0 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 8.885870e-01 1.151297e+00 2.627105e-01 2.956497e-01 2.550000e-01 1.176471e+01 252 206 30 101 16 1 100 12 1.118231e+00 1.151297e+00 3.306686e-02 2.957070e-02 5.435000e+00 2.060718e+01 40 21 766 13 6 1 121 8 1.143273e+00 1.151297e+00 8.024576e-03 7.018951e-03 6.443000e+00 2.002173e+01 36 26 921 25 8 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Adaptive EPSILON: 1.0e-7 MAXITERATION: 10000 TYPE: Float64 GRADIENTTYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{Boscia.MathOptBLMO{SCIP.Optimizer}} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 4.204387e+00 -1.500375e+00 5.704762e+00 0.000000e+00 Inf 1 LD 3 1.340573e+00 1.043106e+00 2.974674e-01 1.021610e-03 2.936541e+03 2 LD 6 1.151297e+00 1.151297e+00 0.000000e+00 5.093181e-03 1.178046e+03 1 Last 6 1.151297e+00 1.151297e+00 0.000000e+00 1.240493e-02 4.836786e+02 1 ---------------------------------------------------------------------------------------------------------------- PP 6 1.151297e+00 1.151297e+00 0.000000e+00 1.644382e-02 3.648787e+02 1 ---------------------------------------------------------------------------------------------------------------- [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 1.1512974429466265 Dual Bound: 1.143272866659543 Dual Gap (relative): 0.007018951049306297 Search Statistics. Total number of nodes processed: 129 Total number of lmo calls: 927 Total time (s): 6.472 LMO calls / sec: 143.23238566131025 Nodes / sec: 19.932014833127315 LMO calls / node: 7.186046511627907 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 seed = 0x41da6acf1c124e20 Boscia Algorithm. Parameter settings. Tree traversal strategy: Move best bound Branching strategy: Most infeasible FrankWolfe variant: Blended Pairwise Conditional Gradient Line Search Method: Adaptive Lazification: true Lazification Tolerance: 2.0 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 -2.856848e+02 -2.707116e+02 1.497327e+01 5.531081e-02 1.995300e+01 1.503533e-01 10682 115 34 4282 11 1 * 4 5 -2.856828e+02 -2.720563e+02 1.362650e+01 5.008705e-02 2.631400e+01 3.420233e-01 2132 120 136 2925 18 12 * 29 24 -2.844546e+02 -2.723163e+02 1.213835e+01 4.457446e-02 7.426100e+01 7.136990e-01 2080 119 873 2884 16 0 * 30 25 -2.844546e+02 -2.725482e+02 1.190642e+01 4.368557e-02 7.547700e+01 7.286988e-01 1208 91 899 1663 18 4 100 87 -2.834917e+02 -2.725482e+02 1.094349e+01 4.015249e-02 2.037240e+02 9.179085e-01 1663 128 2963 2235 20 15 * 109 96 -2.834338e+02 -2.739871e+02 9.446760e+00 3.447885e-02 2.204230e+02 9.300300e-01 2171 114 3237 3182 15 17 * 146 131 -2.832301e+02 -2.749957e+02 8.234374e+00 2.994364e-02 2.889060e+02 9.587894e-01 665 81 4376 905 13 13 * 147 132 -2.832154e+02 -2.757373e+02 7.478089e+00 2.712033e-02 2.898960e+02 9.624141e-01 985 96 4407 1335 10 5 200 173 -2.830001e+02 -2.757373e+02 7.262709e+00 2.633923e-02 3.855590e+02 9.674265e-01 1266 88 5862 1759 15 4 262 219 -2.826777e+02 -2.757373e+02 6.940385e+00 2.517028e-02 5.000060e+02 9.619885e-01 1269 87 7555 1788 19 7 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Adaptive EPSILON: 1.0e-7 MAXITERATION: 10000 TYPE: Float64 GRADIENTTYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{Boscia.MathOptBLMO{SCIP.Optimizer}} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 5.268256e+02 5.224774e+02 4.348203e+00 0.000000e+00 Inf 1 LD 7 -2.644225e+02 -2.658828e+02 1.460291e+00 3.008911e-01 2.326423e+01 2 LD 124 -2.777980e+02 -2.783403e+02 5.422421e-01 5.394137e-01 2.298792e+02 4 LD 166 -2.788264e+02 -2.790324e+02 2.059204e-01 5.603899e-01 2.962223e+02 5 LD 234 -2.793523e+02 -2.794299e+02 7.752629e-02 5.908177e-01 3.960612e+02 6 LD 305 -2.794147e+02 -2.794462e+02 3.150904e-02 7.098131e-01 4.296906e+02 7 LD 391 -2.794245e+02 -2.794341e+02 9.611843e-03 7.465395e-01 5.237499e+02 7 LD 487 -2.794257e+02 -2.794285e+02 2.753625e-03 7.864781e-01 6.192163e+02 8 LD 580 -2.794258e+02 -2.794265e+02 6.368908e-04 8.243713e-01 7.035665e+02 8 LD 718 -2.794258e+02 -2.794261e+02 2.235636e-04 8.924398e-01 8.045361e+02 8 LD 849 -2.794258e+02 -2.794259e+02 5.974910e-05 9.652023e-01 8.796084e+02 9 LD 930 -2.794258e+02 -2.794259e+02 2.973047e-05 1.008039e+00 9.225835e+02 9 P 1000 -2.794258e+02 -2.794259e+02 2.973047e-05 1.044643e+00 9.572645e+02 9 LD 1026 -2.794258e+02 -2.794258e+02 9.048197e-06 1.133002e+00 9.055586e+02 10 LD 1112 -2.794258e+02 -2.794258e+02 3.445550e-06 1.179021e+00 9.431554e+02 10 LD 1197 -2.794258e+02 -2.794258e+02 1.266274e-06 1.225219e+00 9.769680e+02 10 P 2000 -2.794258e+02 -2.794258e+02 1.266274e-06 1.691780e+00 1.182187e+03 10 P 3000 -2.794258e+02 -2.794258e+02 1.266274e-06 2.127873e+00 1.409859e+03 10 P 4000 -2.794258e+02 -2.794258e+02 1.266274e-06 2.574907e+00 1.553454e+03 10 P 5000 -2.794258e+02 -2.794258e+02 1.266274e-06 2.957557e+00 1.690584e+03 10 P 6000 -2.794258e+02 -2.794258e+02 1.266274e-06 3.323454e+00 1.805351e+03 10 P 7000 -2.794258e+02 -2.794258e+02 1.266274e-06 3.684121e+00 1.900046e+03 10 P 8000 -2.794258e+02 -2.794258e+02 1.266274e-06 4.039353e+00 1.980515e+03 10 P 9000 -2.794258e+02 -2.794258e+02 1.266274e-06 4.391872e+00 2.049240e+03 10 P 10000 -2.794258e+02 -2.794258e+02 1.266274e-06 4.749160e+00 2.105635e+03 10 Last 10001 -2.794258e+02 -2.794258e+02 6.005564e-07 4.753439e+00 2.103950e+03 10 ---------------------------------------------------------------------------------------------------------------- PP 10001 -2.794258e+02 -2.794258e+02 6.005564e-07 4.756731e+00 2.102494e+03 10 ---------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Time limit reached Primal Objective: -279.42582809375494 Dual Bound: -282.6777348728958 Dual Gap (relative): 0.011637817453473838 Search Statistics. Total number of nodes processed: 481 Total number of lmo calls: 7583 Total time (s): 506.702 LMO calls / sec: 14.965403728424201 Nodes / sec: 0.9492759057592036 LMO calls / node: 15.765072765072764 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: Adaptive Lazification: true Lazification Tolerance: 2.0 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 -2.702367e+02 -2.647694e+02 5.467311e+00 2.064933e-02 2.036800e+01 1.472899e-01 7745 91 14 17 3 1 * 3 4 -2.694740e+02 -2.656630e+02 3.810930e+00 1.434498e-02 2.109300e+01 3.318637e-01 79 62 35 14 6 0 * 9 10 -2.687458e+02 -2.658081e+02 2.937679e+00 1.105188e-02 2.284400e+01 8.317282e-01 73 56 85 17 4 0 13 14 -2.684016e+02 -2.658081e+02 2.593479e+00 9.756958e-03 2.407900e+01 1.121309e+00 101 77 127 24 5 1 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Postprocessing Blended Pairwise Conditional Gradient Algorithm. MEMORY_MODE: FrankWolfe.InplaceEmphasis() STEPSIZE: Adaptive EPSILON: 1.0e-7 MAXITERATION: 10000 TYPE: Float64 GRADIENTTYPE: Vector{Float64} LAZY: true sparsity_control: 2.0 LMO: Boscia.TimeTrackingLMO{Boscia.MathOptBLMO{SCIP.Optimizer}} ---------------------------------------------------------------------------------------------------------------- Type Iteration Primal Dual Dual Gap Time It/sec #ActiveSet ---------------------------------------------------------------------------------------------------------------- I 1 -1.424909e+02 -1.431743e+02 6.834228e-01 0.000000e+00 Inf 1 LD 2 -2.658081e+02 -2.658081e+02 0.000000e+00 1.839183e-01 1.087440e+01 1 Last 2 -2.658081e+02 -2.658081e+02 0.000000e+00 3.753965e-01 5.327700e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 2 -2.658081e+02 -2.658081e+02 0.000000e+00 3.809908e-01 5.249470e+00 1 ---------------------------------------------------------------------------------------------------------------- [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: -265.80814270413845 Dual Bound: -268.40162147375514 Dual Gap (relative): 0.009756957568088512 Search Statistics. Total number of nodes processed: 27 Total number of lmo calls: 132 Total time (s): 26.35 LMO calls / sec: 5.009487666034155 Nodes / sec: 1.0246679316888045 LMO calls / node: 4.888888888888889 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 Test Suite: Error During Test at /home/pkgeval/.julia/packages/Boscia/9he3V/test/runtests.jl:15 Got exception outside of a @test LoadError: invalid assignment to constant Main.groups. This redefinition may be permitted using the `const` keyword. Stacktrace: [1] top-level scope @ ~/.julia/packages/Boscia/9he3V/test/poisson.jl:192 [2] include(mapexpr::Function, mod::Module, _path::String) @ Base ./Base.jl:310 [3] macro expansion @ ~/.julia/packages/Boscia/9he3V/test/runtests.jl:26 [inlined] [4] macro expansion @ /opt/julia/share/julia/stdlib/v1.13/Test/src/Test.jl:1855 [inlined] [5] top-level scope @ ~/.julia/packages/Boscia/9he3V/test/runtests.jl:17 [6] include(mapexpr::Function, mod::Module, _path::String) @ Base ./Base.jl:310 [7] top-level scope @ none:6 [8] eval(m::Module, e::Any) @ Core ./boot.jl:489 [9] exec_options(opts::Base.JLOptions) @ Base ./client.jl:290 [10] _start() @ Base ./client.jl:557 in expression starting at /home/pkgeval/.julia/packages/Boscia/9he3V/test/poisson.jl:192 Test Summary: | Pass Error Total Time Boscia Test Suite | 127 1 128 28m15.9s Norm hyperbox | 4 4 59.5s Norm hyperbox - strong branching | 2 2 49.1s Normbox - Shadow set activation | 4 4 23.9s Normbox - strong convexity and sharpness | 6 6 18.1s Start with Active Set | 2 2 19.1s Interface - sparse poisson regression | 4 4 24.5s Different FW variants | 10 10 1m08.4s Different line search types | 8 8 2m26.4s Lazification | 5 5 21.3s DICG - Lazification | 10 10 1m17.8s DICG - warm_start | 5 5 59.9s Linear feasible | 4 4 0.1s Integer bounds | 10 10 0.1s Cube LMO | 4 4 25.1s BLMO - Strong Branching | 4 4 24.0s Probability Simplex LMO | 4 4 1m04.7s Unit Simplex LMO | 4 4 1m49.0s Indicators | 5 5 0.2s Hyperplane Aware Rounding - Probability Simplex | 2 2 24.5s Hyperplane Aware Rounding - Unit Simplex | 2 2 44.9s Following Gradient Heuristic - Unit Simplex | 6 6 1m06.6s Rounding Heuristic - Unit Simplex | 3 3 1m06.5s Probability Rounding - Unit Cube | 2 2 24.0s Probability rounding - Probability Simplex | 3 3 22.7s Sparse Regression | 2 2 24.6s Sparse Regression Group | 7 7 35.7s Poisson sparse regression | 2 2 8m29.2s Hybrid branching poisson sparse regression | 3 3 29.0s RNG of the outermost testset: Xoshiro(0x805ea3d38183f22a, 0xaecfb9fbfe0fd234, 0x15f6bce68cbce413, 0x6bf8cba433d5e6b7, 0xee6d13c5a63d2c26) ERROR: LoadError: Some tests did not pass: 127 passed, 0 failed, 1 errored, 0 broken. in expression starting at /home/pkgeval/.julia/packages/Boscia/9he3V/test/runtests.jl:15 Testing failed after 1728.89s ERROR: LoadError: Package Boscia errored during testing Stacktrace: [1] pkgerror(msg::String) @ Pkg.Types /opt/julia/share/julia/stdlib/v1.13/Pkg/src/Types.jl:68 [2] test(ctx::Pkg.Types.Context, pkgs::Vector{PackageSpec}; coverage::Bool, julia_args::Cmd, test_args::Cmd, test_fn::Nothing, force_latest_compatible_version::Bool, allow_earlier_backwards_compatible_versions::Bool, allow_reresolve::Bool) @ Pkg.Operations /opt/julia/share/julia/stdlib/v1.13/Pkg/src/Operations.jl:2423 [3] test @ /opt/julia/share/julia/stdlib/v1.13/Pkg/src/Operations.jl:2278 [inlined] [4] test(ctx::Pkg.Types.Context, pkgs::Vector{PackageSpec}; coverage::Bool, test_fn::Nothing, julia_args::Cmd, test_args::Cmd, force_latest_compatible_version::Bool, allow_earlier_backwards_compatible_versions::Bool, allow_reresolve::Bool, kwargs::@Kwargs{io::IOContext{IO}}) @ Pkg.API /opt/julia/share/julia/stdlib/v1.13/Pkg/src/API.jl:500 [5] test(pkgs::Vector{PackageSpec}; io::IOContext{IO}, kwargs::@Kwargs{julia_args::Cmd}) @ Pkg.API /opt/julia/share/julia/stdlib/v1.13/Pkg/src/API.jl:164 [6] test(pkgs::Vector{String}; kwargs::@Kwargs{julia_args::Cmd}) @ Pkg.API /opt/julia/share/julia/stdlib/v1.13/Pkg/src/API.jl:152 [7] test @ /opt/julia/share/julia/stdlib/v1.13/Pkg/src/API.jl:152 [inlined] [8] #test#81 @ /opt/julia/share/julia/stdlib/v1.13/Pkg/src/API.jl:151 [inlined] [9] top-level scope @ /PkgEval.jl/scripts/evaluate.jl:219 [10] include(mod::Module, _path::String) @ Base ./Base.jl:309 [11] exec_options(opts::Base.JLOptions) @ Base ./client.jl:324 [12] _start() @ Base ./client.jl:557 in expression starting at /PkgEval.jl/scripts/evaluate.jl:210 PkgEval failed after 1901.17s: package tests unexpectedly errored