Package evaluation of Boscia on Julia 1.13.0-DEV.771 (d887bd21ab*) started at 2025-06-22T19:27:54.474 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Set-up completed after 7.65s ################################################################################ # Installation # Installing Boscia... Resolving package versions... Installed Boscia ─ v0.1.37 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.1 [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.0+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 [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 5.07s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... Precompiling package dependencies... Precompilation completed after 116.91s ################################################################################ # Testing # Testing Boscia Status `/tmp/jl_VQzbnQ/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_VQzbnQ/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.1 [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.20 [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.0+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 [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... 10552.8 ms ✓ Distributions 1 dependency successfully precompiled in 13 seconds. 46 already precompiled. Precompiling packages... 4929.4 ms ✓ Distributions → DistributionsTestExt 1 dependency successfully precompiled in 6 seconds. 49 already precompiled. Precompiling packages... 4943.9 ms ✓ Distributions → DistributionsChainRulesCoreExt 1 dependency successfully precompiled in 6 seconds. 52 already precompiled. seed = 0x199869f990b6c5a7 [ 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 4.500000e+00 -7.500000e+00 1.200000e+01 0.000000e+00 Inf LD 3 1.611111e+00 -2.277778e+00 3.888889e+00 9.924908e+00 3.022698e-01 LD 6 9.966017e-02 -5.980259e-01 6.976861e-01 9.966769e+00 6.020005e-01 LD 10 3.793682e-04 -2.188515e-02 2.226452e-02 1.002149e+01 9.978558e-01 LD 16 2.636122e-06 -4.209840e-03 4.212476e-03 1.010035e+01 1.584104e+00 Last 16 2.636122e-06 -4.209840e-03 4.212476e-03 1.013044e+01 1.579398e+00 ------------------------------------------------------------------------------------------------- * 1 2 -4.209840e-03 5.000000e-01 5.042098e-01 Inf 1.647700e+01 1.820720e-01 14639 23 29 16 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 4.500000e+00 -7.200000e+00 1.170000e+01 0.000000e+00 Inf LD 3 9.451267e-01 -1.871767e+00 2.816894e+00 2.728408e-02 1.099542e+02 LD 7 6.926751e-02 -4.128598e-01 4.821273e-01 8.246156e-02 8.488804e+01 LD 11 4.535925e-02 1.907913e-02 2.628012e-02 1.358220e-01 8.098835e+01 LD 15 4.500647e-02 4.104454e-02 3.961933e-03 1.881279e-01 7.973299e+01 Last 15 4.500647e-02 4.104454e-02 3.961933e-03 2.021934e-01 7.418641e+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 4.700000e+00 -7.000000e+00 1.170000e+01 0.000000e+00 Inf LD 4 7.394002e-01 -1.348802e+00 2.088202e+00 3.737378e-02 1.070269e+02 LD 7 2.627667e-01 -3.387319e-02 2.966399e-01 7.405376e-02 9.452592e+01 LD 10 2.451575e-01 2.319537e-01 1.320381e-02 1.122792e-01 8.906368e+01 LD 16 2.450005e-01 2.426474e-01 2.353137e-03 1.876084e-01 8.528405e+01 Last 16 2.450005e-01 2.426474e-01 2.353137e-03 2.014988e-01 7.940492e+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 4.500000e+00 -6.900000e+00 1.140000e+01 0.000000e+00 Inf LD 4 9.752374e-01 -2.117387e+00 3.092624e+00 3.797013e-02 1.053460e+02 LD 8 1.014542e-01 1.318358e-02 8.827063e-02 9.009249e-02 8.879764e+01 LD 11 9.000209e-02 8.822221e-02 1.779877e-03 1.312650e-01 8.379996e+01 Last 11 9.000209e-02 8.822221e-02 1.779877e-03 1.477554e-01 7.444738e+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 4.700000e+00 -6.700000e+00 1.140000e+01 0.000000e+00 Inf LD 4 1.081808e+00 -1.762519e+00 2.844327e+00 4.321503e-02 9.256040e+01 LD 8 2.970638e-01 2.266604e-01 7.040343e-02 1.022445e-01 7.824384e+01 LD 12 2.900084e-01 2.808169e-01 9.191524e-03 1.628698e-01 7.367847e+01 LD 15 2.900007e-01 2.888971e-01 1.103601e-03 2.080166e-01 7.210961e+01 Last 15 2.900007e-01 2.888971e-01 1.103601e-03 2.244327e-01 6.683518e+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 4.500000e+00 -6.600000e+00 1.110000e+01 0.000000e+00 Inf LD 3 1.088508e+00 -1.632887e+00 2.721395e+00 2.935054e-02 1.022128e+02 LD 6 1.707898e-01 -4.955441e-01 6.663339e-01 7.381826e-02 8.128070e+01 LD 9 1.393617e-01 5.377068e-02 8.559104e-02 1.184179e-01 7.600204e+01 LD 14 1.350586e-01 1.257180e-01 9.340609e-03 1.884620e-01 7.428552e+01 LD 21 1.350006e-01 1.328060e-01 2.194614e-03 2.837762e-01 7.400198e+01 Last 21 1.350006e-01 1.328060e-01 2.194614e-03 2.988725e-01 7.026408e+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 4.700000e+00 -6.400000e+00 1.110000e+01 0.000000e+00 Inf LD 3 1.099186e+00 -1.360190e+00 2.459376e+00 2.767486e-02 1.084016e+02 LD 7 3.937994e-01 -2.577471e-01 6.515465e-01 8.450542e-02 8.283492e+01 LD 11 3.368075e-01 2.819564e-01 5.485102e-02 1.437615e-01 7.651560e+01 LD 18 3.350220e-01 3.222444e-01 1.277755e-02 2.456462e-01 7.327610e+01 LD 21 3.350014e-01 3.335731e-01 1.428330e-03 2.883952e-01 7.281676e+01 Last 21 3.350014e-01 3.335731e-01 1.428330e-03 3.043021e-01 6.901036e+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 4.500000e+00 -6.300000e+00 1.080000e+01 0.000000e+00 Inf LD 4 6.980068e-01 -1.243501e+00 1.941508e+00 4.226150e-02 9.464881e+01 LD 7 2.068588e-01 -1.101818e-01 3.170406e-01 8.216385e-02 8.519562e+01 LD 9 1.810445e-01 1.621955e-01 1.884909e-02 1.079923e-01 8.333925e+01 LD 12 1.800022e-01 1.783123e-01 1.689946e-03 1.487035e-01 8.069750e+01 Last 12 1.800022e-01 1.783123e-01 1.689946e-03 1.651908e-01 7.264326e+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 4.700000e+00 -6.100000e+00 1.080000e+01 0.000000e+00 Inf LD 4 8.191936e-01 -8.988781e-01 1.718072e+00 4.250383e-02 9.410916e+01 LD 7 3.969734e-01 1.493536e-01 2.476198e-01 8.496414e-02 8.238770e+01 LD 9 3.804205e-01 3.673978e-01 1.302272e-02 1.128597e-01 7.974502e+01 LD 14 3.800013e-01 3.774068e-01 2.594563e-03 1.823920e-01 7.675777e+01 Last 14 3.800013e-01 3.774068e-01 2.594563e-03 1.978278e-01 7.076862e+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 4.500000e+00 -6.000000e+00 1.050000e+01 0.000000e+00 Inf LD 3 1.047717e+00 -1.311555e+00 2.359272e+00 2.663060e-02 1.126524e+02 LD 6 2.720820e-01 -4.304484e-01 7.025304e-01 6.733649e-02 8.910473e+01 LD 10 2.304680e-01 7.928301e-02 1.511850e-01 1.233985e-01 8.103829e+01 LD 15 2.250868e-01 1.972933e-01 2.779350e-02 1.948776e-01 7.697140e+01 LD 19 2.250080e-01 2.192748e-01 5.733187e-03 2.548644e-01 7.454943e+01 LD 23 2.250004e-01 2.243444e-01 6.559632e-04 3.137873e-01 7.329807e+01 Last 23 2.250004e-01 2.243444e-01 6.559632e-04 3.318272e-01 6.931319e+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 4.700000e+00 -5.800000e+00 1.050000e+01 0.000000e+00 Inf LD 4 1.028425e+00 -1.065284e+00 2.093709e+00 4.525489e-02 8.838824e+01 LD 8 4.276806e-01 3.796292e-01 4.805143e-02 1.049738e-01 7.620950e+01 LD 15 4.250176e-01 4.206314e-01 4.386222e-03 2.037073e-01 7.363506e+01 LD 22 4.250006e-01 4.242199e-01 7.807096e-04 3.021349e-01 7.281517e+01 Last 22 4.250006e-01 4.242199e-01 7.807096e-04 3.183555e-01 6.910513e+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 4.500000e+00 -5.700000e+00 1.020000e+01 0.000000e+00 Inf LD 3 9.942580e-01 -1.105334e+00 2.099592e+00 3.072141e-02 9.765176e+01 LD 7 2.944320e-01 2.781735e-02 2.666146e-01 8.791091e-02 7.962607e+01 LD 13 2.708757e-01 2.407997e-01 3.007600e-02 1.784670e-01 7.284261e+01 LD 22 2.700060e-01 2.678094e-01 2.196589e-03 3.040929e-01 7.234631e+01 Last 22 2.700060e-01 2.678094e-01 2.196589e-03 3.191551e-01 6.893200e+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 4.700000e+00 -5.500000e+00 1.020000e+01 0.000000e+00 Inf LD 4 7.967877e-01 -4.477479e-01 1.244536e+00 4.326402e-02 9.245559e+01 LD 7 4.793012e-01 3.247627e-01 1.545385e-01 8.417583e-02 8.315926e+01 LD 9 4.701583e-01 4.545100e-01 1.564827e-02 1.114931e-01 8.072246e+01 LD 12 4.700008e-01 4.691221e-01 8.787068e-04 1.542943e-01 7.777346e+01 Last 12 4.700008e-01 4.691221e-01 8.787068e-04 1.698863e-01 7.063549e+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 4.700000e+00 -6.700000e+00 1.140000e+01 0.000000e+00 Inf LD 4 8.343024e-01 -1.328716e+00 2.163018e+00 4.287182e-02 9.330138e+01 LD 7 3.157878e-01 -2.557764e-02 3.413655e-01 8.404685e-02 8.328688e+01 LD 10 2.903766e-01 2.774069e-01 1.296970e-02 1.246488e-01 8.022537e+01 LD 16 2.900007e-01 2.889360e-01 1.064743e-03 2.034986e-01 7.862463e+01 Last 16 2.900007e-01 2.889360e-01 1.064743e-03 2.199444e-01 7.274564e+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 4.900000e+00 -6.500000e+00 1.140000e+01 0.000000e+00 Inf LD 3 1.298438e+00 -1.342237e+00 2.640675e+00 2.688237e-02 1.115973e+02 LD 8 5.078624e-01 3.022388e-01 2.056235e-01 9.691859e-02 8.254350e+01 LD 12 4.901191e-01 4.511648e-01 3.895426e-02 1.535290e-01 7.816113e+01 LD 15 4.900053e-01 4.853235e-01 4.681848e-03 1.949268e-01 7.695198e+01 Last 15 4.900053e-01 4.853235e-01 4.681848e-03 2.093048e-01 7.166582e+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 4.500000e+00 -5.400000e+00 9.900000e+00 0.000000e+00 Inf LD 3 1.110796e+00 -1.058834e+00 2.169630e+00 2.782148e-02 1.078304e+02 LD 6 3.361749e-01 9.546747e-02 2.407074e-01 7.125516e-02 8.420442e+01 LD 13 3.159968e-01 2.876425e-01 2.835430e-02 1.729470e-01 7.516754e+01 LD 23 3.150096e-01 3.126308e-01 2.378757e-03 3.155007e-01 7.289999e+01 LD 31 3.150002e-01 3.146958e-01 3.043942e-04 4.292735e-01 7.221504e+01 Last 31 3.150002e-01 3.146958e-01 3.043942e-04 4.449876e-01 6.966487e+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 4.700000e+00 -5.200000e+00 9.900000e+00 0.000000e+00 Inf LD 3 1.551651e+00 -1.106413e+00 2.658064e+00 2.752341e-02 1.089981e+02 LD 6 5.257071e-01 4.270846e-01 9.862250e-02 6.890701e-02 8.707387e+01 LD 14 5.151182e-01 4.949937e-01 2.012446e-02 1.808822e-01 7.739846e+01 LD 18 5.150129e-01 5.112645e-01 3.748391e-03 2.389292e-01 7.533613e+01 Last 18 5.150129e-01 5.112645e-01 3.748391e-03 2.562390e-01 7.024691e+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 4.700000e+00 -6.400000e+00 1.110000e+01 0.000000e+00 Inf LD 4 8.481644e-01 -1.154584e+00 2.002749e+00 4.465425e-02 8.957713e+01 LD 7 3.588261e-01 4.625045e-02 3.125757e-01 8.657699e-02 8.085289e+01 LD 10 3.351436e-01 3.077419e-01 2.740174e-02 1.300354e-01 7.690215e+01 LD 13 3.350076e-01 3.276463e-01 7.361365e-03 1.720991e-01 7.553789e+01 LD 17 3.350004e-01 3.325420e-01 2.458361e-03 2.288564e-01 7.428238e+01 Last 17 3.350004e-01 3.325420e-01 2.458361e-03 2.448071e-01 6.944244e+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 4.900000e+00 -6.200000e+00 1.110000e+01 0.000000e+00 Inf LD 3 1.293482e+00 -1.162084e+00 2.455566e+00 2.928164e-02 1.024533e+02 LD 8 5.572121e-01 3.340746e-01 2.231375e-01 9.941540e-02 8.047043e+01 LD 12 5.352900e-01 4.786030e-01 5.668697e-02 1.543023e-01 7.776940e+01 LD 15 5.350253e-01 5.292280e-01 5.797315e-03 1.957022e-01 7.664706e+01 Last 15 5.350253e-01 5.292280e-01 5.797315e-03 2.108301e-01 7.114733e+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 4.700000e+00 -6.400000e+00 1.110000e+01 0.000000e+00 Inf LD 4 6.184514e-01 -6.987027e-01 1.317154e+00 4.456276e-02 8.976104e+01 LD 7 3.387619e-01 2.141865e-01 1.245753e-01 8.523683e-02 8.212412e+01 LD 11 3.350393e-01 3.319256e-01 3.113743e-03 1.391071e-01 7.907574e+01 Last 11 3.350393e-01 3.319256e-01 3.113743e-03 1.545009e-01 7.119702e+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 4.900000e+00 -6.200000e+00 1.110000e+01 0.000000e+00 Inf LD 3 1.607273e+00 -1.308408e+00 2.915681e+00 2.774032e-02 1.081458e+02 LD 6 5.438496e-01 3.684027e-01 1.754469e-01 7.112678e-02 8.435642e+01 LD 10 5.353363e-01 5.140766e-01 2.125969e-02 1.291408e-01 7.743488e+01 Last 10 5.353363e-01 5.140766e-01 2.125969e-02 1.444666e-01 6.922018e+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 4.500000e+00 -5.100000e+00 9.600000e+00 0.000000e+00 Inf LD 3 1.113217e+00 -9.031528e-01 2.016370e+00 2.840162e-02 1.056278e+02 LD 6 3.759690e-01 2.657686e-01 1.102004e-01 7.141207e-02 8.401941e+01 LD 16 3.604975e-01 3.436333e-01 1.686414e-02 2.138219e-01 7.482864e+01 LD 29 3.600052e-01 3.555100e-01 4.495216e-03 3.921684e-01 7.394783e+01 LD 37 3.600003e-01 3.588510e-01 1.149305e-03 8.421427e-01 4.393555e+01 Last 37 3.600003e-01 3.588510e-01 1.149305e-03 8.572588e-01 4.316083e+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 4.700000e+00 -4.900000e+00 9.600000e+00 0.000000e+00 Inf LD 4 8.221932e-01 -8.857270e-02 9.107659e-01 4.392399e-02 9.106641e+01 LD 7 5.661172e-01 4.722359e-01 9.388124e-02 8.815919e-02 7.940182e+01 LD 10 5.600237e-01 5.501423e-01 9.881391e-03 1.323237e-01 7.557227e+01 Last 10 5.600237e-01 5.501423e-01 9.881391e-03 1.477825e-01 6.766702e+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 4.700000e+00 -6.100000e+00 1.080000e+01 0.000000e+00 Inf LD 4 1.085249e+00 -1.365462e+00 2.450711e+00 4.183316e-02 9.561793e+01 LD 8 3.847448e-01 3.396552e-01 4.508958e-02 9.611106e-02 8.323704e+01 LD 16 3.800172e-01 3.695016e-01 1.051566e-02 2.074760e-01 7.711736e+01 LD 19 3.800008e-01 3.771483e-01 2.852438e-03 2.509899e-01 7.570027e+01 Last 19 3.800008e-01 3.771483e-01 2.852438e-03 2.664646e-01 7.130403e+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 4.900000e+00 -5.900000e+00 1.080000e+01 0.000000e+00 Inf LD 4 1.117376e+00 -8.780871e-01 1.995463e+00 4.193477e-02 9.538624e+01 LD 7 6.096742e-01 2.748316e-01 3.348427e-01 8.136809e-02 8.602881e+01 LD 9 5.812648e-01 5.608040e-01 2.046075e-02 1.067667e-01 8.429594e+01 Last 9 5.812648e-01 5.608040e-01 2.046075e-02 1.212936e-01 7.420012e+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 4.700000e+00 -6.100000e+00 1.080000e+01 0.000000e+00 Inf LD 3 1.069823e+00 -1.175387e+00 2.245210e+00 2.639176e-02 1.136718e+02 LD 8 4.088618e-01 1.619788e-01 2.468830e-01 9.158225e-02 8.735318e+01 LD 13 3.801656e-01 3.506523e-01 2.951331e-02 1.589482e-01 8.178764e+01 LD 18 3.800047e-01 3.742972e-01 5.707523e-03 2.264115e-01 7.950125e+01 LD 21 3.800004e-01 3.793263e-01 6.741157e-04 2.682997e-01 7.827067e+01 Last 21 3.800004e-01 3.793263e-01 6.741157e-04 2.828295e-01 7.424968e+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 4.900000e+00 -5.900000e+00 1.080000e+01 0.000000e+00 Inf LD 4 1.067145e+00 -7.876519e-01 1.854797e+00 4.086392e-02 9.788586e+01 LD 7 6.026901e-01 3.134089e-01 2.892812e-01 8.236189e-02 8.499076e+01 LD 9 5.807521e-01 5.643177e-01 1.643435e-02 1.094979e-01 8.219337e+01 Last 9 5.807521e-01 5.643177e-01 1.643435e-02 1.263349e-01 7.123923e+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 4.700000e+00 -6.100000e+00 1.080000e+01 0.000000e+00 Inf LD 3 1.060101e+00 -1.179900e+00 2.240001e+00 2.662928e-02 1.126579e+02 LD 8 4.107146e-01 1.309050e-02 3.976241e-01 9.345136e-02 8.560603e+01 LD 12 3.810628e-01 3.244434e-01 5.661940e-02 1.447472e-01 8.290318e+01 LD 18 3.800154e-01 3.755406e-01 4.474806e-03 2.266045e-01 7.943356e+01 LD 24 3.800008e-01 3.789894e-01 1.011441e-03 3.094186e-01 7.756482e+01 Last 24 3.800008e-01 3.789894e-01 1.011441e-03 3.243216e-01 7.400062e+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 4.900000e+00 -5.900000e+00 1.080000e+01 0.000000e+00 Inf LD 3 1.398398e+00 -1.031292e+00 2.429690e+00 2.592701e-02 1.157095e+02 LD 7 5.996661e-01 2.205447e-01 3.791214e-01 7.746834e-02 9.035950e+01 LD 11 5.813492e-01 5.374780e-01 4.387118e-02 1.299796e-01 8.462868e+01 Last 11 5.813492e-01 5.374780e-01 4.387118e-02 1.448052e-01 7.596413e+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.500000e+00 -4.800000e+00 9.300000e+00 0.000000e+00 Inf LD 3 6.717731e-01 -1.758119e-01 8.475850e-01 2.636342e-02 1.137940e+02 LD 11 4.329977e-01 2.903740e-01 1.426237e-01 1.321516e-01 8.323776e+01 LD 27 4.064741e-01 3.871632e-01 1.931093e-02 3.444162e-01 7.839352e+01 LD 48 4.050297e-01 4.025744e-01 2.455305e-03 6.184027e-01 7.761932e+01 LD 75 4.050003e-01 4.047598e-01 2.405253e-04 9.694183e-01 7.736598e+01 Last 75 4.050003e-01 4.047598e-01 2.405253e-04 9.837773e-01 7.623677e+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.700000e+00 -4.600000e+00 9.300000e+00 0.000000e+00 Inf LD 3 1.436756e+00 -6.889115e-01 2.125667e+00 2.483684e-02 1.207883e+02 LD 6 6.151902e-01 5.327007e-01 8.248950e-02 6.336352e-02 9.469171e+01 Last 6 6.151902e-01 5.327007e-01 8.248950e-02 7.706611e-02 7.785523e+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 4.700000e+00 -5.800000e+00 1.050000e+01 0.000000e+00 Inf LD 3 1.162958e+00 -1.045145e+00 2.208104e+00 2.546220e-02 1.178217e+02 LD 7 4.505390e-01 7.670181e-02 3.738372e-01 7.843218e-02 8.924908e+01 LD 12 4.260375e-01 3.440937e-01 8.194389e-02 1.477116e-01 8.123940e+01 LD 15 4.251046e-01 4.145493e-01 1.055528e-02 1.882683e-01 7.967351e+01 LD 22 4.250005e-01 4.242752e-01 7.252629e-04 2.782490e-01 7.906588e+01 Last 22 4.250005e-01 4.242752e-01 7.252629e-04 2.925438e-01 7.520240e+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 4.900000e+00 -5.600000e+00 1.050000e+01 0.000000e+00 Inf LD 4 1.109046e+00 -6.595004e-01 1.768546e+00 3.715158e-02 1.076670e+02 LD 7 6.496173e-01 3.641414e-01 2.854758e-01 7.698969e-02 9.092126e+01 LD 10 6.251819e-01 6.114442e-01 1.373772e-02 1.193196e-01 8.380853e+01 Last 10 6.251819e-01 6.114442e-01 1.373772e-02 1.332997e-01 7.501892e+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 4.700000e+00 -5.800000e+00 1.050000e+01 0.000000e+00 Inf LD 4 1.017056e+00 -1.046192e+00 2.063248e+00 3.931029e-02 1.017545e+02 LD 8 4.274481e-01 3.819003e-01 4.554781e-02 9.041446e-02 8.848142e+01 LD 15 4.250162e-01 4.208138e-01 4.202423e-03 1.798898e-01 8.338438e+01 LD 22 4.250005e-01 4.242648e-01 7.357254e-04 2.662706e-01 8.262273e+01 Last 22 4.250005e-01 4.242648e-01 7.357254e-04 2.810303e-01 7.828337e+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 4.900000e+00 -5.600000e+00 1.050000e+01 0.000000e+00 Inf LD 3 1.424404e+00 -8.928764e-01 2.317281e+00 2.566190e-02 1.169048e+02 LD 7 6.445786e-01 3.566399e-01 2.879386e-01 7.521896e-02 9.306165e+01 LD 13 6.253377e-01 6.053888e-01 1.994892e-02 1.505597e-01 8.634451e+01 Last 13 6.253377e-01 6.053888e-01 1.994892e-02 1.651940e-01 7.869534e+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 4.700000e+00 -5.800000e+00 1.050000e+01 0.000000e+00 Inf LD 3 1.025370e+00 -9.718569e-01 1.997227e+00 2.585632e-02 1.160258e+02 LD 8 4.684271e-01 -4.642029e-02 5.148474e-01 9.103058e-02 8.788256e+01 LD 12 4.267765e-01 3.558592e-01 7.091728e-02 1.455360e-01 8.245385e+01 LD 18 4.250359e-01 4.186779e-01 6.357990e-03 2.293599e-01 7.847929e+01 LD 26 4.250003e-01 4.244493e-01 5.509734e-04 3.348815e-01 7.763940e+01 Last 26 4.250003e-01 4.244493e-01 5.509734e-04 3.498561e-01 7.431627e+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 4.900000e+00 -5.600000e+00 1.050000e+01 0.000000e+00 Inf LD 4 1.226960e+00 -8.628285e-01 2.089788e+00 3.906365e-02 1.023970e+02 LD 8 6.276498e-01 5.799249e-01 4.772488e-02 9.075702e-02 8.814745e+01 Last 8 6.276498e-01 5.799249e-01 4.772488e-02 1.057629e-01 7.564087e+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 4.700000e+00 -5.800000e+00 1.050000e+01 0.000000e+00 Inf LD 3 1.095131e+00 -9.967812e-01 2.091912e+00 2.522171e-02 1.189452e+02 LD 8 4.714402e-01 -6.531780e-02 5.367580e-01 9.131836e-02 8.760561e+01 LD 12 4.274397e-01 3.707698e-01 5.666987e-02 1.448341e-01 8.285339e+01 LD 20 4.250134e-01 4.211576e-01 3.855784e-03 2.501187e-01 7.996203e+01 LD 27 4.250003e-01 4.243828e-01 6.175122e-04 3.390200e-01 7.964132e+01 Last 27 4.250003e-01 4.243828e-01 6.175122e-04 3.533769e-01 7.640568e+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 4.900000e+00 -5.600000e+00 1.050000e+01 0.000000e+00 Inf LD 3 1.225873e+00 -7.704779e-01 1.996351e+00 2.614071e-02 1.147635e+02 LD 8 6.679172e-01 1.622498e-01 5.056674e-01 9.066805e-02 8.823394e+01 LD 12 6.268413e-01 5.556773e-01 7.116402e-02 1.432124e-01 8.379166e+01 Last 12 6.268413e-01 5.556773e-01 7.116402e-02 1.575423e-01 7.617000e+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.500000e+00 -4.500000e+00 9.000000e+00 0.000000e+00 Inf LD 3 1.192549e+00 -6.779182e-01 1.870467e+00 2.540366e-02 1.180932e+02 LD 6 4.585380e-01 4.001388e-01 5.839926e-02 6.375772e-02 9.410626e+01 LD 9 4.500066e-01 4.488488e-01 1.157785e-03 1.014129e-01 8.874608e+01 LD 11 4.500000e-01 4.499638e-01 3.622182e-05 1.275561e-01 8.623655e+01 Last 11 4.500000e-01 4.499638e-01 3.622182e-05 1.424704e-01 7.720901e+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.700000e+00 -4.300000e+00 9.000000e+00 0.000000e+00 Inf LD 3 1.514515e+00 -6.303310e-01 2.144846e+00 2.618950e-02 1.145497e+02 LD 6 6.657751e-01 5.780553e-01 8.771977e-02 6.439723e-02 9.317171e+01 Last 6 6.657751e-01 5.780553e-01 8.771977e-02 7.906690e-02 7.588510e+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 4.700000e+00 -5.500000e+00 1.020000e+01 0.000000e+00 Inf LD 3 1.239400e+00 -9.469334e-01 2.186334e+00 2.641105e-02 1.135888e+02 LD 6 5.132024e-01 -8.499203e-02 5.981945e-01 6.603690e-02 9.085829e+01 LD 11 4.744821e-01 4.026064e-01 7.187569e-02 1.317028e-01 8.352138e+01 LD 19 4.700605e-01 4.544682e-01 1.559221e-02 2.357733e-01 8.058590e+01 LD 24 4.700011e-01 4.690461e-01 9.549918e-04 3.045021e-01 7.881720e+01 Last 24 4.700011e-01 4.690461e-01 9.549918e-04 3.214020e-01 7.467284e+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 4.900000e+00 -5.300000e+00 1.020000e+01 0.000000e+00 Inf LD 4 8.963282e-01 -4.373892e-02 9.400671e-01 4.283487e-02 9.338186e+01 LD 7 6.729548e-01 5.911039e-01 8.185092e-02 8.564870e-02 8.172920e+01 Last 7 6.729548e-01 5.911039e-01 8.185092e-02 1.019424e-01 6.866624e+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 4.700000e+00 -5.500000e+00 1.020000e+01 0.000000e+00 Inf LD 3 9.991593e-01 -7.356545e-01 1.734814e+00 2.782427e-02 1.078195e+02 LD 8 5.194187e-01 4.308718e-02 4.763316e-01 9.994769e-02 8.004187e+01 LD 13 4.711409e-01 4.381214e-01 3.301947e-02 1.733167e-01 7.500721e+01 LD 20 4.700141e-01 4.651471e-01 4.866973e-03 2.754049e-01 7.262034e+01 LD 27 4.700002e-01 4.688296e-01 1.170605e-03 3.753320e-01 7.193630e+01 Last 27 4.700002e-01 4.688296e-01 1.170605e-03 3.920864e-01 6.886237e+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 4.900000e+00 -5.300000e+00 1.020000e+01 0.000000e+00 Inf LD 4 1.097535e+00 -4.336077e-01 1.531142e+00 4.278377e-02 9.349339e+01 LD 7 6.895368e-01 4.557669e-01 2.337699e-01 8.452188e-02 8.281879e+01 LD 10 6.700232e-01 6.661817e-01 3.841496e-03 1.269615e-01 7.876401e+01 Last 10 6.700232e-01 6.661817e-01 3.841496e-03 1.428091e-01 7.002356e+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 4.700000e+00 -5.500000e+00 1.020000e+01 0.000000e+00 Inf LD 4 9.982829e-01 -8.072514e-01 1.805534e+00 4.275379e-02 9.355895e+01 LD 8 4.718991e-01 4.186543e-01 5.324474e-02 9.940532e-02 8.047859e+01 LD 11 4.700048e-01 4.663116e-01 3.693166e-03 1.412929e-01 7.785247e+01 LD 14 4.700004e-01 4.687918e-01 1.208538e-03 1.821708e-01 7.685096e+01 Last 14 4.700004e-01 4.687918e-01 1.208538e-03 1.978257e-01 7.076937e+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 4.900000e+00 -5.300000e+00 1.020000e+01 0.000000e+00 Inf LD 3 1.640273e+00 -9.349414e-01 2.575214e+00 2.767664e-02 1.083947e+02 LD 6 6.792159e-01 5.710676e-01 1.081483e-01 7.081536e-02 8.472738e+01 Last 6 6.792159e-01 5.710676e-01 1.081483e-01 8.649128e-02 6.937115e+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 4.700000e+00 -5.500000e+00 1.020000e+01 0.000000e+00 Inf LD 3 1.028267e+00 -7.581279e-01 1.786395e+00 2.737292e-02 1.095974e+02 LD 9 4.979318e-01 2.848521e-01 2.130796e-01 1.135068e-01 7.929043e+01 LD 15 4.707045e-01 4.447910e-01 2.591349e-02 2.014155e-01 7.447292e+01 LD 21 4.700086e-01 4.673256e-01 2.683070e-03 2.879334e-01 7.293354e+01 LD 27 4.700002e-01 4.687394e-01 1.260824e-03 3.760408e-01 7.180072e+01 Last 27 4.700002e-01 4.687394e-01 1.260824e-03 3.931555e-01 6.867512e+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 4.900000e+00 -5.300000e+00 1.020000e+01 0.000000e+00 Inf LD 4 1.179396e+00 -5.754455e-01 1.754842e+00 4.236529e-02 9.441691e+01 LD 8 6.716018e-01 6.225877e-01 4.901414e-02 9.965786e-02 8.027465e+01 Last 8 6.716018e-01 6.225877e-01 4.901414e-02 1.148142e-01 6.967779e+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 4.700000e+00 -5.500000e+00 1.020000e+01 0.000000e+00 Inf LD 3 1.054957e+00 -7.805753e-01 1.835532e+00 3.347225e-02 8.962649e+01 LD 9 4.971626e-01 2.882200e-01 2.089426e-01 1.183117e-01 7.607024e+01 LD 16 4.705018e-01 4.265597e-01 4.394208e-02 6.368969e-01 2.512181e+01 LD 21 4.700147e-01 4.665407e-01 3.474060e-03 7.075696e-01 2.967906e+01 LD 28 4.700002e-01 4.696153e-01 3.848450e-04 8.048678e-01 3.478832e+01 Last 28 4.700002e-01 4.696153e-01 3.848450e-04 8.197002e-01 3.415883e+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 4.900000e+00 -5.300000e+00 1.020000e+01 0.000000e+00 Inf LD 4 1.062290e+00 -3.702201e-01 1.432510e+00 4.164185e-02 9.605721e+01 LD 7 6.855022e-01 4.801883e-01 2.053139e-01 8.340131e-02 8.393153e+01 LD 10 6.700120e-01 6.671287e-01 2.883319e-03 1.229377e-01 8.134202e+01 Last 10 6.700120e-01 6.671287e-01 2.883319e-03 1.375020e-01 7.272620e+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.500000e+00 -3.600000e+00 8.100000e+00 0.000000e+00 Inf LD 3 1.713214e+00 -3.962520e-01 2.109466e+00 2.787940e-02 1.076063e+02 LD 6 8.758887e-01 7.727929e-01 1.030958e-01 6.870204e-02 8.733365e+01 Last 6 8.758887e-01 7.727929e-01 1.030958e-01 8.439853e-02 7.109128e+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.100000e+00 -4.000000e+00 8.100000e+00 0.000000e+00 Inf LD 3 7.697819e-01 -9.781704e-02 8.675989e-01 2.728683e-02 1.099431e+02 LD 6 4.552402e-01 4.481845e-01 7.055726e-03 6.844252e-02 8.766480e+01 LD 8 4.550002e-01 4.547935e-01 2.067577e-04 9.526093e-02 8.397986e+01 Last 8 4.550002e-01 4.547935e-01 2.067577e-04 1.123531e-01 7.120411e+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.100000e+00 -3.100000e+00 7.200000e+00 0.000000e+00 Inf LD 3 1.551180e+00 -1.637293e-01 1.714910e+00 2.715497e-02 1.104770e+02 LD 6 8.725888e-01 8.025313e-01 7.005752e-02 6.589494e-02 9.105403e+01 Last 6 8.725888e-01 8.025313e-01 7.005752e-02 8.064399e-02 7.440108e+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.700000e+00 -3.500000e+00 7.200000e+00 0.000000e+00 Inf LD 3 6.821170e-01 4.936584e-02 6.327512e-01 2.577945e-02 1.163718e+02 LD 6 4.600565e-01 4.569376e-01 3.118905e-03 6.440973e-02 9.315363e+01 LD 11 4.600000e-01 4.599256e-01 7.443537e-05 1.256102e-01 8.757252e+01 Last 11 4.600000e-01 4.599256e-01 7.443537e-05 1.401462e-01 7.848945e+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.700000e+00 -2.600000e+00 6.300000e+00 0.000000e+00 Inf LD 3 1.012807e+00 5.733422e-01 4.394649e-01 2.542784e-02 1.179809e+02 LD 5 8.680054e-01 8.414825e-01 2.652290e-02 5.037825e-02 9.924918e+01 Last 6 8.680054e-01 8.414825e-01 2.652290e-02 7.956146e-02 7.541340e+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.300000e+00 -3.000000e+00 6.300000e+00 0.000000e+00 Inf LD 3 1.093217e+00 -4.597809e-01 1.552997e+00 2.588516e-02 1.158965e+02 LD 6 4.778052e-01 4.098543e-01 6.795084e-02 6.277556e-02 9.557859e+01 LD 9 4.650359e-01 4.627214e-01 2.314505e-03 1.102016e-01 8.166854e+01 LD 12 4.650000e-01 4.649990e-01 9.529467e-07 1.462114e-01 8.207297e+01 Last 12 4.650000e-01 4.649990e-01 9.529467e-07 1.608153e-01 7.461977e+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.300000e+00 -2.100000e+00 5.400000e+00 0.000000e+00 Inf LD 3 1.354930e+00 1.438404e-01 1.211090e+00 2.573767e-02 1.165607e+02 LD 6 8.772295e-01 8.333165e-01 4.391301e-02 6.381109e-02 9.402754e+01 Last 6 8.772295e-01 8.333165e-01 4.391301e-02 7.820857e-02 7.671794e+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.900000e+00 -2.500000e+00 5.400000e+00 0.000000e+00 Inf LD 3 6.111884e-01 1.986478e-01 4.125406e-01 2.497875e-02 1.201021e+02 LD 5 4.734676e-01 4.461337e-01 2.733381e-02 4.949403e-02 1.010223e+02 LD 7 4.700138e-01 4.687008e-01 1.313012e-03 7.424402e-02 9.428369e+01 LD 12 4.700000e-01 4.699734e-01 2.656414e-05 1.341443e-01 8.945593e+01 Last 12 4.700000e-01 4.699734e-01 2.656414e-05 1.489232e-01 8.057846e+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 4.700000e+00 -5.200000e+00 9.900000e+00 0.000000e+00 Inf LD 3 1.091294e+00 -6.308743e-01 1.722169e+00 2.848121e-02 1.053326e+02 LD 7 5.526462e-01 2.571447e-01 2.955015e-01 7.913454e-02 8.845695e+01 LD 14 5.161993e-01 4.873971e-01 2.880221e-02 1.719118e-01 8.143709e+01 LD 22 5.150194e-01 5.115930e-01 3.426402e-03 2.793848e-01 7.874444e+01 Last 22 5.150194e-01 5.115930e-01 3.426402e-03 2.940385e-01 7.482014e+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 4.900000e+00 -5.000000e+00 9.900000e+00 0.000000e+00 Inf LD 3 1.749702e+00 -9.044160e-01 2.654118e+00 2.643370e-02 1.134915e+02 LD 6 7.256095e-01 6.270941e-01 9.851533e-02 6.527135e-02 9.192395e+01 Last 6 7.256095e-01 6.270941e-01 9.851533e-02 8.041084e-02 7.461681e+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 4.700000e+00 -5.200000e+00 9.900000e+00 0.000000e+00 Inf LD 3 1.058377e+00 -5.962559e-01 1.654633e+00 2.583831e-02 1.161067e+02 LD 8 5.686461e-01 1.075589e-01 4.610872e-01 8.948215e-02 8.940330e+01 LD 14 5.170304e-01 4.661659e-01 5.086455e-02 1.668740e-01 8.389561e+01 LD 22 5.150257e-01 5.092279e-01 5.797802e-03 2.709466e-01 8.119680e+01 LD 29 5.150008e-01 5.143331e-01 6.677007e-04 3.630948e-01 7.986894e+01 Last 29 5.150008e-01 5.143331e-01 6.677007e-04 3.777562e-01 7.676909e+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 4.900000e+00 -5.000000e+00 9.900000e+00 0.000000e+00 Inf LD 4 9.629049e-01 2.288471e-02 9.400201e-01 3.809076e-02 1.050123e+02 LD 7 7.196237e-01 6.267892e-01 9.283454e-02 7.621789e-02 9.184196e+01 Last 7 7.196237e-01 6.267892e-01 9.283454e-02 9.152642e-02 7.648064e+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 4.700000e+00 -5.200000e+00 9.900000e+00 0.000000e+00 Inf LD 3 9.876372e-01 -5.208685e-01 1.508506e+00 2.639288e-02 1.136670e+02 LD 9 5.528254e-01 3.165074e-01 2.363180e-01 1.051309e-01 8.560754e+01 LD 17 5.157976e-01 4.907041e-01 2.509354e-02 2.079742e-01 8.174091e+01 LD 27 5.150091e-01 5.126976e-01 2.311516e-03 3.396328e-01 7.949763e+01 Last 27 5.150091e-01 5.126976e-01 2.311516e-03 3.542345e-01 7.622070e+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 4.900000e+00 -5.000000e+00 9.900000e+00 0.000000e+00 Inf LD 4 1.006060e+00 -6.098445e-02 1.067045e+00 4.037537e-02 9.907029e+01 LD 7 7.225143e-01 5.994362e-01 1.230780e-01 7.863670e-02 8.901696e+01 Last 7 7.225143e-01 5.994362e-01 1.230780e-01 9.336150e-02 7.497737e+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 4.700000e+00 -5.200000e+00 9.900000e+00 0.000000e+00 Inf LD 3 1.017344e+00 -5.527562e-01 1.570100e+00 2.494865e-02 1.202470e+02 LD 9 5.508672e-01 3.232062e-01 2.276610e-01 1.052840e-01 8.548310e+01 LD 16 5.157398e-01 4.716414e-01 4.409846e-02 1.951478e-01 8.198913e+01 LD 21 5.150525e-01 5.094167e-01 5.635767e-03 2.591407e-01 8.103705e+01 LD 29 5.150008e-01 5.143062e-01 6.946238e-04 3.620464e-01 8.010022e+01 Last 29 5.150008e-01 5.143062e-01 6.946238e-04 3.765190e-01 7.702135e+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 4.900000e+00 -5.000000e+00 9.900000e+00 0.000000e+00 Inf LD 3 1.739332e+00 -8.937857e-01 2.633117e+00 2.512865e-02 1.193856e+02 LD 6 7.251361e-01 6.270838e-01 9.805237e-02 6.653069e-02 9.018395e+01 Last 6 7.251361e-01 6.270838e-01 9.805237e-02 8.093706e-02 7.413167e+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 4.700000e+00 -5.200000e+00 9.900000e+00 0.000000e+00 Inf LD 3 1.051965e+00 -5.894878e-01 1.641453e+00 2.594937e-02 1.156098e+02 LD 8 5.697219e-01 9.869718e-02 4.710247e-01 9.112621e-02 8.779033e+01 LD 14 5.169861e-01 4.662544e-01 5.073169e-02 1.700685e-01 8.231977e+01 LD 22 5.150238e-01 5.093700e-01 5.653784e-03 2.702731e-01 8.139915e+01 LD 29 5.150007e-01 5.143703e-01 6.304127e-04 3.620659e-01 8.009591e+01 Last 29 5.150007e-01 5.143703e-01 6.304127e-04 3.763569e-01 7.705452e+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 4.900000e+00 -5.000000e+00 9.900000e+00 0.000000e+00 Inf LD 4 9.557518e-01 3.721623e-02 9.185356e-01 3.792868e-02 1.054611e+02 LD 7 7.192134e-01 6.313123e-01 8.790115e-02 7.771213e-02 9.007603e+01 Last 7 7.192134e-01 6.313123e-01 8.790115e-02 9.290700e-02 7.534416e+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 4.700000e+00 -5.200000e+00 9.900000e+00 0.000000e+00 Inf LD 3 9.830638e-01 -5.159125e-01 1.498976e+00 2.710015e-02 1.107005e+02 LD 9 5.531408e-01 3.154151e-01 2.377257e-01 1.071280e-01 8.401164e+01 LD 17 5.157717e-01 4.910958e-01 2.467590e-02 2.173220e-01 7.822492e+01 LD 27 5.150084e-01 5.127850e-01 2.223387e-03 3.479697e-01 7.759297e+01 Last 27 5.150084e-01 5.127850e-01 2.223387e-03 3.626105e-01 7.446006e+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 4.900000e+00 -5.000000e+00 9.900000e+00 0.000000e+00 Inf LD 4 9.984490e-01 -4.648929e-02 1.044938e+00 3.909975e-02 1.023024e+02 LD 7 7.219525e-01 6.042705e-01 1.176820e-01 7.587374e-02 9.225853e+01 Last 7 7.219525e-01 6.042705e-01 1.176820e-01 9.054292e-02 7.731140e+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.900000e+00 -1.600000e+00 4.500000e+00 0.000000e+00 Inf LD 3 9.187715e-01 7.650685e-01 1.537030e-01 2.483318e-02 1.208061e+02 LD 5 8.751195e-01 8.714239e-01 3.695634e-03 5.031159e-02 9.938068e+01 Last 6 8.751195e-01 8.714239e-01 3.695634e-03 7.658260e-02 7.834677e+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.500000e+00 -2.000000e+00 4.500000e+00 0.000000e+00 Inf LD 3 8.237006e-01 -6.043591e-02 8.841366e-01 2.692333e-02 1.114275e+02 LD 6 4.782943e-01 4.535554e-01 2.473896e-02 6.731856e-02 8.912846e+01 LD 9 4.750015e-01 4.746102e-01 3.912721e-04 1.060272e-01 8.488391e+01 LD 11 4.750000e-01 4.749964e-01 3.588514e-06 1.329199e-01 8.275658e+01 Last 11 4.750000e-01 4.749964e-01 3.588514e-06 1.481713e-01 7.423841e+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.500000e+00 -1.100000e+00 3.600000e+00 0.000000e+00 Inf LD 3 1.207436e+00 3.907153e-01 8.167209e-01 2.665440e-02 1.125518e+02 LD 6 8.850734e-01 8.547803e-01 3.029314e-02 6.587874e-02 9.107642e+01 Last 6 8.850734e-01 8.547803e-01 3.029314e-02 8.041209e-02 7.461565e+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.100000e+00 -1.500000e+00 3.600000e+00 0.000000e+00 Inf LD 3 5.772120e-01 2.946009e-01 2.826112e-01 2.514389e-02 1.193133e+02 LD 6 4.800116e-01 4.790245e-01 9.870942e-04 6.435955e-02 9.322626e+01 LD 11 4.800000e-01 4.799794e-01 2.062334e-05 1.264129e-01 8.701643e+01 Last 11 4.800000e-01 4.799794e-01 2.062334e-05 1.415061e-01 7.773519e+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.100000e+00 -6.000000e-01 2.700000e+00 0.000000e+00 Inf LD 3 9.389413e-01 7.741687e-01 1.647725e-01 2.671393e-02 1.123010e+02 LD 5 8.858161e-01 8.771862e-01 8.629980e-03 5.433127e-02 9.202803e+01 Last 6 8.858161e-01 8.771862e-01 8.629980e-03 8.285933e-02 7.241189e+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.700000e+00 -1.000000e+00 2.700000e+00 0.000000e+00 Inf LD 3 7.405811e-01 1.055848e-01 6.349963e-01 2.797223e-02 1.072492e+02 LD 6 4.894644e-01 4.641692e-01 2.529517e-02 6.671425e-02 8.993581e+01 LD 9 4.850090e-01 4.842542e-01 7.548529e-04 1.044380e-01 8.617551e+01 LD 12 4.850000e-01 4.849699e-01 3.011112e-05 1.434544e-01 8.365026e+01 Last 12 4.850000e-01 4.849699e-01 3.011112e-05 1.597089e-01 7.513668e+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.700000e+00 -1.000000e-01 1.800000e+00 0.000000e+00 Inf LD 3 1.042625e+00 6.592409e-01 3.833839e-01 2.739466e-02 1.095104e+02 LD 6 8.919096e-01 8.793507e-01 1.255888e-02 6.716156e-02 8.933681e+01 Last 6 8.919096e-01 8.793507e-01 1.255888e-02 8.314618e-02 7.216206e+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.300000e+00 -5.000000e-01 1.800000e+00 0.000000e+00 Inf LD 3 5.305352e-01 4.091981e-01 1.213371e-01 2.578230e-02 1.163589e+02 LD 5 4.907658e-01 4.836996e-01 7.066205e-03 5.121895e-02 9.762012e+01 LD 7 4.900013e-01 4.897684e-01 2.329456e-04 7.739899e-02 9.044046e+01 LD 11 4.900000e-01 4.899849e-01 1.508023e-05 1.266343e-01 8.686427e+01 Last 11 4.900000e-01 4.899849e-01 1.508023e-05 1.413533e-01 7.781919e+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 4.900000e+00 -6.200000e+00 1.110000e+01 0.000000e+00 Inf LD 3 1.539632e+00 -1.264208e+00 2.803840e+00 2.635373e-02 1.138359e+02 LD 6 5.556056e-01 1.156356e-01 4.399700e-01 6.791469e-02 8.834614e+01 LD 10 5.369094e-01 4.465165e-01 9.039289e-02 1.215864e-01 8.224607e+01 LD 15 5.350130e-01 5.237209e-01 1.129216e-02 1.893480e-01 7.921922e+01 Last 15 5.350130e-01 5.237209e-01 1.129216e-02 2.046279e-01 7.330378e+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.100000e+00 -6.000000e+00 1.110000e+01 0.000000e+00 Inf LD 4 1.460941e+00 -1.127699e+00 2.588640e+00 3.785000e-02 1.056803e+02 LD 8 7.399799e-01 6.900423e-01 4.993764e-02 8.960692e-02 8.927882e+01 Last 8 7.399799e-01 6.900423e-01 4.993764e-02 1.038412e-01 7.704070e+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.300000e+00 4.000000e-01 9.000000e-01 0.000000e+00 Inf LD 3 9.001862e-01 8.796293e-01 2.055691e-02 2.573041e-02 1.165936e+02 LD 5 8.950011e-01 8.948500e-01 1.511511e-04 5.235575e-02 9.550049e+01 Last 6 8.950011e-01 8.948500e-01 1.511511e-04 7.994197e-02 7.505444e+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 9.000000e-01 0.000000e+00 9.000000e-01 0.000000e+00 Inf LD 3 5.571523e-01 3.975908e-01 1.595615e-01 2.698095e-02 1.111896e+02 LD 6 4.954051e-01 4.917483e-01 3.656792e-03 6.826101e-02 8.789790e+01 LD 9 4.950001e-01 4.949656e-01 3.449742e-05 1.065181e-01 8.449270e+01 Last 9 4.950001e-01 4.949656e-01 3.449742e-05 1.211882e-01 7.426467e+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 9.000000e-01 9.000000e-01 0.000000e+00 0.000000e+00 Inf Last 1 9.000000e-01 9.000000e-01 0.000000e+00 1.526063e-02 6.552811e+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 5.000000e-01 5.000000e-01 0.000000e+00 0.000000e+00 Inf Last 1 5.000000e-01 5.000000e-01 0.000000e+00 1.598854e-02 6.254480e+01 ------------------------------------------------------------------------------------------------- 85 0 5.000000e-01 5.000000e-01 0.000000e+00 0.000000e+00 3.786500e+01 2.244817e+00 23 4 2452 1 1 0 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Optimal (tree empty) Primal Objective: 0.49999999999999994 Dual Bound: 0.49999999999999994 Dual Gap (relative): 0.0 Search Statistics. Total number of nodes processed: 85 Total number of lmo calls: 2452 Total time (s): 37.866 LMO calls / sec: 64.7546611736122 Nodes / sec: 2.2447578302434903 LMO calls / node: 28.847058823529412 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 -6.776078e-03 5.000000e-01 5.067761e-01 Inf 1.017000e+00 2.949853e+00 1015 10 11 65 2 1 2 3 -6.776078e-03 5.000000e-01 5.067761e-01 Inf 1.029000e+00 4.859086e+00 10 5 18 41 2 1 3 4 4.461187e-02 5.000000e-01 4.553881e-01 1.020778e+01 1.041000e+00 6.724304e+00 10 6 26 28 2 1 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Node limit reached Primal Objective: 0.49999999999999994 Dual Bound: 0.04461186712171719 Dual Gap (relative): 10.207780177319645 Search Statistics. Total number of nodes processed: 7 Total number of lmo calls: 26 Total time (s): 1.042 LMO calls / sec: 24.95201535508637 Nodes / sec: 6.717850287907869 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 = 0x0eebb3816b3d9c0f seed = 0xec53e8fcbd90c803 seed = 0xb5404cafd7ade995 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.341740e+00 2.454668e+00 1.129284e-01 4.822413e-02 1.717400e+01 1.746827e-01 7681 44 10 28 1 0 7 0 2.454668e+00 2.454668e+00 0.000000e+00 0.000000e+00 1.729100e+01 4.048349e-01 8 5 32 0 1 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 ---------------------------------------------------------------------------------------------------------------- Last 0 2.454668e+00 2.454668e+00 0.000000e+00 2.209507e-02 0.000000e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 0 2.454668e+00 2.454668e+00 0.000000e+00 1.988923e+00 0.000000e+00 1 ---------------------------------------------------------------------------------------------------------------- [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tree empty) Primal Objective: 2.4546682571331155 Dual Bound: 2.4546682571331155 Dual Gap (relative): 0.0 Search Statistics. Total number of nodes processed: 7 Total number of lmo calls: 36 Total time (s): 21.078 LMO calls / sec: 1.707941929974381 Nodes / sec: 0.33209981971724073 LMO calls / node: 5.142857142857143 Total number of global tightenings: 47 Global tightenings / node: 6.71 Total number of local tightenings: 48 Local tightenings / node: 6.86 Total number of potential local tightenings: 48 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 1.240952e+00 1.838568e+00 5.976157e-01 4.815784e-01 1.686800e+01 1.778516e-01 7660 242 34 96 19 1 * 3 4 1.261683e+00 1.820214e+00 5.585315e-01 4.426878e-01 1.717900e+01 4.074742e-01 93 70 72 34 10 0 100 45 1.615702e+00 1.820214e+00 2.045118e-01 1.265777e-01 2.557500e+01 5.669599e+00 24 17 1182 17 12 2 200 45 1.684748e+00 1.820214e+00 1.354662e-01 8.040743e-02 2.838400e+01 8.631623e+00 31 23 1647 27 12 2 300 45 1.735706e+00 1.820214e+00 8.450847e-02 4.868825e-02 3.104700e+01 1.111218e+01 46 35 2100 26 6 0 400 43 1.773811e+00 1.820214e+00 4.640297e-02 2.616004e-02 3.390200e+01 1.306708e+01 33 24 2598 23 5 0 477 38 1.805117e+00 1.820214e+00 1.509671e-02 8.363286e-03 3.615500e+01 1.424423e+01 8 6 2987 0 1 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 5.512430e+00 -1.123240e+00 6.635670e+00 0.000000e+00 Inf 1 LD 3 2.073402e+00 1.711154e+00 3.622483e-01 2.690577e-01 1.115003e+01 2 LD 6 1.820214e+00 1.820214e+00 0.000000e+00 4.480759e-01 1.339059e+01 1 Last 6 1.820214e+00 1.820214e+00 0.000000e+00 4.562313e-01 1.315122e+01 1 ---------------------------------------------------------------------------------------------------------------- PP 6 1.820214e+00 1.820214e+00 0.000000e+00 4.624103e-01 1.297549e+01 1 ---------------------------------------------------------------------------------------------------------------- [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 1.82021398488449 Dual Bound: 1.8051172722562137 Dual Gap (relative): 0.008363286341727276 Search Statistics. Total number of nodes processed: 515 Total number of lmo calls: 2993 Total time (s): 38.377 LMO calls / sec: 77.98942074680147 Nodes / sec: 13.419496052323005 LMO calls / node: 5.8116504854368936 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: 1 Non zero entries: 2th entry: 0.16874575773445724 40th entry: 0.16874575773445724 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 1.302756e+00 1.838568e+00 5.358122e-01 4.112914e-01 2.970000e-01 1.010101e+01 294 241 34 96 19 1 * 3 4 1.320067e+00 1.820214e+00 5.001471e-01 3.788801e-01 5.930000e-01 1.180438e+01 88 68 72 34 10 0 100 26 1.644376e+00 1.820214e+00 1.758385e-01 1.069333e-01 8.882000e+00 1.418599e+01 34 25 1158 23 12 1 200 19 1.758763e+00 1.820214e+00 6.145071e-02 3.493973e-02 1.327800e+01 1.649345e+01 39 28 1849 28 11 1 254 17 1.802333e+00 1.820214e+00 1.788079e-02 9.920912e-03 1.569800e+01 1.726335e+01 35 25 2259 33 12 2 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- 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.512430e+00 -1.123240e+00 6.635670e+00 0.000000e+00 Inf 1 LD 3 2.073402e+00 1.711154e+00 3.622483e-01 1.460877e-03 2.053561e+03 2 LD 6 1.820214e+00 1.820214e+00 0.000000e+00 5.987235e-03 1.002132e+03 1 Last 6 1.820214e+00 1.820214e+00 0.000000e+00 1.453389e-02 4.128281e+02 1 ---------------------------------------------------------------------------------------------------------------- PP 6 1.820214e+00 1.820214e+00 0.000000e+00 1.903389e-02 3.152271e+02 1 ---------------------------------------------------------------------------------------------------------------- [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: 1.82021398488449 Dual Bound: 1.8023331951981103 Dual Gap (relative): 0.009920912367379608 Search Statistics. Total number of nodes processed: 271 Total number of lmo calls: 2265 Total time (s): 15.731 LMO calls / sec: 143.9832178501049 Nodes / sec: 17.227131142330432 LMO calls / node: 8.357933579335793 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 = 0x7a6c86a107b73695 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 -3.210922e+02 -3.010155e+02 2.007673e+01 6.669665e-02 1.881000e+01 1.594896e-01 9385 130 38 2067 18 3 * 3 4 -3.209385e+02 -3.064926e+02 1.444593e+01 4.713304e-02 2.153400e+01 3.250673e-01 1700 137 102 2191 15 5 * 5 6 -3.207415e+02 -3.065062e+02 1.423534e+01 4.644388e-02 2.331000e+01 4.719005e-01 787 92 158 975 9 7 * 30 29 -3.195795e+02 -3.071152e+02 1.246426e+01 4.058497e-02 6.304800e+01 9.357949e-01 1453 102 864 1880 19 14 * 98 81 -3.186114e+02 -3.079638e+02 1.064758e+01 3.457412e-02 1.787650e+02 1.001315e+00 1066 107 2637 1318 13 7 100 81 -3.186041e+02 -3.079638e+02 1.064026e+01 3.455037e-02 1.806010e+02 1.002209e+00 12 7 2665 6 17 11 * 155 130 -3.181270e+02 -3.084124e+02 9.714637e+00 3.149885e-02 2.781530e+02 1.024616e+00 1250 88 4155 1624 15 9 * 181 152 -3.179505e+02 -3.084186e+02 9.531866e+00 3.090561e-02 3.197760e+02 1.041354e+00 1274 86 4856 1628 11 5 200 169 -3.178503e+02 -3.084186e+02 9.431724e+00 3.058092e-02 3.504320e+02 1.052986e+00 1246 90 5357 1575 22 7 * 257 212 -3.176810e+02 -3.095195e+02 8.161494e+00 2.636827e-02 4.576540e+02 1.024792e+00 1524 98 6816 1972 16 8 283 230 -3.176089e+02 -3.095195e+02 8.089339e+00 2.613515e-02 5.000050e+02 1.025990e+00 936 84 7469 1149 16 9 ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------- 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.875772e+02 5.831742e+02 4.403007e+00 0.000000e+00 Inf 1 LD 7 -2.986720e+02 -3.002281e+02 1.556058e+00 3.046355e-01 2.297828e+01 2 LD 106 -3.116258e+02 -3.120632e+02 4.373996e-01 5.332347e-01 1.987868e+02 4 LD 146 -3.128258e+02 -3.129875e+02 1.616300e-01 5.563248e-01 2.624366e+02 5 LD 223 -3.131911e+02 -3.132313e+02 4.023120e-02 6.935455e-01 3.215362e+02 7 LD 368 -3.132262e+02 -3.132430e+02 1.675337e-02 7.500751e-01 4.906175e+02 7 LD 495 -3.132302e+02 -3.132365e+02 6.346756e-03 8.014260e-01 6.176490e+02 9 LD 593 -3.132307e+02 -3.132324e+02 1.710409e-03 8.407299e-01 7.053395e+02 10 LD 702 -3.132308e+02 -3.132314e+02 6.435122e-04 8.971477e-01 7.824798e+02 10 LD 795 -3.132308e+02 -3.132310e+02 2.285238e-04 9.465633e-01 8.398804e+02 10 LD 895 -3.132308e+02 -3.132309e+02 8.041265e-05 1.001012e+00 8.940947e+02 10 LD 994 -3.132308e+02 -3.132308e+02 2.862015e-05 1.052919e+00 9.440425e+02 10 P 1000 -3.132308e+02 -3.132308e+02 2.862015e-05 1.059493e+00 9.438477e+02 10 LD 1094 -3.132308e+02 -3.132308e+02 1.046785e-05 1.176601e+00 9.297968e+02 10 LD 1190 -3.132308e+02 -3.132308e+02 3.846130e-06 1.228884e+00 9.683579e+02 10 LD 1274 -3.132308e+02 -3.132308e+02 1.436364e-06 1.275303e+00 9.989786e+02 10 LD 1365 -3.132308e+02 -3.132308e+02 5.156488e-07 1.325121e+00 1.030094e+03 10 P 2000 -3.132308e+02 -3.132308e+02 5.156488e-07 1.745231e+00 1.145980e+03 10 P 3000 -3.132308e+02 -3.132308e+02 5.156488e-07 2.210670e+00 1.357054e+03 10 P 4000 -3.132308e+02 -3.132308e+02 5.156488e-07 2.648691e+00 1.510180e+03 10 P 5000 -3.132308e+02 -3.132308e+02 5.156488e-07 3.086412e+00 1.620004e+03 10 P 6000 -3.132308e+02 -3.132308e+02 5.156488e-07 3.467326e+00 1.730440e+03 10 P 7000 -3.132308e+02 -3.132308e+02 5.156488e-07 3.853496e+00 1.816532e+03 10 P 8000 -3.132308e+02 -3.132308e+02 5.156488e-07 4.234337e+00 1.889316e+03 10 P 9000 -3.132308e+02 -3.132308e+02 5.156488e-07 4.634338e+00 1.942025e+03 10 P 10000 -3.132308e+02 -3.132308e+02 5.156488e-07 5.032357e+00 1.987141e+03 10 Last 10001 -3.132308e+02 -3.132308e+02 5.156488e-07 5.036723e+00 1.985617e+03 10 ---------------------------------------------------------------------------------------------------------------- PP 10001 -3.132308e+02 -3.132308e+02 5.961063e-07 5.040158e+00 1.984263e+03 10 ---------------------------------------------------------------------------------------------------------------- Solution Statistics. Solution Status: Time limit reached Primal Objective: -313.2308062357152 Dual Bound: -317.60887541330516 Dual Gap (relative): 0.01397713472121047 Search Statistics. Total number of nodes processed: 513 Total number of lmo calls: 7499 Total time (s): 507.016 LMO calls / sec: 14.7904602616091 Nodes / sec: 1.0118023888792465 LMO calls / node: 14.617933723196881 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 -3.013724e+02 -2.975427e+02 3.829657e+00 1.287095e-02 1.920400e+01 1.562175e-01 7810 85 13 29 3 1 * 2 3 -3.013724e+02 -2.983334e+02 3.039004e+00 1.018660e-02 1.951100e+01 2.562657e-01 92 68 23 13 3 1 3 4 -3.004814e+02 -2.983334e+02 2.148069e+00 7.200231e-03 1.977800e+01 3.539286e-01 59 45 30 8 3 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 -1.669150e+02 -1.675986e+02 6.836470e-01 0.000000e+00 Inf 1 LD 2 -2.983334e+02 -2.983334e+02 0.000000e+00 1.752801e-01 1.141031e+01 1 Last 2 -2.983334e+02 -2.983334e+02 0.000000e+00 3.195617e-01 6.258572e+00 1 ---------------------------------------------------------------------------------------------------------------- PP 2 -2.983334e+02 -2.983334e+02 0.000000e+00 3.235622e-01 6.181192e+00 1 ---------------------------------------------------------------------------------------------------------------- [ Info: primal >= tree.incumbent [ Info: postsolve did not improve the solution Solution Statistics. Solution Status: Optimal (tolerance reached) Primal Objective: -298.33337804926174 Dual Bound: -300.4814471862219 Dual Gap (relative): 0.007200230664788202 Search Statistics. Total number of nodes processed: 7 Total number of lmo calls: 35 Total time (s): 21.898 LMO calls / sec: 1.5983194812311627 Nodes / sec: 0.31966389624623254 LMO calls / node: 5.0 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 31m38.5s Norm hyperbox | 4 4 57.3s Norm hyperbox - strong branching | 2 2 49.5s Normbox - Shadow set activation | 4 4 24.1s Normbox - strong convexity and sharpness | 6 6 18.2s Start with Active Set | 2 2 19.0s Interface - sparse poisson regression | 4 4 27.2s Different FW variants | 10 10 1m21.8s Different line search types | 8 8 2m27.7s Lazification | 5 5 20.5s DICG - Lazification | 10 10 3m09.0s DICG - warm_start | 5 5 2m06.4s Linear feasible | 4 4 0.1s Integer bounds | 10 10 0.1s Cube LMO | 4 4 25.3s BLMO - Strong Branching | 4 4 22.2s Probability Simplex LMO | 4 4 59.1s Unit Simplex LMO | 4 4 1m48.9s Indicators | 5 5 0.3s Hyperplane Aware Rounding - Probability Simplex | 2 2 27.1s Hyperplane Aware Rounding - Unit Simplex | 2 2 46.7s Following Gradient Heuristic - Unit Simplex | 6 6 1m16.9s Rounding Heuristic - Unit Simplex | 3 3 1m10.1s Probability Rounding - Unit Cube | 2 2 23.9s Probability rounding - Probability Simplex | 3 3 23.1s Sparse Regression | 2 2 24.5s Sparse Regression Group | 7 7 57.0s Poisson sparse regression | 2 2 8m29.6s Hybrid branching poisson sparse regression | 3 3 24.6s RNG of the outermost testset: Xoshiro(0x0a29909e9573e043, 0x554b3c242675651a, 0x8c37c0d5b06d5d83, 0x7ba13780483ed5b3, 0x288a8db974aebb05) 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 1931.13s 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 2086.34s: package tests unexpectedly errored