If you think that there is an error in how your package is being tested or represented, please file an issue at NewPkgEval.jl , making sure to read the FAQ first.
Results with Julia v1.2.0
Testing was unsuccessful : testing failed for unknown reasons.
Last evaluation was ago and took 5 minutes, 14 seconds.
Click here to download the log file.
Click here to show the log contents.
Resolving package versions...
Installed FastClosures ───────── v0.3.2
Installed URIParser ──────────── v0.4.0
Installed TimerOutputs ───────── v0.5.3
Installed ReverseDiffSparse ──── v0.8.6
Installed CommonSubexpressions ─ v0.2.0
Installed NLPModelsJuMP ──────── v0.4.0
Installed BinaryProvider ─────── v0.5.8
Installed JuMP ───────────────── v0.18.6
Installed Compat ─────────────── v2.2.0
Installed ForwardDiff ────────── v0.10.7
Installed DiffRules ──────────── v0.1.0
Installed Calculus ───────────── v0.5.1
Installed OrderedCollections ─── v1.1.0
Installed MathProgBase ───────── v0.7.7
Installed DataStructures ─────── v0.17.6
Installed NLPModels ──────────── v0.8.3
Installed StaticArrays ───────── v0.12.1
Installed NaNMath ────────────── v0.3.3
Installed LinearOperators ────── v0.7.1
Installed SpecialFunctions ───── v0.8.0
Installed BinDeps ────────────── v0.8.10
Installed DiffResults ────────── v0.0.4
Updating `~/.julia/environments/v1.2/Project.toml`
[792afdf1] + NLPModelsJuMP v0.4.0
Updating `~/.julia/environments/v1.2/Manifest.toml`
[9e28174c] + BinDeps v0.8.10
[b99e7846] + BinaryProvider v0.5.8
[49dc2e85] + Calculus v0.5.1
[bbf7d656] + CommonSubexpressions v0.2.0
[34da2185] + Compat v2.2.0
[864edb3b] + DataStructures v0.17.6
[163ba53b] + DiffResults v0.0.4
[b552c78f] + DiffRules v0.1.0
[9aa1b823] + FastClosures v0.3.2
[f6369f11] + ForwardDiff v0.10.7
[4076af6c] + JuMP v0.18.6
[5c8ed15e] + LinearOperators v0.7.1
[fdba3010] + MathProgBase v0.7.7
[a4795742] + NLPModels v0.8.3
[792afdf1] + NLPModelsJuMP v0.4.0
[77ba4419] + NaNMath v0.3.3
[bac558e1] + OrderedCollections v1.1.0
[89212889] + ReverseDiffSparse v0.8.6
[276daf66] + SpecialFunctions v0.8.0
[90137ffa] + StaticArrays v0.12.1
[a759f4b9] + TimerOutputs v0.5.3
[30578b45] + URIParser v0.4.0
[2a0f44e3] + Base64
[ade2ca70] + Dates
[8bb1440f] + DelimitedFiles
[8ba89e20] + Distributed
[b77e0a4c] + InteractiveUtils
[76f85450] + LibGit2
[8f399da3] + Libdl
[37e2e46d] + LinearAlgebra
[56ddb016] + Logging
[d6f4376e] + Markdown
[a63ad114] + Mmap
[44cfe95a] + Pkg
[de0858da] + Printf
[3fa0cd96] + REPL
[9a3f8284] + Random
[ea8e919c] + SHA
[9e88b42a] + Serialization
[1a1011a3] + SharedArrays
[6462fe0b] + Sockets
[2f01184e] + SparseArrays
[10745b16] + Statistics
[8dfed614] + Test
[cf7118a7] + UUIDs
[4ec0a83e] + Unicode
Building SpecialFunctions → `~/.julia/packages/SpecialFunctions/ne2iw/deps/build.log`
Testing NLPModelsJuMP
Resolving package versions...
Installed JSON ───────────── v0.21.0
Installed BenchmarkTools ─── v0.4.3
Installed Ipopt ──────────── v0.6.1
Installed Parsers ────────── v0.3.10
Installed MathOptInterface ─ v0.9.7
Building Ipopt → `~/.julia/packages/Ipopt/ruIXY/deps/build.log`
Status `/tmp/jl_0h6pef/Manifest.toml`
[6e4b80f9] BenchmarkTools v0.4.3
[9e28174c] BinDeps v0.8.10
[b99e7846] BinaryProvider v0.5.8
[49dc2e85] Calculus v0.5.1
[bbf7d656] CommonSubexpressions v0.2.0
[34da2185] Compat v2.2.0
[864edb3b] DataStructures v0.17.6
[163ba53b] DiffResults v0.0.4
[b552c78f] DiffRules v0.1.0
[9aa1b823] FastClosures v0.3.2
[f6369f11] ForwardDiff v0.10.7
[b6b21f68] Ipopt v0.6.1
[682c06a0] JSON v0.21.0
[4076af6c] JuMP v0.18.6
[5c8ed15e] LinearOperators v0.7.1
[b8f27783] MathOptInterface v0.9.7
[fdba3010] MathProgBase v0.7.7
[a4795742] NLPModels v0.8.3
[792afdf1] NLPModelsJuMP v0.4.0
[77ba4419] NaNMath v0.3.3
[bac558e1] OrderedCollections v1.1.0
[69de0a69] Parsers v0.3.10
[89212889] ReverseDiffSparse v0.8.6
[276daf66] SpecialFunctions v0.8.0
[90137ffa] StaticArrays v0.12.1
[a759f4b9] TimerOutputs v0.5.3
[30578b45] URIParser v0.4.0
[2a0f44e3] Base64 [`@stdlib/Base64`]
[ade2ca70] Dates [`@stdlib/Dates`]
[8bb1440f] DelimitedFiles [`@stdlib/DelimitedFiles`]
[8ba89e20] Distributed [`@stdlib/Distributed`]
[b77e0a4c] InteractiveUtils [`@stdlib/InteractiveUtils`]
[76f85450] LibGit2 [`@stdlib/LibGit2`]
[8f399da3] Libdl [`@stdlib/Libdl`]
[37e2e46d] LinearAlgebra [`@stdlib/LinearAlgebra`]
[56ddb016] Logging [`@stdlib/Logging`]
[d6f4376e] Markdown [`@stdlib/Markdown`]
[a63ad114] Mmap [`@stdlib/Mmap`]
[44cfe95a] Pkg [`@stdlib/Pkg`]
[de0858da] Printf [`@stdlib/Printf`]
[3fa0cd96] REPL [`@stdlib/REPL`]
[9a3f8284] Random [`@stdlib/Random`]
[ea8e919c] SHA [`@stdlib/SHA`]
[9e88b42a] Serialization [`@stdlib/Serialization`]
[1a1011a3] SharedArrays [`@stdlib/SharedArrays`]
[6462fe0b] Sockets [`@stdlib/Sockets`]
[2f01184e] SparseArrays [`@stdlib/SparseArrays`]
[10745b16] Statistics [`@stdlib/Statistics`]
[8dfed614] Test [`@stdlib/Test`]
[cf7118a7] UUIDs [`@stdlib/UUIDs`]
[4ec0a83e] Unicode [`@stdlib/Unicode`]
Minimization problem Generic
nvar = 2, ncon = 1 (0 linear)
Minimization problem Generic
nvar = 2, ncon = 1 (0 linear)
lvar = -1.0 -1.0
uvar = 1.0 1.0
lcon = 0.0
ucon = 0.0
x0 = 1.0 1.0
y0 = 0.0
nnzh = 3
nnzj = 2
nonlinear constraints: 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 http://projects.coin-or.org/Ipopt
******************************************************************************
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation).
Number of nonzeros in equality constraint Jacobian...: 2
Number of nonzeros in inequality constraint Jacobian.: 0
Number of nonzeros in Lagrangian Hessian.............: 3
Total number of variables............................: 2
variables with only lower bounds: 0
variables with lower and upper bounds: 2
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 1.9602000e+00 9.80e-01 0.00e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 5.0000000e-01 0.00e+00 3.83e+01 -1.0 4.90e-01 - 2.47e-02 1.00e+00f 1
2 5.0000000e-01 0.00e+00 7.94e-15 -1.0 0.00e+00 - 1.00e+00 1.00e+00 0
3 5.0000000e-01 0.00e+00 5.55e-17 -2.5 0.00e+00 - 1.00e+00 1.00e+00 0
4 5.0000000e-01 0.00e+00 2.82e-17 -3.8 0.00e+00 - 1.00e+00 1.00e+00 0
5 5.0000000e-01 0.00e+00 1.02e-16 -5.7 3.39e-21 - 1.00e+00 1.00e+00T 0
6 5.0000000e-01 0.00e+00 1.09e-17 -8.6 0.00e+00 - 1.00e+00 1.00e+00T 0
Number of Iterations....: 6
(scaled) (unscaled)
Objective...............: 5.0000000000000000e-01 5.0000000000000000e-01
Dual infeasibility......: 1.0851339087274842e-17 1.0851339087274842e-17
Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00
Complementarity.........: 2.5059035596800845e-09 2.5059035596800845e-09
Overall NLP error.......: 2.5059035596800845e-09 2.5059035596800845e-09
Number of objective function evaluations = 7
Number of objective gradient evaluations = 7
Number of equality constraint evaluations = 7
Number of inequality constraint evaluations = 0
Number of equality constraint Jacobian evaluations = 7
Number of inequality constraint Jacobian evaluations = 0
Number of Lagrangian Hessian evaluations = 6
Total CPU secs in IPOPT (w/o function evaluations) = 1.790
Total CPU secs in NLP function evaluations = 1.315
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation).
Number of nonzeros in equality constraint Jacobian...: 2
Number of nonzeros in inequality constraint Jacobian.: 0
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.................: 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 4.8400000e+00 4.40e+00 1.56e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 1.5175599e+00 9.37e+00 1.88e+00 -1.0 1.88e+00 0.0 1.00e+00 1.00e+00f 1
2 1.5057311e+00 6.05e+01 5.42e-01 -1.0 2.46e+00 0.4 1.00e+00 1.00e+00f 1
3 2.1067038e+00 2.19e-14 2.90e+00 -1.0 5.88e+00 - 1.00e+00 1.00e+00H 1
4 0.0000000e+00 2.11e+01 0.00e+00 -1.0 1.45e+00 - 1.00e+00 1.00e+00f 1
5 0.0000000e+00 0.00e+00 0.00e+00 -1.0 2.11e+00 - 1.00e+00 1.00e+00h 1
Number of Iterations....: 5
(scaled) (unscaled)
Objective...............: 0.0000000000000000e+00 0.0000000000000000e+00
Dual infeasibility......: 0.0000000000000000e+00 0.0000000000000000e+00
Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00
Complementarity.........: 0.0000000000000000e+00 0.0000000000000000e+00
Overall NLP error.......: 0.0000000000000000e+00 0.0000000000000000e+00
Number of objective function evaluations = 7
Number of objective gradient evaluations = 6
Number of equality constraint evaluations = 7
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 CPU secs in IPOPT (w/o function evaluations) = 0.671
Total CPU secs in NLP function evaluations = 0.252
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation).
Number of nonzeros in equality constraint Jacobian...: 0
Number of nonzeros in inequality constraint Jacobian.: 0
Number of nonzeros in Lagrangian Hessian.............: 55
Total number of variables............................: 10
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 1.6881633e-02 0.00e+00 3.72e-01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 1.3104791e-02 0.00e+00 3.45e-01 -1.7 3.57e-03 2.0 1.00e+00 1.00e+00f 1
2 7.1684879e-03 0.00e+00 2.06e-01 -1.7 8.13e-03 1.5 1.00e+00 1.00e+00f 1
3 5.0503944e-03 0.00e+00 3.91e-02 -1.7 6.79e-03 1.0 1.00e+00 1.00e+00f 1
4 4.2729157e-03 0.00e+00 2.42e-02 -2.5 6.85e-03 0.6 1.00e+00 1.00e+00f 1
5 3.8009908e-03 0.00e+00 1.18e-02 -3.8 6.96e-03 0.1 1.00e+00 1.00e+00f 1
6 3.6107425e-03 0.00e+00 7.10e-03 -3.8 1.04e-02 -0.4 1.00e+00 1.00e+00f 1
7 3.5620665e-03 0.00e+00 3.71e-03 -3.8 3.37e-03 0.0 1.00e+00 1.00e+00f 1
8 3.4459562e-03 0.00e+00 3.62e-03 -3.8 9.59e-03 -0.4 1.00e+00 1.00e+00f 1
9 3.4105091e-03 0.00e+00 3.23e-03 -3.8 3.09e-03 -0.0 1.00e+00 1.00e+00f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10 3.3370143e-03 0.00e+00 3.71e-03 -3.8 7.63e-03 -0.5 1.00e+00 1.00e+00f 1
11 3.3168049e-03 0.00e+00 2.30e-03 -3.8 2.39e-03 -0.1 1.00e+00 1.00e+00f 1
12 3.2825415e-03 0.00e+00 2.65e-03 -3.8 5.24e-03 -0.5 1.00e+00 1.00e+00f 1
13 3.2583787e-03 0.00e+00 4.50e-03 -3.8 6.23e-03 -1.0 1.00e+00 1.00e+00f 1
14 3.2522583e-03 0.00e+00 1.93e-03 -3.8 3.78e-03 - 1.00e+00 1.00e+00f 1
15 3.2519781e-03 0.00e+00 4.90e-05 -3.8 6.32e-04 - 1.00e+00 1.00e+00f 1
16 3.2519774e-03 0.00e+00 3.08e-07 -5.7 4.82e-05 - 1.00e+00 1.00e+00f 1
17 3.2519774e-03 0.00e+00 1.06e-12 -8.6 9.33e-08 - 1.00e+00 1.00e+00f 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 3.2519774004411590e-03 3.2519774004411590e-03
Dual infeasibility......: 1.0580217257860625e-12 1.0580217257860625e-12
Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00
Complementarity.........: 0.0000000000000000e+00 0.0000000000000000e+00
Overall NLP error.......: 1.0580217257860625e-12 1.0580217257860625e-12
Number of objective function evaluations = 18
Number of objective gradient evaluations = 18
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 = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.183
Total CPU secs in NLP function evaluations = 0.086
EXIT: Optimal Solution Found.
Checking problem brownden ERROR: LoadError: LoadError: too many parameters for type
Stacktrace:
[1] #hess_op#95(::Base.Iterators.Pairs{Union{},Union{},Tuple{},NamedTuple{(),Tuple{}}}, ::typeof(hess_op), ::ADNLPModel, ::Array{Float64,1}) at /root/.julia/packages/NLPModels/OHjPv/src/NLPModels.jl:391
[2] hess_op(::ADNLPModel, ::Array{Float64,1}) at /root/.julia/packages/NLPModels/OHjPv/src/NLPModels.jl:389
[3] #consistent_functions#75(::Float64, ::Array{Any,1}, ::typeof(consistent_functions), ::Array{AbstractNLPModel,1}) at /root/.julia/packages/NLPModels/OHjPv/test/consistency.jl:124
[4] #consistent_functions at ./none:0 [inlined]
[5] #consistent_nlps#90(::Float64, ::typeof(consistent_nlps), ::Array{AbstractNLPModel,1}) at /root/.julia/packages/NLPModels/OHjPv/test/consistency.jl:320
[6] consistent_nlps(::Array{AbstractNLPModel,1}) at /root/.julia/packages/NLPModels/OHjPv/test/consistency.jl:318
[7] test_consistency() at /root/.julia/packages/NLPModelsJuMP/Ao59I/test/consistency.jl:14
[8] top-level scope at /root/.julia/packages/NLPModelsJuMP/Ao59I/test/consistency.jl:18
[9] include at ./boot.jl:328 [inlined]
[10] include_relative(::Module, ::String) at ./loading.jl:1094
[11] include(::Module, ::String) at ./Base.jl:31
[12] include(::String) at ./client.jl:431
[13] top-level scope at /root/.julia/packages/NLPModelsJuMP/Ao59I/test/runtests.jl:14
[14] include at ./boot.jl:328 [inlined]
[15] include_relative(::Module, ::String) at ./loading.jl:1094
[16] include(::Module, ::String) at ./Base.jl:31
[17] include(::String) at ./client.jl:431
[18] top-level scope at none:5
in expression starting at /root/.julia/packages/NLPModelsJuMP/Ao59I/test/consistency.jl:18
in expression starting at /root/.julia/packages/NLPModelsJuMP/Ao59I/test/runtests.jl:14
ERROR: Package NLPModelsJuMP errored during testing
Stacktrace:
[1] pkgerror(::String, ::Vararg{String,N} where N) at /buildworker/worker/package_linux64/build/usr/share/julia/stdlib/v1.2/Pkg/src/Types.jl:112
[2] #test#119(::Bool, ::Nothing, ::typeof(Pkg.Operations.test), ::Pkg.Types.Context, ::Array{Pkg.Types.PackageSpec,1}) at /buildworker/worker/package_linux64/build/usr/share/julia/stdlib/v1.2/Pkg/src/Operations.jl:1288
[3] #test at ./none:0 [inlined]
[4] #test#62(::Bool, ::Nothing, ::Base.Iterators.Pairs{Union{},Union{},Tuple{},NamedTuple{(),Tuple{}}}, ::typeof(Pkg.API.test), ::Pkg.Types.Context, ::Array{Pkg.Types.PackageSpec,1}) at /buildworker/worker/package_linux64/build/usr/share/julia/stdlib/v1.2/Pkg/src/API.jl:245
[5] test at /buildworker/worker/package_linux64/build/usr/share/julia/stdlib/v1.2/Pkg/src/API.jl:233 [inlined]
[6] #test#61 at /buildworker/worker/package_linux64/build/usr/share/julia/stdlib/v1.2/Pkg/src/API.jl:230 [inlined]
[7] test at /buildworker/worker/package_linux64/build/usr/share/julia/stdlib/v1.2/Pkg/src/API.jl:230 [inlined]
[8] #test#60 at /buildworker/worker/package_linux64/build/usr/share/julia/stdlib/v1.2/Pkg/src/API.jl:229 [inlined]
[9] test at /buildworker/worker/package_linux64/build/usr/share/julia/stdlib/v1.2/Pkg/src/API.jl:229 [inlined]
[10] #test#59(::Base.Iterators.Pairs{Union{},Union{},Tuple{},NamedTuple{(),Tuple{}}}, ::typeof(Pkg.API.test), ::String) at /buildworker/worker/package_linux64/build/usr/share/julia/stdlib/v1.2/Pkg/src/API.jl:228
[11] test(::String) at /buildworker/worker/package_linux64/build/usr/share/julia/stdlib/v1.2/Pkg/src/API.jl:228
[12] top-level scope at none:10
Results with Julia v1.3.0
Testing was unsuccessful : testing failed for unknown reasons.
Last evaluation was ago and took 5 minutes, 27 seconds.
Click here to download the log file.
Click here to show the log contents.
Resolving package versions...
Installed FastClosures ───────── v0.3.2
Installed ReverseDiffSparse ──── v0.8.6
Installed Compat ─────────────── v2.2.0
Installed DiffResults ────────── v0.0.4
Installed NLPModelsJuMP ──────── v0.4.0
Installed LinearOperators ────── v0.7.1
Installed DataStructures ─────── v0.17.6
Installed StaticArrays ───────── v0.12.1
Installed OrderedCollections ─── v1.1.0
Installed TimerOutputs ───────── v0.5.3
Installed NaNMath ────────────── v0.3.3
Installed ForwardDiff ────────── v0.10.7
Installed CommonSubexpressions ─ v0.2.0
Installed SpecialFunctions ───── v0.9.0
Installed NLPModels ──────────── v0.8.3
Installed OpenSpecFun_jll ────── v0.5.3+1
Installed JuMP ───────────────── v0.18.6
Installed MathProgBase ───────── v0.7.7
Installed DiffRules ──────────── v0.1.0
Installed Calculus ───────────── v0.5.1
Updating `~/.julia/environments/v1.3/Project.toml`
[792afdf1] + NLPModelsJuMP v0.4.0
Updating `~/.julia/environments/v1.3/Manifest.toml`
[49dc2e85] + Calculus v0.5.1
[bbf7d656] + CommonSubexpressions v0.2.0
[34da2185] + Compat v2.2.0
[864edb3b] + DataStructures v0.17.6
[163ba53b] + DiffResults v0.0.4
[b552c78f] + DiffRules v0.1.0
[9aa1b823] + FastClosures v0.3.2
[f6369f11] + ForwardDiff v0.10.7
[4076af6c] + JuMP v0.18.6
[5c8ed15e] + LinearOperators v0.7.1
[fdba3010] + MathProgBase v0.7.7
[a4795742] + NLPModels v0.8.3
[792afdf1] + NLPModelsJuMP v0.4.0
[77ba4419] + NaNMath v0.3.3
[efe28fd5] + OpenSpecFun_jll v0.5.3+1
[bac558e1] + OrderedCollections v1.1.0
[89212889] + ReverseDiffSparse v0.8.6
[276daf66] + SpecialFunctions v0.9.0
[90137ffa] + StaticArrays v0.12.1
[a759f4b9] + TimerOutputs v0.5.3
[2a0f44e3] + Base64
[ade2ca70] + Dates
[8bb1440f] + DelimitedFiles
[8ba89e20] + Distributed
[b77e0a4c] + InteractiveUtils
[76f85450] + LibGit2
[8f399da3] + Libdl
[37e2e46d] + LinearAlgebra
[56ddb016] + Logging
[d6f4376e] + Markdown
[a63ad114] + Mmap
[44cfe95a] + Pkg
[de0858da] + Printf
[3fa0cd96] + REPL
[9a3f8284] + Random
[ea8e919c] + SHA
[9e88b42a] + Serialization
[1a1011a3] + SharedArrays
[6462fe0b] + Sockets
[2f01184e] + SparseArrays
[10745b16] + Statistics
[8dfed614] + Test
[cf7118a7] + UUIDs
[4ec0a83e] + Unicode
Testing NLPModelsJuMP
Resolving package versions...
Installed JSON ───────────── v0.21.0
Installed Ipopt ──────────── v0.6.1
Installed Parsers ────────── v0.3.10
Installed MathOptInterface ─ v0.9.7
Installed BinaryProvider ─── v0.5.8
Installed BenchmarkTools ─── v0.4.3
Building Ipopt → `~/.julia/packages/Ipopt/ruIXY/deps/build.log`
Status `/tmp/jl_pdhqI4/Manifest.toml`
[6e4b80f9] BenchmarkTools v0.4.3
[b99e7846] BinaryProvider v0.5.8
[49dc2e85] Calculus v0.5.1
[bbf7d656] CommonSubexpressions v0.2.0
[34da2185] Compat v2.2.0
[864edb3b] DataStructures v0.17.6
[163ba53b] DiffResults v0.0.4
[b552c78f] DiffRules v0.1.0
[9aa1b823] FastClosures v0.3.2
[f6369f11] ForwardDiff v0.10.7
[b6b21f68] Ipopt v0.6.1
[682c06a0] JSON v0.21.0
[4076af6c] JuMP v0.18.6
[5c8ed15e] LinearOperators v0.7.1
[b8f27783] MathOptInterface v0.9.7
[fdba3010] MathProgBase v0.7.7
[a4795742] NLPModels v0.8.3
[792afdf1] NLPModelsJuMP v0.4.0
[77ba4419] NaNMath v0.3.3
[efe28fd5] OpenSpecFun_jll v0.5.3+1
[bac558e1] OrderedCollections v1.1.0
[69de0a69] Parsers v0.3.10
[89212889] ReverseDiffSparse v0.8.6
[276daf66] SpecialFunctions v0.9.0
[90137ffa] StaticArrays v0.12.1
[a759f4b9] TimerOutputs v0.5.3
[2a0f44e3] Base64 [`@stdlib/Base64`]
[ade2ca70] Dates [`@stdlib/Dates`]
[8bb1440f] DelimitedFiles [`@stdlib/DelimitedFiles`]
[8ba89e20] Distributed [`@stdlib/Distributed`]
[b77e0a4c] InteractiveUtils [`@stdlib/InteractiveUtils`]
[76f85450] LibGit2 [`@stdlib/LibGit2`]
[8f399da3] Libdl [`@stdlib/Libdl`]
[37e2e46d] LinearAlgebra [`@stdlib/LinearAlgebra`]
[56ddb016] Logging [`@stdlib/Logging`]
[d6f4376e] Markdown [`@stdlib/Markdown`]
[a63ad114] Mmap [`@stdlib/Mmap`]
[44cfe95a] Pkg [`@stdlib/Pkg`]
[de0858da] Printf [`@stdlib/Printf`]
[3fa0cd96] REPL [`@stdlib/REPL`]
[9a3f8284] Random [`@stdlib/Random`]
[ea8e919c] SHA [`@stdlib/SHA`]
[9e88b42a] Serialization [`@stdlib/Serialization`]
[1a1011a3] SharedArrays [`@stdlib/SharedArrays`]
[6462fe0b] Sockets [`@stdlib/Sockets`]
[2f01184e] SparseArrays [`@stdlib/SparseArrays`]
[10745b16] Statistics [`@stdlib/Statistics`]
[8dfed614] Test [`@stdlib/Test`]
[cf7118a7] UUIDs [`@stdlib/UUIDs`]
[4ec0a83e] Unicode [`@stdlib/Unicode`]
Minimization problem Generic
nvar = 2, ncon = 1 (0 linear)
Minimization problem Generic
nvar = 2, ncon = 1 (0 linear)
lvar = -1.0 -1.0
uvar = 1.0 1.0
lcon = 0.0
ucon = 0.0
x0 = 1.0 1.0
y0 = 0.0
nnzh = 3
nnzj = 2
nonlinear constraints: 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 http://projects.coin-or.org/Ipopt
******************************************************************************
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation).
Number of nonzeros in equality constraint Jacobian...: 2
Number of nonzeros in inequality constraint Jacobian.: 0
Number of nonzeros in Lagrangian Hessian.............: 3
Total number of variables............................: 2
variables with only lower bounds: 0
variables with lower and upper bounds: 2
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 1.9602000e+00 9.80e-01 0.00e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 5.0000000e-01 0.00e+00 3.83e+01 -1.0 4.90e-01 - 2.47e-02 1.00e+00f 1
2 5.0000000e-01 0.00e+00 7.94e-15 -1.0 0.00e+00 - 1.00e+00 1.00e+00 0
3 5.0000000e-01 0.00e+00 5.55e-17 -2.5 0.00e+00 - 1.00e+00 1.00e+00 0
4 5.0000000e-01 0.00e+00 2.82e-17 -3.8 0.00e+00 - 1.00e+00 1.00e+00 0
5 5.0000000e-01 0.00e+00 1.02e-16 -5.7 3.39e-21 - 1.00e+00 1.00e+00T 0
6 5.0000000e-01 0.00e+00 1.09e-17 -8.6 0.00e+00 - 1.00e+00 1.00e+00T 0
Number of Iterations....: 6
(scaled) (unscaled)
Objective...............: 5.0000000000000000e-01 5.0000000000000000e-01
Dual infeasibility......: 1.0851339087274842e-17 1.0851339087274842e-17
Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00
Complementarity.........: 2.5059035596800845e-09 2.5059035596800845e-09
Overall NLP error.......: 2.5059035596800845e-09 2.5059035596800845e-09
Number of objective function evaluations = 7
Number of objective gradient evaluations = 7
Number of equality constraint evaluations = 7
Number of inequality constraint evaluations = 0
Number of equality constraint Jacobian evaluations = 7
Number of inequality constraint Jacobian evaluations = 0
Number of Lagrangian Hessian evaluations = 6
Total CPU secs in IPOPT (w/o function evaluations) = 1.353
Total CPU secs in NLP function evaluations = 1.146
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation).
Number of nonzeros in equality constraint Jacobian...: 2
Number of nonzeros in inequality constraint Jacobian.: 0
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.................: 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 4.8400000e+00 4.40e+00 1.56e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 1.5175599e+00 9.37e+00 1.88e+00 -1.0 1.88e+00 0.0 1.00e+00 1.00e+00f 1
2 1.5057311e+00 6.05e+01 5.42e-01 -1.0 2.46e+00 0.4 1.00e+00 1.00e+00f 1
3 2.1067038e+00 2.19e-14 2.90e+00 -1.0 5.88e+00 - 1.00e+00 1.00e+00H 1
4 0.0000000e+00 2.11e+01 0.00e+00 -1.0 1.45e+00 - 1.00e+00 1.00e+00f 1
5 0.0000000e+00 0.00e+00 0.00e+00 -1.0 2.11e+00 - 1.00e+00 1.00e+00h 1
Number of Iterations....: 5
(scaled) (unscaled)
Objective...............: 0.0000000000000000e+00 0.0000000000000000e+00
Dual infeasibility......: 0.0000000000000000e+00 0.0000000000000000e+00
Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00
Complementarity.........: 0.0000000000000000e+00 0.0000000000000000e+00
Overall NLP error.......: 0.0000000000000000e+00 0.0000000000000000e+00
Number of objective function evaluations = 7
Number of objective gradient evaluations = 6
Number of equality constraint evaluations = 7
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 CPU secs in IPOPT (w/o function evaluations) = 0.589
Total CPU secs in NLP function evaluations = 0.211
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation).
Number of nonzeros in equality constraint Jacobian...: 0
Number of nonzeros in inequality constraint Jacobian.: 0
Number of nonzeros in Lagrangian Hessian.............: 55
Total number of variables............................: 10
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 1.6881633e-02 0.00e+00 3.72e-01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 1.3104791e-02 0.00e+00 3.45e-01 -1.7 3.57e-03 2.0 1.00e+00 1.00e+00f 1
2 7.1684879e-03 0.00e+00 2.06e-01 -1.7 8.13e-03 1.5 1.00e+00 1.00e+00f 1
3 5.0503944e-03 0.00e+00 3.91e-02 -1.7 6.79e-03 1.0 1.00e+00 1.00e+00f 1
4 4.2729157e-03 0.00e+00 2.42e-02 -2.5 6.85e-03 0.6 1.00e+00 1.00e+00f 1
5 3.8009908e-03 0.00e+00 1.18e-02 -3.8 6.96e-03 0.1 1.00e+00 1.00e+00f 1
6 3.6107425e-03 0.00e+00 7.10e-03 -3.8 1.04e-02 -0.4 1.00e+00 1.00e+00f 1
7 3.5620665e-03 0.00e+00 3.71e-03 -3.8 3.37e-03 0.0 1.00e+00 1.00e+00f 1
8 3.4459562e-03 0.00e+00 3.62e-03 -3.8 9.59e-03 -0.4 1.00e+00 1.00e+00f 1
9 3.4105091e-03 0.00e+00 3.23e-03 -3.8 3.09e-03 -0.0 1.00e+00 1.00e+00f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10 3.3370143e-03 0.00e+00 3.71e-03 -3.8 7.63e-03 -0.5 1.00e+00 1.00e+00f 1
11 3.3168049e-03 0.00e+00 2.30e-03 -3.8 2.39e-03 -0.1 1.00e+00 1.00e+00f 1
12 3.2825415e-03 0.00e+00 2.65e-03 -3.8 5.24e-03 -0.5 1.00e+00 1.00e+00f 1
13 3.2583787e-03 0.00e+00 4.50e-03 -3.8 6.23e-03 -1.0 1.00e+00 1.00e+00f 1
14 3.2522583e-03 0.00e+00 1.93e-03 -3.8 3.78e-03 - 1.00e+00 1.00e+00f 1
15 3.2519781e-03 0.00e+00 4.90e-05 -3.8 6.32e-04 - 1.00e+00 1.00e+00f 1
16 3.2519774e-03 0.00e+00 3.08e-07 -5.7 4.82e-05 - 1.00e+00 1.00e+00f 1
17 3.2519774e-03 0.00e+00 1.06e-12 -8.6 9.33e-08 - 1.00e+00 1.00e+00f 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 3.2519774004411590e-03 3.2519774004411590e-03
Dual infeasibility......: 1.0580217257860625e-12 1.0580217257860625e-12
Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00
Complementarity.........: 0.0000000000000000e+00 0.0000000000000000e+00
Overall NLP error.......: 1.0580217257860625e-12 1.0580217257860625e-12
Number of objective function evaluations = 18
Number of objective gradient evaluations = 18
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 = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.163
Total CPU secs in NLP function evaluations = 0.091
EXIT: Optimal Solution Found.
Checking problem brownden ERROR: LoadError: LoadError: too many parameters for type
Stacktrace:
[1] #hess_op#95(::Base.Iterators.Pairs{Union{},Union{},Tuple{},NamedTuple{(),Tuple{}}}, ::typeof(hess_op), ::ADNLPModel, ::Array{Float64,1}) at /root/.julia/packages/NLPModels/OHjPv/src/NLPModels.jl:391
[2] hess_op(::ADNLPModel, ::Array{Float64,1}) at /root/.julia/packages/NLPModels/OHjPv/src/NLPModels.jl:389
[3] #consistent_functions#75(::Float64, ::Array{Any,1}, ::typeof(consistent_functions), ::Array{AbstractNLPModel,1}) at /root/.julia/packages/NLPModels/OHjPv/test/consistency.jl:124
[4] #consistent_functions at ./none:0 [inlined]
[5] #consistent_nlps#90(::Float64, ::typeof(consistent_nlps), ::Array{AbstractNLPModel,1}) at /root/.julia/packages/NLPModels/OHjPv/test/consistency.jl:320
[6] consistent_nlps(::Array{AbstractNLPModel,1}) at /root/.julia/packages/NLPModels/OHjPv/test/consistency.jl:318
[7] test_consistency() at /root/.julia/packages/NLPModelsJuMP/Ao59I/test/consistency.jl:14
[8] top-level scope at /root/.julia/packages/NLPModelsJuMP/Ao59I/test/consistency.jl:18
[9] include at ./boot.jl:328 [inlined]
[10] include_relative(::Module, ::String) at ./loading.jl:1105
[11] include(::Module, ::String) at ./Base.jl:31
[12] include(::String) at ./client.jl:424
[13] top-level scope at /root/.julia/packages/NLPModelsJuMP/Ao59I/test/runtests.jl:14
[14] include at ./boot.jl:328 [inlined]
[15] include_relative(::Module, ::String) at ./loading.jl:1105
[16] include(::Module, ::String) at ./Base.jl:31
[17] include(::String) at ./client.jl:424
[18] top-level scope at none:6
in expression starting at /root/.julia/packages/NLPModelsJuMP/Ao59I/test/consistency.jl:18
in expression starting at /root/.julia/packages/NLPModelsJuMP/Ao59I/test/runtests.jl:14
ERROR: Package NLPModelsJuMP errored during testing
Stacktrace:
[1] pkgerror(::String, ::Vararg{String,N} where N) at /buildworker/worker/package_linux64/build/usr/share/julia/stdlib/v1.3/Pkg/src/Types.jl:113
[2] #test#131(::Bool, ::Nothing, ::Cmd, ::Cmd, ::typeof(Pkg.Operations.test), ::Pkg.Types.Context, ::Array{Pkg.Types.PackageSpec,1}) at /buildworker/worker/package_linux64/build/usr/share/julia/stdlib/v1.3/Pkg/src/Operations.jl:1370
[3] #test at ./none:0 [inlined]
[4] #test#62(::Bool, ::Nothing, ::Cmd, ::Cmd, ::Base.Iterators.Pairs{Union{},Union{},Tuple{},NamedTuple{(),Tuple{}}}, ::typeof(Pkg.API.test), ::Pkg.Types.Context, ::Array{Pkg.Types.PackageSpec,1}) at /buildworker/worker/package_linux64/build/usr/share/julia/stdlib/v1.3/Pkg/src/API.jl:253
[5] test(::Pkg.Types.Context, ::Array{Pkg.Types.PackageSpec,1}) at /buildworker/worker/package_linux64/build/usr/share/julia/stdlib/v1.3/Pkg/src/API.jl:239
[6] #test#61 at /buildworker/worker/package_linux64/build/usr/share/julia/stdlib/v1.3/Pkg/src/API.jl:233 [inlined]
[7] test at /buildworker/worker/package_linux64/build/usr/share/julia/stdlib/v1.3/Pkg/src/API.jl:233 [inlined]
[8] #test#60 at /buildworker/worker/package_linux64/build/usr/share/julia/stdlib/v1.3/Pkg/src/API.jl:232 [inlined]
[9] test at /buildworker/worker/package_linux64/build/usr/share/julia/stdlib/v1.3/Pkg/src/API.jl:232 [inlined]
[10] #test#59(::Base.Iterators.Pairs{Union{},Union{},Tuple{},NamedTuple{(),Tuple{}}}, ::typeof(Pkg.API.test), ::String) at /buildworker/worker/package_linux64/build/usr/share/julia/stdlib/v1.3/Pkg/src/API.jl:231
[11] test(::String) at /buildworker/worker/package_linux64/build/usr/share/julia/stdlib/v1.3/Pkg/src/API.jl:231
[12] top-level scope at none:10
Results with Julia v1.3.1-pre-7704df0a5a
Testing was unsuccessful : testing failed for unknown reasons.
Last evaluation was ago and took 5 minutes, 21 seconds.
Click here to download the log file.
Click here to show the log contents.
Resolving package versions...
Installed NaNMath ────────────── v0.3.3
Installed OpenSpecFun_jll ────── v0.5.3+1
Installed NLPModelsJuMP ──────── v0.4.0
Installed NLPModels ──────────── v0.8.3
Installed SpecialFunctions ───── v0.9.0
Installed LinearOperators ────── v0.7.1
Installed DataStructures ─────── v0.17.6
Installed JuMP ───────────────── v0.18.6
Installed Calculus ───────────── v0.5.1
Installed Compat ─────────────── v2.2.0
Installed DiffResults ────────── v0.0.4
Installed ForwardDiff ────────── v0.10.7
Installed StaticArrays ───────── v0.12.1
Installed FastClosures ───────── v0.3.2
Installed DiffRules ──────────── v0.1.0
Installed CommonSubexpressions ─ v0.2.0
Installed MathProgBase ───────── v0.7.7
Installed OrderedCollections ─── v1.1.0
Installed TimerOutputs ───────── v0.5.3
Installed ReverseDiffSparse ──── v0.8.6
Updating `~/.julia/environments/v1.3/Project.toml`
[792afdf1] + NLPModelsJuMP v0.4.0
Updating `~/.julia/environments/v1.3/Manifest.toml`
[49dc2e85] + Calculus v0.5.1
[bbf7d656] + CommonSubexpressions v0.2.0
[34da2185] + Compat v2.2.0
[864edb3b] + DataStructures v0.17.6
[163ba53b] + DiffResults v0.0.4
[b552c78f] + DiffRules v0.1.0
[9aa1b823] + FastClosures v0.3.2
[f6369f11] + ForwardDiff v0.10.7
[4076af6c] + JuMP v0.18.6
[5c8ed15e] + LinearOperators v0.7.1
[fdba3010] + MathProgBase v0.7.7
[a4795742] + NLPModels v0.8.3
[792afdf1] + NLPModelsJuMP v0.4.0
[77ba4419] + NaNMath v0.3.3
[efe28fd5] + OpenSpecFun_jll v0.5.3+1
[bac558e1] + OrderedCollections v1.1.0
[89212889] + ReverseDiffSparse v0.8.6
[276daf66] + SpecialFunctions v0.9.0
[90137ffa] + StaticArrays v0.12.1
[a759f4b9] + TimerOutputs v0.5.3
[2a0f44e3] + Base64
[ade2ca70] + Dates
[8bb1440f] + DelimitedFiles
[8ba89e20] + Distributed
[b77e0a4c] + InteractiveUtils
[76f85450] + LibGit2
[8f399da3] + Libdl
[37e2e46d] + LinearAlgebra
[56ddb016] + Logging
[d6f4376e] + Markdown
[a63ad114] + Mmap
[44cfe95a] + Pkg
[de0858da] + Printf
[3fa0cd96] + REPL
[9a3f8284] + Random
[ea8e919c] + SHA
[9e88b42a] + Serialization
[1a1011a3] + SharedArrays
[6462fe0b] + Sockets
[2f01184e] + SparseArrays
[10745b16] + Statistics
[8dfed614] + Test
[cf7118a7] + UUIDs
[4ec0a83e] + Unicode
Testing NLPModelsJuMP
Resolving package versions...
Installed BinaryProvider ─── v0.5.8
Installed Parsers ────────── v0.3.10
Installed Ipopt ──────────── v0.6.1
Installed JSON ───────────── v0.21.0
Installed BenchmarkTools ─── v0.4.3
Installed MathOptInterface ─ v0.9.7
Building Ipopt → `~/.julia/packages/Ipopt/ruIXY/deps/build.log`
Status `/tmp/jl_EOfPoT/Manifest.toml`
[6e4b80f9] BenchmarkTools v0.4.3
[b99e7846] BinaryProvider v0.5.8
[49dc2e85] Calculus v0.5.1
[bbf7d656] CommonSubexpressions v0.2.0
[34da2185] Compat v2.2.0
[864edb3b] DataStructures v0.17.6
[163ba53b] DiffResults v0.0.4
[b552c78f] DiffRules v0.1.0
[9aa1b823] FastClosures v0.3.2
[f6369f11] ForwardDiff v0.10.7
[b6b21f68] Ipopt v0.6.1
[682c06a0] JSON v0.21.0
[4076af6c] JuMP v0.18.6
[5c8ed15e] LinearOperators v0.7.1
[b8f27783] MathOptInterface v0.9.7
[fdba3010] MathProgBase v0.7.7
[a4795742] NLPModels v0.8.3
[792afdf1] NLPModelsJuMP v0.4.0
[77ba4419] NaNMath v0.3.3
[efe28fd5] OpenSpecFun_jll v0.5.3+1
[bac558e1] OrderedCollections v1.1.0
[69de0a69] Parsers v0.3.10
[89212889] ReverseDiffSparse v0.8.6
[276daf66] SpecialFunctions v0.9.0
[90137ffa] StaticArrays v0.12.1
[a759f4b9] TimerOutputs v0.5.3
[2a0f44e3] Base64 [`@stdlib/Base64`]
[ade2ca70] Dates [`@stdlib/Dates`]
[8bb1440f] DelimitedFiles [`@stdlib/DelimitedFiles`]
[8ba89e20] Distributed [`@stdlib/Distributed`]
[b77e0a4c] InteractiveUtils [`@stdlib/InteractiveUtils`]
[76f85450] LibGit2 [`@stdlib/LibGit2`]
[8f399da3] Libdl [`@stdlib/Libdl`]
[37e2e46d] LinearAlgebra [`@stdlib/LinearAlgebra`]
[56ddb016] Logging [`@stdlib/Logging`]
[d6f4376e] Markdown [`@stdlib/Markdown`]
[a63ad114] Mmap [`@stdlib/Mmap`]
[44cfe95a] Pkg [`@stdlib/Pkg`]
[de0858da] Printf [`@stdlib/Printf`]
[3fa0cd96] REPL [`@stdlib/REPL`]
[9a3f8284] Random [`@stdlib/Random`]
[ea8e919c] SHA [`@stdlib/SHA`]
[9e88b42a] Serialization [`@stdlib/Serialization`]
[1a1011a3] SharedArrays [`@stdlib/SharedArrays`]
[6462fe0b] Sockets [`@stdlib/Sockets`]
[2f01184e] SparseArrays [`@stdlib/SparseArrays`]
[10745b16] Statistics [`@stdlib/Statistics`]
[8dfed614] Test [`@stdlib/Test`]
[cf7118a7] UUIDs [`@stdlib/UUIDs`]
[4ec0a83e] Unicode [`@stdlib/Unicode`]
Minimization problem Generic
nvar = 2, ncon = 1 (0 linear)
Minimization problem Generic
nvar = 2, ncon = 1 (0 linear)
lvar = -1.0 -1.0
uvar = 1.0 1.0
lcon = 0.0
ucon = 0.0
x0 = 1.0 1.0
y0 = 0.0
nnzh = 3
nnzj = 2
nonlinear constraints: 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 http://projects.coin-or.org/Ipopt
******************************************************************************
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation).
Number of nonzeros in equality constraint Jacobian...: 2
Number of nonzeros in inequality constraint Jacobian.: 0
Number of nonzeros in Lagrangian Hessian.............: 3
Total number of variables............................: 2
variables with only lower bounds: 0
variables with lower and upper bounds: 2
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 1.9602000e+00 9.80e-01 0.00e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 5.0000000e-01 0.00e+00 3.83e+01 -1.0 4.90e-01 - 2.47e-02 1.00e+00f 1
2 5.0000000e-01 0.00e+00 7.94e-15 -1.0 0.00e+00 - 1.00e+00 1.00e+00 0
3 5.0000000e-01 0.00e+00 5.55e-17 -2.5 0.00e+00 - 1.00e+00 1.00e+00 0
4 5.0000000e-01 0.00e+00 2.82e-17 -3.8 0.00e+00 - 1.00e+00 1.00e+00 0
5 5.0000000e-01 0.00e+00 1.02e-16 -5.7 3.39e-21 - 1.00e+00 1.00e+00T 0
6 5.0000000e-01 0.00e+00 1.09e-17 -8.6 0.00e+00 - 1.00e+00 1.00e+00T 0
Number of Iterations....: 6
(scaled) (unscaled)
Objective...............: 5.0000000000000000e-01 5.0000000000000000e-01
Dual infeasibility......: 1.0851339087274842e-17 1.0851339087274842e-17
Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00
Complementarity.........: 2.5059035596800845e-09 2.5059035596800845e-09
Overall NLP error.......: 2.5059035596800845e-09 2.5059035596800845e-09
Number of objective function evaluations = 7
Number of objective gradient evaluations = 7
Number of equality constraint evaluations = 7
Number of inequality constraint evaluations = 0
Number of equality constraint Jacobian evaluations = 7
Number of inequality constraint Jacobian evaluations = 0
Number of Lagrangian Hessian evaluations = 6
Total CPU secs in IPOPT (w/o function evaluations) = 1.346
Total CPU secs in NLP function evaluations = 1.192
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation).
Number of nonzeros in equality constraint Jacobian...: 2
Number of nonzeros in inequality constraint Jacobian.: 0
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.................: 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 4.8400000e+00 4.40e+00 1.56e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 1.5175599e+00 9.37e+00 1.88e+00 -1.0 1.88e+00 0.0 1.00e+00 1.00e+00f 1
2 1.5057311e+00 6.05e+01 5.42e-01 -1.0 2.46e+00 0.4 1.00e+00 1.00e+00f 1
3 2.1067038e+00 2.19e-14 2.90e+00 -1.0 5.88e+00 - 1.00e+00 1.00e+00H 1
4 0.0000000e+00 2.11e+01 0.00e+00 -1.0 1.45e+00 - 1.00e+00 1.00e+00f 1
5 0.0000000e+00 0.00e+00 0.00e+00 -1.0 2.11e+00 - 1.00e+00 1.00e+00h 1
Number of Iterations....: 5
(scaled) (unscaled)
Objective...............: 0.0000000000000000e+00 0.0000000000000000e+00
Dual infeasibility......: 0.0000000000000000e+00 0.0000000000000000e+00
Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00
Complementarity.........: 0.0000000000000000e+00 0.0000000000000000e+00
Overall NLP error.......: 0.0000000000000000e+00 0.0000000000000000e+00
Number of objective function evaluations = 7
Number of objective gradient evaluations = 6
Number of equality constraint evaluations = 7
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 CPU secs in IPOPT (w/o function evaluations) = 0.657
Total CPU secs in NLP function evaluations = 0.207
EXIT: Optimal Solution Found.
This is Ipopt version 3.12.10, running with linear solver mumps.
NOTE: Other linear solvers might be more efficient (see Ipopt documentation).
Number of nonzeros in equality constraint Jacobian...: 0
Number of nonzeros in inequality constraint Jacobian.: 0
Number of nonzeros in Lagrangian Hessian.............: 55
Total number of variables............................: 10
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 1.6881633e-02 0.00e+00 3.72e-01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 1.3104791e-02 0.00e+00 3.45e-01 -1.7 3.57e-03 2.0 1.00e+00 1.00e+00f 1
2 7.1684879e-03 0.00e+00 2.06e-01 -1.7 8.13e-03 1.5 1.00e+00 1.00e+00f 1
3 5.0503944e-03 0.00e+00 3.91e-02 -1.7 6.79e-03 1.0 1.00e+00 1.00e+00f 1
4 4.2729157e-03 0.00e+00 2.42e-02 -2.5 6.85e-03 0.6 1.00e+00 1.00e+00f 1
5 3.8009908e-03 0.00e+00 1.18e-02 -3.8 6.96e-03 0.1 1.00e+00 1.00e+00f 1
6 3.6107425e-03 0.00e+00 7.10e-03 -3.8 1.04e-02 -0.4 1.00e+00 1.00e+00f 1
7 3.5620665e-03 0.00e+00 3.71e-03 -3.8 3.37e-03 0.0 1.00e+00 1.00e+00f 1
8 3.4459562e-03 0.00e+00 3.62e-03 -3.8 9.59e-03 -0.4 1.00e+00 1.00e+00f 1
9 3.4105091e-03 0.00e+00 3.23e-03 -3.8 3.09e-03 -0.0 1.00e+00 1.00e+00f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10 3.3370143e-03 0.00e+00 3.71e-03 -3.8 7.63e-03 -0.5 1.00e+00 1.00e+00f 1
11 3.3168049e-03 0.00e+00 2.30e-03 -3.8 2.39e-03 -0.1 1.00e+00 1.00e+00f 1
12 3.2825415e-03 0.00e+00 2.65e-03 -3.8 5.24e-03 -0.5 1.00e+00 1.00e+00f 1
13 3.2583787e-03 0.00e+00 4.50e-03 -3.8 6.23e-03 -1.0 1.00e+00 1.00e+00f 1
14 3.2522583e-03 0.00e+00 1.93e-03 -3.8 3.78e-03 - 1.00e+00 1.00e+00f 1
15 3.2519781e-03 0.00e+00 4.90e-05 -3.8 6.32e-04 - 1.00e+00 1.00e+00f 1
16 3.2519774e-03 0.00e+00 3.08e-07 -5.7 4.82e-05 - 1.00e+00 1.00e+00f 1
17 3.2519774e-03 0.00e+00 1.06e-12 -8.6 9.33e-08 - 1.00e+00 1.00e+00f 1
Number of Iterations....: 17
(scaled) (unscaled)
Objective...............: 3.2519774004411590e-03 3.2519774004411590e-03
Dual infeasibility......: 1.0580217257860625e-12 1.0580217257860625e-12
Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00
Complementarity.........: 0.0000000000000000e+00 0.0000000000000000e+00
Overall NLP error.......: 1.0580217257860625e-12 1.0580217257860625e-12
Number of objective function evaluations = 18
Number of objective gradient evaluations = 18
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 = 17
Total CPU secs in IPOPT (w/o function evaluations) = 0.190
Total CPU secs in NLP function evaluations = 0.098
EXIT: Optimal Solution Found.
Checking problem brownden ERROR: LoadError: LoadError: too many parameters for type
Stacktrace:
[1] #hess_op#95(::Base.Iterators.Pairs{Union{},Union{},Tuple{},NamedTuple{(),Tuple{}}}, ::typeof(hess_op), ::ADNLPModel, ::Array{Float64,1}) at /root/.julia/packages/NLPModels/OHjPv/src/NLPModels.jl:391
[2] hess_op(::ADNLPModel, ::Array{Float64,1}) at /root/.julia/packages/NLPModels/OHjPv/src/NLPModels.jl:389
[3] #consistent_functions#75(::Float64, ::Array{Any,1}, ::typeof(consistent_functions), ::Array{AbstractNLPModel,1}) at /root/.julia/packages/NLPModels/OHjPv/test/consistency.jl:124
[4] #consistent_functions at ./none:0 [inlined]
[5] #consistent_nlps#90(::Float64, ::typeof(consistent_nlps), ::Array{AbstractNLPModel,1}) at /root/.julia/packages/NLPModels/OHjPv/test/consistency.jl:320
[6] consistent_nlps(::Array{AbstractNLPModel,1}) at /root/.julia/packages/NLPModels/OHjPv/test/consistency.jl:318
[7] test_consistency() at /root/.julia/packages/NLPModelsJuMP/Ao59I/test/consistency.jl:14
[8] top-level scope at /root/.julia/packages/NLPModelsJuMP/Ao59I/test/consistency.jl:18
[9] include at ./boot.jl:328 [inlined]
[10] include_relative(::Module, ::String) at ./loading.jl:1105
[11] include(::Module, ::String) at ./Base.jl:31
[12] include(::String) at ./client.jl:424
[13] top-level scope at /root/.julia/packages/NLPModelsJuMP/Ao59I/test/runtests.jl:14
[14] include at ./boot.jl:328 [inlined]
[15] include_relative(::Module, ::String) at ./loading.jl:1105
[16] include(::Module, ::String) at ./Base.jl:31
[17] include(::String) at ./client.jl:424
[18] top-level scope at none:6
in expression starting at /root/.julia/packages/NLPModelsJuMP/Ao59I/test/consistency.jl:18
in expression starting at /root/.julia/packages/NLPModelsJuMP/Ao59I/test/runtests.jl:14
ERROR: Package NLPModelsJuMP errored during testing
Stacktrace:
[1] pkgerror(::String, ::Vararg{String,N} where N) at /workspace/srcdir/julia/usr/share/julia/stdlib/v1.3/Pkg/src/Types.jl:113
[2] #test#131(::Bool, ::Nothing, ::Cmd, ::Cmd, ::typeof(Pkg.Operations.test), ::Pkg.Types.Context, ::Array{Pkg.Types.PackageSpec,1}) at /workspace/srcdir/julia/usr/share/julia/stdlib/v1.3/Pkg/src/Operations.jl:1370
[3] #test at ./none:0 [inlined]
[4] #test#62(::Bool, ::Nothing, ::Cmd, ::Cmd, ::Base.Iterators.Pairs{Union{},Union{},Tuple{},NamedTuple{(),Tuple{}}}, ::typeof(Pkg.API.test), ::Pkg.Types.Context, ::Array{Pkg.Types.PackageSpec,1}) at /workspace/srcdir/julia/usr/share/julia/stdlib/v1.3/Pkg/src/API.jl:253
[5] test(::Pkg.Types.Context, ::Array{Pkg.Types.PackageSpec,1}) at /workspace/srcdir/julia/usr/share/julia/stdlib/v1.3/Pkg/src/API.jl:239
[6] #test#61 at /workspace/srcdir/julia/usr/share/julia/stdlib/v1.3/Pkg/src/API.jl:233 [inlined]
[7] test at /workspace/srcdir/julia/usr/share/julia/stdlib/v1.3/Pkg/src/API.jl:233 [inlined]
[8] #test#60 at /workspace/srcdir/julia/usr/share/julia/stdlib/v1.3/Pkg/src/API.jl:232 [inlined]
[9] test at /workspace/srcdir/julia/usr/share/julia/stdlib/v1.3/Pkg/src/API.jl:232 [inlined]
[10] #test#59(::Base.Iterators.Pairs{Union{},Union{},Tuple{},NamedTuple{(),Tuple{}}}, ::typeof(Pkg.API.test), ::String) at /workspace/srcdir/julia/usr/share/julia/stdlib/v1.3/Pkg/src/API.jl:231
[11] test(::String) at /workspace/srcdir/julia/usr/share/julia/stdlib/v1.3/Pkg/src/API.jl:231
[12] top-level scope at none:10