Package evaluation of JSOSuite on Julia 1.10.8 (92f03a4775*) started at 2025-02-25T12:34:09.283 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Set-up completed after 5.2s ################################################################################ # Installation # Installing JSOSuite... Resolving package versions... Updating `~/.julia/environments/v1.10/Project.toml` [ed6ae0be] + JSOSuite v0.2.0 Updating `~/.julia/environments/v1.10/Manifest.toml` [54578032] + ADNLPModels v0.8.11 [47edcb42] + ADTypes v1.13.0 [66dad0bd] + AliasTables v1.1.3 [6e4b80f9] + BenchmarkTools v1.6.0 [d360d2e6] + ChainRulesCore v1.25.1 [523fee87] + CodecBzip2 v0.8.5 [944b1d66] + CodecZlib v0.7.8 [35d6a980] + ColorSchemes v3.29.0 [3da002f7] + ColorTypes v0.12.0 [c3611d14] + ColorVectorSpace v0.11.0 [5ae59095] + Colors v0.13.0 [bbf7d656] + CommonSubexpressions v0.3.1 [34da2185] + Compat v4.16.0 [d38c429a] + Contour v0.6.3 [a8cc5b0e] + Crayons v4.1.1 [9a962f9c] + DataAPI v1.16.0 [a93c6f00] + DataFrames v1.7.0 [864edb3b] + DataStructures v0.18.20 [e2d170a0] + DataValueInterfaces v1.0.0 [163ba53b] + DiffResults v1.1.0 [b552c78f] + DiffRules v1.15.1 [ffbed154] + DocStringExtensions v0.9.3 [e2ba6199] + ExprTools v0.1.10 [9aa1b823] + FastClosures v0.3.2 [1a297f60] + FillArrays v1.13.0 [53c48c17] + FixedPointNumbers v0.8.5 [f6369f11] + ForwardDiff v0.10.38 [069b7b12] + FunctionWrappers v1.1.3 [842dd82b] + InlineStrings v1.4.3 [41ab1584] + InvertedIndices v1.3.1 [92d709cd] + IrrationalConstants v0.2.4 [82899510] + IteratorInterfaceExtensions v1.0.0 [692b3bcd] + JLLWrappers v1.7.0 [682c06a0] + JSON v0.21.4 [0f8b85d8] + JSON3 v1.14.1 [10dff2fc] + JSOSolvers v0.12.1 [ed6ae0be] + JSOSuite v0.2.0 [4076af6c] + JuMP v1.24.0 [ba0b0d4f] + Krylov v0.9.10 [39f5bc3e] + LLSModels v0.3.11 [b964fa9f] + LaTeXStrings v1.4.0 [5c8ed15e] + LinearOperators v2.9.0 [2ab3a3ac] + LogExpFunctions v0.3.29 [1914dd2f] + MacroTools v0.5.15 [299715c1] + MarchingCubes v0.1.11 [b8f27783] + MathOptInterface v1.37.0 [e1d29d7a] + Missings v1.2.0 [d8a4904e] + MutableArithmetics v1.6.4 [a4795742] + NLPModels v0.21.3 [792afdf1] + NLPModelsJuMP v0.13.2 [e01155f1] + NLPModelsModifiers v0.7.2 [77ba4419] + NaNMath v1.1.2 [bac558e1] + OrderedCollections v1.8.0 [69de0a69] + Parsers v2.8.1 [01435c0c] + Percival v0.7.2 [2dfb63ee] + PooledArrays v1.4.3 [aea7be01] + PrecompileTools v1.2.1 [21216c6a] + Preferences v1.4.3 [08abe8d2] + PrettyTables v2.4.0 [43287f4e] + PtrArrays v1.3.0 [f468eda6] + QuadraticModels v0.9.8 [189a3867] + Reexport v1.2.2 [ae029012] + Requires v1.3.0 [37e2e3b7] + ReverseDiff v1.15.3 [91c51154] + SentinelArrays v1.4.8 [ff4d7338] + SolverCore v0.3.8 [d076d87d] + SolverParameters v0.1.1 [b5612192] + SolverTools v0.9.0 [a2af1166] + SortingAlgorithms v1.2.1 [9f842d2f] + SparseConnectivityTracer v0.6.13 [fa32481b] + SparseMatricesCOO v0.2.3 [0a514795] + SparseMatrixColorings v0.4.13 [276daf66] + SpecialFunctions v2.5.0 [90137ffa] + StaticArrays v1.9.12 [1e83bf80] + StaticArraysCore v1.4.3 [82ae8749] + StatsAPI v1.7.0 [2913bbd2] + StatsBase v0.34.4 [892a3eda] + StringManipulation v0.4.1 [856f2bd8] + StructTypes v1.11.0 [3783bdb8] + TableTraits v1.0.1 [bd369af6] + Tables v1.12.0 [62fd8b95] + TensorCore v0.1.1 [a759f4b9] + TimerOutputs v0.5.27 [3bb67fe8] + TranscodingStreams v0.11.3 [b8865327] + UnicodePlots v3.7.2 [6e34b625] + Bzip2_jll v1.0.9+0 [efe28fd5] + OpenSpecFun_jll v0.5.6+0 [56f22d72] + Artifacts [2a0f44e3] + Base64 [ade2ca70] + Dates [9fa8497b] + Future [b77e0a4c] + InteractiveUtils [76f85450] + LibGit2 [8f399da3] + Libdl [37e2e46d] + LinearAlgebra [56ddb016] + Logging [d6f4376e] + Markdown [a63ad114] + Mmap [ca575930] + NetworkOptions v1.2.0 [de0858da] + Printf [9abbd945] + Profile [9a3f8284] + Random [ea8e919c] + SHA v0.7.0 [9e88b42a] + Serialization [2f01184e] + SparseArrays v1.10.0 [10745b16] + Statistics v1.10.0 [fa267f1f] + TOML v1.0.3 [8dfed614] + Test [cf7118a7] + UUIDs [4ec0a83e] + Unicode [e66e0078] + CompilerSupportLibraries_jll v1.1.1+0 [e37daf67] + LibGit2_jll v1.6.4+0 [29816b5a] + LibSSH2_jll v1.11.0+1 [c8ffd9c3] + MbedTLS_jll v2.28.2+1 [4536629a] + OpenBLAS_jll v0.3.23+4 [05823500] + OpenLibm_jll v0.8.1+4 [bea87d4a] + SuiteSparse_jll v7.2.1+1 [83775a58] + Zlib_jll v1.2.13+1 [8e850b90] + libblastrampoline_jll v5.11.0+0 Installation completed after 8.9s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... ┌ Warning: Could not use exact versions of packages in manifest, re-resolving └ @ TestEnv ~/.julia/packages/TestEnv/tgnBf/src/julia-1.9/activate_set.jl:63 Precompiling package dependencies... Precompilation completed after 1008.2s ################################################################################ # Testing # Testing JSOSuite ┌ Warning: Could not use exact versions of packages in manifest, re-resolving └ @ Pkg.Operations /opt/julia/share/julia/stdlib/v1.10/Pkg/src/Operations.jl:1829 Status `/tmp/jl_qmYG3l/Project.toml` ⌅ [54578032] ADNLPModels v0.7.2 [5a1c9e79] CaNNOLeS v0.7.7 [bee2e536] DCISolver v0.4.6 ⌃ [a93c6f00] DataFrames v1.3.6 [e59f0261] FletcherPenaltySolver v0.2.6 ⌅ [10dff2fc] JSOSolvers v0.11.2 [ed6ae0be] JSOSuite v0.2.0 [4076af6c] JuMP v1.24.0 [67920dd8] KNITRO v0.14.4 [39f5bc3e] LLSModels v0.3.11 [5c8ed15e] LinearOperators v2.9.0 ⌅ [a4795742] NLPModels v0.20.0 [f4238b75] NLPModelsIpopt v0.10.2 ⌅ [792afdf1] NLPModelsJuMP v0.12.7 [bec4dd0d] NLPModelsKnitro v0.9.1 [e01155f1] NLPModelsModifiers v0.7.2 [7cde8186] NLSProblems v0.5.3 ⌅ [5049e819] OptimizationProblems v0.8.1 [01435c0c] Percival v0.7.2 [f468eda6] QuadraticModels v0.9.8 [1e40b3f8] RipQP v0.6.4 ⌅ [581a75fa] SolverBenchmark v0.5.5 [ff4d7338] SolverCore v0.3.8 [fa32481b] SparseMatricesCOO v0.2.3 [37e2e46d] LinearAlgebra [56ddb016] Logging [2f01184e] SparseArrays v1.10.0 [8dfed614] Test Status `/tmp/jl_qmYG3l/Manifest.toml` ⌅ [54578032] ADNLPModels v0.7.2 [14f7f29c] AMD v0.5.3 [1520ce14] AbstractTrees v0.4.5 [66dad0bd] AliasTables v1.1.3 [dce04be8] ArgCheck v2.4.0 [ecbce9bc] BenchmarkProfiles v0.4.6 [6e4b80f9] BenchmarkTools v1.6.0 [b99e7846] BinaryProvider v0.5.10 [d1d4a3ce] BitFlags v0.1.9 [336ed68f] CSV v0.10.15 [5a1c9e79] CaNNOLeS v0.7.7 [d360d2e6] ChainRulesCore v1.25.1 [523fee87] CodecBzip2 v0.8.5 [944b1d66] CodecZlib v0.7.8 ⌅ [ffa27691] ColPack v0.3.0 [35d6a980] ColorSchemes v3.29.0 [3da002f7] ColorTypes v0.12.0 [c3611d14] ColorVectorSpace v0.11.0 [5ae59095] Colors v0.13.0 [bbf7d656] CommonSubexpressions v0.3.1 [34da2185] Compat v4.16.0 [f0e56b4a] ConcurrentUtilities v2.5.0 [d38c429a] Contour v0.6.3 [a8cc5b0e] Crayons v4.1.1 [bee2e536] DCISolver v0.4.6 [9a962f9c] DataAPI v1.16.0 ⌃ [a93c6f00] DataFrames v1.3.6 [864edb3b] DataStructures v0.18.20 [e2d170a0] DataValueInterfaces v1.0.0 [3f0dd361] DefaultApplication v1.1.0 [8bb1440f] DelimitedFiles v1.9.1 [163ba53b] DiffResults v1.1.0 [b552c78f] DiffRules v1.15.1 [ffbed154] DocStringExtensions v0.9.3 [460bff9d] ExceptionUnwrapping v0.1.11 [e2ba6199] ExprTools v0.1.10 ⌃ [c87230d0] FFMPEG v0.2.4 [9aa1b823] FastClosures v0.3.2 [5789e2e9] FileIO v1.16.6 [48062228] FilePathsBase v0.9.23 [53c48c17] FixedPointNumbers v0.8.5 [e59f0261] FletcherPenaltySolver v0.2.6 [1fa38f19] Format v1.3.7 [59287772] Formatting v0.4.3 [f6369f11] ForwardDiff v0.10.38 [069b7b12] FunctionWrappers v1.1.3 [28b8d3ca] GR v0.73.13 [bc5e4493] GitHub v5.9.0 [42e2da0e] Grisu v1.0.2 ⌅ [34c5aeac] HSL v0.4.3 [cd3eb016] HTTP v1.10.15 [842dd82b] InlineStrings v1.4.3 [41ab1584] InvertedIndices v1.3.1 [b6b21f68] Ipopt v1.7.2 [92d709cd] IrrationalConstants v0.2.4 [82899510] IteratorInterfaceExtensions v1.0.0 ⌅ [033835bb] JLD2 v0.4.54 [1019f520] JLFzf v0.1.9 [692b3bcd] JLLWrappers v1.7.0 [682c06a0] JSON v0.21.4 [0f8b85d8] JSON3 v1.14.1 ⌅ [10dff2fc] JSOSolvers v0.11.2 [ed6ae0be] JSOSuite v0.2.0 [4076af6c] JuMP v1.24.0 [67920dd8] KNITRO v0.14.4 [ba0b0d4f] Krylov v0.9.10 [40e66cde] LDLFactorizations v0.10.1 [39f5bc3e] LLSModels v0.3.11 [b964fa9f] LaTeXStrings v1.4.0 ⌅ [266f59ce] LaTeXTabulars v0.1.3 [23fbe1c1] Latexify v0.16.6 [1d6d02ad] LeftChildRightSiblingTrees v0.2.0 [f5a24dde] LimitedLDLFactorizations v0.5.1 [5c8ed15e] LinearOperators v2.9.0 [2ab3a3ac] LogExpFunctions v0.3.29 [e6f89c97] LoggingExtras v1.1.0 [1914dd2f] MacroTools v0.5.15 [299715c1] MarchingCubes v0.1.11 [b8f27783] MathOptInterface v1.37.0 [4d4711f2] MatrixMarket v0.5.2 [739be429] MbedTLS v1.1.9 [442fdcdd] Measures v0.3.2 [e1d29d7a] Missings v1.2.0 [d8a4904e] MutableArithmetics v1.6.4 ⌅ [a4795742] NLPModels v0.20.0 [f4238b75] NLPModelsIpopt v0.10.2 ⌅ [792afdf1] NLPModelsJuMP v0.12.7 [bec4dd0d] NLPModelsKnitro v0.9.1 [e01155f1] NLPModelsModifiers v0.7.2 [7cde8186] NLSProblems v0.5.3 [77ba4419] NaNMath v1.1.2 [4d8831e6] OpenSSL v1.4.3 [c32e1cdf] OperatorScaling v0.1.0 ⌅ [5049e819] OptimizationProblems v0.8.1 [bac558e1] OrderedCollections v1.8.0 [8314cec4] PGFPlotsX v1.6.2 [d96e819e] Parameters v0.12.3 [69de0a69] Parsers v2.8.1 [01435c0c] Percival v0.7.2 [b98c9c47] Pipe v1.3.0 [32113eaa] PkgBenchmark v0.2.12 [ccf2f8ad] PlotThemes v3.3.0 [995b91a9] PlotUtils v1.4.3 ⌃ [91a5bcdd] Plots v1.40.1 [2dfb63ee] PooledArrays v1.4.3 [aea7be01] PrecompileTools v1.2.1 [21216c6a] Preferences v1.4.3 ⌅ [08abe8d2] PrettyTables v1.3.1 [33c8b6b6] ProgressLogging v0.1.4 [43287f4e] PtrArrays v1.3.0 [f468eda6] QuadraticModels v0.9.8 [3cdcf5f2] RecipesBase v1.3.4 [01d81517] RecipesPipeline v0.6.12 [189a3867] Reexport v1.2.2 [05181044] RelocatableFolders v1.0.1 [ae029012] Requires v1.3.0 [37e2e3b7] ReverseDiff v1.15.3 [1e40b3f8] RipQP v0.6.4 [6c6a2e73] Scratch v1.2.1 [91c51154] SentinelArrays v1.4.8 [992d4aef] Showoff v1.0.3 [777ac1f9] SimpleBufferStream v1.2.0 [2133526b] SodiumSeal v0.1.1 ⌅ [581a75fa] SolverBenchmark v0.5.5 [ff4d7338] SolverCore v0.3.8 [d076d87d] SolverParameters v0.1.1 ⌅ [b5612192] SolverTools v0.8.8 [a2af1166] SortingAlgorithms v1.2.1 [fa32481b] SparseMatricesCOO v0.2.3 [276daf66] SpecialFunctions v2.5.0 [860ef19b] StableRNGs v1.0.2 [90137ffa] StaticArrays v1.9.12 [1e83bf80] StaticArraysCore v1.4.3 [82ae8749] StatsAPI v1.7.0 [2913bbd2] StatsBase v0.34.4 [c4fe5a9e] Stopping v0.6.5 [53949629] StoppingInterface v0.5.4 [856f2bd8] StructTypes v1.11.0 [3783bdb8] TableTraits v1.0.1 [bd369af6] Tables v1.12.0 [62fd8b95] TensorCore v0.1.1 [5d786b92] TerminalLoggers v0.1.7 [a759f4b9] TimerOutputs v0.5.27 [3bb67fe8] TranscodingStreams v0.11.3 [5c2747f8] URIs v1.5.1 [3a884ed6] UnPack v1.0.2 [1cfade01] UnicodeFun v0.4.1 [b8865327] UnicodePlots v3.7.2 [1986cc42] Unitful v1.22.0 [45397f5d] UnitfulLatexify v1.6.4 [41fe7b60] Unzip v0.2.0 [ea10d353] WeakRefStrings v1.4.2 [76eceee3] WorkerUtilities v1.6.1 [ae81ac8f] ASL_jll v0.1.3+0 [6e34b625] Bzip2_jll v1.0.9+0 [83423d85] Cairo_jll v1.18.2+1 ⌅ [f218ff0c] ColPack_jll v0.3.0+0 [ee1fde0b] Dbus_jll v1.14.10+0 [2702e6a9] EpollShim_jll v0.0.20230411+1 [2e619515] Expat_jll v2.6.5+0 [b22a6f82] FFMPEG_jll v7.1.0+0 [a3f928ae] Fontconfig_jll v2.15.0+0 [d7e528f0] FreeType2_jll v2.13.3+1 [559328eb] FriBidi_jll v1.0.16+0 [0656b61e] GLFW_jll v3.4.0+2 [d2c73de3] GR_jll v0.73.13+0 [78b55507] Gettext_jll v0.21.0+0 [7746bdde] Glib_jll v2.82.4+0 [3b182d85] Graphite2_jll v1.3.14+1 [017b0a0e] HSL_jll v4.0.2+0 [2e76f6c2] HarfBuzz_jll v8.5.0+0 [e33a78d0] Hwloc_jll v2.12.0+0 [9cc047cb] Ipopt_jll v300.1400.1700+0 [aacddb02] JpegTurbo_jll v3.1.1+0 [c1c5ebd0] LAME_jll v3.100.2+0 [88015f11] LERC_jll v4.0.1+0 [1d63c593] LLVMOpenMP_jll v18.1.7+0 [dd4b983a] LZO_jll v2.10.3+0 ⌅ [e9f186c6] Libffi_jll v3.2.2+2 [d4300ac3] Libgcrypt_jll v1.11.0+0 [7e76a0d4] Libglvnd_jll v1.7.0+0 [7add5ba3] Libgpg_error_jll v1.51.1+0 [94ce4f54] Libiconv_jll v1.18.0+0 [4b2f31a3] Libmount_jll v2.40.3+0 [89763e89] Libtiff_jll v4.7.1+0 [38a345b3] Libuuid_jll v2.40.3+0 [d00139f3] METIS_jll v5.1.3+0 [d7ed1dd3] MUMPS_seq_jll v500.700.301+0 [e7412a2a] Ogg_jll v1.3.5+1 ⌅ [656ef2d0] OpenBLAS32_jll v0.3.24+0 [458c3c95] OpenSSL_jll v3.0.16+0 [efe28fd5] OpenSpecFun_jll v0.5.6+0 [91d4177d] Opus_jll v1.3.3+0 [36c8627f] Pango_jll v1.56.1+0 ⌅ [30392449] Pixman_jll v0.43.4+0 ⌅ [c0090381] Qt6Base_jll v6.7.1+1 ⌅ [629bc702] Qt6Declarative_jll v6.7.1+2 ⌅ [ce943373] Qt6ShaderTools_jll v6.7.1+1 ⌃ [e99dba38] Qt6Wayland_jll v6.7.1+1 ⌅ [319450e9] SPRAL_jll v2024.5.8+0 [a44049a8] Vulkan_Loader_jll v1.3.243+0 [a2964d1f] Wayland_jll v1.21.0+2 [2381bf8a] Wayland_protocols_jll v1.36.0+0 [02c8fc9c] XML2_jll v2.13.6+1 [aed1982a] XSLT_jll v1.1.42+0 [ffd25f8a] XZ_jll v5.6.4+1 [f67eecfb] Xorg_libICE_jll v1.1.1+0 [c834827a] Xorg_libSM_jll v1.2.4+0 [4f6342f7] Xorg_libX11_jll v1.8.6+3 [0c0b7dd1] Xorg_libXau_jll v1.0.12+0 [935fb764] Xorg_libXcursor_jll v1.2.3+0 [a3789734] Xorg_libXdmcp_jll v1.1.5+0 [1082639a] Xorg_libXext_jll v1.3.6+3 [d091e8ba] Xorg_libXfixes_jll v6.0.0+0 [a51aa0fd] Xorg_libXi_jll v1.8.2+0 [d1454406] Xorg_libXinerama_jll v1.1.5+0 [ec84b674] Xorg_libXrandr_jll v1.5.4+0 [ea2f1a96] Xorg_libXrender_jll v0.9.11+1 [14d82f49] Xorg_libpthread_stubs_jll v0.1.2+0 [c7cfdc94] Xorg_libxcb_jll v1.17.0+3 [cc61e674] Xorg_libxkbfile_jll v1.1.2+1 [e920d4aa] Xorg_xcb_util_cursor_jll v0.1.4+0 [12413925] Xorg_xcb_util_image_jll v0.4.0+1 [2def613f] Xorg_xcb_util_jll v0.4.0+1 [975044d2] Xorg_xcb_util_keysyms_jll v0.4.0+1 [0d47668e] Xorg_xcb_util_renderutil_jll v0.3.9+1 [c22f9ab0] Xorg_xcb_util_wm_jll v0.4.1+1 [35661453] Xorg_xkbcomp_jll v1.4.6+1 [33bec58e] Xorg_xkeyboard_config_jll v2.39.0+0 [c5fb5394] Xorg_xtrans_jll v1.5.1+0 [3161d3a3] Zstd_jll v1.5.7+1 [35ca27e7] eudev_jll v3.2.9+0 [214eeab7] fzf_jll v0.56.3+0 [1a1c6b14] gperf_jll v3.1.1+1 [a4ae2306] libaom_jll v3.11.0+0 [0ac62f75] libass_jll v0.15.2+0 [1183f4f0] libdecor_jll v0.2.2+0 [2db6ffa8] libevdev_jll v1.11.0+0 [f638f0a6] libfdk_aac_jll v2.0.3+0 [36db933b] libinput_jll v1.18.0+0 [b53b4c65] libpng_jll v1.6.46+0 [a9144af2] libsodium_jll v1.0.20+3 [f27f6e37] libvorbis_jll v1.3.7+2 [009596ad] mtdev_jll v1.1.6+0 [1270edf5] x264_jll v10164.0.1+0 [dfaa095f] x265_jll v4.1.0+0 [d8fb68d0] xkbcommon_jll v1.4.1+2 [0dad84c5] ArgTools v1.1.1 [56f22d72] Artifacts [2a0f44e3] Base64 [ade2ca70] Dates [f43a241f] Downloads v1.6.0 [7b1f6079] FileWatching [9fa8497b] Future [b77e0a4c] InteractiveUtils [b27032c2] LibCURL v0.6.4 [76f85450] LibGit2 [8f399da3] Libdl [37e2e46d] LinearAlgebra [56ddb016] Logging [d6f4376e] Markdown [a63ad114] Mmap [ca575930] NetworkOptions v1.2.0 [44cfe95a] Pkg v1.10.0 [de0858da] Printf [9abbd945] Profile [3fa0cd96] REPL [9a3f8284] Random [ea8e919c] SHA v0.7.0 [9e88b42a] Serialization [6462fe0b] Sockets [2f01184e] SparseArrays v1.10.0 [10745b16] Statistics v1.10.0 [fa267f1f] TOML v1.0.3 [a4e569a6] Tar v1.10.0 [8dfed614] Test [cf7118a7] UUIDs [4ec0a83e] Unicode [e66e0078] CompilerSupportLibraries_jll v1.1.1+0 [deac9b47] LibCURL_jll v8.4.0+0 [e37daf67] LibGit2_jll v1.6.4+0 [29816b5a] LibSSH2_jll v1.11.0+1 [c8ffd9c3] MbedTLS_jll v2.28.2+1 [14a3606d] MozillaCACerts_jll v2023.1.10 [4536629a] OpenBLAS_jll v0.3.23+4 [05823500] OpenLibm_jll v0.8.1+4 [efcefdf7] PCRE2_jll v10.42.0+1 [bea87d4a] SuiteSparse_jll v7.2.1+1 [83775a58] Zlib_jll v1.2.13+1 [8e850b90] libblastrampoline_jll v5.11.0+0 [8e850ede] nghttp2_jll v1.52.0+1 [3f19e933] p7zip_jll v17.4.0+2 Info Packages marked with ⌃ and ⌅ have new versions available. Those with ⌃ may be upgradable, but those with ⌅ are restricted by compatibility constraints from upgrading. Testing Running tests... Test Summary: | Pass Total Time Test not loaded solvers | 6 6 16.9s WARNING: using Krylov.solve! in module DCISolver conflicts with an existing identifier. WARNING: method definition for solve_two_least_squares at /home/pkgeval/.julia/packages/FletcherPenaltySolver/3DDMg/src/solve_linear_system.jl:161 declares type variable Tt but does not use it. ┌ Warning: Warning: KNITRO is not properly installed. See, KNITRO.jl. └ @ StoppingInterface ~/.julia/packages/StoppingInterface/Lrl6f/src/stopping_to_nlpmodels_knitro.jl:193 ┌ Warning: `R2Solver(nlp::AbstractNLPModel; kwargs...)` is deprecated, use `FoSolver(nlp::AbstractNLPModel; kwargs...)` instead. │ caller = ip:0x0 └ @ Core :-1 ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit https://github.com/coin-or/Ipopt ****************************************************************************** This is Ipopt version 3.14.17, running with linear solver MUMPS 5.7.3. Number of nonzeros in equality constraint Jacobian...: 0 Number of nonzeros in inequality constraint Jacobian.: 0 Number of nonzeros in Lagrangian Hessian.............: 5050 Total number of variables............................: 100 variables with only lower bounds: 0 variables with lower and upper bounds: 0 variables with only upper bounds: 0 Total number of equality constraints.................: 0 Total number of inequality constraints...............: 0 inequality constraints with only lower bounds: 0 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 0 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 2.5000000e+02 0.00e+00 2.00e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 5.0000000e+01 0.00e+00 5.98e-15 -1.0 2.00e+00 - 1.00e+00 1.00e+00f 1 Number of Iterations....: 1 (scaled) (unscaled) Objective...............: 5.0000000000000128e+01 5.0000000000000128e+01 Dual infeasibility......: 5.9778570982160788e-15 5.9778570982160788e-15 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 0.0000000000000000e+00 0.0000000000000000e+00 Overall NLP error.......: 5.9778570982160788e-15 5.9778570982160788e-15 Number of objective function evaluations = 2 Number of objective gradient evaluations = 2 Number of equality constraint evaluations = 0 Number of inequality constraint evaluations = 0 Number of equality constraint Jacobian evaluations = 0 Number of inequality constraint Jacobian evaluations = 0 Number of Lagrangian Hessian evaluations = 1 Total seconds in IPOPT = 11.148 EXIT: Optimal Solution Found. This is Ipopt version 3.14.17, running with linear solver MUMPS 5.7.3. Number of nonzeros in equality constraint Jacobian...: 0 Number of nonzeros in inequality constraint Jacobian.: 0 Number of nonzeros in Lagrangian Hessian.............: 5050 Total number of variables............................: 100 variables with only lower bounds: 0 variables with lower and upper bounds: 0 variables with only upper bounds: 0 Total number of equality constraints.................: 0 Total number of inequality constraints...............: 0 inequality constraints with only lower bounds: 0 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 0 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 2.5000000e+02 0.00e+00 2.00e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 5.0000000e+01 0.00e+00 5.98e-15 -1.0 2.00e+00 - 1.00e+00 1.00e+00f 1 Number of Iterations....: 1 (scaled) (unscaled) Objective...............: 5.0000000000000128e+01 5.0000000000000128e+01 Dual infeasibility......: 5.9778570982160788e-15 5.9778570982160788e-15 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 0.0000000000000000e+00 0.0000000000000000e+00 Overall NLP error.......: 5.9778570982160788e-15 5.9778570982160788e-15 Number of objective function evaluations = 2 Number of objective gradient evaluations = 2 Number of equality constraint evaluations = 0 Number of inequality constraint evaluations = 0 Number of equality constraint Jacobian evaluations = 0 Number of inequality constraint Jacobian evaluations = 0 Number of Lagrangian Hessian evaluations = 1 Total seconds in IPOPT = 0.013 EXIT: Optimal Solution Found. This is Ipopt version 3.14.17, running with linear solver MUMPS 5.7.3. Number of nonzeros in equality constraint Jacobian...: 0 Number of nonzeros in inequality constraint Jacobian.: 0 Number of nonzeros in Lagrangian Hessian.............: 5050 Total number of variables............................: 100 variables with only lower bounds: 0 variables with lower and upper bounds: 0 variables with only upper bounds: 0 Total number of equality constraints.................: 0 Total number of inequality constraints...............: 0 inequality constraints with only lower bounds: 0 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 0 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 2.5000000e+02 0.00e+00 2.00e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 5.0000000e+01 0.00e+00 5.93e-15 -1.0 2.00e+00 - 1.00e+00 1.00e+00f 1 Number of Iterations....: 1 (scaled) (unscaled) Objective...............: 5.0000000000000064e+01 5.0000000000000064e+01 Dual infeasibility......: 5.9327542878406661e-15 5.9327542878406661e-15 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 0.0000000000000000e+00 0.0000000000000000e+00 Overall NLP error.......: 5.9327542878406661e-15 5.9327542878406661e-15 Number of objective function evaluations = 2 Number of objective gradient evaluations = 2 Number of equality constraint evaluations = 0 Number of inequality constraint evaluations = 0 Number of equality constraint Jacobian evaluations = 0 Number of inequality constraint Jacobian evaluations = 0 Number of Lagrangian Hessian evaluations = 1 Total seconds in IPOPT = 5.624 EXIT: Optimal Solution Found. This is Ipopt version 3.14.17, running with linear solver MUMPS 5.7.3. Number of nonzeros in equality constraint Jacobian...: 0 Number of nonzeros in inequality constraint Jacobian.: 0 Number of nonzeros in Lagrangian Hessian.............: 5050 Total number of variables............................: 100 variables with only lower bounds: 0 variables with lower and upper bounds: 0 variables with only upper bounds: 0 Total number of equality constraints.................: 0 Total number of inequality constraints...............: 0 inequality constraints with only lower bounds: 0 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 0 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 2.5000000e+02 0.00e+00 2.00e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 5.0000000e+01 0.00e+00 5.93e-15 -1.0 2.00e+00 - 1.00e+00 1.00e+00f 1 Number of Iterations....: 1 (scaled) (unscaled) Objective...............: 5.0000000000000064e+01 5.0000000000000064e+01 Dual infeasibility......: 5.9327542878406661e-15 5.9327542878406661e-15 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 0.0000000000000000e+00 0.0000000000000000e+00 Overall NLP error.......: 5.9327542878406661e-15 5.9327542878406661e-15 Number of objective function evaluations = 2 Number of objective gradient evaluations = 2 Number of equality constraint evaluations = 0 Number of inequality constraint evaluations = 0 Number of equality constraint Jacobian evaluations = 0 Number of inequality constraint Jacobian evaluations = 0 Number of Lagrangian Hessian evaluations = 1 Total seconds in IPOPT = 0.010 EXIT: Optimal Solution Found. Test Summary: | Pass Total Time Test in-place solve! | 34 34 3m43.0s The problem uncqp_QP has 2 variables and no constraints. Algorithm selection: - unconstrained: ✓; - nonlinear objective: ✓; - may use 2-th order derivative. There are 8 optimizers available: ["LBFGS", "R2", "TRON", "TRUNK", "IPOPT", "DCISolver", "FletcherPenaltySolver", "Percival"]. Solve using LBFGS: [ Info: iter f(x) ‖∇f‖ ∇fᵀd bk [ Info: 0 7.4e+00 1.2e+01 - - [ Info: 1 3.1e+00 7.6e+00 -1.4e+02 2 [ Info: 2 3.1e-01 2.2e-01 -5.6e+00 0 [ Info: 3 3.0e-01 5.5e-02 -4.9e-03 0 [ Info: 4 3.0e-01 1.2e-06 -3.9e-04 0 [ Info: 5 3.0e-01 3.6e-10 -1.3e-13 0 [ Info: 5 3.0e-01 3.6e-10 The problem uncqp_QP has 2 variables and no constraints. Algorithm selection: - unconstrained: ✓; - nonlinear objective: ✓; - may use 2-th order derivative. There are 8 optimizers available: ["LBFGS", "R2", "TRON", "TRUNK", "IPOPT", "DCISolver", "FletcherPenaltySolver", "Percival"]. Solve using LBFGS: [ Info: iter f(x) ‖∇f‖ ∇fᵀd bk [ Info: 0 7.4e+00 1.2e+01 - - [ Info: 1 3.1e+00 7.6e+00 -1.4e+02 2 [ Info: 2 3.1e-01 2.2e-01 -5.6e+00 0 [ Info: 3 3.0e-01 5.5e-02 -4.9e-03 0 [ Info: 4 3.0e-01 1.2e-06 -3.9e-04 0 [ Info: 5 3.0e-01 3.6e-10 -1.3e-13 0 [ Info: 5 3.0e-01 3.6e-10 [ Info: Solving in Float64 using K2LDL with LDLFactorizationData [ Info: iter obj rgap ‖rb‖ ‖rc‖ α_pri α_du μ ρ δ [ Info: 0 1.0e+00 0.0e+00 0.0e+00 1.1e+00 0.0e+00 0.0e+00 NaN 1.5e-03 1.5e-03 [ Info: 1 3.0e-01 1.5e-03 0.0e+00 1.5e-03 1.0e+00 1.0e+00 NaN 1.5e-03 1.5e-03 [ Info: 2 3.0e-01 2.0e-07 0.0e+00 2.1e-07 1.0e+00 1.0e+00 NaN 1.5e-04 1.5e-04 [ Info: 3 3.0e-01 2.8e-12 0.0e+00 3.0e-12 1.0e+00 1.0e+00 NaN 1.5e-05 1.5e-05 The problem bndqp_QP has 2 variables and no constraints. Algorithm selection: - bounds: ✓; - nonlinear constraints: ✓; - nonlinear objective: ✓; - may use 2-th order derivative. There are 3 optimizers available: ["TRON", "IPOPT", "Percival"]. Solve using TRON: [ Info: iter f(x) π Δ ratio cgstatus [ Info: 0 2.0e+00 7.1e-01 - - - [ Info: 1 0.0e+00 0.0e+00 1.0e+00 1.0e+00 stationary point found [ Info: 1 0.0e+00 0.0e+00 1.1e+00 The problem bndqp_QP has 2 variables and no constraints. Algorithm selection: - bounds: ✓; - nonlinear constraints: ✓; - nonlinear objective: ✓; - may use 2-th order derivative. There are 3 optimizers available: ["TRON", "IPOPT", "Percival"]. Solve using TRON: [ Info: iter f(x) π Δ ratio cgstatus [ Info: 0 2.0e+00 7.1e-01 - - - [ Info: 1 0.0e+00 0.0e+00 1.0e+00 1.0e+00 stationary point found [ Info: 1 0.0e+00 0.0e+00 1.1e+00 [ Info: Solving in Float64 using K2LDL with LDLFactorizationData [ Info: iter obj rgap ‖rb‖ ‖rc‖ α_pri α_du μ ρ δ [ Info: 0 1.4e-04 2.2e+00 0.0e+00 6.7e-01 0.0e+00 0.0e+00 5.6e-01 1.5e-03 1.5e-03 [ Info: 1 6.5e-05 2.3e-03 0.0e+00 6.8e-04 1.0e+00 1.0e+00 5.8e-04 1.5e-03 1.5e-03 [ Info: 2 6.5e-08 2.3e-06 0.0e+00 6.7e-07 1.0e+00 1.0e+00 5.8e-07 1.5e-04 1.5e-04 [ Info: 3 6.5e-11 2.3e-09 0.0e+00 6.7e-10 1.0e+00 1.0e+00 5.8e-10 1.5e-05 1.5e-05 The problem eqconqp_QP has 50 variables and 1 constraint. Algorithm selection: - equalities: ✓; - linear constraints: ✓; - nonlinear objective: ✓; - may use 2-th order derivative. There are 4 optimizers available: ["IPOPT", "DCISolver", "FletcherPenaltySolver", "Percival"]. Solve using IPOPT: This is Ipopt version 3.14.17, running with linear solver MUMPS 5.7.3. Number of nonzeros in equality constraint Jacobian...: 50 Number of nonzeros in inequality constraint Jacobian.: 0 Number of nonzeros in Lagrangian Hessian.............: 51 Total number of variables............................: 50 variables with only lower bounds: 0 variables with lower and upper bounds: 0 variables with only upper bounds: 0 Total number of equality constraints.................: 1 Total number of inequality constraints...............: 0 inequality constraints with only lower bounds: 0 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 0 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 0.0000000e+00 1.00e+00 0.00e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 1.1162694e-01 1.11e-16 2.78e-17 -1.7 2.23e-01 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 1 (scaled) (unscaled) Objective...............: 1.1162694322615738e-01 1.1162694322615738e-01 Dual infeasibility......: 2.7755575615628914e-17 2.7755575615628914e-17 Constraint violation....: 1.1102230246251565e-16 1.1102230246251565e-16 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 0.0000000000000000e+00 0.0000000000000000e+00 Overall NLP error.......: 1.1102230246251565e-16 1.1102230246251565e-16 Number of objective function evaluations = 2 Number of objective gradient evaluations = 2 Number of equality constraint evaluations = 2 Number of inequality constraint evaluations = 0 Number of equality constraint Jacobian evaluations = 2 Number of inequality constraint Jacobian evaluations = 0 Number of Lagrangian Hessian evaluations = 1 Total seconds in IPOPT = 1.299 EXIT: Optimal Solution Found. The problem eqconqp_QP has 50 variables and 1 constraint. Algorithm selection: - equalities: ✓; - linear constraints: ✓; - nonlinear objective: ✓; - may use 2-th order derivative. There are 4 optimizers available: ["IPOPT", "DCISolver", "FletcherPenaltySolver", "Percival"]. Solve using IPOPT: This is Ipopt version 3.14.17, running with linear solver MUMPS 5.7.3. Number of nonzeros in equality constraint Jacobian...: 50 Number of nonzeros in inequality constraint Jacobian.: 0 Number of nonzeros in Lagrangian Hessian.............: 51 Total number of variables............................: 50 variables with only lower bounds: 0 variables with lower and upper bounds: 0 variables with only upper bounds: 0 Total number of equality constraints.................: 1 Total number of inequality constraints...............: 0 inequality constraints with only lower bounds: 0 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 0 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 0.0000000e+00 1.00e+00 0.00e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 1.1162694e-01 1.11e-16 2.78e-17 -1.7 2.23e-01 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 1 (scaled) (unscaled) Objective...............: 1.1162694322615738e-01 1.1162694322615738e-01 Dual infeasibility......: 2.7755575615628914e-17 2.7755575615628914e-17 Constraint violation....: 1.1102230246251565e-16 1.1102230246251565e-16 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 0.0000000000000000e+00 0.0000000000000000e+00 Overall NLP error.......: 1.1102230246251565e-16 1.1102230246251565e-16 Number of objective function evaluations = 2 Number of objective gradient evaluations = 2 Number of equality constraint evaluations = 2 Number of inequality constraint evaluations = 0 Number of equality constraint Jacobian evaluations = 2 Number of inequality constraint Jacobian evaluations = 0 Number of Lagrangian Hessian evaluations = 1 Total seconds in IPOPT = 0.002 EXIT: Optimal Solution Found. [ Info: Solving in Float64 using K2LDL with LDLFactorizationData [ Info: iter obj rgap ‖rb‖ ‖rc‖ α_pri α_du μ ρ δ [ Info: 0 1.1e-01 1.0e-01 5.0e-04 1.1e-01 0.0e+00 0.0e+00 NaN 1.5e-03 1.5e-03 [ Info: 1 1.1e-01 3.3e-05 1.7e-04 1.6e-05 1.0e+00 1.0e+00 NaN 1.5e-03 1.5e-03 [ Info: 2 1.1e-01 6.0e-09 5.6e-09 5.0e-09 1.0e+00 1.0e+00 NaN 1.5e-04 1.5e-04 The problem ineqconqp_QP has 2 variables and 3 constraints. Algorithm selection: - inequalities: ✓; - linear constraints: ✓; - nonlinear objective: ✓; - may use 2-th order derivative. There are 2 optimizers available: ["IPOPT", "Percival"]. Solve using IPOPT: This is Ipopt version 3.14.17, running with linear solver MUMPS 5.7.3. Number of nonzeros in equality constraint Jacobian...: 0 Number of nonzeros in inequality constraint Jacobian.: 6 Number of nonzeros in Lagrangian Hessian.............: 2 Total number of variables............................: 2 variables with only lower bounds: 0 variables with lower and upper bounds: 0 variables with only upper bounds: 0 Total number of equality constraints.................: 0 Total number of inequality constraints...............: 3 inequality constraints with only lower bounds: 1 inequality constraints with lower and upper bounds: 1 inequality constraints with only upper bounds: 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 0.0000000e+00 1.00e+00 8.00e-01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 3.0744353e-01 0.00e+00 1.00e-06 -1.0 6.07e-01 - 1.00e+00 1.00e+00f 1 2 2.6620982e-01 0.00e+00 1.06e-03 -2.5 7.71e-02 - 9.73e-01 1.00e+00f 1 3 2.5129029e-01 0.00e+00 1.50e-09 -3.8 5.04e-02 - 1.00e+00 1.00e+00f 1 4 2.5019974e-01 0.00e+00 1.84e-11 -5.7 2.80e-02 - 1.00e+00 1.00e+00f 1 5 2.5005210e-01 0.00e+00 1.84e-11 -5.7 1.39e-02 - 1.00e+00 1.00e+00f 1 6 2.5001534e-01 0.00e+00 1.84e-11 -5.7 6.83e-03 - 1.00e+00 1.00e+00f 1 7 2.5000337e-01 0.00e+00 2.51e-14 -8.6 3.67e-03 - 1.00e+00 1.00e+00f 1 8 2.5000084e-01 0.00e+00 2.51e-14 -8.6 1.84e-03 - 1.00e+00 1.00e+00f 1 9 2.5000021e-01 0.00e+00 2.51e-14 -8.6 9.17e-04 - 1.00e+00 1.00e+00f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 2.5000005e-01 0.00e+00 2.51e-14 -8.6 4.56e-04 - 1.00e+00 1.00e+00f 1 11 2.5000001e-01 0.00e+00 2.51e-14 -8.6 2.23e-04 - 1.00e+00 1.00e+00f 1 12 2.5000000e-01 0.00e+00 9.09e-15 -9.0 1.15e-04 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 12 (scaled) (unscaled) Objective...............: 2.5000000009898249e-01 2.5000000009898249e-01 Dual infeasibility......: 9.0909132435465501e-15 9.0909132435465501e-15 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 4.1902152191904154e-09 4.1902152191904154e-09 Overall NLP error.......: 4.1902152191904154e-09 4.1902152191904154e-09 Number of objective function evaluations = 13 Number of objective gradient evaluations = 13 Number of equality constraint evaluations = 0 Number of inequality constraint evaluations = 13 Number of equality constraint Jacobian evaluations = 0 Number of inequality constraint Jacobian evaluations = 13 Number of Lagrangian Hessian evaluations = 12 Total seconds in IPOPT = 2.166 EXIT: Optimal Solution Found. The problem ineqconqp_QP has 2 variables and 3 constraints. Algorithm selection: - inequalities: ✓; - linear constraints: ✓; - nonlinear objective: ✓; - may use 2-th order derivative. There are 2 optimizers available: ["IPOPT", "Percival"]. Solve using IPOPT: This is Ipopt version 3.14.17, running with linear solver MUMPS 5.7.3. Number of nonzeros in equality constraint Jacobian...: 0 Number of nonzeros in inequality constraint Jacobian.: 6 Number of nonzeros in Lagrangian Hessian.............: 2 Total number of variables............................: 2 variables with only lower bounds: 0 variables with lower and upper bounds: 0 variables with only upper bounds: 0 Total number of equality constraints.................: 0 Total number of inequality constraints...............: 3 inequality constraints with only lower bounds: 1 inequality constraints with lower and upper bounds: 1 inequality constraints with only upper bounds: 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 0.0000000e+00 1.00e+00 8.00e-01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 3.0744353e-01 0.00e+00 1.00e-06 -1.0 6.07e-01 - 1.00e+00 1.00e+00f 1 2 2.6620982e-01 0.00e+00 1.06e-03 -2.5 7.71e-02 - 9.73e-01 1.00e+00f 1 3 2.5129029e-01 0.00e+00 1.50e-09 -3.8 5.04e-02 - 1.00e+00 1.00e+00f 1 4 2.5019974e-01 0.00e+00 1.84e-11 -5.7 2.80e-02 - 1.00e+00 1.00e+00f 1 5 2.5005210e-01 0.00e+00 1.84e-11 -5.7 1.39e-02 - 1.00e+00 1.00e+00f 1 6 2.5001534e-01 0.00e+00 1.84e-11 -5.7 6.83e-03 - 1.00e+00 1.00e+00f 1 7 2.5000337e-01 0.00e+00 2.51e-14 -8.6 3.67e-03 - 1.00e+00 1.00e+00f 1 8 2.5000084e-01 0.00e+00 2.51e-14 -8.6 1.84e-03 - 1.00e+00 1.00e+00f 1 9 2.5000021e-01 0.00e+00 2.51e-14 -8.6 9.17e-04 - 1.00e+00 1.00e+00f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 2.5000005e-01 0.00e+00 2.51e-14 -8.6 4.56e-04 - 1.00e+00 1.00e+00f 1 11 2.5000001e-01 0.00e+00 2.51e-14 -8.6 2.23e-04 - 1.00e+00 1.00e+00f 1 12 2.5000000e-01 0.00e+00 9.09e-15 -9.0 1.15e-04 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 12 (scaled) (unscaled) Objective...............: 2.5000000009898249e-01 2.5000000009898249e-01 Dual infeasibility......: 9.0909132435465501e-15 9.0909132435465501e-15 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 4.1902152191904154e-09 4.1902152191904154e-09 Overall NLP error.......: 4.1902152191904154e-09 4.1902152191904154e-09 Number of objective function evaluations = 13 Number of objective gradient evaluations = 13 Number of equality constraint evaluations = 0 Number of inequality constraint evaluations = 13 Number of equality constraint Jacobian evaluations = 0 Number of inequality constraint Jacobian evaluations = 13 Number of Lagrangian Hessian evaluations = 12 Total seconds in IPOPT = 0.005 EXIT: Optimal Solution Found. [ Info: Solving in Float64 using K2LDL with LDLFactorizationData [ Info: iter obj rgap ‖rb‖ ‖rc‖ α_pri α_du μ ρ δ [ Info: 0 1.0e+00 1.8e-04 2.5e-01 1.0e+00 0.0e+00 0.0e+00 1.1e-04 1.5e-03 1.5e-03 [ Info: 1 2.5e-01 4.0e-01 1.2e-01 5.0e-01 5.0e-01 1.0e+00 3.7e-04 1.5e-03 1.5e-03 [ Info: 2 2.2e+00 1.6e+01 1.2e-01 4.8e+01 2.0e-02 1.0e+00 2.5e+01 1.5e-04 1.5e-04 [ Info: 3 8.0e+00 1.3e+03 1.2e-01 4.3e+02 8.6e-03 1.0e+00 3.4e+03 1.5e-05 1.5e-05 [ Info: 4 8.0e+00 3.0e+00 2.4e-04 4.3e-01 1.0e+00 1.0e+00 7.3e+00 1.5e-06 1.5e-06 [ Info: 5 1.5e+00 1.0e+00 1.5e-07 5.0e-07 1.0e+00 1.0e+00 6.3e-01 1.5e-07 1.5e-07 [ Info: 6 4.3e-01 2.6e-01 5.1e-09 2.1e-08 1.0e+00 1.0e+00 9.3e-02 1.5e-08 1.5e-08 [ Info: 7 2.8e-01 4.2e-02 1.9e-10 7.8e-10 1.0e+00 1.0e+00 1.3e-02 1.5e-09 1.5e-09 [ Info: 8 2.5e-01 6.1e-03 7.4e-11 2.9e-11 1.0e+00 1.0e+00 1.9e-03 1.5e-10 1.5e-09 [ Info: 9 2.5e-01 8.7e-04 2.8e-11 1.1e-12 1.0e+00 1.0e+00 2.7e-04 1.5e-11 1.5e-09 [ Info: 10 2.5e-01 1.2e-04 1.1e-11 4.2e-14 1.0e+00 1.0e+00 3.9e-05 1.5e-12 1.5e-09 [ Info: 11 2.5e-01 1.8e-05 4.0e-12 1.6e-15 1.0e+00 1.0e+00 5.6e-06 1.5e-13 1.5e-09 [ Info: 12 2.5e-01 2.6e-06 1.5e-12 6.0e-17 1.0e+00 1.0e+00 8.0e-07 1.5e-14 1.5e-09 [ Info: 13 2.5e-01 3.7e-07 5.7e-13 2.3e-17 1.0e+00 1.0e+00 1.1e-07 1.5e-14 1.5e-09 [ Info: 14 2.5e-01 5.3e-08 2.2e-13 8.7e-18 1.0e+00 1.0e+00 1.6e-08 1.5e-14 1.5e-09 [ Info: 15 2.5e-01 7.5e-09 8.2e-14 1.1e-16 1.0e+00 1.0e+00 2.4e-09 1.5e-14 1.5e-09 Test Summary: | Pass Total Time Solve quadratic models | 12 12 1m18.6s The problem genrose has 100 variables and no constraints. Algorithm selection: - Float32 precision: ✓; - unconstrained: ✓; - nonlinear objective: ✓; - may use 2-th order derivative. There are 7 optimizers available: ["LBFGS", "R2", "TRON", "TRUNK", "DCISolver", "FletcherPenaltySolver", "Percival"]. ┌ Warning: Problem does not have general constraints; calling tron └ @ Percival ~/.julia/packages/Percival/QKyOW/src/method.jl:36 Test Summary: | Pass Total Time Test `Float32` | 7 7 1m43.2s The problem has 100 variables and no constraints. Algorithm selection: - unconstrained: ✓; - nonlinear objective: ✓; - may use 2-th order derivative. There are 8 optimizers available: ["LBFGS", "R2", "TRON", "TRUNK", "IPOPT", "DCISolver", "FletcherPenaltySolver", "Percival"]. The problem has 100 variables and no constraints. Algorithm selection: - unconstrained: ✓; - nonlinear objective: ✓; - may use 2-th order derivative. There are 8 optimizers available: ["LBFGS", "R2", "TRON", "TRUNK", "IPOPT", "DCISolver", "FletcherPenaltySolver", "Percival"]. The problem has 100 variables and no constraints. Algorithm selection: - unconstrained: ✓; - nonlinear objective: ✓; - may use 2-th order derivative. There are 8 optimizers available: ["LBFGS", "R2", "TRON", "TRUNK", "IPOPT", "DCISolver", "FletcherPenaltySolver", "Percival"]. ┌ Warning: Problem does not have general constraints; calling tron └ @ Percival ~/.julia/packages/Percival/QKyOW/src/method.jl:36 Test Summary: | Pass Total Time JSOSuite JuMP API | 9 9 24.5s [ Info: Name nvar ncon status Time f(x) Dual Primal [ Info: biggs6 6 0 unknown 6.4e+00 -1.3e+27 1.7e+27 0.0e+00 [ Info: enso 9 0 first_order 9.5e+00 3.9e+02 2.6e-10 0.0e+00 [ Info: gauss1 8 0 first_order 7.5e+00 6.6e+02 1.4e-09 0.0e+00 [ Info: gauss2 8 0 first_order 2.6e+00 6.2e+02 1.2e-07 0.0e+00 [ Info: gauss3 8 0 first_order 2.9e+00 6.2e+02 2.0e-09 0.0e+00 [ Info: Name nvar ncon status Time f(x) Dual Primal [ Info: biggs6 6 0 unbounded 2.1e+00 -3.9e+16 5.1e+16 0.0e+00 [ Info: enso 9 0 first_order 2.5e+00 3.9e+02 1.8e-05 0.0e+00 [ Info: gauss1 8 0 first_order 2.2e+00 6.6e+02 1.5e-04 0.0e+00 [ Info: gauss2 8 0 first_order 2.2e+00 6.2e+02 1.1e-03 0.0e+00 [ Info: gauss3 8 0 first_order 2.2e+00 6.2e+02 3.4e-04 0.0e+00 [ Info: Name nvar ncon status Time f(x) Dual Primal [ Info: biggs6 6 0 unbounded 1.2e-04 -2.5e+14 3.2e+14 0.0e+00 [ Info: enso 9 0 first_order 4.1e-02 3.9e+02 9.5e-04 0.0e+00 [ Info: gauss1 8 0 max_eval 4.0e-01 3.7e+03 1.6e+03 0.0e+00 [ Info: gauss2 8 0 max_eval 4.1e-01 4.5e+03 4.4e+03 0.0e+00 [ Info: gauss3 8 0 max_eval 4.3e-01 9.3e+03 4.5e+03 0.0e+00 [ Info: Name nvar ncon status Time f(x) Dual Primal [ Info: biggs6 6 0 unbounded 2.1e-04 -3.9e+16 5.1e+16 0.0e+00 [ Info: enso 9 0 first_order 1.4e-02 3.9e+02 1.8e-05 0.0e+00 [ Info: gauss1 8 0 first_order 1.7e-02 6.6e+02 1.5e-04 0.0e+00 [ Info: gauss2 8 0 first_order 1.7e-02 6.2e+02 1.1e-03 0.0e+00 [ Info: gauss3 8 0 first_order 2.5e-02 6.2e+02 3.4e-04 0.0e+00 stats.solver_specific = Dict{Symbol, Any}(:real_time => 3.108144998550415, :internal_msg => (:Error_In_Step_Computation, MathOptInterface.NUMERICAL_ERROR, MathOptInterface.UNKNOWN_RESULT_STATUS)) [ Info: Name nvar ncon status Time f(x) Dual Primal [ Info: biggs6 6 0 unbounded 3.4e+00 -4.2e-01 1.7e+27 0.0e+00 [ Info: enso 9 0 first_order 3.0e+00 3.9e+02 2.6e-10 0.0e+00 [ Info: gauss1 8 0 first_order 2.9e+00 6.6e+02 1.4e-09 0.0e+00 [ Info: gauss2 8 0 first_order 2.8e+00 6.2e+02 1.2e-07 0.0e+00 [ Info: gauss3 8 0 first_order 2.8e+00 6.2e+02 2.0e-09 0.0e+00 [ Info: Name nvar ncon status Time f(x) Dual Primal [ Info: biggs6 6 0 max_eval 1.2e-02 NaN NaN 0.0e+00 [ Info: enso 9 0 first_order 3.9e-03 3.9e+02 8.0e-04 0.0e+00 [ Info: gauss1 8 0 first_order 1.9e-01 6.6e+02 2.1e-03 0.0e+00 [ Info: gauss2 8 0 first_order 1.9e-01 6.2e+02 7.2e-03 0.0e+00 [ Info: gauss3 8 0 first_order 4.3e-01 6.2e+02 1.1e-03 0.0e+00 [ Info: Name nvar ncon status Time f(x) Dual Primal [ Info: biggs6 6 0 not_desc 3.2e-04 -1.1e+174 1.5e+174 0.0e+00 [ Info: enso 9 0 first_order 1.3e-02 3.9e+02 4.5e-04 0.0e+00 [ Info: gauss1 8 0 first_order 4.8e-03 6.6e+02 3.6e-04 0.0e+00 [ Info: gauss2 8 0 first_order 5.5e-03 6.2e+02 1.0e-03 0.0e+00 [ Info: gauss3 8 0 first_order 7.9e-03 6.2e+02 9.0e-04 0.0e+00 [ Info: Name nvar ncon status Time f(x) Dual Primal [ Info: biggs6 6 0 unbounded 3.9e+00 -5.6e+228 7.3e+228 0.0e+00 [ Info: enso 9 0 first_order 6.9e-03 3.9e+02 5.8e-05 0.0e+00 [ Info: gauss1 8 0 first_order 2.3e-03 6.6e+02 1.1e-06 0.0e+00 [ Info: gauss2 8 0 first_order 2.2e-03 6.2e+02 2.9e-07 0.0e+00 [ Info: gauss3 8 0 first_order 1.5e-02 6.2e+02 8.3e-06 0.0e+00 Test Summary: | Pass Total Time Benchmark on unconstrained problems | 1 1 1m35.9s Test Summary: | Pass Total Time Basic solve tests | 4 4 26.8s Test Summary: | Pass Total Time Test solve OptimizationProblems: AMPGO02 | 2 2 1.8s Test Summary: | Pass Total Time Test solve OptimizationProblems: AMPGO03 | 2 2 1.5s Test Summary: | Pass Total Time Test solve OptimizationProblems: AMPGO04 | 2 2 1.5s Test Summary: | Pass Total Time Test solve OptimizationProblems: AMPGO05 | 2 2 1.5s Test Summary: | Pass Total Time Test solve OptimizationProblems: AMPGO06 | 2 2 1.4s The problem lincon-feasres-ffnls has 34 variables and 11 constraint. Algorithm selection: - equalities: ✓; - bounds: ✓; - nonlinear constraints: ✓; - nonlinear objective: ✓; - may use 2-th order derivative. There are 2 optimizers available: ["IPOPT", "Percival"]. Solve using IPOPT: This is Ipopt version 3.14.17, running with linear solver MUMPS 5.7.3. Number of nonzeros in equality constraint Jacobian...: 38 Number of nonzeros in inequality constraint Jacobian.: 0 Number of nonzeros in Lagrangian Hessian.............: 131 Total number of variables............................: 34 variables with only lower bounds: 3 variables with lower and upper bounds: 1 variables with only upper bounds: 4 Total number of equality constraints.................: 11 Total number of inequality constraints...............: 0 inequality constraints with only lower bounds: 0 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 0 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 0.0000000e+00 4.40e+01 1.06e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 2.2804087e-09 1.11e-16 1.00e-02 -1.0 2.93e+00 -4.0 9.90e-01 1.00e+00h 1 2 4.9344545e-10 3.55e-15 4.05e-05 -2.5 2.84e-01 -4.5 9.97e-01 1.00e+00f 1 3 4.0113481e-11 3.32e-16 3.65e-05 -3.8 3.29e+00 -5.0 1.00e+00 1.00e+00f 1 4 9.4659141e-15 4.11e-16 1.79e-07 -5.7 4.85e-02 -5.4 1.00e+00 1.00e+00f 1 5 2.4607576e-20 5.88e-16 6.13e-10 -8.6 4.97e-04 -5.9 1.00e+00 1.00e+00h 1 Number of Iterations....: 5 (scaled) (unscaled) Objective...............: 2.4607576176608067e-20 2.4607576176608067e-20 Dual infeasibility......: 6.1304802952637973e-10 6.1304802952637973e-10 Constraint violation....: 5.8794137114763208e-16 5.8794137114763208e-16 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 2.5123135618349948e-09 2.5123135618349948e-09 Overall NLP error.......: 2.5123135618349948e-09 2.5123135618349948e-09 Number of objective function evaluations = 6 Number of objective gradient evaluations = 6 Number of equality constraint evaluations = 6 Number of inequality constraint evaluations = 0 Number of equality constraint Jacobian evaluations = 6 Number of inequality constraint Jacobian evaluations = 0 Number of Lagrangian Hessian evaluations = 5 Total seconds in IPOPT = 10.168 EXIT: Optimal Solution Found. The problem Generic-feasres-ffnls has 34 variables and 11 constraint. Algorithm selection: - equalities: ✓; - bounds: ✓; - nonlinear constraints: ✓; - nonlinear objective: ✓; - may use 2-th order derivative. There are 2 optimizers available: ["IPOPT", "Percival"]. Solve using IPOPT: This is Ipopt version 3.14.17, running with linear solver MUMPS 5.7.3. Number of nonzeros in equality constraint Jacobian...: 36 Number of nonzeros in inequality constraint Jacobian.: 0 Number of nonzeros in Lagrangian Hessian.............: 26 Total number of variables............................: 34 variables with only lower bounds: 3 variables with lower and upper bounds: 1 variables with only upper bounds: 4 Total number of equality constraints.................: 11 Total number of inequality constraints...............: 0 inequality constraints with only lower bounds: 0 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 0 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 0.0000000e+00 4.40e+01 1.06e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 2.2804087e-09 2.70e-16 1.00e-02 -1.0 2.93e+00 -4.0 9.90e-01 1.00e+00h 1 2 4.9344545e-10 3.55e-15 4.05e-05 -2.5 2.84e-01 -4.5 9.97e-01 1.00e+00f 1 3 4.0113481e-11 5.94e-16 3.65e-05 -3.8 3.29e+00 -5.0 1.00e+00 1.00e+00f 1 4 9.4659141e-15 4.23e-16 1.79e-07 -5.7 4.85e-02 -5.4 1.00e+00 1.00e+00h 1 5 2.4607576e-20 3.49e-16 6.13e-10 -8.6 4.97e-04 -5.9 1.00e+00 1.00e+00h 1 Number of Iterations....: 5 (scaled) (unscaled) Objective...............: 2.4607576176600535e-20 2.4607576176600535e-20 Dual infeasibility......: 6.1304802952640620e-10 6.1304802952640620e-10 Constraint violation....: 3.4883590563019920e-16 3.4883590563019920e-16 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 2.5123135618349948e-09 2.5123135618349948e-09 Overall NLP error.......: 2.5123135618349948e-09 2.5123135618349948e-09 Number of objective function evaluations = 6 Number of objective gradient evaluations = 6 Number of equality constraint evaluations = 6 Number of inequality constraint evaluations = 0 Number of equality constraint Jacobian evaluations = 6 Number of inequality constraint Jacobian evaluations = 0 Number of Lagrangian Hessian evaluations = 5 Total seconds in IPOPT = 5.543 EXIT: Optimal Solution Found. Test Summary: | Time Test feasible | None 27.9s Test Summary: |Time Test options in KNITRO | None 0.0s Test Summary: | Pass Total Time Test options in LBFGS | 1 1 2.3s Test Summary: | Pass Total Time Test options in R2 | 1 1 1.8s Test Summary: | Pass Total Time Test options in TRON | 1 1 5.6s Test Summary: | Pass Total Time Test options in TRUNK | 1 1 2.3s Test Summary: | Pass Total Time Test options in TRON-NLS | 1 1 0.1s Test Summary: | Pass Total Time Test options in TRUNK-NLS | 1 1 0.1s Test Summary: | Pass Total Time Test options in CaNNOLeS | 1 1 12.2s ┌ Warning: Not implemented option `atol` for IPOPT. └ @ JSOSuite ~/.julia/packages/JSOSuite/itKIP/src/solvers/ipopt_solve.jl:11 ┌ Warning: Not implemented option `max_eval` for IPOPT. └ @ JSOSuite ~/.julia/packages/JSOSuite/itKIP/src/solvers/ipopt_solve.jl:28 Test Summary: | Pass Total Time Test options in IPOPT | 1 1 4.1s Test Summary: | Pass Total Time Test options in DCISolver | 1 1 9.7s Test Summary: | Pass Total Time Test options in FletcherPenaltySolver | 1 1 13.2s ┌ Warning: Problem does not have general constraints; calling tron └ @ Percival ~/.julia/packages/Percival/QKyOW/src/method.jl:36 Test Summary: | Pass Total Time Test options in Percival | 1 1 3.6s ┌ Warning: Not implemented option `max_eval` for RipQP. └ @ JSOSuite ~/.julia/packages/JSOSuite/itKIP/src/solvers/ripqp_solve.jl:54 Test Summary: | Pass Total Time Test options in RipQP | 1 1 2.4s ┌ Warning: Not implemented option `atol` for IPOPT. └ @ JSOSuite ~/.julia/packages/JSOSuite/itKIP/src/solvers/ipopt_solve.jl:11 ┌ Warning: Not implemented option `max_eval` for IPOPT. └ @ JSOSuite ~/.julia/packages/JSOSuite/itKIP/src/solvers/ipopt_solve.jl:28 ┌ Warning: Not implemented option `callback` for IPOPT. └ @ JSOSuite ~/.julia/packages/JSOSuite/itKIP/src/solvers/ipopt_solve.jl:32 ┌ Warning: Problem does not have general constraints; calling tron └ @ Percival ~/.julia/packages/Percival/QKyOW/src/method.jl:36 ┌ Warning: Not implemented option `max_eval` for RipQP. └ @ JSOSuite ~/.julia/packages/JSOSuite/itKIP/src/solvers/ripqp_solve.jl:54 ┌ Warning: Not implemented option `callback` for RipQP. └ @ JSOSuite ~/.julia/packages/JSOSuite/itKIP/src/solvers/ripqp_solve.jl:58 Test Summary: | Pass Total Time Test kwargs in optimizers on arglina | 12 12 24.7s ┌ Warning: Not implemented option `atol` for IPOPT. └ @ JSOSuite ~/.julia/packages/JSOSuite/itKIP/src/solvers/ipopt_solve.jl:11 ┌ Warning: Not implemented option `max_eval` for IPOPT. └ @ JSOSuite ~/.julia/packages/JSOSuite/itKIP/src/solvers/ipopt_solve.jl:28 ┌ Warning: Not implemented option `callback` for IPOPT. └ @ JSOSuite ~/.julia/packages/JSOSuite/itKIP/src/solvers/ipopt_solve.jl:32 ┌ Warning: Not implemented option `max_eval` for RipQP. └ @ JSOSuite ~/.julia/packages/JSOSuite/itKIP/src/solvers/ripqp_solve.jl:54 ┌ Warning: Not implemented option `callback` for RipQP. └ @ JSOSuite ~/.julia/packages/JSOSuite/itKIP/src/solvers/ripqp_solve.jl:58 Test Summary: | Pass Total Time Test kwargs in optimizers on hs6 | 6 6 31.2s Testing JSOSuite tests passed Testing completed after 1418.71s PkgEval succeeded after 2478.17s