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 successful .
Last evaluation was ago and took 4 minutes, 21 seconds.
Click here to download the log file.
Click here to show the log contents.
Resolving package versions...
Installed Parsers ──────────── v0.3.10
Installed Compat ───────────── v2.2.0
Installed BenchmarkTools ───── v0.4.3
Installed Ipopt ────────────── v0.6.1
Installed BinaryProvider ───── v0.5.8
Installed MathProgBase ─────── v0.7.7
Installed JSON ─────────────── v0.21.0
Installed MathOptInterface ─── v0.9.7
Installed OrderedCollections ─ v1.1.0
Updating `~/.julia/environments/v1.2/Project.toml`
[b6b21f68] + Ipopt v0.6.1
Updating `~/.julia/environments/v1.2/Manifest.toml`
[6e4b80f9] + BenchmarkTools v0.4.3
[b99e7846] + BinaryProvider v0.5.8
[34da2185] + Compat v2.2.0
[b6b21f68] + Ipopt v0.6.1
[682c06a0] + JSON v0.21.0
[b8f27783] + MathOptInterface v0.9.7
[fdba3010] + MathProgBase v0.7.7
[bac558e1] + OrderedCollections v1.1.0
[69de0a69] + Parsers v0.3.10
[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 Ipopt → `~/.julia/packages/Ipopt/ruIXY/deps/build.log`
Testing Ipopt
Resolving package versions...
Status `/tmp/jl_U56jpj/Manifest.toml`
[6e4b80f9] BenchmarkTools v0.4.3
[b99e7846] BinaryProvider v0.5.8
[34da2185] Compat v2.2.0
[b6b21f68] Ipopt v0.6.1
[682c06a0] JSON v0.21.0
[b8f27783] MathOptInterface v0.9.7
[fdba3010] MathProgBase v0.7.7
[bac558e1] OrderedCollections v1.1.0
[69de0a69] Parsers v0.3.10
[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`]
******************************************************************************
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...: 4
Number of nonzeros in inequality constraint Jacobian.: 4
Number of nonzeros in Lagrangian Hessian.............: 10
Total number of variables............................: 4
variables with only lower bounds: 0
variables with lower and upper bounds: 4
variables with only upper bounds: 0
Total number of equality constraints.................: 1
Total number of inequality constraints...............: 1
inequality constraints with only lower bounds: 1
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.6109693e+01 1.12e+01 5.28e-01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 1.6982239e+01 7.30e-01 1.02e+01 -1.0 6.11e-01 - 7.19e-02 1.00e+00f 1
2 1.7318411e+01 3.60e-02 5.05e-01 -1.0 1.61e-01 - 1.00e+00 1.00e+00h 1
3 1.6849424e+01 2.78e-01 6.68e-02 -1.7 2.85e-01 - 7.94e-01 1.00e+00h 1
4 1.7051199e+01 4.71e-03 2.78e-03 -1.7 6.06e-02 - 1.00e+00 1.00e+00h 1
5 1.7011979e+01 7.19e-03 8.50e-03 -3.8 3.66e-02 - 9.45e-01 9.98e-01h 1
6 1.7014271e+01 1.74e-05 9.78e-06 -3.8 3.33e-03 - 1.00e+00 1.00e+00h 1
7 1.7014021e+01 1.23e-07 1.82e-07 -5.7 2.69e-04 - 1.00e+00 1.00e+00h 1
8 1.7014017e+01 1.77e-11 2.52e-11 -8.6 3.32e-06 - 1.00e+00 1.00e+00h 1
Number of Iterations....: 8
(scaled) (unscaled)
Objective...............: 1.7014017145179160e+01 1.7014017145179160e+01
Dual infeasibility......: 2.5164268330575961e-11 2.5164268330575961e-11
Constraint violation....: 1.7706724975141697e-11 1.7706724975141697e-11
Complementarity.........: 2.5277100427932987e-09 2.5277100427932987e-09
Overall NLP error.......: 2.5277100427932987e-09 2.5277100427932987e-09
Number of objective function evaluations = 9
Number of objective gradient evaluations = 9
Number of equality constraint evaluations = 9
Number of inequality constraint evaluations = 9
Number of equality constraint Jacobian evaluations = 9
Number of inequality constraint Jacobian evaluations = 9
Number of Lagrangian Hessian evaluations = 8
Total CPU secs in IPOPT (w/o function evaluations) = 0.206
Total CPU secs in NLP function evaluations = 0.032
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...: 4
Number of nonzeros in inequality constraint Jacobian.: 4
Number of nonzeros in Lagrangian Hessian.............: 10
Total number of variables............................: 4
variables with only lower bounds: 0
variables with lower and upper bounds: 4
variables with only upper bounds: 0
Total number of equality constraints.................: 1
Total number of inequality constraints...............: 1
inequality constraints with only lower bounds: 1
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.7159878e+01 2.01e-02 5.20e-01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 1.7146308e+01 2.06e-02 1.47e-01 -1.0 1.15e-01 - 9.86e-01 1.00e+00f 1
Number of Iterations....: 1
(scaled) (unscaled)
Objective...............: 1.7146307787804172e+01 1.7146307787804172e+01
Dual infeasibility......: 1.4659378128596279e-01 1.4659378128596279e-01
Constraint violation....: 2.0600446810355777e-02 2.0600446810355777e-02
Complementarity.........: 2.2602930210765068e-01 2.2602930210765068e-01
Overall NLP error.......: 2.2602930210765068e-01 2.2602930210765068e-01
Number of objective function evaluations = 2
Number of objective gradient evaluations = 2
Number of equality constraint evaluations = 2
Number of inequality constraint evaluations = 2
Number of equality constraint Jacobian evaluations = 2
Number of inequality constraint Jacobian evaluations = 2
Number of Lagrangian Hessian evaluations = 1
Total CPU secs in IPOPT (w/o function evaluations) = 0.009
Total CPU secs in NLP function evaluations = 0.000
EXIT: Stopping optimization at current point as requested by user.
String option
Int option
Float option
Ipopt 3.12.10 (Linux x86_64), ASL(20160307)
Test Summary: | Pass Total
C API | 11 11
Setting: "badoption" is not a valid setting for Option: hessian_approximation. Check the option documentation.
### hessian_approximation (String) ###
Category: Hessian Approximation
Description: Indicates what Hessian information is to be used.
Valid Settings:
exact (Use second derivatives provided by the NLP.)
limited-memory (Perform a limited-memory quasi-Newton approximation)
Default: "exact"
Setting: "-1" is not a valid setting for Option: file_print_level. Check the option documentation.
### file_print_level (Integer) ###
Category: Output
Description: Verbosity level for output file.
0 <= (5) <= 12
Setting: "-1" is not a valid setting for Option: derivative_test_tol. Check the option documentation.
### derivative_test_tol (Real Number) ###
Category: Derivative Checker
Description: Threshold for indicating wrong derivative.
0 < (0.0001) <= +inf
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.: 2
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 2
variables with only lower bounds: 2
variables with lower and upper bounds: 0
variables with only upper bounds: 0
Total number of equality constraints.................: 0
Total number of inequality constraints...............: 1
inequality constraints with only lower bounds: 0
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 -9.9999900e-03 0.00e+00 0.00e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 -1.1447368e-01 0.00e+00 4.57e-01 -1.0 3.06e-01 - 6.84e-01 1.00e+00f 1
2 -7.2703784e-01 0.00e+00 4.30e-02 -1.7 1.25e+00 - 1.00e+00 9.24e-01f 1
3 -7.4256221e-01 0.00e+00 2.83e-08 -2.5 2.57e-02 - 1.00e+00 1.00e+00f 1
4 -7.4969062e-01 0.00e+00 1.50e-09 -3.8 8.30e-03 - 1.00e+00 1.00e+00f 1
5 -7.4999627e-01 0.00e+00 1.84e-11 -5.7 3.07e-04 - 1.00e+00 1.00e+00f 1
6 -7.5000001e-01 0.00e+00 2.51e-14 -8.6 3.74e-06 - 1.00e+00 1.00e+00f 1
Number of Iterations....: 6
(scaled) (unscaled)
Objective...............: -7.5000000747928541e-01 -7.5000000747928541e-01
Dual infeasibility......: 2.5113627760616495e-14 2.5113627760616495e-14
Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00
Complementarity.........: 2.5103575950753621e-09 2.5103575950753621e-09
Overall NLP error.......: 2.5103575950753621e-09 2.5103575950753621e-09
Number of objective function evaluations = 7
Number of objective gradient evaluations = 7
Number of equality constraint evaluations = 0
Number of inequality constraint evaluations = 7
Number of equality constraint Jacobian evaluations = 0
Number of inequality constraint Jacobian evaluations = 7
Number of Lagrangian Hessian evaluations = 6
Total CPU secs in IPOPT (w/o function evaluations) = 0.321
Total CPU secs in NLP function evaluations = 0.253
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.: 2
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 2
variables with only lower bounds: 2
variables with lower and upper bounds: 0
variables with only upper bounds: 0
Total number of equality constraints.................: 0
Total number of inequality constraints...............: 1
inequality constraints with only lower bounds: 0
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 -9.9999900e-03 0.00e+00 0.00e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 -1.1447368e-01 0.00e+00 4.57e-01 -1.0 3.06e-01 - 6.84e-01 1.00e+00f 1
2 -7.2703784e-01 0.00e+00 4.30e-02 -1.7 1.25e+00 - 1.00e+00 9.24e-01f 1
3 -7.4256221e-01 0.00e+00 2.83e-08 -2.5 2.57e-02 - 1.00e+00 1.00e+00f 1
4 -7.4969062e-01 0.00e+00 1.50e-09 -3.8 8.30e-03 - 1.00e+00 1.00e+00f 1
5 -7.4999627e-01 0.00e+00 1.84e-11 -5.7 3.07e-04 - 1.00e+00 1.00e+00f 1
6 -7.5000001e-01 0.00e+00 2.51e-14 -8.6 3.74e-06 - 1.00e+00 1.00e+00f 1
Number of Iterations....: 6
(scaled) (unscaled)
Objective...............: -7.5000000747928541e-01 -7.5000000747928541e-01
Dual infeasibility......: 2.5113627760616495e-14 2.5113627760616495e-14
Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00
Complementarity.........: 2.5103575950753621e-09 2.5103575950753621e-09
Overall NLP error.......: 2.5103575950753621e-09 2.5103575950753621e-09
Number of objective function evaluations = 7
Number of objective gradient evaluations = 7
Number of equality constraint evaluations = 0
Number of inequality constraint evaluations = 7
Number of equality constraint Jacobian evaluations = 0
Number of inequality constraint Jacobian evaluations = 7
Number of Lagrangian Hessian evaluations = 6
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
┌ Warning: Element type Int64 does not have an infinite value. Note that this may artifically introduce ranged (two-sided) constraints. To avoid this, consider casting the problem data to Float64.
└ @ MathProgBase.HighLevelInterface ~/.julia/packages/MathProgBase/rVlFR/src/HighLevelInterface/HighLevelInterface.jl:9
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.: 2
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 2
variables with only lower bounds: 2
variables with lower and upper bounds: 0
variables with only upper bounds: 0
Total number of equality constraints.................: 0
Total number of inequality constraints...............: 1
inequality constraints with only lower bounds: 0
inequality constraints with lower and upper bounds: 1
inequality constraints with only upper bounds: 0
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 9.9999900e-03 1.03e+00 8.33e-01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 9.9990000e-05 1.01e+00 4.53e+01 -1.0 3.83e-01 - 9.90e-01 2.58e-02h 1
2 2.8879429e-05 1.00e+00 3.58e+03 -1.0 5.01e-01 - 9.90e-01 1.28e-02h 1
3 2.8732641e-07 1.00e+00 1.92e+07 -1.0 3.46e-01 - 9.90e-01 1.85e-04h 1
4r 2.8732641e-07 1.00e+00 1.00e+03 0.0 0.00e+00 - 0.00e+00 4.67e-07R 3
5r 9.9969511e-04 1.00e+00 9.97e+00 0.0 4.00e-03 - 9.90e-01 1.00e+00f 1
6r 4.9798661e-04 1.00e+00 8.98e-02 0.0 1.00e-03 - 9.91e-01 1.00e+00f 1
7r 1.9513382e-05 1.00e+00 1.20e-02 -1.4 3.36e-03 - 9.94e-01 1.00e+00f 1
8r 3.4684297e-07 1.00e+00 1.87e-08 -3.1 1.34e-04 - 1.00e+00 1.00e+00f 1
Number of Iterations....: 8
(scaled) (unscaled)
Objective...............: -9.9583877308489748e-09 -9.9583877308489748e-09
Dual infeasibility......: 1.0000000079514848e+00 1.0000000079514848e+00
Constraint violation....: 9.9999996016644899e-01 9.9999996016644899e-01
Complementarity.........: 8.3739702929516048e-08 8.3739702929516048e-08
Overall NLP error.......: 9.9999996016644899e-01 1.0000000079514848e+00
Number of objective function evaluations = 13
Number of objective gradient evaluations = 6
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 = 11
Number of Lagrangian Hessian evaluations = 9
Total CPU secs in IPOPT (w/o function evaluations) = 0.007
Total CPU secs in NLP function evaluations = 0.000
EXIT: Converged to a point of local infeasibility. Problem may be infeasible.
┌ Warning: Problem is infeasible, but infeasibility ray ("Farkas proof") is unavailable; check that the proper solver options are set.
└ @ MathProgBase.HighLevelInterface ~/.julia/packages/MathProgBase/rVlFR/src/HighLevelInterface/linprog.jl:89
┌ Warning: Element type Int64 does not have an infinite value. Note that this may artifically introduce ranged (two-sided) constraints. To avoid this, consider casting the problem data to Float64.
└ @ MathProgBase.HighLevelInterface ~/.julia/packages/MathProgBase/rVlFR/src/HighLevelInterface/HighLevelInterface.jl:9
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.: 2
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 2
variables with only lower bounds: 2
variables with lower and upper bounds: 0
variables with only upper bounds: 0
Total number of equality constraints.................: 0
Total number of inequality constraints...............: 1
inequality constraints with only lower bounds: 0
inequality constraints with lower and upper bounds: 1
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.9999980e-02 1.00e-02 2.33e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 -2.0166663e-01 0.00e+00 4.84e+00 -1.0 1.48e-01 - 1.70e-01 1.00e+00f 1
2 -7.7864804e-01 0.00e+00 4.23e+00 -1.0 4.33e-01 - 3.15e-01 1.00e+00f 1
3 -8.8868649e+00 0.00e+00 1.63e+00 -1.0 5.38e+00 - 1.07e-01 1.00e+00f 1
4 -5.6819241e+02 0.00e+00 2.79e+00 -1.0 3.73e+02 - 1.54e-02 1.00e+00f 1
5 -1.6377850e+06 0.00e+00 1.27e+00 -1.0 1.09e+06 - 3.43e-04 1.00e+00f 1
6 -4.3576977e+11 0.00e+00 1.17e+00 -1.0 2.91e+11 - 3.72e-06 1.00e+00f 1
7 -4.0497367e+16 0.00e+00 1.17e+00 -1.0 2.70e+16 - 1.07e-05 1.00e+00f 1
8 -4.0497367e+16 0.00e+00 1.20e+00 -1.0 1.20e+04 -4.0 9.90e-01 1.00e+00f 1
9 -4.0497367e+16 0.00e+00 1.20e+00 -1.0 3.60e+04 -4.5 9.90e-01 1.00e+00f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10 -1.0129590e+17 0.00e+00 1.20e+00 -1.0 4.05e+16 - 3.96e-01 1.00e+00f 1
11 -1.1832087e+17 0.00e+00 1.40e+00 -1.0 8.11e+16 - 4.51e-01 1.40e-01f 1
12 -1.1832087e+17 0.00e+00 1.20e+00 -1.0 1.08e+05 -5.0 9.90e-01 1.00e+00f 1
13 -1.2863936e+17 0.00e+00 1.56e+00 -1.0 2.70e+16 - 9.90e-01 2.55e-01f 1
14 -1.2863936e+17 0.00e+00 1.20e+00 -1.0 3.24e+05 -5.4 1.00e+00 1.00e+00f 1
15 -1.4383899e+17 0.00e+00 1.20e+00 -1.0 1.01e+16 - 1.00e+00 1.00e+00f 1
16 -2.2490370e+17 0.00e+00 2.01e+00 -1.0 5.40e+16 - 2.80e-01 1.00e+00f 1
17 -4.1730036e+19 0.00e+00 2.01e+00 -1.0 2.77e+19 - 3.89e-03 1.00e+00f 1
18 -4.1730036e+19 0.00e+00 2.01e+00 -1.0 9.45e+05 -5.9 1.00e+00 4.72e-03f 1
19 -4.1730036e+19 0.00e+00 1.97e+00 -1.0 2.92e+06 -6.4 1.00e+00 2.35e-02f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
20 -4.1745236e+19 0.00e+00 1.97e+00 -1.0 1.01e+16 - 2.88e-01 1.00e+00f 1
21 -4.1745236e+19 0.00e+00 1.93e+00 -1.0 8.75e+06 -6.9 1.00e+00 3.26e-02f 1
22 -4.1747136e+19 0.00e+00 3.73e+00 -1.0 1.27e+15 - 1.00e+00 1.00e+00f 1
23 -4.1747136e+19 0.00e+00 1.20e+00 -1.0 2.62e+07 -7.3 1.00e+00 1.00e+00f 1
24 -4.1807934e+19 0.00e+00 2.01e+00 -1.0 4.05e+16 - 2.80e-01 1.00e+00f 1
25 -7.2936784e+19 0.00e+00 4.84e+00 -1.0 2.08e+19 - 1.03e-03 1.00e+00f 1
26 -7.2936784e+19 0.00e+00 4.84e+00 -1.0 7.73e+07 -7.8 1.00e+00 2.79e-04f 1
27 -7.2936784e+19 0.00e+00 3.31e+00 -1.0 2.36e+08 -8.3 1.00e+00 3.60e-01f 1
28 -7.2967183e+19 0.00e+00 3.31e+00 -1.0 2.03e+16 - 1.46e-01 1.00e+00f 1
29 -7.2967183e+19 0.00e+00 3.28e+00 -1.0 7.09e+08 -8.8 1.00e+00 1.36e-02f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
30 -7.2967183e+19 0.00e+00 1.20e+00 -1.0 2.13e+09 -9.2 1.00e+00 1.00e+00f 1
31 -7.3129313e+19 0.00e+00 3.43e+00 -1.0 1.08e+17 - 1.40e-01 1.00e+00f 1
32 -1.5613958e+20 0.00e+00 3.43e+00 -1.0 5.53e+19 - 1.63e-03 1.00e+00f 1
Number of Iterations....: 32
(scaled) (unscaled)
Objective...............: -1.5613957799791742e+20 -1.5613957799791742e+20
Dual infeasibility......: 3.4284275246391345e+00 3.4284275246391345e+00
Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00
Complementarity.........: 2.1352347958057366e-01 2.1352347958057366e-01
Overall NLP error.......: 3.4284275246391345e+00 3.4284275246391345e+00
Number of objective function evaluations = 33
Number of objective gradient evaluations = 33
Number of equality constraint evaluations = 0
Number of inequality constraint evaluations = 33
Number of equality constraint Jacobian evaluations = 0
Number of inequality constraint Jacobian evaluations = 33
Number of Lagrangian Hessian evaluations = 32
Total CPU secs in IPOPT (w/o function evaluations) = 0.012
Total CPU secs in NLP function evaluations = 0.001
EXIT: Iterates diverging; problem might be unbounded.
┌ Warning: Problem is unbounded, but unbounded ray is unavailable; check that the proper solver options are set.
└ @ MathProgBase.HighLevelInterface ~/.julia/packages/MathProgBase/rVlFR/src/HighLevelInterface/linprog.jl:97
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...: 4
Number of nonzeros in inequality constraint Jacobian.: 4
Number of nonzeros in Lagrangian Hessian.............: 10
Total number of variables............................: 4
variables with only lower bounds: 0
variables with lower and upper bounds: 4
variables with only upper bounds: 0
Total number of equality constraints.................: 1
Total number of inequality constraints...............: 1
inequality constraints with only lower bounds: 1
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.6109693e+01 1.12e+01 5.28e-01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 1.6982239e+01 7.30e-01 1.02e+01 -1.0 6.11e-01 - 7.19e-02 1.00e+00f 1
2 1.7318411e+01 3.60e-02 5.05e-01 -1.0 1.61e-01 - 1.00e+00 1.00e+00h 1
3 1.6849424e+01 2.78e-01 6.68e-02 -1.7 2.85e-01 - 7.94e-01 1.00e+00h 1
4 1.7051199e+01 4.71e-03 2.78e-03 -1.7 6.06e-02 - 1.00e+00 1.00e+00h 1
5 1.7011979e+01 7.19e-03 8.50e-03 -3.8 3.66e-02 - 9.45e-01 9.98e-01h 1
6 1.7014271e+01 1.74e-05 9.78e-06 -3.8 3.33e-03 - 1.00e+00 1.00e+00h 1
7 1.7014021e+01 1.23e-07 1.82e-07 -5.7 2.69e-04 - 1.00e+00 1.00e+00h 1
8 1.7014017e+01 1.77e-11 2.52e-11 -8.6 3.32e-06 - 1.00e+00 1.00e+00h 1
Number of Iterations....: 8
(scaled) (unscaled)
Objective...............: 1.7014017145179160e+01 1.7014017145179160e+01
Dual infeasibility......: 2.5164268330575961e-11 2.5164268330575961e-11
Constraint violation....: 1.7706724975141697e-11 1.7706724975141697e-11
Complementarity.........: 2.5277100427932987e-09 2.5277100427932987e-09
Overall NLP error.......: 2.5277100427932987e-09 2.5277100427932987e-09
Number of objective function evaluations = 9
Number of objective gradient evaluations = 9
Number of equality constraint evaluations = 9
Number of inequality constraint evaluations = 9
Number of equality constraint Jacobian evaluations = 9
Number of inequality constraint Jacobian evaluations = 9
Number of Lagrangian Hessian evaluations = 8
Total CPU secs in IPOPT (w/o function evaluations) = 0.244
Total CPU secs in NLP function evaluations = 0.069
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...: 4
Number of nonzeros in inequality constraint Jacobian.: 4
Number of nonzeros in Lagrangian Hessian.............: 10
Total number of variables............................: 4
variables with only lower bounds: 0
variables with lower and upper bounds: 4
variables with only upper bounds: 0
Total number of equality constraints.................: 1
Total number of inequality constraints...............: 1
inequality constraints with only lower bounds: 1
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.6109693e+01 1.12e+01 5.28e-01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 1.6982239e+01 7.30e-01 1.02e+01 -1.0 6.11e-01 - 7.19e-02 1.00e+00f 1
2 1.7318411e+01 3.60e-02 5.05e-01 -1.0 1.61e-01 - 1.00e+00 1.00e+00h 1
3 1.6849424e+01 2.78e-01 6.68e-02 -1.7 2.85e-01 - 7.94e-01 1.00e+00h 1
4 1.7051199e+01 4.71e-03 2.78e-03 -1.7 6.06e-02 - 1.00e+00 1.00e+00h 1
5 1.7011979e+01 7.19e-03 8.50e-03 -3.8 3.66e-02 - 9.45e-01 9.98e-01h 1
6 1.7014271e+01 1.74e-05 9.78e-06 -3.8 3.33e-03 - 1.00e+00 1.00e+00h 1
7 1.7014021e+01 1.23e-07 1.82e-07 -5.7 2.69e-04 - 1.00e+00 1.00e+00h 1
8 1.7014017e+01 1.77e-11 2.52e-11 -8.6 3.32e-06 - 1.00e+00 1.00e+00h 1
Number of Iterations....: 8
(scaled) (unscaled)
Objective...............: 1.7014017145179160e+01 1.7014017145179160e+01
Dual infeasibility......: 2.5164268330575961e-11 2.5164268330575961e-11
Constraint violation....: 1.7706724975141697e-11 1.7706724975141697e-11
Complementarity.........: 2.5277100427932987e-09 2.5277100427932987e-09
Overall NLP error.......: 2.5277100427932987e-09 2.5277100427932987e-09
Number of objective function evaluations = 9
Number of objective gradient evaluations = 9
Number of equality constraint evaluations = 9
Number of inequality constraint evaluations = 9
Number of equality constraint Jacobian evaluations = 9
Number of inequality constraint Jacobian evaluations = 9
Number of Lagrangian Hessian evaluations = 8
Total CPU secs in IPOPT (w/o function evaluations) = 0.005
Total CPU secs in NLP function evaluations = 0.000
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...: 4
Number of nonzeros in inequality constraint Jacobian.: 4
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 4
variables with only lower bounds: 0
variables with lower and upper bounds: 4
variables with only upper bounds: 0
Total number of equality constraints.................: 1
Total number of inequality constraints...............: 1
inequality constraints with only lower bounds: 1
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.6109693e+01 1.12e+01 5.28e-01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 1.7420709e+01 7.49e-01 2.40e+01 -0.3 8.13e-01 - 3.20e-01 1.00e+00f 1
2 1.7120453e+01 2.14e-01 2.00e-01 -0.6 1.02e+00 - 9.97e-01 1.00e+00h 1
3 1.6979032e+01 1.70e-01 8.49e-02 -1.6 1.18e-01 - 9.72e-01 1.00e+00h 1
4 1.6972554e+01 7.69e-02 1.20e-02 -3.2 8.01e-02 - 1.00e+00 1.00e+00h 1
5 1.7013661e+01 6.75e-04 9.50e-03 -4.9 1.00e-02 - 1.00e+00 1.00e+00h 1
6 1.7014018e+01 1.96e-06 3.49e-04 -6.1 1.09e-03 - 1.00e+00 1.00e+00h 1
7 1.7014017e+01 1.47e-09 2.15e-07 -8.2 3.02e-05 - 1.00e+00 1.00e+00h 1
8 1.7014017e+01 0.00e+00 1.69e-09 -11.0 1.17e-08 - 1.00e+00 1.00e+00h 1
Number of Iterations....: 8
(scaled) (unscaled)
Objective...............: 1.7014017140224176e+01 1.7014017140224176e+01
Dual infeasibility......: 1.6853176362439831e-09 1.6853176362439831e-09
Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00
Complementarity.........: 1.0002952000760592e-11 1.0002952000760592e-11
Overall NLP error.......: 1.6853176362439831e-09 1.6853176362439831e-09
Number of objective function evaluations = 9
Number of objective gradient evaluations = 9
Number of equality constraint evaluations = 9
Number of inequality constraint evaluations = 9
Number of equality constraint Jacobian evaluations = 9
Number of inequality constraint Jacobian evaluations = 9
Number of Lagrangian Hessian evaluations = 0
Total CPU secs in IPOPT (w/o function evaluations) = 0.063
Total CPU secs in NLP function evaluations = 0.019
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...: 4
Number of nonzeros in inequality constraint Jacobian.: 4
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 4
variables with only lower bounds: 0
variables with lower and upper bounds: 4
variables with only upper bounds: 0
Total number of equality constraints.................: 1
Total number of inequality constraints...............: 1
inequality constraints with only lower bounds: 1
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.6109693e+01 1.12e+01 5.28e-01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 1.7420709e+01 7.49e-01 2.40e+01 -0.3 8.13e-01 - 3.20e-01 1.00e+00f 1
2 1.7120453e+01 2.14e-01 2.00e-01 -0.6 1.02e+00 - 9.97e-01 1.00e+00h 1
3 1.6979032e+01 1.70e-01 8.49e-02 -1.6 1.18e-01 - 9.72e-01 1.00e+00h 1
4 1.6972554e+01 7.69e-02 1.20e-02 -3.2 8.01e-02 - 1.00e+00 1.00e+00h 1
5 1.7013661e+01 6.75e-04 9.50e-03 -4.9 1.00e-02 - 1.00e+00 1.00e+00h 1
6 1.7014018e+01 1.96e-06 3.49e-04 -6.1 1.09e-03 - 1.00e+00 1.00e+00h 1
7 1.7014017e+01 1.47e-09 2.15e-07 -8.2 3.02e-05 - 1.00e+00 1.00e+00h 1
8 1.7014017e+01 0.00e+00 1.69e-09 -11.0 1.17e-08 - 1.00e+00 1.00e+00h 1
Number of Iterations....: 8
(scaled) (unscaled)
Objective...............: 1.7014017140224176e+01 1.7014017140224176e+01
Dual infeasibility......: 1.6853176362439831e-09 1.6853176362439831e-09
Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00
Complementarity.........: 1.0002952000760592e-11 1.0002952000760592e-11
Overall NLP error.......: 1.6853176362439831e-09 1.6853176362439831e-09
Number of objective function evaluations = 9
Number of objective gradient evaluations = 9
Number of equality constraint evaluations = 9
Number of inequality constraint evaluations = 9
Number of equality constraint Jacobian evaluations = 9
Number of inequality constraint Jacobian evaluations = 9
Number of Lagrangian Hessian evaluations = 0
Total CPU secs in IPOPT (w/o function evaluations) = 0.011
Total CPU secs in NLP function evaluations = 0.000
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.: 2
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.................: 0
Total number of inequality constraints...............: 1
inequality constraints with only lower bounds: 0
inequality constraints with lower and upper bounds: 0
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 0.00e+00 1.00e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 -1.5499995e+00 0.00e+00 9.70e-01 -1.0 1.00e+00 - 6.83e-01 1.00e+00f 1
2 -3.3684721e+00 1.23e-01 5.89e-01 -1.7 1.51e+00 0.0 6.42e-01 9.54e-01f 1
3 -3.9741885e+00 9.68e-01 9.57e-02 -1.7 2.80e+00 - 1.00e+00 4.25e-01h 1
4 -3.9687809e+00 9.59e-01 2.44e-01 -1.7 1.32e+00 - 1.00e+00 2.87e-01h 1
5 -3.9481863e+00 9.26e-01 1.87e-01 -1.7 3.19e-01 - 3.46e-02 3.75e-02h 1
6 -3.4559338e+00 1.88e-01 7.87e-02 -1.7 4.82e-01 - 1.00e+00 1.00e+00h 1
7 -3.3770765e+00 9.02e-02 8.25e-02 -1.7 7.39e-02 - 5.32e-01 6.09e-01h 1
8 -3.3181872e+00 1.03e-02 1.90e-02 -2.5 9.62e-02 - 1.00e+00 1.00e+00h 1
9 -3.3094856e+00 9.76e-05 7.03e-04 -3.8 1.08e-02 - 9.89e-01 1.00e+00h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10 -3.3093993e+00 0.00e+00 1.18e-07 -5.7 1.13e-04 - 1.00e+00 1.00e+00h 1
11 -3.3094011e+00 0.00e+00 2.42e-11 -8.6 2.20e-06 - 1.00e+00 1.00e+00h 1
Number of Iterations....: 11
(scaled) (unscaled)
Objective...............: -3.3094010829284688e+00 -3.3094010829284688e+00
Dual infeasibility......: 2.4180452302933228e-11 2.4180452302933228e-11
Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00
Complementarity.........: 2.5290927319670938e-09 2.5290927319670938e-09
Overall NLP error.......: 2.5290927319670938e-09 2.5290927319670938e-09
Number of objective function evaluations = 12
Number of objective gradient evaluations = 12
Number of equality constraint evaluations = 0
Number of inequality constraint evaluations = 12
Number of equality constraint Jacobian evaluations = 0
Number of inequality constraint Jacobian evaluations = 12
Number of Lagrangian Hessian evaluations = 11
Total CPU secs in IPOPT (w/o function evaluations) = 0.123
Total CPU secs in NLP function evaluations = 0.024
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.: 2
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.................: 0
Total number of inequality constraints...............: 1
inequality constraints with only lower bounds: 0
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 -3.3094011e+00 0.00e+00 9.74e-02 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 -3.2208641e+00 0.00e+00 1.14e-02 -1.0 9.22e-02 - 1.00e+00 1.00e+00f 1
2 -3.3108681e+00 1.95e-03 2.16e-03 -2.5 1.06e-01 - 1.00e+00 9.62e-01f 1
3 -3.3094591e+00 6.73e-05 9.20e-04 -3.8 9.58e-03 - 1.00e+00 1.00e+00h 1
4 -3.3093998e+00 0.00e+00 1.57e-06 -5.7 3.63e-04 - 1.00e+00 1.00e+00h 1
5 -3.3094011e+00 0.00e+00 4.82e-11 -8.6 2.51e-06 - 1.00e+00 1.00e+00h 1
Number of Iterations....: 5
(scaled) (unscaled)
Objective...............: -3.3094010829363834e+00 -3.3094010829363834e+00
Dual infeasibility......: 4.8183660518598715e-11 4.8183660518598715e-11
Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00
Complementarity.........: 2.5468012068635348e-09 2.5468012068635348e-09
Overall NLP error.......: 2.5468012068635348e-09 2.5468012068635348e-09
Number of objective function evaluations = 6
Number of objective gradient evaluations = 6
Number of equality constraint evaluations = 0
Number of inequality constraint evaluations = 6
Number of equality constraint Jacobian evaluations = 0
Number of inequality constraint Jacobian evaluations = 6
Number of Lagrangian Hessian evaluations = 5
Total CPU secs in IPOPT (w/o function evaluations) = 0.003
Total CPU secs in NLP function evaluations = 0.000
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.............: 3
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...............: 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 8.1008100e+05 0.00e+00 1.00e+02 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 8.0991001e+01 0.00e+00 5.00e-03 -1.0 9.00e+01 - 1.00e+00 1.00e+00f 1
2 7.6633847e+01 0.00e+00 9.02e-02 -3.8 1.80e+02 - 1.00e+00 3.12e-02f 6
3 7.4460854e+01 0.00e+00 2.79e-01 -3.8 1.00e+01 - 1.00e+00 1.00e+00f 1
4 6.4854348e+01 0.00e+00 2.70e-02 -3.8 2.49e+00 - 1.00e+00 1.00e+00f 1
5 6.1324534e+01 0.00e+00 1.50e-01 -3.8 2.65e+01 - 1.00e+00 2.50e-01f 3
6 5.5682148e+01 0.00e+00 6.07e-02 -3.8 4.11e+00 - 1.00e+00 1.00e+00f 1
7 5.2401345e+01 0.00e+00 1.05e-01 -3.8 9.55e+00 - 1.00e+00 5.00e-01f 2
8 4.7754183e+01 0.00e+00 8.64e-02 -3.8 4.91e+00 - 1.00e+00 1.00e+00f 1
9 4.3662081e+01 0.00e+00 1.02e-01 -3.8 5.29e+00 - 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.9394585e+01 0.00e+00 5.99e-02 -3.8 3.86e+00 - 1.00e+00 1.00e+00f 1
11 3.6854350e+01 0.00e+00 1.33e-01 -3.8 5.93e+00 - 1.00e+00 1.00e+00f 1
12 3.2085703e+01 0.00e+00 2.32e-02 -3.8 2.07e+00 - 1.00e+00 1.00e+00f 1
13 3.1530610e+01 0.00e+00 1.46e-01 -3.8 1.17e+01 - 1.00e+00 5.00e-01f 2
14 2.5979012e+01 0.00e+00 1.30e-02 -3.8 1.32e+00 - 1.00e+00 1.00e+00f 1
15 2.4078492e+01 0.00e+00 7.46e-02 -3.8 1.55e+01 - 1.00e+00 2.50e-01f 3
16 2.1087884e+01 0.00e+00 2.83e-02 -3.8 2.25e+00 - 1.00e+00 1.00e+00f 1
17 1.9387060e+01 0.00e+00 5.03e-02 -3.8 5.43e+00 - 1.00e+00 5.00e-01f 2
18 1.7017660e+01 0.00e+00 3.80e-02 -3.8 2.60e+00 - 1.00e+00 1.00e+00f 1
19 1.5063675e+01 0.00e+00 4.92e-02 -3.8 2.96e+00 - 1.00e+00 1.00e+00f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
20 1.2958390e+01 0.00e+00 2.26e-02 -3.8 1.84e+00 - 1.00e+00 1.00e+00f 1
21 1.2513152e+01 0.00e+00 7.34e-02 -3.8 3.55e+00 - 1.00e+00 1.00e+00f 1
22 9.5226477e+00 0.00e+00 6.26e-03 -3.8 6.84e-01 - 1.00e+00 1.00e+00f 1
23 8.5338704e+00 0.00e+00 3.28e-02 -3.8 8.38e+00 - 1.00e+00 2.50e-01f 3
24 7.1136882e+00 0.00e+00 1.47e-02 -3.8 1.31e+00 - 1.00e+00 1.00e+00f 1
25 6.8119498e+00 0.00e+00 4.68e-02 -3.8 2.54e+00 - 1.00e+00 1.00e+00f 1
26 4.8721294e+00 0.00e+00 4.03e-03 -3.8 4.60e-01 - 1.00e+00 1.00e+00f 1
27 4.2350045e+00 0.00e+00 1.83e-02 -3.8 5.49e+00 - 1.00e+00 2.50e-01f 3
28 3.3933446e+00 0.00e+00 1.06e-02 -3.8 9.96e-01 - 1.00e+00 1.00e+00f 1
29 2.8588540e+00 0.00e+00 1.93e-02 -3.8 1.40e+00 - 1.00e+00 1.00e+00f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
30 2.1180181e+00 0.00e+00 4.22e-03 -3.8 5.09e-01 - 1.00e+00 1.00e+00f 1
31 1.7857252e+00 0.00e+00 1.29e-02 -3.8 2.01e+00 - 1.00e+00 5.00e-01f 2
32 1.2901521e+00 0.00e+00 3.76e-03 -3.8 4.67e-01 - 1.00e+00 1.00e+00f 1
33 1.0408718e+00 0.00e+00 7.23e-03 -3.8 1.30e+00 - 1.00e+00 5.00e-01f 2
34 7.3496094e-01 0.00e+00 4.30e-03 -3.8 5.10e-01 - 1.00e+00 1.00e+00f 1
35 5.3205719e-01 0.00e+00 6.07e-03 -3.8 6.27e-01 - 1.00e+00 1.00e+00f 1
36 3.3053300e-01 0.00e+00 1.79e-03 -3.8 2.74e-01 - 1.00e+00 1.00e+00f 1
37 3.2727124e-01 0.00e+00 6.94e-03 -3.8 6.55e-01 - 1.00e+00 1.00e+00f 1
38 1.0342719e-01 0.00e+00 3.68e-04 -3.8 5.29e-02 - 1.00e+00 1.00e+00f 1
39 6.6217406e-02 0.00e+00 2.35e-03 -5.7 6.73e-01 - 1.00e+00 5.00e-01f 2
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
40 2.2745202e-02 0.00e+00 3.32e-04 -5.7 8.84e-02 - 1.00e+00 1.00e+00f 1
41 1.5172949e-02 0.00e+00 1.36e-03 -5.7 2.45e-01 - 1.00e+00 1.00e+00f 1
42 8.6032066e-04 0.00e+00 3.46e-05 -5.7 1.48e-02 - 1.00e+00 1.00e+00f 1
43 6.5696724e-05 0.00e+00 9.01e-05 -5.7 5.83e-02 - 1.00e+00 1.00e+00f 1
44 1.5884129e-08 0.00e+00 1.38e-07 -5.7 7.81e-04 - 1.00e+00 1.00e+00f 1
45 2.5336289e-14 0.00e+00 1.77e-09 -8.6 2.51e-04 - 1.00e+00 1.00e+00f 1
Number of Iterations....: 45
(scaled) (unscaled)
Objective...............: 7.0375062599303445e-18 2.5336289286876029e-14
Dual infeasibility......: 1.7687817079841355e-09 6.3679325294503244e-06
Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00
Complementarity.........: 0.0000000000000000e+00 0.0000000000000000e+00
Overall NLP error.......: 1.7687817079841355e-09 6.3679325294503244e-06
Number of objective function evaluations = 109
Number of objective gradient evaluations = 46
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 = 45
Total CPU secs in IPOPT (w/o function evaluations) = 0.149
Total CPU secs in NLP function evaluations = 0.016
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.............: 3
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...............: 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 8.1008100e+05 0.00e+00 1.00e+02 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 8.0991001e+01 0.00e+00 5.00e-03 -1.0 9.00e+01 - 1.00e+00 1.00e+00f 1
2 7.6633847e+01 0.00e+00 9.02e-02 -3.8 1.80e+02 - 1.00e+00 3.12e-02f 6
3 7.4460854e+01 0.00e+00 2.79e-01 -3.8 1.00e+01 - 1.00e+00 1.00e+00f 1
4 6.4854348e+01 0.00e+00 2.70e-02 -3.8 2.49e+00 - 1.00e+00 1.00e+00f 1
5 6.1324534e+01 0.00e+00 1.50e-01 -3.8 2.65e+01 - 1.00e+00 2.50e-01f 3
6 5.5682148e+01 0.00e+00 6.07e-02 -3.8 4.11e+00 - 1.00e+00 1.00e+00f 1
7 5.2401345e+01 0.00e+00 1.05e-01 -3.8 9.55e+00 - 1.00e+00 5.00e-01f 2
8 4.7754183e+01 0.00e+00 8.64e-02 -3.8 4.91e+00 - 1.00e+00 1.00e+00f 1
9 4.3662081e+01 0.00e+00 1.02e-01 -3.8 5.29e+00 - 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.9394585e+01 0.00e+00 5.99e-02 -3.8 3.86e+00 - 1.00e+00 1.00e+00f 1
11 3.6854350e+01 0.00e+00 1.33e-01 -3.8 5.93e+00 - 1.00e+00 1.00e+00f 1
12 3.2085703e+01 0.00e+00 2.32e-02 -3.8 2.07e+00 - 1.00e+00 1.00e+00f 1
13 3.1530610e+01 0.00e+00 1.46e-01 -3.8 1.17e+01 - 1.00e+00 5.00e-01f 2
14 2.5979012e+01 0.00e+00 1.30e-02 -3.8 1.32e+00 - 1.00e+00 1.00e+00f 1
15 2.4078492e+01 0.00e+00 7.46e-02 -3.8 1.55e+01 - 1.00e+00 2.50e-01f 3
16 2.1087884e+01 0.00e+00 2.83e-02 -3.8 2.25e+00 - 1.00e+00 1.00e+00f 1
17 1.9387060e+01 0.00e+00 5.03e-02 -3.8 5.43e+00 - 1.00e+00 5.00e-01f 2
18 1.7017660e+01 0.00e+00 3.80e-02 -3.8 2.60e+00 - 1.00e+00 1.00e+00f 1
19 1.5063675e+01 0.00e+00 4.92e-02 -3.8 2.96e+00 - 1.00e+00 1.00e+00f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
20 1.2958390e+01 0.00e+00 2.26e-02 -3.8 1.84e+00 - 1.00e+00 1.00e+00f 1
21 1.2513152e+01 0.00e+00 7.34e-02 -3.8 3.55e+00 - 1.00e+00 1.00e+00f 1
22 9.5226477e+00 0.00e+00 6.26e-03 -3.8 6.84e-01 - 1.00e+00 1.00e+00f 1
23 8.5338704e+00 0.00e+00 3.28e-02 -3.8 8.38e+00 - 1.00e+00 2.50e-01f 3
24 7.1136882e+00 0.00e+00 1.47e-02 -3.8 1.31e+00 - 1.00e+00 1.00e+00f 1
25 6.8119498e+00 0.00e+00 4.68e-02 -3.8 2.54e+00 - 1.00e+00 1.00e+00f 1
26 4.8721294e+00 0.00e+00 4.03e-03 -3.8 4.60e-01 - 1.00e+00 1.00e+00f 1
27 4.2350045e+00 0.00e+00 1.83e-02 -3.8 5.49e+00 - 1.00e+00 2.50e-01f 3
28 3.3933446e+00 0.00e+00 1.06e-02 -3.8 9.96e-01 - 1.00e+00 1.00e+00f 1
29 2.8588540e+00 0.00e+00 1.93e-02 -3.8 1.40e+00 - 1.00e+00 1.00e+00f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
30 2.1180181e+00 0.00e+00 4.22e-03 -3.8 5.09e-01 - 1.00e+00 1.00e+00f 1
31 1.7857252e+00 0.00e+00 1.29e-02 -3.8 2.01e+00 - 1.00e+00 5.00e-01f 2
32 1.2901521e+00 0.00e+00 3.76e-03 -3.8 4.67e-01 - 1.00e+00 1.00e+00f 1
33 1.0408718e+00 0.00e+00 7.23e-03 -3.8 1.30e+00 - 1.00e+00 5.00e-01f 2
34 7.3496094e-01 0.00e+00 4.30e-03 -3.8 5.10e-01 - 1.00e+00 1.00e+00f 1
35 5.3205719e-01 0.00e+00 6.07e-03 -3.8 6.27e-01 - 1.00e+00 1.00e+00f 1
36 3.3053300e-01 0.00e+00 1.79e-03 -3.8 2.74e-01 - 1.00e+00 1.00e+00f 1
37 3.2727124e-01 0.00e+00 6.94e-03 -3.8 6.55e-01 - 1.00e+00 1.00e+00f 1
38 1.0342719e-01 0.00e+00 3.68e-04 -3.8 5.29e-02 - 1.00e+00 1.00e+00f 1
39 6.6217406e-02 0.00e+00 2.35e-03 -5.7 6.73e-01 - 1.00e+00 5.00e-01f 2
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
40 2.2745202e-02 0.00e+00 3.32e-04 -5.7 8.84e-02 - 1.00e+00 1.00e+00f 1
41 1.5172949e-02 0.00e+00 1.36e-03 -5.7 2.45e-01 - 1.00e+00 1.00e+00f 1
42 8.6032066e-04 0.00e+00 3.46e-05 -5.7 1.48e-02 - 1.00e+00 1.00e+00f 1
43 6.5696724e-05 0.00e+00 9.01e-05 -5.7 5.83e-02 - 1.00e+00 1.00e+00f 1
44 1.5884129e-08 0.00e+00 1.38e-07 -5.7 7.81e-04 - 1.00e+00 1.00e+00f 1
45 2.5336289e-14 0.00e+00 1.77e-09 -8.6 2.51e-04 - 1.00e+00 1.00e+00f 1
Number of Iterations....: 45
(scaled) (unscaled)
Objective...............: 7.0375062599303445e-18 2.5336289286876029e-14
Dual infeasibility......: 1.7687817079841355e-09 6.3679325294503244e-06
Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00
Complementarity.........: 0.0000000000000000e+00 0.0000000000000000e+00
Overall NLP error.......: 1.7687817079841355e-09 6.3679325294503244e-06
Number of objective function evaluations = 109
Number of objective gradient evaluations = 46
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 = 45
Total CPU secs in IPOPT (w/o function evaluations) = 0.018
Total CPU secs in NLP function evaluations = 0.001
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.: 5
Number of nonzeros in Lagrangian Hessian.............: 5
Total number of variables............................: 3
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...............: 2
inequality constraints with only lower bounds: 2
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.00e+00 1.00e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 2.0292095e+00 0.00e+00 1.00e-06 -1.0 8.40e-01 - 1.00e+00 1.00e+00h 1
2 1.8730894e+00 0.00e+00 2.83e-08 -2.5 1.06e-01 - 1.00e+00 1.00e+00f 1
3 1.8576864e+00 0.00e+00 1.50e-09 -3.8 1.34e-02 - 1.00e+00 1.00e+00f 1
4 1.8571468e+00 0.00e+00 1.84e-11 -5.7 4.61e-04 - 1.00e+00 1.00e+00f 1
5 1.8571428e+00 0.00e+00 2.51e-14 -8.6 2.57e-06 - 1.00e+00 1.00e+00f 1
Number of Iterations....: 5
(scaled) (unscaled)
Objective...............: 1.8571428250202391e+00 1.8571428250202391e+00
Dual infeasibility......: 2.5091040356528538e-14 2.5091040356528538e-14
Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00
Complementarity.........: 2.5138314144122443e-09 2.5138314144122443e-09
Overall NLP error.......: 2.5138314144122443e-09 2.5138314144122443e-09
Number of objective function evaluations = 6
Number of objective gradient evaluations = 6
Number of equality constraint evaluations = 0
Number of inequality constraint evaluations = 6
Number of equality constraint Jacobian evaluations = 0
Number of inequality constraint Jacobian evaluations = 6
Number of Lagrangian Hessian evaluations = 5
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
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.: 5
Number of nonzeros in Lagrangian Hessian.............: 7
Total number of variables............................: 3
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...............: 2
inequality constraints with only lower bounds: 2
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.00e+00 1.00e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 2.0292095e+00 0.00e+00 1.00e-06 -1.0 8.40e-01 - 1.00e+00 1.00e+00h 1
2 1.8730894e+00 0.00e+00 2.83e-08 -2.5 1.06e-01 - 1.00e+00 1.00e+00f 1
3 1.8576864e+00 0.00e+00 1.50e-09 -3.8 1.34e-02 - 1.00e+00 1.00e+00f 1
4 1.8571468e+00 0.00e+00 1.84e-11 -5.7 4.61e-04 - 1.00e+00 1.00e+00f 1
5 1.8571428e+00 0.00e+00 2.51e-14 -8.6 2.57e-06 - 1.00e+00 1.00e+00f 1
Number of Iterations....: 5
(scaled) (unscaled)
Objective...............: 1.8571428250202391e+00 1.8571428250202391e+00
Dual infeasibility......: 2.5091040356528538e-14 2.5091040356528538e-14
Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00
Complementarity.........: 2.5138314144122443e-09 2.5138314144122443e-09
Overall NLP error.......: 2.5138314144122443e-09 2.5138314144122443e-09
Number of objective function evaluations = 6
Number of objective gradient evaluations = 6
Number of equality constraint evaluations = 0
Number of inequality constraint evaluations = 6
Number of equality constraint Jacobian evaluations = 0
Number of inequality constraint Jacobian evaluations = 6
Number of Lagrangian Hessian evaluations = 5
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
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.: 7
Number of nonzeros in Lagrangian Hessian.............: 1
Total number of variables............................: 2
variables with only lower bounds: 2
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: 2
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 -1.9999980e-02 0.00e+00 1.40e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 -1.7869412e-01 0.00e+00 3.41e+00 -1.0 1.59e-01 - 2.52e-01 1.00e+00f 1
2 -5.4045150e-01 0.00e+00 3.01e+00 -1.0 3.62e-01 - 4.18e-01 1.00e+00f 1
3 -2.3683408e+00 4.36e-01 8.69e-01 -1.0 1.83e+00 - 2.76e-01 1.00e+00f 1
4 -2.2818178e+00 2.13e-01 1.46e-01 -1.7 4.76e-01 - 5.42e-01 7.53e-01h 1
5 -2.5836664e+00 3.80e-01 4.77e-01 -1.7 1.58e+00 - 7.32e-01 1.00e+00f 1
6 -2.2715765e+00 2.18e-02 4.19e-03 -1.7 7.11e-01 - 1.00e+00 1.00e+00h 1
7 -2.2469466e+00 0.00e+00 8.53e-04 -2.5 5.29e-02 - 1.00e+00 1.00e+00h 1
8 -2.2498339e+00 0.00e+00 1.66e-05 -3.8 3.08e-03 - 1.00e+00 1.00e+00h 1
9 -2.2499981e+00 0.00e+00 1.49e-08 -5.7 1.66e-04 - 1.00e+00 1.00e+00h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10 -2.2500000e+00 0.00e+00 1.09e-12 -8.6 1.89e-06 - 1.00e+00 1.00e+00h 1
Number of Iterations....: 10
(scaled) (unscaled)
Objective...............: -2.2500000174878498e+00 -2.2500000174878498e+00
Dual infeasibility......: 1.0861618183608446e-12 1.0861618183608446e-12
Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00
Complementarity.........: 2.5121753680505435e-09 2.5121753680505435e-09
Overall NLP error.......: 2.5121753680505435e-09 2.5121753680505435e-09
Number of objective function evaluations = 11
Number of objective gradient evaluations = 11
Number of equality constraint evaluations = 0
Number of inequality constraint evaluations = 11
Number of equality constraint Jacobian evaluations = 0
Number of inequality constraint Jacobian evaluations = 11
Number of Lagrangian Hessian evaluations = 10
Total CPU secs in IPOPT (w/o function evaluations) = 0.006
Total CPU secs in NLP function evaluations = 0.000
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.: 2
Number of nonzeros in Lagrangian Hessian.............: 1
Total number of variables............................: 1
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...............: 1
inequality constraints with only lower bounds: 0
inequality constraints with lower and upper bounds: 0
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 0.00e+00 1.00e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 -5.0000000e-01 0.00e+00 9.50e-01 -1.0 5.00e-01 - 1.00e+00 1.00e+00f 1
2 -2.4190404e+00 3.85e+00 5.66e-01 -1.7 8.12e+00 - 1.00e+00 2.44e-01f 1
3 -1.6039641e+00 5.73e-01 2.40e-01 -1.7 8.15e-01 - 1.00e+00 1.00e+00h 1
4 -1.4115695e+00 0.00e+00 3.97e-02 -1.7 1.92e-01 - 1.00e+00 1.00e+00h 1
5 -1.4119185e+00 0.00e+00 9.76e-06 -2.5 3.80e-02 - 1.00e+00 1.00e+00h 1
6 -1.4140615e+00 0.00e+00 2.32e-06 -3.8 6.05e-03 - 1.00e+00 1.00e+00f 1
7 -1.4142117e+00 0.00e+00 1.10e-08 -5.7 4.29e-04 - 1.00e+00 1.00e+00h 1
8 -1.4142136e+00 0.00e+00 1.70e-12 -8.6 5.26e-06 - 1.00e+00 1.00e+00h 1
Number of Iterations....: 8
(scaled) (unscaled)
Objective...............: -1.4142135669370588e+00 -1.4142135669370588e+00
Dual infeasibility......: 1.6973089600469393e-12 1.6973089600469393e-12
Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00
Complementarity.........: 2.5083142310387366e-09 2.5083142310387366e-09
Overall NLP error.......: 2.5083142310387366e-09 2.5083142310387366e-09
Number of objective function evaluations = 9
Number of objective gradient evaluations = 9
Number of equality constraint evaluations = 0
Number of inequality constraint evaluations = 9
Number of equality constraint Jacobian evaluations = 0
Number of inequality constraint Jacobian evaluations = 9
Number of Lagrangian Hessian evaluations = 8
Total CPU secs in IPOPT (w/o function evaluations) = 0.005
Total CPU secs in NLP function evaluations = 0.000
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.: 2
Number of nonzeros in Lagrangian Hessian.............: 1
Total number of variables............................: 1
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...............: 1
inequality constraints with only lower bounds: 0
inequality constraints with lower and upper bounds: 0
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 0.00e+00 1.00e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 -5.0000000e-01 0.00e+00 9.50e-01 -1.0 5.00e-01 - 1.00e+00 1.00e+00f 1
2 -2.4190404e+00 3.85e+00 5.66e-01 -1.7 8.12e+00 - 1.00e+00 2.44e-01f 1
3 -1.6039641e+00 5.73e-01 2.40e-01 -1.7 8.15e-01 - 1.00e+00 1.00e+00h 1
4 -1.4115695e+00 0.00e+00 3.97e-02 -1.7 1.92e-01 - 1.00e+00 1.00e+00h 1
5 -1.4119185e+00 0.00e+00 9.76e-06 -2.5 3.80e-02 - 1.00e+00 1.00e+00h 1
6 -1.4140615e+00 0.00e+00 2.32e-06 -3.8 6.05e-03 - 1.00e+00 1.00e+00f 1
7 -1.4142117e+00 0.00e+00 1.10e-08 -5.7 4.29e-04 - 1.00e+00 1.00e+00h 1
8 -1.4142136e+00 0.00e+00 1.70e-12 -8.6 5.26e-06 - 1.00e+00 1.00e+00h 1
Number of Iterations....: 8
(scaled) (unscaled)
Objective...............: -1.4142135669370588e+00 -1.4142135669370588e+00
Dual infeasibility......: 1.6973089600469393e-12 1.6973089600469393e-12
Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00
Complementarity.........: 2.5083142310387366e-09 2.5083142310387366e-09
Overall NLP error.......: 2.5083142310387366e-09 2.5083142310387366e-09
Number of objective function evaluations = 9
Number of objective gradient evaluations = 9
Number of equality constraint evaluations = 0
Number of inequality constraint evaluations = 9
Number of equality constraint Jacobian evaluations = 0
Number of inequality constraint Jacobian evaluations = 9
Number of Lagrangian Hessian evaluations = 8
Total CPU secs in IPOPT (w/o function evaluations) = 0.005
Total CPU secs in NLP function evaluations = 0.000
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...: 4
Number of nonzeros in inequality constraint Jacobian.: 4
Number of nonzeros in Lagrangian Hessian.............: 10
Total number of variables............................: 4
variables with only lower bounds: 0
variables with lower and upper bounds: 4
variables with only upper bounds: 0
Total number of equality constraints.................: 1
Total number of inequality constraints...............: 1
inequality constraints with only lower bounds: 1
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 5.9714928e+01 3.48e+01 2.58e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1r 5.9714928e+01 3.48e+01 9.99e+02 1.5 0.00e+00 - 0.00e+00 0.00e+00R 1
Number of Iterations....: 1
(scaled) (unscaled)
Objective...............: 1.8095432878019967e+01 5.9714928497465891e+01
Dual infeasibility......: 1.7946182115358788e+01 5.9222400980683993e+01
Constraint violation....: 3.4824901449944008e+01 3.4824901449944008e+01
Complementarity.........: 3.9900000599999998e+00 1.3167000197999998e+01
Overall NLP error.......: 3.4824901449944008e+01 5.9222400980683993e+01
Number of objective function evaluations = 2
Number of objective gradient evaluations = 2
Number of equality constraint evaluations = 2
Number of inequality constraint evaluations = 2
Number of equality constraint Jacobian evaluations = 2
Number of inequality constraint Jacobian evaluations = 2
Number of Lagrangian Hessian evaluations = 1
Total CPU secs in IPOPT (w/o function evaluations) = 0.002
Total CPU secs in NLP function evaluations = 0.000
EXIT: Maximum Number of Iterations Exceeded.
Test Summary: | Pass Total
MathProgBase | 53 53
Test Summary: | Pass Total
MathOptInterface | 672 672
Testing Ipopt tests passed
Results with Julia v1.3.0
Testing was successful .
Last evaluation was ago and took 3 minutes, 53 seconds.
Click here to download the log file.
Click here to show the log contents.
Resolving package versions...
Installed Compat ───────────── v2.2.0
Installed OrderedCollections ─ v1.1.0
Installed BenchmarkTools ───── v0.4.3
Installed Ipopt ────────────── v0.6.1
Installed BinaryProvider ───── v0.5.8
Installed MathProgBase ─────── v0.7.7
Installed JSON ─────────────── v0.21.0
Installed MathOptInterface ─── v0.9.7
Installed Parsers ──────────── v0.3.10
Updating `~/.julia/environments/v1.3/Project.toml`
[b6b21f68] + Ipopt v0.6.1
Updating `~/.julia/environments/v1.3/Manifest.toml`
[6e4b80f9] + BenchmarkTools v0.4.3
[b99e7846] + BinaryProvider v0.5.8
[34da2185] + Compat v2.2.0
[b6b21f68] + Ipopt v0.6.1
[682c06a0] + JSON v0.21.0
[b8f27783] + MathOptInterface v0.9.7
[fdba3010] + MathProgBase v0.7.7
[bac558e1] + OrderedCollections v1.1.0
[69de0a69] + Parsers v0.3.10
[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 Ipopt → `~/.julia/packages/Ipopt/ruIXY/deps/build.log`
Testing Ipopt
Resolving package versions...
Status `/tmp/jl_isutVk/Manifest.toml`
[6e4b80f9] BenchmarkTools v0.4.3
[b99e7846] BinaryProvider v0.5.8
[34da2185] Compat v2.2.0
[b6b21f68] Ipopt v0.6.1
[682c06a0] JSON v0.21.0
[b8f27783] MathOptInterface v0.9.7
[fdba3010] MathProgBase v0.7.7
[bac558e1] OrderedCollections v1.1.0
[69de0a69] Parsers v0.3.10
[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`]
******************************************************************************
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...: 4
Number of nonzeros in inequality constraint Jacobian.: 4
Number of nonzeros in Lagrangian Hessian.............: 10
Total number of variables............................: 4
variables with only lower bounds: 0
variables with lower and upper bounds: 4
variables with only upper bounds: 0
Total number of equality constraints.................: 1
Total number of inequality constraints...............: 1
inequality constraints with only lower bounds: 1
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.6109693e+01 1.12e+01 5.28e-01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 1.6982239e+01 7.30e-01 1.02e+01 -1.0 6.11e-01 - 7.19e-02 1.00e+00f 1
2 1.7318411e+01 3.60e-02 5.05e-01 -1.0 1.61e-01 - 1.00e+00 1.00e+00h 1
3 1.6849424e+01 2.78e-01 6.68e-02 -1.7 2.85e-01 - 7.94e-01 1.00e+00h 1
4 1.7051199e+01 4.71e-03 2.78e-03 -1.7 6.06e-02 - 1.00e+00 1.00e+00h 1
5 1.7011979e+01 7.19e-03 8.50e-03 -3.8 3.66e-02 - 9.45e-01 9.98e-01h 1
6 1.7014271e+01 1.74e-05 9.78e-06 -3.8 3.33e-03 - 1.00e+00 1.00e+00h 1
7 1.7014021e+01 1.23e-07 1.82e-07 -5.7 2.69e-04 - 1.00e+00 1.00e+00h 1
8 1.7014017e+01 1.77e-11 2.52e-11 -8.6 3.32e-06 - 1.00e+00 1.00e+00h 1
Number of Iterations....: 8
(scaled) (unscaled)
Objective...............: 1.7014017145179160e+01 1.7014017145179160e+01
Dual infeasibility......: 2.5164268330575961e-11 2.5164268330575961e-11
Constraint violation....: 1.7706724975141697e-11 1.7706724975141697e-11
Complementarity.........: 2.5277100427932987e-09 2.5277100427932987e-09
Overall NLP error.......: 2.5277100427932987e-09 2.5277100427932987e-09
Number of objective function evaluations = 9
Number of objective gradient evaluations = 9
Number of equality constraint evaluations = 9
Number of inequality constraint evaluations = 9
Number of equality constraint Jacobian evaluations = 9
Number of inequality constraint Jacobian evaluations = 9
Number of Lagrangian Hessian evaluations = 8
Total CPU secs in IPOPT (w/o function evaluations) = 0.191
Total CPU secs in NLP function evaluations = 0.036
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...: 4
Number of nonzeros in inequality constraint Jacobian.: 4
Number of nonzeros in Lagrangian Hessian.............: 10
Total number of variables............................: 4
variables with only lower bounds: 0
variables with lower and upper bounds: 4
variables with only upper bounds: 0
Total number of equality constraints.................: 1
Total number of inequality constraints...............: 1
inequality constraints with only lower bounds: 1
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.7159878e+01 2.01e-02 5.20e-01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 1.7146308e+01 2.06e-02 1.47e-01 -1.0 1.15e-01 - 9.86e-01 1.00e+00f 1
Number of Iterations....: 1
(scaled) (unscaled)
Objective...............: 1.7146307787804172e+01 1.7146307787804172e+01
Dual infeasibility......: 1.4659378128596279e-01 1.4659378128596279e-01
Constraint violation....: 2.0600446810355777e-02 2.0600446810355777e-02
Complementarity.........: 2.2602930210765068e-01 2.2602930210765068e-01
Overall NLP error.......: 2.2602930210765068e-01 2.2602930210765068e-01
Number of objective function evaluations = 2
Number of objective gradient evaluations = 2
Number of equality constraint evaluations = 2
Number of inequality constraint evaluations = 2
Number of equality constraint Jacobian evaluations = 2
Number of inequality constraint Jacobian evaluations = 2
Number of Lagrangian Hessian evaluations = 1
Total CPU secs in IPOPT (w/o function evaluations) = 0.010
Total CPU secs in NLP function evaluations = 0.000
EXIT: Stopping optimization at current point as requested by user.
String option
Int option
Float option
Ipopt 3.12.10 (Linux x86_64), ASL(20160307)
Test Summary: | Pass Total
C API | 11 11
Setting: "badoption" is not a valid setting for Option: hessian_approximation. Check the option documentation.
### hessian_approximation (String) ###
Category: Hessian Approximation
Description: Indicates what Hessian information is to be used.
Valid Settings:
exact (Use second derivatives provided by the NLP.)
limited-memory (Perform a limited-memory quasi-Newton approximation)
Default: "exact"
Setting: "-1" is not a valid setting for Option: file_print_level. Check the option documentation.
### file_print_level (Integer) ###
Category: Output
Description: Verbosity level for output file.
0 <= (5) <= 12
Setting: "-1" is not a valid setting for Option: derivative_test_tol. Check the option documentation.
### derivative_test_tol (Real Number) ###
Category: Derivative Checker
Description: Threshold for indicating wrong derivative.
0 < (0.0001) <= +inf
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.: 2
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 2
variables with only lower bounds: 2
variables with lower and upper bounds: 0
variables with only upper bounds: 0
Total number of equality constraints.................: 0
Total number of inequality constraints...............: 1
inequality constraints with only lower bounds: 0
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 -9.9999900e-03 0.00e+00 0.00e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 -1.1447368e-01 0.00e+00 4.57e-01 -1.0 3.06e-01 - 6.84e-01 1.00e+00f 1
2 -7.2703784e-01 0.00e+00 4.30e-02 -1.7 1.25e+00 - 1.00e+00 9.24e-01f 1
3 -7.4256221e-01 0.00e+00 2.83e-08 -2.5 2.57e-02 - 1.00e+00 1.00e+00f 1
4 -7.4969062e-01 0.00e+00 1.50e-09 -3.8 8.30e-03 - 1.00e+00 1.00e+00f 1
5 -7.4999627e-01 0.00e+00 1.84e-11 -5.7 3.07e-04 - 1.00e+00 1.00e+00f 1
6 -7.5000001e-01 0.00e+00 2.51e-14 -8.6 3.74e-06 - 1.00e+00 1.00e+00f 1
Number of Iterations....: 6
(scaled) (unscaled)
Objective...............: -7.5000000747928541e-01 -7.5000000747928541e-01
Dual infeasibility......: 2.5113627760616495e-14 2.5113627760616495e-14
Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00
Complementarity.........: 2.5103575950753621e-09 2.5103575950753621e-09
Overall NLP error.......: 2.5103575950753621e-09 2.5103575950753621e-09
Number of objective function evaluations = 7
Number of objective gradient evaluations = 7
Number of equality constraint evaluations = 0
Number of inequality constraint evaluations = 7
Number of equality constraint Jacobian evaluations = 0
Number of inequality constraint Jacobian evaluations = 7
Number of Lagrangian Hessian evaluations = 6
Total CPU secs in IPOPT (w/o function evaluations) = 0.284
Total CPU secs in NLP function evaluations = 0.222
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.: 2
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 2
variables with only lower bounds: 2
variables with lower and upper bounds: 0
variables with only upper bounds: 0
Total number of equality constraints.................: 0
Total number of inequality constraints...............: 1
inequality constraints with only lower bounds: 0
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 -9.9999900e-03 0.00e+00 0.00e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 -1.1447368e-01 0.00e+00 4.57e-01 -1.0 3.06e-01 - 6.84e-01 1.00e+00f 1
2 -7.2703784e-01 0.00e+00 4.30e-02 -1.7 1.25e+00 - 1.00e+00 9.24e-01f 1
3 -7.4256221e-01 0.00e+00 2.83e-08 -2.5 2.57e-02 - 1.00e+00 1.00e+00f 1
4 -7.4969062e-01 0.00e+00 1.50e-09 -3.8 8.30e-03 - 1.00e+00 1.00e+00f 1
5 -7.4999627e-01 0.00e+00 1.84e-11 -5.7 3.07e-04 - 1.00e+00 1.00e+00f 1
6 -7.5000001e-01 0.00e+00 2.51e-14 -8.6 3.74e-06 - 1.00e+00 1.00e+00f 1
Number of Iterations....: 6
(scaled) (unscaled)
Objective...............: -7.5000000747928541e-01 -7.5000000747928541e-01
Dual infeasibility......: 2.5113627760616495e-14 2.5113627760616495e-14
Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00
Complementarity.........: 2.5103575950753621e-09 2.5103575950753621e-09
Overall NLP error.......: 2.5103575950753621e-09 2.5103575950753621e-09
Number of objective function evaluations = 7
Number of objective gradient evaluations = 7
Number of equality constraint evaluations = 0
Number of inequality constraint evaluations = 7
Number of equality constraint Jacobian evaluations = 0
Number of inequality constraint Jacobian evaluations = 7
Number of Lagrangian Hessian evaluations = 6
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
┌ Warning: Element type Int64 does not have an infinite value. Note that this may artifically introduce ranged (two-sided) constraints. To avoid this, consider casting the problem data to Float64.
└ @ MathProgBase.HighLevelInterface ~/.julia/packages/MathProgBase/rVlFR/src/HighLevelInterface/HighLevelInterface.jl:9
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.: 2
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 2
variables with only lower bounds: 2
variables with lower and upper bounds: 0
variables with only upper bounds: 0
Total number of equality constraints.................: 0
Total number of inequality constraints...............: 1
inequality constraints with only lower bounds: 0
inequality constraints with lower and upper bounds: 1
inequality constraints with only upper bounds: 0
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 9.9999900e-03 1.03e+00 8.33e-01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 9.9990000e-05 1.01e+00 4.53e+01 -1.0 3.83e-01 - 9.90e-01 2.58e-02h 1
2 2.8879429e-05 1.00e+00 3.58e+03 -1.0 5.01e-01 - 9.90e-01 1.28e-02h 1
3 2.8732641e-07 1.00e+00 1.92e+07 -1.0 3.46e-01 - 9.90e-01 1.85e-04h 1
4r 2.8732641e-07 1.00e+00 1.00e+03 0.0 0.00e+00 - 0.00e+00 4.67e-07R 3
5r 9.9969511e-04 1.00e+00 9.97e+00 0.0 4.00e-03 - 9.90e-01 1.00e+00f 1
6r 4.9798661e-04 1.00e+00 8.98e-02 0.0 1.00e-03 - 9.91e-01 1.00e+00f 1
7r 1.9513382e-05 1.00e+00 1.20e-02 -1.4 3.36e-03 - 9.94e-01 1.00e+00f 1
8r 3.4684297e-07 1.00e+00 1.87e-08 -3.1 1.34e-04 - 1.00e+00 1.00e+00f 1
Number of Iterations....: 8
(scaled) (unscaled)
Objective...............: -9.9583877308489748e-09 -9.9583877308489748e-09
Dual infeasibility......: 1.0000000079514848e+00 1.0000000079514848e+00
Constraint violation....: 9.9999996016644899e-01 9.9999996016644899e-01
Complementarity.........: 8.3739702929516048e-08 8.3739702929516048e-08
Overall NLP error.......: 9.9999996016644899e-01 1.0000000079514848e+00
Number of objective function evaluations = 13
Number of objective gradient evaluations = 6
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 = 11
Number of Lagrangian Hessian evaluations = 9
Total CPU secs in IPOPT (w/o function evaluations) = 0.001
Total CPU secs in NLP function evaluations = 0.000
EXIT: Converged to a point of local infeasibility. Problem may be infeasible.
┌ Warning: Problem is infeasible, but infeasibility ray ("Farkas proof") is unavailable; check that the proper solver options are set.
└ @ MathProgBase.HighLevelInterface ~/.julia/packages/MathProgBase/rVlFR/src/HighLevelInterface/linprog.jl:89
┌ Warning: Element type Int64 does not have an infinite value. Note that this may artifically introduce ranged (two-sided) constraints. To avoid this, consider casting the problem data to Float64.
└ @ MathProgBase.HighLevelInterface ~/.julia/packages/MathProgBase/rVlFR/src/HighLevelInterface/HighLevelInterface.jl:9
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.: 2
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 2
variables with only lower bounds: 2
variables with lower and upper bounds: 0
variables with only upper bounds: 0
Total number of equality constraints.................: 0
Total number of inequality constraints...............: 1
inequality constraints with only lower bounds: 0
inequality constraints with lower and upper bounds: 1
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.9999980e-02 1.00e-02 2.33e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 -2.0166663e-01 0.00e+00 4.84e+00 -1.0 1.48e-01 - 1.70e-01 1.00e+00f 1
2 -7.7864804e-01 0.00e+00 4.23e+00 -1.0 4.33e-01 - 3.15e-01 1.00e+00f 1
3 -8.8868649e+00 0.00e+00 1.63e+00 -1.0 5.38e+00 - 1.07e-01 1.00e+00f 1
4 -5.6819241e+02 0.00e+00 2.79e+00 -1.0 3.73e+02 - 1.54e-02 1.00e+00f 1
5 -1.6377850e+06 0.00e+00 1.27e+00 -1.0 1.09e+06 - 3.43e-04 1.00e+00f 1
6 -4.3576977e+11 0.00e+00 1.17e+00 -1.0 2.91e+11 - 3.72e-06 1.00e+00f 1
7 -4.0497367e+16 0.00e+00 1.17e+00 -1.0 2.70e+16 - 1.07e-05 1.00e+00f 1
8 -4.0497367e+16 0.00e+00 1.20e+00 -1.0 1.20e+04 -4.0 9.90e-01 1.00e+00f 1
9 -4.0497367e+16 0.00e+00 1.20e+00 -1.0 3.60e+04 -4.5 9.90e-01 1.00e+00f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10 -1.0129590e+17 0.00e+00 1.20e+00 -1.0 4.05e+16 - 3.96e-01 1.00e+00f 1
11 -1.1832087e+17 0.00e+00 1.40e+00 -1.0 8.11e+16 - 4.51e-01 1.40e-01f 1
12 -1.1832087e+17 0.00e+00 1.20e+00 -1.0 1.08e+05 -5.0 9.90e-01 1.00e+00f 1
13 -1.2863936e+17 0.00e+00 1.56e+00 -1.0 2.70e+16 - 9.90e-01 2.55e-01f 1
14 -1.2863936e+17 0.00e+00 1.20e+00 -1.0 3.24e+05 -5.4 1.00e+00 1.00e+00f 1
15 -1.4383899e+17 0.00e+00 1.20e+00 -1.0 1.01e+16 - 1.00e+00 1.00e+00f 1
16 -2.2490370e+17 0.00e+00 2.01e+00 -1.0 5.40e+16 - 2.80e-01 1.00e+00f 1
17 -4.1730036e+19 0.00e+00 2.01e+00 -1.0 2.77e+19 - 3.89e-03 1.00e+00f 1
18 -4.1730036e+19 0.00e+00 2.01e+00 -1.0 9.45e+05 -5.9 1.00e+00 4.72e-03f 1
19 -4.1730036e+19 0.00e+00 1.97e+00 -1.0 2.92e+06 -6.4 1.00e+00 2.35e-02f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
20 -4.1745236e+19 0.00e+00 1.97e+00 -1.0 1.01e+16 - 2.88e-01 1.00e+00f 1
21 -4.1745236e+19 0.00e+00 1.93e+00 -1.0 8.75e+06 -6.9 1.00e+00 3.26e-02f 1
22 -4.1747136e+19 0.00e+00 3.73e+00 -1.0 1.27e+15 - 1.00e+00 1.00e+00f 1
23 -4.1747136e+19 0.00e+00 1.20e+00 -1.0 2.62e+07 -7.3 1.00e+00 1.00e+00f 1
24 -4.1807934e+19 0.00e+00 2.01e+00 -1.0 4.05e+16 - 2.80e-01 1.00e+00f 1
25 -7.2936784e+19 0.00e+00 4.84e+00 -1.0 2.08e+19 - 1.03e-03 1.00e+00f 1
26 -7.2936784e+19 0.00e+00 4.84e+00 -1.0 7.73e+07 -7.8 1.00e+00 2.79e-04f 1
27 -7.2936784e+19 0.00e+00 3.31e+00 -1.0 2.36e+08 -8.3 1.00e+00 3.60e-01f 1
28 -7.2967183e+19 0.00e+00 3.31e+00 -1.0 2.03e+16 - 1.46e-01 1.00e+00f 1
29 -7.2967183e+19 0.00e+00 3.28e+00 -1.0 7.09e+08 -8.8 1.00e+00 1.36e-02f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
30 -7.2967183e+19 0.00e+00 1.20e+00 -1.0 2.13e+09 -9.2 1.00e+00 1.00e+00f 1
31 -7.3129313e+19 0.00e+00 3.43e+00 -1.0 1.08e+17 - 1.40e-01 1.00e+00f 1
32 -1.5613958e+20 0.00e+00 3.43e+00 -1.0 5.53e+19 - 1.63e-03 1.00e+00f 1
Number of Iterations....: 32
(scaled) (unscaled)
Objective...............: -1.5613957799791742e+20 -1.5613957799791742e+20
Dual infeasibility......: 3.4284275246391345e+00 3.4284275246391345e+00
Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00
Complementarity.........: 2.1352347958057366e-01 2.1352347958057366e-01
Overall NLP error.......: 3.4284275246391345e+00 3.4284275246391345e+00
Number of objective function evaluations = 33
Number of objective gradient evaluations = 33
Number of equality constraint evaluations = 0
Number of inequality constraint evaluations = 33
Number of equality constraint Jacobian evaluations = 0
Number of inequality constraint Jacobian evaluations = 33
Number of Lagrangian Hessian evaluations = 32
Total CPU secs in IPOPT (w/o function evaluations) = 0.012
Total CPU secs in NLP function evaluations = 0.001
EXIT: Iterates diverging; problem might be unbounded.
┌ Warning: Problem is unbounded, but unbounded ray is unavailable; check that the proper solver options are set.
└ @ MathProgBase.HighLevelInterface ~/.julia/packages/MathProgBase/rVlFR/src/HighLevelInterface/linprog.jl:97
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...: 4
Number of nonzeros in inequality constraint Jacobian.: 4
Number of nonzeros in Lagrangian Hessian.............: 10
Total number of variables............................: 4
variables with only lower bounds: 0
variables with lower and upper bounds: 4
variables with only upper bounds: 0
Total number of equality constraints.................: 1
Total number of inequality constraints...............: 1
inequality constraints with only lower bounds: 1
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.6109693e+01 1.12e+01 5.28e-01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 1.6982239e+01 7.30e-01 1.02e+01 -1.0 6.11e-01 - 7.19e-02 1.00e+00f 1
2 1.7318411e+01 3.60e-02 5.05e-01 -1.0 1.61e-01 - 1.00e+00 1.00e+00h 1
3 1.6849424e+01 2.78e-01 6.68e-02 -1.7 2.85e-01 - 7.94e-01 1.00e+00h 1
4 1.7051199e+01 4.71e-03 2.78e-03 -1.7 6.06e-02 - 1.00e+00 1.00e+00h 1
5 1.7011979e+01 7.19e-03 8.50e-03 -3.8 3.66e-02 - 9.45e-01 9.98e-01h 1
6 1.7014271e+01 1.74e-05 9.78e-06 -3.8 3.33e-03 - 1.00e+00 1.00e+00h 1
7 1.7014021e+01 1.23e-07 1.82e-07 -5.7 2.69e-04 - 1.00e+00 1.00e+00h 1
8 1.7014017e+01 1.77e-11 2.52e-11 -8.6 3.32e-06 - 1.00e+00 1.00e+00h 1
Number of Iterations....: 8
(scaled) (unscaled)
Objective...............: 1.7014017145179160e+01 1.7014017145179160e+01
Dual infeasibility......: 2.5164268330575961e-11 2.5164268330575961e-11
Constraint violation....: 1.7706724975141697e-11 1.7706724975141697e-11
Complementarity.........: 2.5277100427932987e-09 2.5277100427932987e-09
Overall NLP error.......: 2.5277100427932987e-09 2.5277100427932987e-09
Number of objective function evaluations = 9
Number of objective gradient evaluations = 9
Number of equality constraint evaluations = 9
Number of inequality constraint evaluations = 9
Number of equality constraint Jacobian evaluations = 9
Number of inequality constraint Jacobian evaluations = 9
Number of Lagrangian Hessian evaluations = 8
Total CPU secs in IPOPT (w/o function evaluations) = 0.167
Total CPU secs in NLP function evaluations = 0.033
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...: 4
Number of nonzeros in inequality constraint Jacobian.: 4
Number of nonzeros in Lagrangian Hessian.............: 10
Total number of variables............................: 4
variables with only lower bounds: 0
variables with lower and upper bounds: 4
variables with only upper bounds: 0
Total number of equality constraints.................: 1
Total number of inequality constraints...............: 1
inequality constraints with only lower bounds: 1
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.6109693e+01 1.12e+01 5.28e-01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 1.6982239e+01 7.30e-01 1.02e+01 -1.0 6.11e-01 - 7.19e-02 1.00e+00f 1
2 1.7318411e+01 3.60e-02 5.05e-01 -1.0 1.61e-01 - 1.00e+00 1.00e+00h 1
3 1.6849424e+01 2.78e-01 6.68e-02 -1.7 2.85e-01 - 7.94e-01 1.00e+00h 1
4 1.7051199e+01 4.71e-03 2.78e-03 -1.7 6.06e-02 - 1.00e+00 1.00e+00h 1
5 1.7011979e+01 7.19e-03 8.50e-03 -3.8 3.66e-02 - 9.45e-01 9.98e-01h 1
6 1.7014271e+01 1.74e-05 9.78e-06 -3.8 3.33e-03 - 1.00e+00 1.00e+00h 1
7 1.7014021e+01 1.23e-07 1.82e-07 -5.7 2.69e-04 - 1.00e+00 1.00e+00h 1
8 1.7014017e+01 1.77e-11 2.52e-11 -8.6 3.32e-06 - 1.00e+00 1.00e+00h 1
Number of Iterations....: 8
(scaled) (unscaled)
Objective...............: 1.7014017145179160e+01 1.7014017145179160e+01
Dual infeasibility......: 2.5164268330575961e-11 2.5164268330575961e-11
Constraint violation....: 1.7706724975141697e-11 1.7706724975141697e-11
Complementarity.........: 2.5277100427932987e-09 2.5277100427932987e-09
Overall NLP error.......: 2.5277100427932987e-09 2.5277100427932987e-09
Number of objective function evaluations = 9
Number of objective gradient evaluations = 9
Number of equality constraint evaluations = 9
Number of inequality constraint evaluations = 9
Number of equality constraint Jacobian evaluations = 9
Number of inequality constraint Jacobian evaluations = 9
Number of Lagrangian Hessian evaluations = 8
Total CPU secs in IPOPT (w/o function evaluations) = 0.003
Total CPU secs in NLP function evaluations = 0.000
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...: 4
Number of nonzeros in inequality constraint Jacobian.: 4
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 4
variables with only lower bounds: 0
variables with lower and upper bounds: 4
variables with only upper bounds: 0
Total number of equality constraints.................: 1
Total number of inequality constraints...............: 1
inequality constraints with only lower bounds: 1
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.6109693e+01 1.12e+01 5.28e-01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 1.7420709e+01 7.49e-01 2.40e+01 -0.3 8.13e-01 - 3.20e-01 1.00e+00f 1
2 1.7120453e+01 2.14e-01 2.00e-01 -0.6 1.02e+00 - 9.97e-01 1.00e+00h 1
3 1.6979032e+01 1.70e-01 8.49e-02 -1.6 1.18e-01 - 9.72e-01 1.00e+00h 1
4 1.6972554e+01 7.69e-02 1.20e-02 -3.2 8.01e-02 - 1.00e+00 1.00e+00h 1
5 1.7013661e+01 6.75e-04 9.50e-03 -4.9 1.00e-02 - 1.00e+00 1.00e+00h 1
6 1.7014018e+01 1.96e-06 3.49e-04 -6.1 1.09e-03 - 1.00e+00 1.00e+00h 1
7 1.7014017e+01 1.47e-09 2.15e-07 -8.2 3.02e-05 - 1.00e+00 1.00e+00h 1
8 1.7014017e+01 0.00e+00 1.69e-09 -11.0 1.17e-08 - 1.00e+00 1.00e+00h 1
Number of Iterations....: 8
(scaled) (unscaled)
Objective...............: 1.7014017140224176e+01 1.7014017140224176e+01
Dual infeasibility......: 1.6853176362439831e-09 1.6853176362439831e-09
Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00
Complementarity.........: 1.0002952000760592e-11 1.0002952000760592e-11
Overall NLP error.......: 1.6853176362439831e-09 1.6853176362439831e-09
Number of objective function evaluations = 9
Number of objective gradient evaluations = 9
Number of equality constraint evaluations = 9
Number of inequality constraint evaluations = 9
Number of equality constraint Jacobian evaluations = 9
Number of inequality constraint Jacobian evaluations = 9
Number of Lagrangian Hessian evaluations = 0
Total CPU secs in IPOPT (w/o function evaluations) = 0.068
Total CPU secs in NLP function evaluations = 0.020
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...: 4
Number of nonzeros in inequality constraint Jacobian.: 4
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 4
variables with only lower bounds: 0
variables with lower and upper bounds: 4
variables with only upper bounds: 0
Total number of equality constraints.................: 1
Total number of inequality constraints...............: 1
inequality constraints with only lower bounds: 1
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.6109693e+01 1.12e+01 5.28e-01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 1.7420709e+01 7.49e-01 2.40e+01 -0.3 8.13e-01 - 3.20e-01 1.00e+00f 1
2 1.7120453e+01 2.14e-01 2.00e-01 -0.6 1.02e+00 - 9.97e-01 1.00e+00h 1
3 1.6979032e+01 1.70e-01 8.49e-02 -1.6 1.18e-01 - 9.72e-01 1.00e+00h 1
4 1.6972554e+01 7.69e-02 1.20e-02 -3.2 8.01e-02 - 1.00e+00 1.00e+00h 1
5 1.7013661e+01 6.75e-04 9.50e-03 -4.9 1.00e-02 - 1.00e+00 1.00e+00h 1
6 1.7014018e+01 1.96e-06 3.49e-04 -6.1 1.09e-03 - 1.00e+00 1.00e+00h 1
7 1.7014017e+01 1.47e-09 2.15e-07 -8.2 3.02e-05 - 1.00e+00 1.00e+00h 1
8 1.7014017e+01 0.00e+00 1.69e-09 -11.0 1.17e-08 - 1.00e+00 1.00e+00h 1
Number of Iterations....: 8
(scaled) (unscaled)
Objective...............: 1.7014017140224176e+01 1.7014017140224176e+01
Dual infeasibility......: 1.6853176362439831e-09 1.6853176362439831e-09
Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00
Complementarity.........: 1.0002952000760592e-11 1.0002952000760592e-11
Overall NLP error.......: 1.6853176362439831e-09 1.6853176362439831e-09
Number of objective function evaluations = 9
Number of objective gradient evaluations = 9
Number of equality constraint evaluations = 9
Number of inequality constraint evaluations = 9
Number of equality constraint Jacobian evaluations = 9
Number of inequality constraint Jacobian evaluations = 9
Number of Lagrangian Hessian evaluations = 0
Total CPU secs in IPOPT (w/o function evaluations) = 0.009
Total CPU secs in NLP function evaluations = 0.000
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.: 2
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.................: 0
Total number of inequality constraints...............: 1
inequality constraints with only lower bounds: 0
inequality constraints with lower and upper bounds: 0
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 0.00e+00 1.00e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 -1.5499995e+00 0.00e+00 9.70e-01 -1.0 1.00e+00 - 6.83e-01 1.00e+00f 1
2 -3.3684721e+00 1.23e-01 5.89e-01 -1.7 1.51e+00 0.0 6.42e-01 9.54e-01f 1
3 -3.9741885e+00 9.68e-01 9.57e-02 -1.7 2.80e+00 - 1.00e+00 4.25e-01h 1
4 -3.9687809e+00 9.59e-01 2.44e-01 -1.7 1.32e+00 - 1.00e+00 2.87e-01h 1
5 -3.9481863e+00 9.26e-01 1.87e-01 -1.7 3.19e-01 - 3.46e-02 3.75e-02h 1
6 -3.4559338e+00 1.88e-01 7.87e-02 -1.7 4.82e-01 - 1.00e+00 1.00e+00h 1
7 -3.3770765e+00 9.02e-02 8.25e-02 -1.7 7.39e-02 - 5.32e-01 6.09e-01h 1
8 -3.3181872e+00 1.03e-02 1.90e-02 -2.5 9.62e-02 - 1.00e+00 1.00e+00h 1
9 -3.3094856e+00 9.76e-05 7.03e-04 -3.8 1.08e-02 - 9.89e-01 1.00e+00h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10 -3.3093993e+00 0.00e+00 1.18e-07 -5.7 1.13e-04 - 1.00e+00 1.00e+00h 1
11 -3.3094011e+00 0.00e+00 2.42e-11 -8.6 2.20e-06 - 1.00e+00 1.00e+00h 1
Number of Iterations....: 11
(scaled) (unscaled)
Objective...............: -3.3094010829284688e+00 -3.3094010829284688e+00
Dual infeasibility......: 2.4180452302933228e-11 2.4180452302933228e-11
Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00
Complementarity.........: 2.5290927319670938e-09 2.5290927319670938e-09
Overall NLP error.......: 2.5290927319670938e-09 2.5290927319670938e-09
Number of objective function evaluations = 12
Number of objective gradient evaluations = 12
Number of equality constraint evaluations = 0
Number of inequality constraint evaluations = 12
Number of equality constraint Jacobian evaluations = 0
Number of inequality constraint Jacobian evaluations = 12
Number of Lagrangian Hessian evaluations = 11
Total CPU secs in IPOPT (w/o function evaluations) = 0.114
Total CPU secs in NLP function evaluations = 0.023
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.: 2
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.................: 0
Total number of inequality constraints...............: 1
inequality constraints with only lower bounds: 0
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 -3.3094011e+00 0.00e+00 9.74e-02 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 -3.2208641e+00 0.00e+00 1.14e-02 -1.0 9.22e-02 - 1.00e+00 1.00e+00f 1
2 -3.3108681e+00 1.95e-03 2.16e-03 -2.5 1.06e-01 - 1.00e+00 9.62e-01f 1
3 -3.3094591e+00 6.73e-05 9.20e-04 -3.8 9.58e-03 - 1.00e+00 1.00e+00h 1
4 -3.3093998e+00 0.00e+00 1.57e-06 -5.7 3.63e-04 - 1.00e+00 1.00e+00h 1
5 -3.3094011e+00 0.00e+00 4.82e-11 -8.6 2.51e-06 - 1.00e+00 1.00e+00h 1
Number of Iterations....: 5
(scaled) (unscaled)
Objective...............: -3.3094010829363834e+00 -3.3094010829363834e+00
Dual infeasibility......: 4.8183660518598715e-11 4.8183660518598715e-11
Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00
Complementarity.........: 2.5468012068635348e-09 2.5468012068635348e-09
Overall NLP error.......: 2.5468012068635348e-09 2.5468012068635348e-09
Number of objective function evaluations = 6
Number of objective gradient evaluations = 6
Number of equality constraint evaluations = 0
Number of inequality constraint evaluations = 6
Number of equality constraint Jacobian evaluations = 0
Number of inequality constraint Jacobian evaluations = 6
Number of Lagrangian Hessian evaluations = 5
Total CPU secs in IPOPT (w/o function evaluations) = 0.003
Total CPU secs in NLP function evaluations = 0.000
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.............: 3
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...............: 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 8.1008100e+05 0.00e+00 1.00e+02 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 8.0991001e+01 0.00e+00 5.00e-03 -1.0 9.00e+01 - 1.00e+00 1.00e+00f 1
2 7.6633847e+01 0.00e+00 9.02e-02 -3.8 1.80e+02 - 1.00e+00 3.12e-02f 6
3 7.4460854e+01 0.00e+00 2.79e-01 -3.8 1.00e+01 - 1.00e+00 1.00e+00f 1
4 6.4854348e+01 0.00e+00 2.70e-02 -3.8 2.49e+00 - 1.00e+00 1.00e+00f 1
5 6.1324534e+01 0.00e+00 1.50e-01 -3.8 2.65e+01 - 1.00e+00 2.50e-01f 3
6 5.5682148e+01 0.00e+00 6.07e-02 -3.8 4.11e+00 - 1.00e+00 1.00e+00f 1
7 5.2401345e+01 0.00e+00 1.05e-01 -3.8 9.55e+00 - 1.00e+00 5.00e-01f 2
8 4.7754183e+01 0.00e+00 8.64e-02 -3.8 4.91e+00 - 1.00e+00 1.00e+00f 1
9 4.3662081e+01 0.00e+00 1.02e-01 -3.8 5.29e+00 - 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.9394585e+01 0.00e+00 5.99e-02 -3.8 3.86e+00 - 1.00e+00 1.00e+00f 1
11 3.6854350e+01 0.00e+00 1.33e-01 -3.8 5.93e+00 - 1.00e+00 1.00e+00f 1
12 3.2085703e+01 0.00e+00 2.32e-02 -3.8 2.07e+00 - 1.00e+00 1.00e+00f 1
13 3.1530610e+01 0.00e+00 1.46e-01 -3.8 1.17e+01 - 1.00e+00 5.00e-01f 2
14 2.5979012e+01 0.00e+00 1.30e-02 -3.8 1.32e+00 - 1.00e+00 1.00e+00f 1
15 2.4078492e+01 0.00e+00 7.46e-02 -3.8 1.55e+01 - 1.00e+00 2.50e-01f 3
16 2.1087884e+01 0.00e+00 2.83e-02 -3.8 2.25e+00 - 1.00e+00 1.00e+00f 1
17 1.9387060e+01 0.00e+00 5.03e-02 -3.8 5.43e+00 - 1.00e+00 5.00e-01f 2
18 1.7017660e+01 0.00e+00 3.80e-02 -3.8 2.60e+00 - 1.00e+00 1.00e+00f 1
19 1.5063675e+01 0.00e+00 4.92e-02 -3.8 2.96e+00 - 1.00e+00 1.00e+00f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
20 1.2958390e+01 0.00e+00 2.26e-02 -3.8 1.84e+00 - 1.00e+00 1.00e+00f 1
21 1.2513152e+01 0.00e+00 7.34e-02 -3.8 3.55e+00 - 1.00e+00 1.00e+00f 1
22 9.5226477e+00 0.00e+00 6.26e-03 -3.8 6.84e-01 - 1.00e+00 1.00e+00f 1
23 8.5338704e+00 0.00e+00 3.28e-02 -3.8 8.38e+00 - 1.00e+00 2.50e-01f 3
24 7.1136882e+00 0.00e+00 1.47e-02 -3.8 1.31e+00 - 1.00e+00 1.00e+00f 1
25 6.8119498e+00 0.00e+00 4.68e-02 -3.8 2.54e+00 - 1.00e+00 1.00e+00f 1
26 4.8721294e+00 0.00e+00 4.03e-03 -3.8 4.60e-01 - 1.00e+00 1.00e+00f 1
27 4.2350045e+00 0.00e+00 1.83e-02 -3.8 5.49e+00 - 1.00e+00 2.50e-01f 3
28 3.3933446e+00 0.00e+00 1.06e-02 -3.8 9.96e-01 - 1.00e+00 1.00e+00f 1
29 2.8588540e+00 0.00e+00 1.93e-02 -3.8 1.40e+00 - 1.00e+00 1.00e+00f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
30 2.1180181e+00 0.00e+00 4.22e-03 -3.8 5.09e-01 - 1.00e+00 1.00e+00f 1
31 1.7857252e+00 0.00e+00 1.29e-02 -3.8 2.01e+00 - 1.00e+00 5.00e-01f 2
32 1.2901521e+00 0.00e+00 3.76e-03 -3.8 4.67e-01 - 1.00e+00 1.00e+00f 1
33 1.0408718e+00 0.00e+00 7.23e-03 -3.8 1.30e+00 - 1.00e+00 5.00e-01f 2
34 7.3496094e-01 0.00e+00 4.30e-03 -3.8 5.10e-01 - 1.00e+00 1.00e+00f 1
35 5.3205719e-01 0.00e+00 6.07e-03 -3.8 6.27e-01 - 1.00e+00 1.00e+00f 1
36 3.3053300e-01 0.00e+00 1.79e-03 -3.8 2.74e-01 - 1.00e+00 1.00e+00f 1
37 3.2727124e-01 0.00e+00 6.94e-03 -3.8 6.55e-01 - 1.00e+00 1.00e+00f 1
38 1.0342719e-01 0.00e+00 3.68e-04 -3.8 5.29e-02 - 1.00e+00 1.00e+00f 1
39 6.6217406e-02 0.00e+00 2.35e-03 -5.7 6.73e-01 - 1.00e+00 5.00e-01f 2
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
40 2.2745202e-02 0.00e+00 3.32e-04 -5.7 8.84e-02 - 1.00e+00 1.00e+00f 1
41 1.5172949e-02 0.00e+00 1.36e-03 -5.7 2.45e-01 - 1.00e+00 1.00e+00f 1
42 8.6032066e-04 0.00e+00 3.46e-05 -5.7 1.48e-02 - 1.00e+00 1.00e+00f 1
43 6.5696724e-05 0.00e+00 9.01e-05 -5.7 5.83e-02 - 1.00e+00 1.00e+00f 1
44 1.5884129e-08 0.00e+00 1.38e-07 -5.7 7.81e-04 - 1.00e+00 1.00e+00f 1
45 2.5336289e-14 0.00e+00 1.77e-09 -8.6 2.51e-04 - 1.00e+00 1.00e+00f 1
Number of Iterations....: 45
(scaled) (unscaled)
Objective...............: 7.0375062599303445e-18 2.5336289286876029e-14
Dual infeasibility......: 1.7687817079841355e-09 6.3679325294503244e-06
Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00
Complementarity.........: 0.0000000000000000e+00 0.0000000000000000e+00
Overall NLP error.......: 1.7687817079841355e-09 6.3679325294503244e-06
Number of objective function evaluations = 109
Number of objective gradient evaluations = 46
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 = 45
Total CPU secs in IPOPT (w/o function evaluations) = 0.125
Total CPU secs in NLP function evaluations = 0.014
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.............: 3
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...............: 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 8.1008100e+05 0.00e+00 1.00e+02 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 8.0991001e+01 0.00e+00 5.00e-03 -1.0 9.00e+01 - 1.00e+00 1.00e+00f 1
2 7.6633847e+01 0.00e+00 9.02e-02 -3.8 1.80e+02 - 1.00e+00 3.12e-02f 6
3 7.4460854e+01 0.00e+00 2.79e-01 -3.8 1.00e+01 - 1.00e+00 1.00e+00f 1
4 6.4854348e+01 0.00e+00 2.70e-02 -3.8 2.49e+00 - 1.00e+00 1.00e+00f 1
5 6.1324534e+01 0.00e+00 1.50e-01 -3.8 2.65e+01 - 1.00e+00 2.50e-01f 3
6 5.5682148e+01 0.00e+00 6.07e-02 -3.8 4.11e+00 - 1.00e+00 1.00e+00f 1
7 5.2401345e+01 0.00e+00 1.05e-01 -3.8 9.55e+00 - 1.00e+00 5.00e-01f 2
8 4.7754183e+01 0.00e+00 8.64e-02 -3.8 4.91e+00 - 1.00e+00 1.00e+00f 1
9 4.3662081e+01 0.00e+00 1.02e-01 -3.8 5.29e+00 - 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.9394585e+01 0.00e+00 5.99e-02 -3.8 3.86e+00 - 1.00e+00 1.00e+00f 1
11 3.6854350e+01 0.00e+00 1.33e-01 -3.8 5.93e+00 - 1.00e+00 1.00e+00f 1
12 3.2085703e+01 0.00e+00 2.32e-02 -3.8 2.07e+00 - 1.00e+00 1.00e+00f 1
13 3.1530610e+01 0.00e+00 1.46e-01 -3.8 1.17e+01 - 1.00e+00 5.00e-01f 2
14 2.5979012e+01 0.00e+00 1.30e-02 -3.8 1.32e+00 - 1.00e+00 1.00e+00f 1
15 2.4078492e+01 0.00e+00 7.46e-02 -3.8 1.55e+01 - 1.00e+00 2.50e-01f 3
16 2.1087884e+01 0.00e+00 2.83e-02 -3.8 2.25e+00 - 1.00e+00 1.00e+00f 1
17 1.9387060e+01 0.00e+00 5.03e-02 -3.8 5.43e+00 - 1.00e+00 5.00e-01f 2
18 1.7017660e+01 0.00e+00 3.80e-02 -3.8 2.60e+00 - 1.00e+00 1.00e+00f 1
19 1.5063675e+01 0.00e+00 4.92e-02 -3.8 2.96e+00 - 1.00e+00 1.00e+00f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
20 1.2958390e+01 0.00e+00 2.26e-02 -3.8 1.84e+00 - 1.00e+00 1.00e+00f 1
21 1.2513152e+01 0.00e+00 7.34e-02 -3.8 3.55e+00 - 1.00e+00 1.00e+00f 1
22 9.5226477e+00 0.00e+00 6.26e-03 -3.8 6.84e-01 - 1.00e+00 1.00e+00f 1
23 8.5338704e+00 0.00e+00 3.28e-02 -3.8 8.38e+00 - 1.00e+00 2.50e-01f 3
24 7.1136882e+00 0.00e+00 1.47e-02 -3.8 1.31e+00 - 1.00e+00 1.00e+00f 1
25 6.8119498e+00 0.00e+00 4.68e-02 -3.8 2.54e+00 - 1.00e+00 1.00e+00f 1
26 4.8721294e+00 0.00e+00 4.03e-03 -3.8 4.60e-01 - 1.00e+00 1.00e+00f 1
27 4.2350045e+00 0.00e+00 1.83e-02 -3.8 5.49e+00 - 1.00e+00 2.50e-01f 3
28 3.3933446e+00 0.00e+00 1.06e-02 -3.8 9.96e-01 - 1.00e+00 1.00e+00f 1
29 2.8588540e+00 0.00e+00 1.93e-02 -3.8 1.40e+00 - 1.00e+00 1.00e+00f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
30 2.1180181e+00 0.00e+00 4.22e-03 -3.8 5.09e-01 - 1.00e+00 1.00e+00f 1
31 1.7857252e+00 0.00e+00 1.29e-02 -3.8 2.01e+00 - 1.00e+00 5.00e-01f 2
32 1.2901521e+00 0.00e+00 3.76e-03 -3.8 4.67e-01 - 1.00e+00 1.00e+00f 1
33 1.0408718e+00 0.00e+00 7.23e-03 -3.8 1.30e+00 - 1.00e+00 5.00e-01f 2
34 7.3496094e-01 0.00e+00 4.30e-03 -3.8 5.10e-01 - 1.00e+00 1.00e+00f 1
35 5.3205719e-01 0.00e+00 6.07e-03 -3.8 6.27e-01 - 1.00e+00 1.00e+00f 1
36 3.3053300e-01 0.00e+00 1.79e-03 -3.8 2.74e-01 - 1.00e+00 1.00e+00f 1
37 3.2727124e-01 0.00e+00 6.94e-03 -3.8 6.55e-01 - 1.00e+00 1.00e+00f 1
38 1.0342719e-01 0.00e+00 3.68e-04 -3.8 5.29e-02 - 1.00e+00 1.00e+00f 1
39 6.6217406e-02 0.00e+00 2.35e-03 -5.7 6.73e-01 - 1.00e+00 5.00e-01f 2
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
40 2.2745202e-02 0.00e+00 3.32e-04 -5.7 8.84e-02 - 1.00e+00 1.00e+00f 1
41 1.5172949e-02 0.00e+00 1.36e-03 -5.7 2.45e-01 - 1.00e+00 1.00e+00f 1
42 8.6032066e-04 0.00e+00 3.46e-05 -5.7 1.48e-02 - 1.00e+00 1.00e+00f 1
43 6.5696724e-05 0.00e+00 9.01e-05 -5.7 5.83e-02 - 1.00e+00 1.00e+00f 1
44 1.5884129e-08 0.00e+00 1.38e-07 -5.7 7.81e-04 - 1.00e+00 1.00e+00f 1
45 2.5336289e-14 0.00e+00 1.77e-09 -8.6 2.51e-04 - 1.00e+00 1.00e+00f 1
Number of Iterations....: 45
(scaled) (unscaled)
Objective...............: 7.0375062599303445e-18 2.5336289286876029e-14
Dual infeasibility......: 1.7687817079841355e-09 6.3679325294503244e-06
Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00
Complementarity.........: 0.0000000000000000e+00 0.0000000000000000e+00
Overall NLP error.......: 1.7687817079841355e-09 6.3679325294503244e-06
Number of objective function evaluations = 109
Number of objective gradient evaluations = 46
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 = 45
Total CPU secs in IPOPT (w/o function evaluations) = 0.022
Total CPU secs in NLP function evaluations = 0.001
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.: 5
Number of nonzeros in Lagrangian Hessian.............: 5
Total number of variables............................: 3
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...............: 2
inequality constraints with only lower bounds: 2
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.00e+00 1.00e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 2.0292095e+00 0.00e+00 1.00e-06 -1.0 8.40e-01 - 1.00e+00 1.00e+00h 1
2 1.8730894e+00 0.00e+00 2.83e-08 -2.5 1.06e-01 - 1.00e+00 1.00e+00f 1
3 1.8576864e+00 0.00e+00 1.50e-09 -3.8 1.34e-02 - 1.00e+00 1.00e+00f 1
4 1.8571468e+00 0.00e+00 1.84e-11 -5.7 4.61e-04 - 1.00e+00 1.00e+00f 1
5 1.8571428e+00 0.00e+00 2.51e-14 -8.6 2.57e-06 - 1.00e+00 1.00e+00f 1
Number of Iterations....: 5
(scaled) (unscaled)
Objective...............: 1.8571428250202391e+00 1.8571428250202391e+00
Dual infeasibility......: 2.5091040356528538e-14 2.5091040356528538e-14
Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00
Complementarity.........: 2.5138314144122443e-09 2.5138314144122443e-09
Overall NLP error.......: 2.5138314144122443e-09 2.5138314144122443e-09
Number of objective function evaluations = 6
Number of objective gradient evaluations = 6
Number of equality constraint evaluations = 0
Number of inequality constraint evaluations = 6
Number of equality constraint Jacobian evaluations = 0
Number of inequality constraint Jacobian evaluations = 6
Number of Lagrangian Hessian evaluations = 5
Total CPU secs in IPOPT (w/o function evaluations) = 0.003
Total CPU secs in NLP function evaluations = 0.000
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.: 5
Number of nonzeros in Lagrangian Hessian.............: 7
Total number of variables............................: 3
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...............: 2
inequality constraints with only lower bounds: 2
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.00e+00 1.00e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 2.0292095e+00 0.00e+00 1.00e-06 -1.0 8.40e-01 - 1.00e+00 1.00e+00h 1
2 1.8730894e+00 0.00e+00 2.83e-08 -2.5 1.06e-01 - 1.00e+00 1.00e+00f 1
3 1.8576864e+00 0.00e+00 1.50e-09 -3.8 1.34e-02 - 1.00e+00 1.00e+00f 1
4 1.8571468e+00 0.00e+00 1.84e-11 -5.7 4.61e-04 - 1.00e+00 1.00e+00f 1
5 1.8571428e+00 0.00e+00 2.51e-14 -8.6 2.57e-06 - 1.00e+00 1.00e+00f 1
Number of Iterations....: 5
(scaled) (unscaled)
Objective...............: 1.8571428250202391e+00 1.8571428250202391e+00
Dual infeasibility......: 2.5091040356528538e-14 2.5091040356528538e-14
Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00
Complementarity.........: 2.5138314144122443e-09 2.5138314144122443e-09
Overall NLP error.......: 2.5138314144122443e-09 2.5138314144122443e-09
Number of objective function evaluations = 6
Number of objective gradient evaluations = 6
Number of equality constraint evaluations = 0
Number of inequality constraint evaluations = 6
Number of equality constraint Jacobian evaluations = 0
Number of inequality constraint Jacobian evaluations = 6
Number of Lagrangian Hessian evaluations = 5
Total CPU secs in IPOPT (w/o function evaluations) = 0.003
Total CPU secs in NLP function evaluations = 0.000
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.: 7
Number of nonzeros in Lagrangian Hessian.............: 1
Total number of variables............................: 2
variables with only lower bounds: 2
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: 2
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 -1.9999980e-02 0.00e+00 1.40e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 -1.7869412e-01 0.00e+00 3.41e+00 -1.0 1.59e-01 - 2.52e-01 1.00e+00f 1
2 -5.4045150e-01 0.00e+00 3.01e+00 -1.0 3.62e-01 - 4.18e-01 1.00e+00f 1
3 -2.3683408e+00 4.36e-01 8.69e-01 -1.0 1.83e+00 - 2.76e-01 1.00e+00f 1
4 -2.2818178e+00 2.13e-01 1.46e-01 -1.7 4.76e-01 - 5.42e-01 7.53e-01h 1
5 -2.5836664e+00 3.80e-01 4.77e-01 -1.7 1.58e+00 - 7.32e-01 1.00e+00f 1
6 -2.2715765e+00 2.18e-02 4.19e-03 -1.7 7.11e-01 - 1.00e+00 1.00e+00h 1
7 -2.2469466e+00 0.00e+00 8.53e-04 -2.5 5.29e-02 - 1.00e+00 1.00e+00h 1
8 -2.2498339e+00 0.00e+00 1.66e-05 -3.8 3.08e-03 - 1.00e+00 1.00e+00h 1
9 -2.2499981e+00 0.00e+00 1.49e-08 -5.7 1.66e-04 - 1.00e+00 1.00e+00h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10 -2.2500000e+00 0.00e+00 1.09e-12 -8.6 1.89e-06 - 1.00e+00 1.00e+00h 1
Number of Iterations....: 10
(scaled) (unscaled)
Objective...............: -2.2500000174878498e+00 -2.2500000174878498e+00
Dual infeasibility......: 1.0861618183608446e-12 1.0861618183608446e-12
Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00
Complementarity.........: 2.5121753680505435e-09 2.5121753680505435e-09
Overall NLP error.......: 2.5121753680505435e-09 2.5121753680505435e-09
Number of objective function evaluations = 11
Number of objective gradient evaluations = 11
Number of equality constraint evaluations = 0
Number of inequality constraint evaluations = 11
Number of equality constraint Jacobian evaluations = 0
Number of inequality constraint Jacobian evaluations = 11
Number of Lagrangian Hessian evaluations = 10
Total CPU secs in IPOPT (w/o function evaluations) = 0.006
Total CPU secs in NLP function evaluations = 0.000
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.: 2
Number of nonzeros in Lagrangian Hessian.............: 1
Total number of variables............................: 1
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...............: 1
inequality constraints with only lower bounds: 0
inequality constraints with lower and upper bounds: 0
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 0.00e+00 1.00e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 -5.0000000e-01 0.00e+00 9.50e-01 -1.0 5.00e-01 - 1.00e+00 1.00e+00f 1
2 -2.4190404e+00 3.85e+00 5.66e-01 -1.7 8.12e+00 - 1.00e+00 2.44e-01f 1
3 -1.6039641e+00 5.73e-01 2.40e-01 -1.7 8.15e-01 - 1.00e+00 1.00e+00h 1
4 -1.4115695e+00 0.00e+00 3.97e-02 -1.7 1.92e-01 - 1.00e+00 1.00e+00h 1
5 -1.4119185e+00 0.00e+00 9.76e-06 -2.5 3.80e-02 - 1.00e+00 1.00e+00h 1
6 -1.4140615e+00 0.00e+00 2.32e-06 -3.8 6.05e-03 - 1.00e+00 1.00e+00f 1
7 -1.4142117e+00 0.00e+00 1.10e-08 -5.7 4.29e-04 - 1.00e+00 1.00e+00h 1
8 -1.4142136e+00 0.00e+00 1.70e-12 -8.6 5.26e-06 - 1.00e+00 1.00e+00h 1
Number of Iterations....: 8
(scaled) (unscaled)
Objective...............: -1.4142135669370588e+00 -1.4142135669370588e+00
Dual infeasibility......: 1.6973089600469393e-12 1.6973089600469393e-12
Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00
Complementarity.........: 2.5083142310387366e-09 2.5083142310387366e-09
Overall NLP error.......: 2.5083142310387366e-09 2.5083142310387366e-09
Number of objective function evaluations = 9
Number of objective gradient evaluations = 9
Number of equality constraint evaluations = 0
Number of inequality constraint evaluations = 9
Number of equality constraint Jacobian evaluations = 0
Number of inequality constraint Jacobian evaluations = 9
Number of Lagrangian Hessian evaluations = 8
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
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.: 2
Number of nonzeros in Lagrangian Hessian.............: 1
Total number of variables............................: 1
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...............: 1
inequality constraints with only lower bounds: 0
inequality constraints with lower and upper bounds: 0
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 0.00e+00 1.00e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 -5.0000000e-01 0.00e+00 9.50e-01 -1.0 5.00e-01 - 1.00e+00 1.00e+00f 1
2 -2.4190404e+00 3.85e+00 5.66e-01 -1.7 8.12e+00 - 1.00e+00 2.44e-01f 1
3 -1.6039641e+00 5.73e-01 2.40e-01 -1.7 8.15e-01 - 1.00e+00 1.00e+00h 1
4 -1.4115695e+00 0.00e+00 3.97e-02 -1.7 1.92e-01 - 1.00e+00 1.00e+00h 1
5 -1.4119185e+00 0.00e+00 9.76e-06 -2.5 3.80e-02 - 1.00e+00 1.00e+00h 1
6 -1.4140615e+00 0.00e+00 2.32e-06 -3.8 6.05e-03 - 1.00e+00 1.00e+00f 1
7 -1.4142117e+00 0.00e+00 1.10e-08 -5.7 4.29e-04 - 1.00e+00 1.00e+00h 1
8 -1.4142136e+00 0.00e+00 1.70e-12 -8.6 5.26e-06 - 1.00e+00 1.00e+00h 1
Number of Iterations....: 8
(scaled) (unscaled)
Objective...............: -1.4142135669370588e+00 -1.4142135669370588e+00
Dual infeasibility......: 1.6973089600469393e-12 1.6973089600469393e-12
Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00
Complementarity.........: 2.5083142310387366e-09 2.5083142310387366e-09
Overall NLP error.......: 2.5083142310387366e-09 2.5083142310387366e-09
Number of objective function evaluations = 9
Number of objective gradient evaluations = 9
Number of equality constraint evaluations = 0
Number of inequality constraint evaluations = 9
Number of equality constraint Jacobian evaluations = 0
Number of inequality constraint Jacobian evaluations = 9
Number of Lagrangian Hessian evaluations = 8
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
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...: 4
Number of nonzeros in inequality constraint Jacobian.: 4
Number of nonzeros in Lagrangian Hessian.............: 10
Total number of variables............................: 4
variables with only lower bounds: 0
variables with lower and upper bounds: 4
variables with only upper bounds: 0
Total number of equality constraints.................: 1
Total number of inequality constraints...............: 1
inequality constraints with only lower bounds: 1
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 5.9714928e+01 3.48e+01 2.58e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1r 5.9714928e+01 3.48e+01 9.99e+02 1.5 0.00e+00 - 0.00e+00 0.00e+00R 1
Number of Iterations....: 1
(scaled) (unscaled)
Objective...............: 1.8095432878019967e+01 5.9714928497465891e+01
Dual infeasibility......: 1.7946182115358788e+01 5.9222400980683993e+01
Constraint violation....: 3.4824901449944008e+01 3.4824901449944008e+01
Complementarity.........: 3.9900000599999998e+00 1.3167000197999998e+01
Overall NLP error.......: 3.4824901449944008e+01 5.9222400980683993e+01
Number of objective function evaluations = 2
Number of objective gradient evaluations = 2
Number of equality constraint evaluations = 2
Number of inequality constraint evaluations = 2
Number of equality constraint Jacobian evaluations = 2
Number of inequality constraint Jacobian evaluations = 2
Number of Lagrangian Hessian evaluations = 1
Total CPU secs in IPOPT (w/o function evaluations) = 0.000
Total CPU secs in NLP function evaluations = 0.000
EXIT: Maximum Number of Iterations Exceeded.
Test Summary: | Pass Total
MathProgBase | 53 53
Test Summary: | Pass Total
MathOptInterface | 672 672
Testing Ipopt tests passed
Results with Julia v1.3.1-pre-7704df0a5a
Testing was successful .
Last evaluation was ago and took 3 minutes, 27 seconds.
Click here to download the log file.
Click here to show the log contents.
Resolving package versions...
Installed Compat ───────────── v2.2.0
Installed BenchmarkTools ───── v0.4.3
Installed OrderedCollections ─ v1.1.0
Installed Ipopt ────────────── v0.6.1
Installed BinaryProvider ───── v0.5.8
Installed MathProgBase ─────── v0.7.7
Installed JSON ─────────────── v0.21.0
Installed MathOptInterface ─── v0.9.7
Installed Parsers ──────────── v0.3.10
Updating `~/.julia/environments/v1.3/Project.toml`
[b6b21f68] + Ipopt v0.6.1
Updating `~/.julia/environments/v1.3/Manifest.toml`
[6e4b80f9] + BenchmarkTools v0.4.3
[b99e7846] + BinaryProvider v0.5.8
[34da2185] + Compat v2.2.0
[b6b21f68] + Ipopt v0.6.1
[682c06a0] + JSON v0.21.0
[b8f27783] + MathOptInterface v0.9.7
[fdba3010] + MathProgBase v0.7.7
[bac558e1] + OrderedCollections v1.1.0
[69de0a69] + Parsers v0.3.10
[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 Ipopt → `~/.julia/packages/Ipopt/ruIXY/deps/build.log`
Testing Ipopt
Resolving package versions...
Status `/tmp/jl_zxbtVe/Manifest.toml`
[6e4b80f9] BenchmarkTools v0.4.3
[b99e7846] BinaryProvider v0.5.8
[34da2185] Compat v2.2.0
[b6b21f68] Ipopt v0.6.1
[682c06a0] JSON v0.21.0
[b8f27783] MathOptInterface v0.9.7
[fdba3010] MathProgBase v0.7.7
[bac558e1] OrderedCollections v1.1.0
[69de0a69] Parsers v0.3.10
[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`]
******************************************************************************
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...: 4
Number of nonzeros in inequality constraint Jacobian.: 4
Number of nonzeros in Lagrangian Hessian.............: 10
Total number of variables............................: 4
variables with only lower bounds: 0
variables with lower and upper bounds: 4
variables with only upper bounds: 0
Total number of equality constraints.................: 1
Total number of inequality constraints...............: 1
inequality constraints with only lower bounds: 1
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.6109693e+01 1.12e+01 5.28e-01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 1.6982239e+01 7.30e-01 1.02e+01 -1.0 6.11e-01 - 7.19e-02 1.00e+00f 1
2 1.7318411e+01 3.60e-02 5.05e-01 -1.0 1.61e-01 - 1.00e+00 1.00e+00h 1
3 1.6849424e+01 2.78e-01 6.68e-02 -1.7 2.85e-01 - 7.94e-01 1.00e+00h 1
4 1.7051199e+01 4.71e-03 2.78e-03 -1.7 6.06e-02 - 1.00e+00 1.00e+00h 1
5 1.7011979e+01 7.19e-03 8.50e-03 -3.8 3.66e-02 - 9.45e-01 9.98e-01h 1
6 1.7014271e+01 1.74e-05 9.78e-06 -3.8 3.33e-03 - 1.00e+00 1.00e+00h 1
7 1.7014021e+01 1.23e-07 1.82e-07 -5.7 2.69e-04 - 1.00e+00 1.00e+00h 1
8 1.7014017e+01 1.77e-11 2.52e-11 -8.6 3.32e-06 - 1.00e+00 1.00e+00h 1
Number of Iterations....: 8
(scaled) (unscaled)
Objective...............: 1.7014017145179160e+01 1.7014017145179160e+01
Dual infeasibility......: 2.5164268330575961e-11 2.5164268330575961e-11
Constraint violation....: 1.7706724975141697e-11 1.7706724975141697e-11
Complementarity.........: 2.5277100427932987e-09 2.5277100427932987e-09
Overall NLP error.......: 2.5277100427932987e-09 2.5277100427932987e-09
Number of objective function evaluations = 9
Number of objective gradient evaluations = 9
Number of equality constraint evaluations = 9
Number of inequality constraint evaluations = 9
Number of equality constraint Jacobian evaluations = 9
Number of inequality constraint Jacobian evaluations = 9
Number of Lagrangian Hessian evaluations = 8
Total CPU secs in IPOPT (w/o function evaluations) = 0.164
Total CPU secs in NLP function evaluations = 0.028
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...: 4
Number of nonzeros in inequality constraint Jacobian.: 4
Number of nonzeros in Lagrangian Hessian.............: 10
Total number of variables............................: 4
variables with only lower bounds: 0
variables with lower and upper bounds: 4
variables with only upper bounds: 0
Total number of equality constraints.................: 1
Total number of inequality constraints...............: 1
inequality constraints with only lower bounds: 1
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.7159878e+01 2.01e-02 5.20e-01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 1.7146308e+01 2.06e-02 1.47e-01 -1.0 1.15e-01 - 9.86e-01 1.00e+00f 1
Number of Iterations....: 1
(scaled) (unscaled)
Objective...............: 1.7146307787804172e+01 1.7146307787804172e+01
Dual infeasibility......: 1.4659378128596279e-01 1.4659378128596279e-01
Constraint violation....: 2.0600446810355777e-02 2.0600446810355777e-02
Complementarity.........: 2.2602930210765068e-01 2.2602930210765068e-01
Overall NLP error.......: 2.2602930210765068e-01 2.2602930210765068e-01
Number of objective function evaluations = 2
Number of objective gradient evaluations = 2
Number of equality constraint evaluations = 2
Number of inequality constraint evaluations = 2
Number of equality constraint Jacobian evaluations = 2
Number of inequality constraint Jacobian evaluations = 2
Number of Lagrangian Hessian evaluations = 1
Total CPU secs in IPOPT (w/o function evaluations) = 0.009
Total CPU secs in NLP function evaluations = 0.000
EXIT: Stopping optimization at current point as requested by user.
String option
Int option
Float option
Ipopt 3.12.10 (Linux x86_64), ASL(20160307)
Test Summary: | Pass Total
C API | 11 11
Setting: "badoption" is not a valid setting for Option: hessian_approximation. Check the option documentation.
### hessian_approximation (String) ###
Category: Hessian Approximation
Description: Indicates what Hessian information is to be used.
Valid Settings:
exact (Use second derivatives provided by the NLP.)
limited-memory (Perform a limited-memory quasi-Newton approximation)
Default: "exact"
Setting: "-1" is not a valid setting for Option: file_print_level. Check the option documentation.
### file_print_level (Integer) ###
Category: Output
Description: Verbosity level for output file.
0 <= (5) <= 12
Setting: "-1" is not a valid setting for Option: derivative_test_tol. Check the option documentation.
### derivative_test_tol (Real Number) ###
Category: Derivative Checker
Description: Threshold for indicating wrong derivative.
0 < (0.0001) <= +inf
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.: 2
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 2
variables with only lower bounds: 2
variables with lower and upper bounds: 0
variables with only upper bounds: 0
Total number of equality constraints.................: 0
Total number of inequality constraints...............: 1
inequality constraints with only lower bounds: 0
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 -9.9999900e-03 0.00e+00 0.00e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 -1.1447368e-01 0.00e+00 4.57e-01 -1.0 3.06e-01 - 6.84e-01 1.00e+00f 1
2 -7.2703784e-01 0.00e+00 4.30e-02 -1.7 1.25e+00 - 1.00e+00 9.24e-01f 1
3 -7.4256221e-01 0.00e+00 2.83e-08 -2.5 2.57e-02 - 1.00e+00 1.00e+00f 1
4 -7.4969062e-01 0.00e+00 1.50e-09 -3.8 8.30e-03 - 1.00e+00 1.00e+00f 1
5 -7.4999627e-01 0.00e+00 1.84e-11 -5.7 3.07e-04 - 1.00e+00 1.00e+00f 1
6 -7.5000001e-01 0.00e+00 2.51e-14 -8.6 3.74e-06 - 1.00e+00 1.00e+00f 1
Number of Iterations....: 6
(scaled) (unscaled)
Objective...............: -7.5000000747928541e-01 -7.5000000747928541e-01
Dual infeasibility......: 2.5113627760616495e-14 2.5113627760616495e-14
Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00
Complementarity.........: 2.5103575950753621e-09 2.5103575950753621e-09
Overall NLP error.......: 2.5103575950753621e-09 2.5103575950753621e-09
Number of objective function evaluations = 7
Number of objective gradient evaluations = 7
Number of equality constraint evaluations = 0
Number of inequality constraint evaluations = 7
Number of equality constraint Jacobian evaluations = 0
Number of inequality constraint Jacobian evaluations = 7
Number of Lagrangian Hessian evaluations = 6
Total CPU secs in IPOPT (w/o function evaluations) = 0.311
Total CPU secs in NLP function evaluations = 0.255
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.: 2
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 2
variables with only lower bounds: 2
variables with lower and upper bounds: 0
variables with only upper bounds: 0
Total number of equality constraints.................: 0
Total number of inequality constraints...............: 1
inequality constraints with only lower bounds: 0
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 -9.9999900e-03 0.00e+00 0.00e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 -1.1447368e-01 0.00e+00 4.57e-01 -1.0 3.06e-01 - 6.84e-01 1.00e+00f 1
2 -7.2703784e-01 0.00e+00 4.30e-02 -1.7 1.25e+00 - 1.00e+00 9.24e-01f 1
3 -7.4256221e-01 0.00e+00 2.83e-08 -2.5 2.57e-02 - 1.00e+00 1.00e+00f 1
4 -7.4969062e-01 0.00e+00 1.50e-09 -3.8 8.30e-03 - 1.00e+00 1.00e+00f 1
5 -7.4999627e-01 0.00e+00 1.84e-11 -5.7 3.07e-04 - 1.00e+00 1.00e+00f 1
6 -7.5000001e-01 0.00e+00 2.51e-14 -8.6 3.74e-06 - 1.00e+00 1.00e+00f 1
Number of Iterations....: 6
(scaled) (unscaled)
Objective...............: -7.5000000747928541e-01 -7.5000000747928541e-01
Dual infeasibility......: 2.5113627760616495e-14 2.5113627760616495e-14
Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00
Complementarity.........: 2.5103575950753621e-09 2.5103575950753621e-09
Overall NLP error.......: 2.5103575950753621e-09 2.5103575950753621e-09
Number of objective function evaluations = 7
Number of objective gradient evaluations = 7
Number of equality constraint evaluations = 0
Number of inequality constraint evaluations = 7
Number of equality constraint Jacobian evaluations = 0
Number of inequality constraint Jacobian evaluations = 7
Number of Lagrangian Hessian evaluations = 6
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
┌ Warning: Element type Int64 does not have an infinite value. Note that this may artifically introduce ranged (two-sided) constraints. To avoid this, consider casting the problem data to Float64.
└ @ MathProgBase.HighLevelInterface ~/.julia/packages/MathProgBase/rVlFR/src/HighLevelInterface/HighLevelInterface.jl:9
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.: 2
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 2
variables with only lower bounds: 2
variables with lower and upper bounds: 0
variables with only upper bounds: 0
Total number of equality constraints.................: 0
Total number of inequality constraints...............: 1
inequality constraints with only lower bounds: 0
inequality constraints with lower and upper bounds: 1
inequality constraints with only upper bounds: 0
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 9.9999900e-03 1.03e+00 8.33e-01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 9.9990000e-05 1.01e+00 4.53e+01 -1.0 3.83e-01 - 9.90e-01 2.58e-02h 1
2 2.8879429e-05 1.00e+00 3.58e+03 -1.0 5.01e-01 - 9.90e-01 1.28e-02h 1
3 2.8732641e-07 1.00e+00 1.92e+07 -1.0 3.46e-01 - 9.90e-01 1.85e-04h 1
4r 2.8732641e-07 1.00e+00 1.00e+03 0.0 0.00e+00 - 0.00e+00 4.67e-07R 3
5r 9.9969511e-04 1.00e+00 9.97e+00 0.0 4.00e-03 - 9.90e-01 1.00e+00f 1
6r 4.9798661e-04 1.00e+00 8.98e-02 0.0 1.00e-03 - 9.91e-01 1.00e+00f 1
7r 1.9513382e-05 1.00e+00 1.20e-02 -1.4 3.36e-03 - 9.94e-01 1.00e+00f 1
8r 3.4684297e-07 1.00e+00 1.87e-08 -3.1 1.34e-04 - 1.00e+00 1.00e+00f 1
Number of Iterations....: 8
(scaled) (unscaled)
Objective...............: -9.9583877308489748e-09 -9.9583877308489748e-09
Dual infeasibility......: 1.0000000079514848e+00 1.0000000079514848e+00
Constraint violation....: 9.9999996016644899e-01 9.9999996016644899e-01
Complementarity.........: 8.3739702929516048e-08 8.3739702929516048e-08
Overall NLP error.......: 9.9999996016644899e-01 1.0000000079514848e+00
Number of objective function evaluations = 13
Number of objective gradient evaluations = 6
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 = 11
Number of Lagrangian Hessian evaluations = 9
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Converged to a point of local infeasibility. Problem may be infeasible.
┌ Warning: Problem is infeasible, but infeasibility ray ("Farkas proof") is unavailable; check that the proper solver options are set.
└ @ MathProgBase.HighLevelInterface ~/.julia/packages/MathProgBase/rVlFR/src/HighLevelInterface/linprog.jl:89
┌ Warning: Element type Int64 does not have an infinite value. Note that this may artifically introduce ranged (two-sided) constraints. To avoid this, consider casting the problem data to Float64.
└ @ MathProgBase.HighLevelInterface ~/.julia/packages/MathProgBase/rVlFR/src/HighLevelInterface/HighLevelInterface.jl:9
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.: 2
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 2
variables with only lower bounds: 2
variables with lower and upper bounds: 0
variables with only upper bounds: 0
Total number of equality constraints.................: 0
Total number of inequality constraints...............: 1
inequality constraints with only lower bounds: 0
inequality constraints with lower and upper bounds: 1
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.9999980e-02 1.00e-02 2.33e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 -2.0166663e-01 0.00e+00 4.84e+00 -1.0 1.48e-01 - 1.70e-01 1.00e+00f 1
2 -7.7864804e-01 0.00e+00 4.23e+00 -1.0 4.33e-01 - 3.15e-01 1.00e+00f 1
3 -8.8868649e+00 0.00e+00 1.63e+00 -1.0 5.38e+00 - 1.07e-01 1.00e+00f 1
4 -5.6819241e+02 0.00e+00 2.79e+00 -1.0 3.73e+02 - 1.54e-02 1.00e+00f 1
5 -1.6377850e+06 0.00e+00 1.27e+00 -1.0 1.09e+06 - 3.43e-04 1.00e+00f 1
6 -4.3576977e+11 0.00e+00 1.17e+00 -1.0 2.91e+11 - 3.72e-06 1.00e+00f 1
7 -4.0497367e+16 0.00e+00 1.17e+00 -1.0 2.70e+16 - 1.07e-05 1.00e+00f 1
8 -4.0497367e+16 0.00e+00 1.20e+00 -1.0 1.20e+04 -4.0 9.90e-01 1.00e+00f 1
9 -4.0497367e+16 0.00e+00 1.20e+00 -1.0 3.60e+04 -4.5 9.90e-01 1.00e+00f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10 -1.0129590e+17 0.00e+00 1.20e+00 -1.0 4.05e+16 - 3.96e-01 1.00e+00f 1
11 -1.1832087e+17 0.00e+00 1.40e+00 -1.0 8.11e+16 - 4.51e-01 1.40e-01f 1
12 -1.1832087e+17 0.00e+00 1.20e+00 -1.0 1.08e+05 -5.0 9.90e-01 1.00e+00f 1
13 -1.2863936e+17 0.00e+00 1.56e+00 -1.0 2.70e+16 - 9.90e-01 2.55e-01f 1
14 -1.2863936e+17 0.00e+00 1.20e+00 -1.0 3.24e+05 -5.4 1.00e+00 1.00e+00f 1
15 -1.4383899e+17 0.00e+00 1.20e+00 -1.0 1.01e+16 - 1.00e+00 1.00e+00f 1
16 -2.2490370e+17 0.00e+00 2.01e+00 -1.0 5.40e+16 - 2.80e-01 1.00e+00f 1
17 -4.1730036e+19 0.00e+00 2.01e+00 -1.0 2.77e+19 - 3.89e-03 1.00e+00f 1
18 -4.1730036e+19 0.00e+00 2.01e+00 -1.0 9.45e+05 -5.9 1.00e+00 4.72e-03f 1
19 -4.1730036e+19 0.00e+00 1.97e+00 -1.0 2.92e+06 -6.4 1.00e+00 2.35e-02f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
20 -4.1745236e+19 0.00e+00 1.97e+00 -1.0 1.01e+16 - 2.88e-01 1.00e+00f 1
21 -4.1745236e+19 0.00e+00 1.93e+00 -1.0 8.75e+06 -6.9 1.00e+00 3.26e-02f 1
22 -4.1747136e+19 0.00e+00 3.73e+00 -1.0 1.27e+15 - 1.00e+00 1.00e+00f 1
23 -4.1747136e+19 0.00e+00 1.20e+00 -1.0 2.62e+07 -7.3 1.00e+00 1.00e+00f 1
24 -4.1807934e+19 0.00e+00 2.01e+00 -1.0 4.05e+16 - 2.80e-01 1.00e+00f 1
25 -7.2936784e+19 0.00e+00 4.84e+00 -1.0 2.08e+19 - 1.03e-03 1.00e+00f 1
26 -7.2936784e+19 0.00e+00 4.84e+00 -1.0 7.73e+07 -7.8 1.00e+00 2.79e-04f 1
27 -7.2936784e+19 0.00e+00 3.31e+00 -1.0 2.36e+08 -8.3 1.00e+00 3.60e-01f 1
28 -7.2967183e+19 0.00e+00 3.31e+00 -1.0 2.03e+16 - 1.46e-01 1.00e+00f 1
29 -7.2967183e+19 0.00e+00 3.28e+00 -1.0 7.09e+08 -8.8 1.00e+00 1.36e-02f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
30 -7.2967183e+19 0.00e+00 1.20e+00 -1.0 2.13e+09 -9.2 1.00e+00 1.00e+00f 1
31 -7.3129313e+19 0.00e+00 3.43e+00 -1.0 1.08e+17 - 1.40e-01 1.00e+00f 1
32 -1.5613958e+20 0.00e+00 3.43e+00 -1.0 5.53e+19 - 1.63e-03 1.00e+00f 1
Number of Iterations....: 32
(scaled) (unscaled)
Objective...............: -1.5613957799791742e+20 -1.5613957799791742e+20
Dual infeasibility......: 3.4284275246391345e+00 3.4284275246391345e+00
Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00
Complementarity.........: 2.1352347958057366e-01 2.1352347958057366e-01
Overall NLP error.......: 3.4284275246391345e+00 3.4284275246391345e+00
Number of objective function evaluations = 33
Number of objective gradient evaluations = 33
Number of equality constraint evaluations = 0
Number of inequality constraint evaluations = 33
Number of equality constraint Jacobian evaluations = 0
Number of inequality constraint Jacobian evaluations = 33
Number of Lagrangian Hessian evaluations = 32
Total CPU secs in IPOPT (w/o function evaluations) = 0.008
Total CPU secs in NLP function evaluations = 0.000
EXIT: Iterates diverging; problem might be unbounded.
┌ Warning: Problem is unbounded, but unbounded ray is unavailable; check that the proper solver options are set.
└ @ MathProgBase.HighLevelInterface ~/.julia/packages/MathProgBase/rVlFR/src/HighLevelInterface/linprog.jl:97
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...: 4
Number of nonzeros in inequality constraint Jacobian.: 4
Number of nonzeros in Lagrangian Hessian.............: 10
Total number of variables............................: 4
variables with only lower bounds: 0
variables with lower and upper bounds: 4
variables with only upper bounds: 0
Total number of equality constraints.................: 1
Total number of inequality constraints...............: 1
inequality constraints with only lower bounds: 1
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.6109693e+01 1.12e+01 5.28e-01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 1.6982239e+01 7.30e-01 1.02e+01 -1.0 6.11e-01 - 7.19e-02 1.00e+00f 1
2 1.7318411e+01 3.60e-02 5.05e-01 -1.0 1.61e-01 - 1.00e+00 1.00e+00h 1
3 1.6849424e+01 2.78e-01 6.68e-02 -1.7 2.85e-01 - 7.94e-01 1.00e+00h 1
4 1.7051199e+01 4.71e-03 2.78e-03 -1.7 6.06e-02 - 1.00e+00 1.00e+00h 1
5 1.7011979e+01 7.19e-03 8.50e-03 -3.8 3.66e-02 - 9.45e-01 9.98e-01h 1
6 1.7014271e+01 1.74e-05 9.78e-06 -3.8 3.33e-03 - 1.00e+00 1.00e+00h 1
7 1.7014021e+01 1.23e-07 1.82e-07 -5.7 2.69e-04 - 1.00e+00 1.00e+00h 1
8 1.7014017e+01 1.77e-11 2.52e-11 -8.6 3.32e-06 - 1.00e+00 1.00e+00h 1
Number of Iterations....: 8
(scaled) (unscaled)
Objective...............: 1.7014017145179160e+01 1.7014017145179160e+01
Dual infeasibility......: 2.5164268330575961e-11 2.5164268330575961e-11
Constraint violation....: 1.7706724975141697e-11 1.7706724975141697e-11
Complementarity.........: 2.5277100427932987e-09 2.5277100427932987e-09
Overall NLP error.......: 2.5277100427932987e-09 2.5277100427932987e-09
Number of objective function evaluations = 9
Number of objective gradient evaluations = 9
Number of equality constraint evaluations = 9
Number of inequality constraint evaluations = 9
Number of equality constraint Jacobian evaluations = 9
Number of inequality constraint Jacobian evaluations = 9
Number of Lagrangian Hessian evaluations = 8
Total CPU secs in IPOPT (w/o function evaluations) = 0.175
Total CPU secs in NLP function evaluations = 0.038
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...: 4
Number of nonzeros in inequality constraint Jacobian.: 4
Number of nonzeros in Lagrangian Hessian.............: 10
Total number of variables............................: 4
variables with only lower bounds: 0
variables with lower and upper bounds: 4
variables with only upper bounds: 0
Total number of equality constraints.................: 1
Total number of inequality constraints...............: 1
inequality constraints with only lower bounds: 1
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.6109693e+01 1.12e+01 5.28e-01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 1.6982239e+01 7.30e-01 1.02e+01 -1.0 6.11e-01 - 7.19e-02 1.00e+00f 1
2 1.7318411e+01 3.60e-02 5.05e-01 -1.0 1.61e-01 - 1.00e+00 1.00e+00h 1
3 1.6849424e+01 2.78e-01 6.68e-02 -1.7 2.85e-01 - 7.94e-01 1.00e+00h 1
4 1.7051199e+01 4.71e-03 2.78e-03 -1.7 6.06e-02 - 1.00e+00 1.00e+00h 1
5 1.7011979e+01 7.19e-03 8.50e-03 -3.8 3.66e-02 - 9.45e-01 9.98e-01h 1
6 1.7014271e+01 1.74e-05 9.78e-06 -3.8 3.33e-03 - 1.00e+00 1.00e+00h 1
7 1.7014021e+01 1.23e-07 1.82e-07 -5.7 2.69e-04 - 1.00e+00 1.00e+00h 1
8 1.7014017e+01 1.77e-11 2.52e-11 -8.6 3.32e-06 - 1.00e+00 1.00e+00h 1
Number of Iterations....: 8
(scaled) (unscaled)
Objective...............: 1.7014017145179160e+01 1.7014017145179160e+01
Dual infeasibility......: 2.5164268330575961e-11 2.5164268330575961e-11
Constraint violation....: 1.7706724975141697e-11 1.7706724975141697e-11
Complementarity.........: 2.5277100427932987e-09 2.5277100427932987e-09
Overall NLP error.......: 2.5277100427932987e-09 2.5277100427932987e-09
Number of objective function evaluations = 9
Number of objective gradient evaluations = 9
Number of equality constraint evaluations = 9
Number of inequality constraint evaluations = 9
Number of equality constraint Jacobian evaluations = 9
Number of inequality constraint Jacobian evaluations = 9
Number of Lagrangian Hessian evaluations = 8
Total CPU secs in IPOPT (w/o function evaluations) = 0.005
Total CPU secs in NLP function evaluations = 0.000
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...: 4
Number of nonzeros in inequality constraint Jacobian.: 4
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 4
variables with only lower bounds: 0
variables with lower and upper bounds: 4
variables with only upper bounds: 0
Total number of equality constraints.................: 1
Total number of inequality constraints...............: 1
inequality constraints with only lower bounds: 1
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.6109693e+01 1.12e+01 5.28e-01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 1.7420709e+01 7.49e-01 2.40e+01 -0.3 8.13e-01 - 3.20e-01 1.00e+00f 1
2 1.7120453e+01 2.14e-01 2.00e-01 -0.6 1.02e+00 - 9.97e-01 1.00e+00h 1
3 1.6979032e+01 1.70e-01 8.49e-02 -1.6 1.18e-01 - 9.72e-01 1.00e+00h 1
4 1.6972554e+01 7.69e-02 1.20e-02 -3.2 8.01e-02 - 1.00e+00 1.00e+00h 1
5 1.7013661e+01 6.75e-04 9.50e-03 -4.9 1.00e-02 - 1.00e+00 1.00e+00h 1
6 1.7014018e+01 1.96e-06 3.49e-04 -6.1 1.09e-03 - 1.00e+00 1.00e+00h 1
7 1.7014017e+01 1.47e-09 2.15e-07 -8.2 3.02e-05 - 1.00e+00 1.00e+00h 1
8 1.7014017e+01 0.00e+00 1.69e-09 -11.0 1.17e-08 - 1.00e+00 1.00e+00h 1
Number of Iterations....: 8
(scaled) (unscaled)
Objective...............: 1.7014017140224176e+01 1.7014017140224176e+01
Dual infeasibility......: 1.6853176362439831e-09 1.6853176362439831e-09
Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00
Complementarity.........: 1.0002952000760592e-11 1.0002952000760592e-11
Overall NLP error.......: 1.6853176362439831e-09 1.6853176362439831e-09
Number of objective function evaluations = 9
Number of objective gradient evaluations = 9
Number of equality constraint evaluations = 9
Number of inequality constraint evaluations = 9
Number of equality constraint Jacobian evaluations = 9
Number of inequality constraint Jacobian evaluations = 9
Number of Lagrangian Hessian evaluations = 0
Total CPU secs in IPOPT (w/o function evaluations) = 0.053
Total CPU secs in NLP function evaluations = 0.018
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...: 4
Number of nonzeros in inequality constraint Jacobian.: 4
Number of nonzeros in Lagrangian Hessian.............: 0
Total number of variables............................: 4
variables with only lower bounds: 0
variables with lower and upper bounds: 4
variables with only upper bounds: 0
Total number of equality constraints.................: 1
Total number of inequality constraints...............: 1
inequality constraints with only lower bounds: 1
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.6109693e+01 1.12e+01 5.28e-01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 1.7420709e+01 7.49e-01 2.40e+01 -0.3 8.13e-01 - 3.20e-01 1.00e+00f 1
2 1.7120453e+01 2.14e-01 2.00e-01 -0.6 1.02e+00 - 9.97e-01 1.00e+00h 1
3 1.6979032e+01 1.70e-01 8.49e-02 -1.6 1.18e-01 - 9.72e-01 1.00e+00h 1
4 1.6972554e+01 7.69e-02 1.20e-02 -3.2 8.01e-02 - 1.00e+00 1.00e+00h 1
5 1.7013661e+01 6.75e-04 9.50e-03 -4.9 1.00e-02 - 1.00e+00 1.00e+00h 1
6 1.7014018e+01 1.96e-06 3.49e-04 -6.1 1.09e-03 - 1.00e+00 1.00e+00h 1
7 1.7014017e+01 1.47e-09 2.15e-07 -8.2 3.02e-05 - 1.00e+00 1.00e+00h 1
8 1.7014017e+01 0.00e+00 1.69e-09 -11.0 1.17e-08 - 1.00e+00 1.00e+00h 1
Number of Iterations....: 8
(scaled) (unscaled)
Objective...............: 1.7014017140224176e+01 1.7014017140224176e+01
Dual infeasibility......: 1.6853176362439831e-09 1.6853176362439831e-09
Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00
Complementarity.........: 1.0002952000760592e-11 1.0002952000760592e-11
Overall NLP error.......: 1.6853176362439831e-09 1.6853176362439831e-09
Number of objective function evaluations = 9
Number of objective gradient evaluations = 9
Number of equality constraint evaluations = 9
Number of inequality constraint evaluations = 9
Number of equality constraint Jacobian evaluations = 9
Number of inequality constraint Jacobian evaluations = 9
Number of Lagrangian Hessian evaluations = 0
Total CPU secs in IPOPT (w/o function evaluations) = 0.011
Total CPU secs in NLP function evaluations = 0.000
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.: 2
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.................: 0
Total number of inequality constraints...............: 1
inequality constraints with only lower bounds: 0
inequality constraints with lower and upper bounds: 0
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 0.00e+00 1.00e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 -1.5499995e+00 0.00e+00 9.70e-01 -1.0 1.00e+00 - 6.83e-01 1.00e+00f 1
2 -3.3684721e+00 1.23e-01 5.89e-01 -1.7 1.51e+00 0.0 6.42e-01 9.54e-01f 1
3 -3.9741885e+00 9.68e-01 9.57e-02 -1.7 2.80e+00 - 1.00e+00 4.25e-01h 1
4 -3.9687809e+00 9.59e-01 2.44e-01 -1.7 1.32e+00 - 1.00e+00 2.87e-01h 1
5 -3.9481863e+00 9.26e-01 1.87e-01 -1.7 3.19e-01 - 3.46e-02 3.75e-02h 1
6 -3.4559338e+00 1.88e-01 7.87e-02 -1.7 4.82e-01 - 1.00e+00 1.00e+00h 1
7 -3.3770765e+00 9.02e-02 8.25e-02 -1.7 7.39e-02 - 5.32e-01 6.09e-01h 1
8 -3.3181872e+00 1.03e-02 1.90e-02 -2.5 9.62e-02 - 1.00e+00 1.00e+00h 1
9 -3.3094856e+00 9.76e-05 7.03e-04 -3.8 1.08e-02 - 9.89e-01 1.00e+00h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10 -3.3093993e+00 0.00e+00 1.18e-07 -5.7 1.13e-04 - 1.00e+00 1.00e+00h 1
11 -3.3094011e+00 0.00e+00 2.42e-11 -8.6 2.20e-06 - 1.00e+00 1.00e+00h 1
Number of Iterations....: 11
(scaled) (unscaled)
Objective...............: -3.3094010829284688e+00 -3.3094010829284688e+00
Dual infeasibility......: 2.4180452302933228e-11 2.4180452302933228e-11
Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00
Complementarity.........: 2.5290927319670938e-09 2.5290927319670938e-09
Overall NLP error.......: 2.5290927319670938e-09 2.5290927319670938e-09
Number of objective function evaluations = 12
Number of objective gradient evaluations = 12
Number of equality constraint evaluations = 0
Number of inequality constraint evaluations = 12
Number of equality constraint Jacobian evaluations = 0
Number of inequality constraint Jacobian evaluations = 12
Number of Lagrangian Hessian evaluations = 11
Total CPU secs in IPOPT (w/o function evaluations) = 0.110
Total CPU secs in NLP function evaluations = 0.026
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.: 2
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.................: 0
Total number of inequality constraints...............: 1
inequality constraints with only lower bounds: 0
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 -3.3094011e+00 0.00e+00 9.74e-02 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 -3.2208641e+00 0.00e+00 1.14e-02 -1.0 9.22e-02 - 1.00e+00 1.00e+00f 1
2 -3.3108681e+00 1.95e-03 2.16e-03 -2.5 1.06e-01 - 1.00e+00 9.62e-01f 1
3 -3.3094591e+00 6.73e-05 9.20e-04 -3.8 9.58e-03 - 1.00e+00 1.00e+00h 1
4 -3.3093998e+00 0.00e+00 1.57e-06 -5.7 3.63e-04 - 1.00e+00 1.00e+00h 1
5 -3.3094011e+00 0.00e+00 4.82e-11 -8.6 2.51e-06 - 1.00e+00 1.00e+00h 1
Number of Iterations....: 5
(scaled) (unscaled)
Objective...............: -3.3094010829363834e+00 -3.3094010829363834e+00
Dual infeasibility......: 4.8183660518598715e-11 4.8183660518598715e-11
Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00
Complementarity.........: 2.5468012068635348e-09 2.5468012068635348e-09
Overall NLP error.......: 2.5468012068635348e-09 2.5468012068635348e-09
Number of objective function evaluations = 6
Number of objective gradient evaluations = 6
Number of equality constraint evaluations = 0
Number of inequality constraint evaluations = 6
Number of equality constraint Jacobian evaluations = 0
Number of inequality constraint Jacobian evaluations = 6
Number of Lagrangian Hessian evaluations = 5
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
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.............: 3
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...............: 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 8.1008100e+05 0.00e+00 1.00e+02 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 8.0991001e+01 0.00e+00 5.00e-03 -1.0 9.00e+01 - 1.00e+00 1.00e+00f 1
2 7.6633847e+01 0.00e+00 9.02e-02 -3.8 1.80e+02 - 1.00e+00 3.12e-02f 6
3 7.4460854e+01 0.00e+00 2.79e-01 -3.8 1.00e+01 - 1.00e+00 1.00e+00f 1
4 6.4854348e+01 0.00e+00 2.70e-02 -3.8 2.49e+00 - 1.00e+00 1.00e+00f 1
5 6.1324534e+01 0.00e+00 1.50e-01 -3.8 2.65e+01 - 1.00e+00 2.50e-01f 3
6 5.5682148e+01 0.00e+00 6.07e-02 -3.8 4.11e+00 - 1.00e+00 1.00e+00f 1
7 5.2401345e+01 0.00e+00 1.05e-01 -3.8 9.55e+00 - 1.00e+00 5.00e-01f 2
8 4.7754183e+01 0.00e+00 8.64e-02 -3.8 4.91e+00 - 1.00e+00 1.00e+00f 1
9 4.3662081e+01 0.00e+00 1.02e-01 -3.8 5.29e+00 - 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.9394585e+01 0.00e+00 5.99e-02 -3.8 3.86e+00 - 1.00e+00 1.00e+00f 1
11 3.6854350e+01 0.00e+00 1.33e-01 -3.8 5.93e+00 - 1.00e+00 1.00e+00f 1
12 3.2085703e+01 0.00e+00 2.32e-02 -3.8 2.07e+00 - 1.00e+00 1.00e+00f 1
13 3.1530610e+01 0.00e+00 1.46e-01 -3.8 1.17e+01 - 1.00e+00 5.00e-01f 2
14 2.5979012e+01 0.00e+00 1.30e-02 -3.8 1.32e+00 - 1.00e+00 1.00e+00f 1
15 2.4078492e+01 0.00e+00 7.46e-02 -3.8 1.55e+01 - 1.00e+00 2.50e-01f 3
16 2.1087884e+01 0.00e+00 2.83e-02 -3.8 2.25e+00 - 1.00e+00 1.00e+00f 1
17 1.9387060e+01 0.00e+00 5.03e-02 -3.8 5.43e+00 - 1.00e+00 5.00e-01f 2
18 1.7017660e+01 0.00e+00 3.80e-02 -3.8 2.60e+00 - 1.00e+00 1.00e+00f 1
19 1.5063675e+01 0.00e+00 4.92e-02 -3.8 2.96e+00 - 1.00e+00 1.00e+00f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
20 1.2958390e+01 0.00e+00 2.26e-02 -3.8 1.84e+00 - 1.00e+00 1.00e+00f 1
21 1.2513152e+01 0.00e+00 7.34e-02 -3.8 3.55e+00 - 1.00e+00 1.00e+00f 1
22 9.5226477e+00 0.00e+00 6.26e-03 -3.8 6.84e-01 - 1.00e+00 1.00e+00f 1
23 8.5338704e+00 0.00e+00 3.28e-02 -3.8 8.38e+00 - 1.00e+00 2.50e-01f 3
24 7.1136882e+00 0.00e+00 1.47e-02 -3.8 1.31e+00 - 1.00e+00 1.00e+00f 1
25 6.8119498e+00 0.00e+00 4.68e-02 -3.8 2.54e+00 - 1.00e+00 1.00e+00f 1
26 4.8721294e+00 0.00e+00 4.03e-03 -3.8 4.60e-01 - 1.00e+00 1.00e+00f 1
27 4.2350045e+00 0.00e+00 1.83e-02 -3.8 5.49e+00 - 1.00e+00 2.50e-01f 3
28 3.3933446e+00 0.00e+00 1.06e-02 -3.8 9.96e-01 - 1.00e+00 1.00e+00f 1
29 2.8588540e+00 0.00e+00 1.93e-02 -3.8 1.40e+00 - 1.00e+00 1.00e+00f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
30 2.1180181e+00 0.00e+00 4.22e-03 -3.8 5.09e-01 - 1.00e+00 1.00e+00f 1
31 1.7857252e+00 0.00e+00 1.29e-02 -3.8 2.01e+00 - 1.00e+00 5.00e-01f 2
32 1.2901521e+00 0.00e+00 3.76e-03 -3.8 4.67e-01 - 1.00e+00 1.00e+00f 1
33 1.0408718e+00 0.00e+00 7.23e-03 -3.8 1.30e+00 - 1.00e+00 5.00e-01f 2
34 7.3496094e-01 0.00e+00 4.30e-03 -3.8 5.10e-01 - 1.00e+00 1.00e+00f 1
35 5.3205719e-01 0.00e+00 6.07e-03 -3.8 6.27e-01 - 1.00e+00 1.00e+00f 1
36 3.3053300e-01 0.00e+00 1.79e-03 -3.8 2.74e-01 - 1.00e+00 1.00e+00f 1
37 3.2727124e-01 0.00e+00 6.94e-03 -3.8 6.55e-01 - 1.00e+00 1.00e+00f 1
38 1.0342719e-01 0.00e+00 3.68e-04 -3.8 5.29e-02 - 1.00e+00 1.00e+00f 1
39 6.6217406e-02 0.00e+00 2.35e-03 -5.7 6.73e-01 - 1.00e+00 5.00e-01f 2
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
40 2.2745202e-02 0.00e+00 3.32e-04 -5.7 8.84e-02 - 1.00e+00 1.00e+00f 1
41 1.5172949e-02 0.00e+00 1.36e-03 -5.7 2.45e-01 - 1.00e+00 1.00e+00f 1
42 8.6032066e-04 0.00e+00 3.46e-05 -5.7 1.48e-02 - 1.00e+00 1.00e+00f 1
43 6.5696724e-05 0.00e+00 9.01e-05 -5.7 5.83e-02 - 1.00e+00 1.00e+00f 1
44 1.5884129e-08 0.00e+00 1.38e-07 -5.7 7.81e-04 - 1.00e+00 1.00e+00f 1
45 2.5336289e-14 0.00e+00 1.77e-09 -8.6 2.51e-04 - 1.00e+00 1.00e+00f 1
Number of Iterations....: 45
(scaled) (unscaled)
Objective...............: 7.0375062599303445e-18 2.5336289286876029e-14
Dual infeasibility......: 1.7687817079841355e-09 6.3679325294503244e-06
Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00
Complementarity.........: 0.0000000000000000e+00 0.0000000000000000e+00
Overall NLP error.......: 1.7687817079841355e-09 6.3679325294503244e-06
Number of objective function evaluations = 109
Number of objective gradient evaluations = 46
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 = 45
Total CPU secs in IPOPT (w/o function evaluations) = 0.141
Total CPU secs in NLP function evaluations = 0.015
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.............: 3
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...............: 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 8.1008100e+05 0.00e+00 1.00e+02 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 8.0991001e+01 0.00e+00 5.00e-03 -1.0 9.00e+01 - 1.00e+00 1.00e+00f 1
2 7.6633847e+01 0.00e+00 9.02e-02 -3.8 1.80e+02 - 1.00e+00 3.12e-02f 6
3 7.4460854e+01 0.00e+00 2.79e-01 -3.8 1.00e+01 - 1.00e+00 1.00e+00f 1
4 6.4854348e+01 0.00e+00 2.70e-02 -3.8 2.49e+00 - 1.00e+00 1.00e+00f 1
5 6.1324534e+01 0.00e+00 1.50e-01 -3.8 2.65e+01 - 1.00e+00 2.50e-01f 3
6 5.5682148e+01 0.00e+00 6.07e-02 -3.8 4.11e+00 - 1.00e+00 1.00e+00f 1
7 5.2401345e+01 0.00e+00 1.05e-01 -3.8 9.55e+00 - 1.00e+00 5.00e-01f 2
8 4.7754183e+01 0.00e+00 8.64e-02 -3.8 4.91e+00 - 1.00e+00 1.00e+00f 1
9 4.3662081e+01 0.00e+00 1.02e-01 -3.8 5.29e+00 - 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.9394585e+01 0.00e+00 5.99e-02 -3.8 3.86e+00 - 1.00e+00 1.00e+00f 1
11 3.6854350e+01 0.00e+00 1.33e-01 -3.8 5.93e+00 - 1.00e+00 1.00e+00f 1
12 3.2085703e+01 0.00e+00 2.32e-02 -3.8 2.07e+00 - 1.00e+00 1.00e+00f 1
13 3.1530610e+01 0.00e+00 1.46e-01 -3.8 1.17e+01 - 1.00e+00 5.00e-01f 2
14 2.5979012e+01 0.00e+00 1.30e-02 -3.8 1.32e+00 - 1.00e+00 1.00e+00f 1
15 2.4078492e+01 0.00e+00 7.46e-02 -3.8 1.55e+01 - 1.00e+00 2.50e-01f 3
16 2.1087884e+01 0.00e+00 2.83e-02 -3.8 2.25e+00 - 1.00e+00 1.00e+00f 1
17 1.9387060e+01 0.00e+00 5.03e-02 -3.8 5.43e+00 - 1.00e+00 5.00e-01f 2
18 1.7017660e+01 0.00e+00 3.80e-02 -3.8 2.60e+00 - 1.00e+00 1.00e+00f 1
19 1.5063675e+01 0.00e+00 4.92e-02 -3.8 2.96e+00 - 1.00e+00 1.00e+00f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
20 1.2958390e+01 0.00e+00 2.26e-02 -3.8 1.84e+00 - 1.00e+00 1.00e+00f 1
21 1.2513152e+01 0.00e+00 7.34e-02 -3.8 3.55e+00 - 1.00e+00 1.00e+00f 1
22 9.5226477e+00 0.00e+00 6.26e-03 -3.8 6.84e-01 - 1.00e+00 1.00e+00f 1
23 8.5338704e+00 0.00e+00 3.28e-02 -3.8 8.38e+00 - 1.00e+00 2.50e-01f 3
24 7.1136882e+00 0.00e+00 1.47e-02 -3.8 1.31e+00 - 1.00e+00 1.00e+00f 1
25 6.8119498e+00 0.00e+00 4.68e-02 -3.8 2.54e+00 - 1.00e+00 1.00e+00f 1
26 4.8721294e+00 0.00e+00 4.03e-03 -3.8 4.60e-01 - 1.00e+00 1.00e+00f 1
27 4.2350045e+00 0.00e+00 1.83e-02 -3.8 5.49e+00 - 1.00e+00 2.50e-01f 3
28 3.3933446e+00 0.00e+00 1.06e-02 -3.8 9.96e-01 - 1.00e+00 1.00e+00f 1
29 2.8588540e+00 0.00e+00 1.93e-02 -3.8 1.40e+00 - 1.00e+00 1.00e+00f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
30 2.1180181e+00 0.00e+00 4.22e-03 -3.8 5.09e-01 - 1.00e+00 1.00e+00f 1
31 1.7857252e+00 0.00e+00 1.29e-02 -3.8 2.01e+00 - 1.00e+00 5.00e-01f 2
32 1.2901521e+00 0.00e+00 3.76e-03 -3.8 4.67e-01 - 1.00e+00 1.00e+00f 1
33 1.0408718e+00 0.00e+00 7.23e-03 -3.8 1.30e+00 - 1.00e+00 5.00e-01f 2
34 7.3496094e-01 0.00e+00 4.30e-03 -3.8 5.10e-01 - 1.00e+00 1.00e+00f 1
35 5.3205719e-01 0.00e+00 6.07e-03 -3.8 6.27e-01 - 1.00e+00 1.00e+00f 1
36 3.3053300e-01 0.00e+00 1.79e-03 -3.8 2.74e-01 - 1.00e+00 1.00e+00f 1
37 3.2727124e-01 0.00e+00 6.94e-03 -3.8 6.55e-01 - 1.00e+00 1.00e+00f 1
38 1.0342719e-01 0.00e+00 3.68e-04 -3.8 5.29e-02 - 1.00e+00 1.00e+00f 1
39 6.6217406e-02 0.00e+00 2.35e-03 -5.7 6.73e-01 - 1.00e+00 5.00e-01f 2
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
40 2.2745202e-02 0.00e+00 3.32e-04 -5.7 8.84e-02 - 1.00e+00 1.00e+00f 1
41 1.5172949e-02 0.00e+00 1.36e-03 -5.7 2.45e-01 - 1.00e+00 1.00e+00f 1
42 8.6032066e-04 0.00e+00 3.46e-05 -5.7 1.48e-02 - 1.00e+00 1.00e+00f 1
43 6.5696724e-05 0.00e+00 9.01e-05 -5.7 5.83e-02 - 1.00e+00 1.00e+00f 1
44 1.5884129e-08 0.00e+00 1.38e-07 -5.7 7.81e-04 - 1.00e+00 1.00e+00f 1
45 2.5336289e-14 0.00e+00 1.77e-09 -8.6 2.51e-04 - 1.00e+00 1.00e+00f 1
Number of Iterations....: 45
(scaled) (unscaled)
Objective...............: 7.0375062599303445e-18 2.5336289286876029e-14
Dual infeasibility......: 1.7687817079841355e-09 6.3679325294503244e-06
Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00
Complementarity.........: 0.0000000000000000e+00 0.0000000000000000e+00
Overall NLP error.......: 1.7687817079841355e-09 6.3679325294503244e-06
Number of objective function evaluations = 109
Number of objective gradient evaluations = 46
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 = 45
Total CPU secs in IPOPT (w/o function evaluations) = 0.015
Total CPU secs in NLP function evaluations = 0.001
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.: 5
Number of nonzeros in Lagrangian Hessian.............: 5
Total number of variables............................: 3
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...............: 2
inequality constraints with only lower bounds: 2
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.00e+00 1.00e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 2.0292095e+00 0.00e+00 1.00e-06 -1.0 8.40e-01 - 1.00e+00 1.00e+00h 1
2 1.8730894e+00 0.00e+00 2.83e-08 -2.5 1.06e-01 - 1.00e+00 1.00e+00f 1
3 1.8576864e+00 0.00e+00 1.50e-09 -3.8 1.34e-02 - 1.00e+00 1.00e+00f 1
4 1.8571468e+00 0.00e+00 1.84e-11 -5.7 4.61e-04 - 1.00e+00 1.00e+00f 1
5 1.8571428e+00 0.00e+00 2.51e-14 -8.6 2.57e-06 - 1.00e+00 1.00e+00f 1
Number of Iterations....: 5
(scaled) (unscaled)
Objective...............: 1.8571428250202391e+00 1.8571428250202391e+00
Dual infeasibility......: 2.5091040356528538e-14 2.5091040356528538e-14
Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00
Complementarity.........: 2.5138314144122443e-09 2.5138314144122443e-09
Overall NLP error.......: 2.5138314144122443e-09 2.5138314144122443e-09
Number of objective function evaluations = 6
Number of objective gradient evaluations = 6
Number of equality constraint evaluations = 0
Number of inequality constraint evaluations = 6
Number of equality constraint Jacobian evaluations = 0
Number of inequality constraint Jacobian evaluations = 6
Number of Lagrangian Hessian evaluations = 5
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
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.: 5
Number of nonzeros in Lagrangian Hessian.............: 7
Total number of variables............................: 3
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...............: 2
inequality constraints with only lower bounds: 2
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.00e+00 1.00e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 2.0292095e+00 0.00e+00 1.00e-06 -1.0 8.40e-01 - 1.00e+00 1.00e+00h 1
2 1.8730894e+00 0.00e+00 2.83e-08 -2.5 1.06e-01 - 1.00e+00 1.00e+00f 1
3 1.8576864e+00 0.00e+00 1.50e-09 -3.8 1.34e-02 - 1.00e+00 1.00e+00f 1
4 1.8571468e+00 0.00e+00 1.84e-11 -5.7 4.61e-04 - 1.00e+00 1.00e+00f 1
5 1.8571428e+00 0.00e+00 2.51e-14 -8.6 2.57e-06 - 1.00e+00 1.00e+00f 1
Number of Iterations....: 5
(scaled) (unscaled)
Objective...............: 1.8571428250202391e+00 1.8571428250202391e+00
Dual infeasibility......: 2.5091040356528538e-14 2.5091040356528538e-14
Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00
Complementarity.........: 2.5138314144122443e-09 2.5138314144122443e-09
Overall NLP error.......: 2.5138314144122443e-09 2.5138314144122443e-09
Number of objective function evaluations = 6
Number of objective gradient evaluations = 6
Number of equality constraint evaluations = 0
Number of inequality constraint evaluations = 6
Number of equality constraint Jacobian evaluations = 0
Number of inequality constraint Jacobian evaluations = 6
Number of Lagrangian Hessian evaluations = 5
Total CPU secs in IPOPT (w/o function evaluations) = 0.003
Total CPU secs in NLP function evaluations = 0.000
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.: 7
Number of nonzeros in Lagrangian Hessian.............: 1
Total number of variables............................: 2
variables with only lower bounds: 2
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: 2
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 -1.9999980e-02 0.00e+00 1.40e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 -1.7869412e-01 0.00e+00 3.41e+00 -1.0 1.59e-01 - 2.52e-01 1.00e+00f 1
2 -5.4045150e-01 0.00e+00 3.01e+00 -1.0 3.62e-01 - 4.18e-01 1.00e+00f 1
3 -2.3683408e+00 4.36e-01 8.69e-01 -1.0 1.83e+00 - 2.76e-01 1.00e+00f 1
4 -2.2818178e+00 2.13e-01 1.46e-01 -1.7 4.76e-01 - 5.42e-01 7.53e-01h 1
5 -2.5836664e+00 3.80e-01 4.77e-01 -1.7 1.58e+00 - 7.32e-01 1.00e+00f 1
6 -2.2715765e+00 2.18e-02 4.19e-03 -1.7 7.11e-01 - 1.00e+00 1.00e+00h 1
7 -2.2469466e+00 0.00e+00 8.53e-04 -2.5 5.29e-02 - 1.00e+00 1.00e+00h 1
8 -2.2498339e+00 0.00e+00 1.66e-05 -3.8 3.08e-03 - 1.00e+00 1.00e+00h 1
9 -2.2499981e+00 0.00e+00 1.49e-08 -5.7 1.66e-04 - 1.00e+00 1.00e+00h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10 -2.2500000e+00 0.00e+00 1.09e-12 -8.6 1.89e-06 - 1.00e+00 1.00e+00h 1
Number of Iterations....: 10
(scaled) (unscaled)
Objective...............: -2.2500000174878498e+00 -2.2500000174878498e+00
Dual infeasibility......: 1.0861618183608446e-12 1.0861618183608446e-12
Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00
Complementarity.........: 2.5121753680505435e-09 2.5121753680505435e-09
Overall NLP error.......: 2.5121753680505435e-09 2.5121753680505435e-09
Number of objective function evaluations = 11
Number of objective gradient evaluations = 11
Number of equality constraint evaluations = 0
Number of inequality constraint evaluations = 11
Number of equality constraint Jacobian evaluations = 0
Number of inequality constraint Jacobian evaluations = 11
Number of Lagrangian Hessian evaluations = 10
Total CPU secs in IPOPT (w/o function evaluations) = 0.002
Total CPU secs in NLP function evaluations = 0.000
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.: 2
Number of nonzeros in Lagrangian Hessian.............: 1
Total number of variables............................: 1
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...............: 1
inequality constraints with only lower bounds: 0
inequality constraints with lower and upper bounds: 0
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 0.00e+00 1.00e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 -5.0000000e-01 0.00e+00 9.50e-01 -1.0 5.00e-01 - 1.00e+00 1.00e+00f 1
2 -2.4190404e+00 3.85e+00 5.66e-01 -1.7 8.12e+00 - 1.00e+00 2.44e-01f 1
3 -1.6039641e+00 5.73e-01 2.40e-01 -1.7 8.15e-01 - 1.00e+00 1.00e+00h 1
4 -1.4115695e+00 0.00e+00 3.97e-02 -1.7 1.92e-01 - 1.00e+00 1.00e+00h 1
5 -1.4119185e+00 0.00e+00 9.76e-06 -2.5 3.80e-02 - 1.00e+00 1.00e+00h 1
6 -1.4140615e+00 0.00e+00 2.32e-06 -3.8 6.05e-03 - 1.00e+00 1.00e+00f 1
7 -1.4142117e+00 0.00e+00 1.10e-08 -5.7 4.29e-04 - 1.00e+00 1.00e+00h 1
8 -1.4142136e+00 0.00e+00 1.70e-12 -8.6 5.26e-06 - 1.00e+00 1.00e+00h 1
Number of Iterations....: 8
(scaled) (unscaled)
Objective...............: -1.4142135669370588e+00 -1.4142135669370588e+00
Dual infeasibility......: 1.6973089600469393e-12 1.6973089600469393e-12
Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00
Complementarity.........: 2.5083142310387366e-09 2.5083142310387366e-09
Overall NLP error.......: 2.5083142310387366e-09 2.5083142310387366e-09
Number of objective function evaluations = 9
Number of objective gradient evaluations = 9
Number of equality constraint evaluations = 0
Number of inequality constraint evaluations = 9
Number of equality constraint Jacobian evaluations = 0
Number of inequality constraint Jacobian evaluations = 9
Number of Lagrangian Hessian evaluations = 8
Total CPU secs in IPOPT (w/o function evaluations) = 0.002
Total CPU secs in NLP function evaluations = 0.000
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.: 2
Number of nonzeros in Lagrangian Hessian.............: 1
Total number of variables............................: 1
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...............: 1
inequality constraints with only lower bounds: 0
inequality constraints with lower and upper bounds: 0
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 0.00e+00 1.00e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 -5.0000000e-01 0.00e+00 9.50e-01 -1.0 5.00e-01 - 1.00e+00 1.00e+00f 1
2 -2.4190404e+00 3.85e+00 5.66e-01 -1.7 8.12e+00 - 1.00e+00 2.44e-01f 1
3 -1.6039641e+00 5.73e-01 2.40e-01 -1.7 8.15e-01 - 1.00e+00 1.00e+00h 1
4 -1.4115695e+00 0.00e+00 3.97e-02 -1.7 1.92e-01 - 1.00e+00 1.00e+00h 1
5 -1.4119185e+00 0.00e+00 9.76e-06 -2.5 3.80e-02 - 1.00e+00 1.00e+00h 1
6 -1.4140615e+00 0.00e+00 2.32e-06 -3.8 6.05e-03 - 1.00e+00 1.00e+00f 1
7 -1.4142117e+00 0.00e+00 1.10e-08 -5.7 4.29e-04 - 1.00e+00 1.00e+00h 1
8 -1.4142136e+00 0.00e+00 1.70e-12 -8.6 5.26e-06 - 1.00e+00 1.00e+00h 1
Number of Iterations....: 8
(scaled) (unscaled)
Objective...............: -1.4142135669370588e+00 -1.4142135669370588e+00
Dual infeasibility......: 1.6973089600469393e-12 1.6973089600469393e-12
Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00
Complementarity.........: 2.5083142310387366e-09 2.5083142310387366e-09
Overall NLP error.......: 2.5083142310387366e-09 2.5083142310387366e-09
Number of objective function evaluations = 9
Number of objective gradient evaluations = 9
Number of equality constraint evaluations = 0
Number of inequality constraint evaluations = 9
Number of equality constraint Jacobian evaluations = 0
Number of inequality constraint Jacobian evaluations = 9
Number of Lagrangian Hessian evaluations = 8
Total CPU secs in IPOPT (w/o function evaluations) = 0.004
Total CPU secs in NLP function evaluations = 0.000
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...: 4
Number of nonzeros in inequality constraint Jacobian.: 4
Number of nonzeros in Lagrangian Hessian.............: 10
Total number of variables............................: 4
variables with only lower bounds: 0
variables with lower and upper bounds: 4
variables with only upper bounds: 0
Total number of equality constraints.................: 1
Total number of inequality constraints...............: 1
inequality constraints with only lower bounds: 1
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 5.9714928e+01 3.48e+01 2.58e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1r 5.9714928e+01 3.48e+01 9.99e+02 1.5 0.00e+00 - 0.00e+00 0.00e+00R 1
Number of Iterations....: 1
(scaled) (unscaled)
Objective...............: 1.8095432878019967e+01 5.9714928497465891e+01
Dual infeasibility......: 1.7946182115358788e+01 5.9222400980683993e+01
Constraint violation....: 3.4824901449944008e+01 3.4824901449944008e+01
Complementarity.........: 3.9900000599999998e+00 1.3167000197999998e+01
Overall NLP error.......: 3.4824901449944008e+01 5.9222400980683993e+01
Number of objective function evaluations = 2
Number of objective gradient evaluations = 2
Number of equality constraint evaluations = 2
Number of inequality constraint evaluations = 2
Number of equality constraint Jacobian evaluations = 2
Number of inequality constraint Jacobian evaluations = 2
Number of Lagrangian Hessian evaluations = 1
Total CPU secs in IPOPT (w/o function evaluations) = 0.002
Total CPU secs in NLP function evaluations = 0.000
EXIT: Maximum Number of Iterations Exceeded.
Test Summary: | Pass Total
MathProgBase | 53 53
Test Summary: | Pass Total
MathOptInterface | 672 672
Testing Ipopt tests passed