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 5 minutes, 57 seconds.
Click here to download the log file.
Click here to show the log contents.
Resolving package versions...
Installed Missings ──────────────────── v0.4.3
Installed DataAPI ───────────────────── v1.1.0
Installed URIParser ─────────────────── v0.4.0
Installed OpSel ─────────────────────── v0.1.0
Installed TableTraits ───────────────── v1.0.0
Installed CommonSubexpressions ──────── v0.2.0
Installed BinaryProvider ────────────── v0.5.8
Installed DataFrames ────────────────── v0.19.4
Installed InvertedIndices ───────────── v1.0.0
Installed DataValueInterfaces ───────── v1.0.0
Installed PooledArrays ──────────────── v0.5.2
Installed Reexport ──────────────────── v0.2.0
Installed Compat ────────────────────── v2.2.0
Installed ForwardDiff ───────────────── v0.10.7
Installed MathProgBase ──────────────── v0.7.7
Installed OrderedCollections ────────── v1.1.0
Installed Calculus ──────────────────── v0.5.1
Installed Tables ────────────────────── v0.2.11
Installed DataStructures ────────────── v0.17.6
Installed DiffRules ─────────────────── v0.1.0
Installed Parsers ───────────────────── v0.3.10
Installed JSON ──────────────────────── v0.21.0
Installed NaNMath ───────────────────── v0.3.3
Installed JuMP ──────────────────────── v0.20.1
Installed StaticArrays ──────────────── v0.12.1
Installed DiffResults ───────────────── v0.0.4
Installed BenchmarkTools ────────────── v0.4.3
Installed MathOptInterface ──────────── v0.9.7
Installed CategoricalArrays ─────────── v0.7.3
Installed SortingAlgorithms ─────────── v0.3.1
Installed SpecialFunctions ──────────── v0.8.0
Installed BinDeps ───────────────────── v0.8.10
Installed IteratorInterfaceExtensions ─ v1.0.0
Installed Ipopt ─────────────────────── v0.6.1
Updating `~/.julia/environments/v1.2/Project.toml`
[099ba0d8] + OpSel v0.1.0
Updating `~/.julia/environments/v1.2/Manifest.toml`
[6e4b80f9] + BenchmarkTools v0.4.3
[9e28174c] + BinDeps v0.8.10
[b99e7846] + BinaryProvider v0.5.8
[49dc2e85] + Calculus v0.5.1
[324d7699] + CategoricalArrays v0.7.3
[bbf7d656] + CommonSubexpressions v0.2.0
[34da2185] + Compat v2.2.0
[9a962f9c] + DataAPI v1.1.0
[a93c6f00] + DataFrames v0.19.4
[864edb3b] + DataStructures v0.17.6
[e2d170a0] + DataValueInterfaces v1.0.0
[163ba53b] + DiffResults v0.0.4
[b552c78f] + DiffRules v0.1.0
[f6369f11] + ForwardDiff v0.10.7
[41ab1584] + InvertedIndices v1.0.0
[b6b21f68] + Ipopt v0.6.1
[82899510] + IteratorInterfaceExtensions v1.0.0
[682c06a0] + JSON v0.21.0
[4076af6c] + JuMP v0.20.1
[b8f27783] + MathOptInterface v0.9.7
[fdba3010] + MathProgBase v0.7.7
[e1d29d7a] + Missings v0.4.3
[77ba4419] + NaNMath v0.3.3
[099ba0d8] + OpSel v0.1.0
[bac558e1] + OrderedCollections v1.1.0
[69de0a69] + Parsers v0.3.10
[2dfb63ee] + PooledArrays v0.5.2
[189a3867] + Reexport v0.2.0
[a2af1166] + SortingAlgorithms v0.3.1
[276daf66] + SpecialFunctions v0.8.0
[90137ffa] + StaticArrays v0.12.1
[3783bdb8] + TableTraits v1.0.0
[bd369af6] + Tables v0.2.11
[30578b45] + URIParser v0.4.0
[2a0f44e3] + Base64
[ade2ca70] + Dates
[8bb1440f] + DelimitedFiles
[8ba89e20] + Distributed
[9fa8497b] + Future
[b77e0a4c] + InteractiveUtils
[76f85450] + LibGit2
[8f399da3] + Libdl
[37e2e46d] + LinearAlgebra
[56ddb016] + Logging
[d6f4376e] + Markdown
[a63ad114] + Mmap
[44cfe95a] + Pkg
[de0858da] + Printf
[3fa0cd96] + REPL
[9a3f8284] + Random
[ea8e919c] + SHA
[9e88b42a] + Serialization
[1a1011a3] + SharedArrays
[6462fe0b] + Sockets
[2f01184e] + SparseArrays
[10745b16] + Statistics
[8dfed614] + Test
[cf7118a7] + UUIDs
[4ec0a83e] + Unicode
Building SpecialFunctions → `~/.julia/packages/SpecialFunctions/ne2iw/deps/build.log`
Building Ipopt ───────────→ `~/.julia/packages/Ipopt/ruIXY/deps/build.log`
Testing OpSel
Resolving package versions...
Status `/tmp/jl_d82Gpq/Manifest.toml`
[6e4b80f9] BenchmarkTools v0.4.3
[9e28174c] BinDeps v0.8.10
[b99e7846] BinaryProvider v0.5.8
[49dc2e85] Calculus v0.5.1
[324d7699] CategoricalArrays v0.7.3
[bbf7d656] CommonSubexpressions v0.2.0
[34da2185] Compat v2.2.0
[9a962f9c] DataAPI v1.1.0
[a93c6f00] DataFrames v0.19.4
[864edb3b] DataStructures v0.17.6
[e2d170a0] DataValueInterfaces v1.0.0
[163ba53b] DiffResults v0.0.4
[b552c78f] DiffRules v0.1.0
[f6369f11] ForwardDiff v0.10.7
[41ab1584] InvertedIndices v1.0.0
[b6b21f68] Ipopt v0.6.1
[82899510] IteratorInterfaceExtensions v1.0.0
[682c06a0] JSON v0.21.0
[4076af6c] JuMP v0.20.1
[b8f27783] MathOptInterface v0.9.7
[fdba3010] MathProgBase v0.7.7
[e1d29d7a] Missings v0.4.3
[77ba4419] NaNMath v0.3.3
[099ba0d8] OpSel v0.1.0
[bac558e1] OrderedCollections v1.1.0
[69de0a69] Parsers v0.3.10
[2dfb63ee] PooledArrays v0.5.2
[189a3867] Reexport v0.2.0
[a2af1166] SortingAlgorithms v0.3.1
[276daf66] SpecialFunctions v0.8.0
[90137ffa] StaticArrays v0.12.1
[3783bdb8] TableTraits v1.0.0
[bd369af6] Tables v0.2.11
[30578b45] URIParser v0.4.0
[2a0f44e3] Base64 [`@stdlib/Base64`]
[ade2ca70] Dates [`@stdlib/Dates`]
[8bb1440f] DelimitedFiles [`@stdlib/DelimitedFiles`]
[8ba89e20] Distributed [`@stdlib/Distributed`]
[9fa8497b] Future [`@stdlib/Future`]
[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`]
Z = 2045, N_s = 14, N = 2800, theta = 0.03571428571428571
******************************************************************************
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...: 2045
Number of nonzeros in inequality constraint Jacobian.: 30081
Number of nonzeros in Lagrangian Hessian.............: 6036
Total number of variables............................: 2045
variables with only lower bounds: 0
variables with lower and upper bounds: 0
variables with only upper bounds: 0
Total number of equality constraints.................: 1
Total number of inequality constraints...............: 4091
inequality constraints with only lower bounds: 0
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 4091
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 -0.0000000e+00 1.00e+00 2.90e-01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 -2.0245767e+02 6.17e-01 2.18e+00 -1.7 1.57e-01 - 1.00e+00 3.83e-01h 1
2 -2.5345910e+02 2.65e-01 3.99e+00 -1.7 9.93e-02 - 1.00e+00 5.71e-01h 1
3 -3.0977733e+02 8.80e-02 5.93e+00 -1.7 3.12e-02 - 1.00e+00 6.67e-01h 1
4 -3.2160359e+02 2.48e-02 9.39e+00 -1.7 1.77e-02 - 1.00e+00 7.18e-01h 1
5 -3.2948097e+02 1.42e-02 6.76e+01 -1.7 6.57e-03 - 1.00e+00 4.27e-01h 1
6 -3.3041401e+02 4.43e-03 6.19e+01 -1.7 1.71e-03 - 1.00e+00 6.88e-01h 1
7 -3.3201918e+02 2.09e-03 2.58e+02 -1.7 1.36e-03 - 1.00e+00 5.29e-01h 1
8 -3.3206985e+02 8.00e-04 4.58e+02 -1.7 2.44e-04 - 1.00e+00 6.16e-01h 1
9 -3.3237163e+02 3.42e-04 1.27e+03 -1.7 2.42e-04 - 1.00e+00 5.73e-01h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10 -3.3237492e+02 1.39e-04 2.88e+03 -1.7 3.76e-05 - 1.00e+00 5.92e-01h 1
11 -3.3242817e+02 5.76e-05 7.08e+03 -1.7 4.19e-05 - 1.00e+00 5.86e-01h 1
12 -3.3242833e+02 4.06e-05 2.87e+04 -1.7 6.23e-06 - 1.00e+00 2.96e-01f 2
13 -3.3243597e+02 7.40e-06 1.38e+04 -1.7 7.07e-06 - 1.00e+00 8.18e-01h 1
14 -3.3243743e+02 5.55e-06 1.81e+05 -1.7 2.53e-06 - 1.00e+00 2.49e-01f 2
15 -3.3243957e+02 2.53e-07 2.00e+04 -1.7 1.26e-06 - 1.00e+00 9.54e-01h 1
16 -3.3243945e+02 1.73e-07 8.12e+05 -1.7 1.37e-07 - 1.00e+00 3.19e-01f 2
17 -3.3243949e+02 6.49e-13 2.30e-06 -1.7 3.23e-08 - 1.00e+00 1.00e+00h 1
18 -3.3255390e+02 7.91e-13 2.38e+04 -5.7 2.39e-04 - 9.88e-01 1.00e+00f 1
19 -3.3772965e+02 7.46e-13 2.37e+04 -5.7 3.02e-01 - 1.84e-03 5.75e-02f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
20 -3.5002135e+02 1.29e-03 2.12e+04 -5.7 4.57e-02 - 1.06e-01 5.89e-01f 1
21 -3.5716425e+02 1.19e-03 1.87e+04 -5.7 4.86e-02 - 1.18e-01 2.85e-01h 1
22 -3.6074876e+02 1.18e-03 1.53e+04 -5.7 1.01e-01 - 1.81e-01 1.09e-01h 1
23 -3.6534792e+02 1.14e-03 1.16e+04 -5.7 8.38e-02 - 2.46e-01 1.58e-01h 1
24 -3.7410262e+02 1.23e-03 1.10e+04 -5.7 6.31e-02 - 4.91e-02 2.37e-01f 1
25 -3.7960064e+02 1.22e-03 9.90e+03 -5.7 6.21e-02 - 9.84e-02 1.41e-01h 1
26 -3.8630974e+02 1.33e-03 8.07e+03 -5.7 7.35e-02 - 1.85e-01 1.93e-01h 1
27 -3.9364995e+02 1.33e-03 6.80e+03 -5.7 5.47e-02 - 1.58e-01 2.44e-01h 1
28 -4.0413809e+02 1.51e-03 5.95e+03 -5.7 3.67e-02 - 1.26e-01 3.20e-01f 1
29 -4.0770429e+02 1.36e-03 4.64e+03 -5.7 2.37e-02 - 2.20e-01 1.48e-01h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
30 -4.1274713e+02 1.23e-03 3.46e+03 -5.7 2.62e-02 - 2.54e-01 2.14e-01f 1
31 -4.1980970e+02 1.11e-03 2.88e+03 -5.7 1.99e-02 - 1.68e-01 3.37e-01f 1
32 -4.2426380e+02 9.13e-04 2.20e+03 -5.7 1.61e-02 - 2.36e-01 2.98e-01f 1
33 -4.2912260e+02 6.94e-04 1.46e+03 -5.7 1.45e-02 - 3.37e-01 4.20e-01f 1
34 -4.3303730e+02 4.52e-04 8.78e+02 -5.7 9.20e-03 - 3.97e-01 5.24e-01f 1
35 -4.3567823e+02 2.23e-04 6.14e+02 -5.7 5.83e-03 - 3.01e-01 6.68e-01f 1
36 -4.3714565e+02 3.65e-05 1.08e+02 -5.7 5.19e-03 - 8.25e-01 1.00e+00f 1
37 -4.3721427e+02 4.44e-16 2.60e-06 -5.7 8.36e-04 - 1.00e+00 1.00e+00h 1
38 -4.3871316e+02 1.82e-05 4.09e+00 -8.6 2.51e-03 - 7.76e-01 7.97e-01f 1
39 -4.3910600e+02 2.70e-06 2.24e+00 -8.6 7.16e-04 - 9.28e-01 9.79e-01h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
40 -4.3911615e+02 5.37e-08 6.72e-02 -8.6 1.23e-04 - 9.78e-01 1.00e+00f 1
41 -4.3911628e+02 3.33e-16 4.88e-09 -8.6 3.03e-05 - 1.00e+00 1.00e+00h 1
Number of Iterations....: 41
(scaled) (unscaled)
Objective...............: -8.2384635286027919e-01 -4.3911628492217517e+02
Dual infeasibility......: 4.8805531838169713e-09 2.6013714511233238e-06
Constraint violation....: 3.3306690738754696e-16 3.3306690738754696e-16
Complementarity.........: 4.4684712318714910e-09 2.3817286801217435e-06
Overall NLP error.......: 4.8805531838169713e-09 2.6013714511233238e-06
Number of objective function evaluations = 45
Number of objective gradient evaluations = 42
Number of equality constraint evaluations = 45
Number of inequality constraint evaluations = 45
Number of equality constraint Jacobian evaluations = 42
Number of inequality constraint Jacobian evaluations = 42
Number of Lagrangian Hessian evaluations = 41
Total CPU secs in IPOPT (w/o function evaluations) = 7.009
Total CPU secs in NLP function evaluations = 1.663
EXIT: Optimal Solution Found.
=== Result Summary ===
JuMP status = LOCALLY_SOLVED
Z = 2045, N_s = 14, N = 2800
gx = 439.116285, xAx = 0.071429, 2theta = 0.071429
time(s): build = 5.261, solver = 38.072, total = 43.333
Z = 200, N = 50, theta = 0.016714999999999997
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...: 200
Number of nonzeros in inequality constraint Jacobian.: 2700
Number of nonzeros in Lagrangian Hessian.............: 550
Total number of variables............................: 200
variables with only lower bounds: 0
variables with lower and upper bounds: 0
variables with only upper bounds: 0
Total number of equality constraints.................: 1
Total number of inequality constraints...............: 401
inequality constraints with only lower bounds: 0
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 401
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 -0.0000000e+00 1.00e+00 6.15e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 -1.3922826e+01 8.72e-01 1.26e+01 -1.0 1.37e-01 - 1.00e+00 1.28e-01h 1
2 -1.5800200e+01 2.19e-01 6.27e+00 -1.0 2.99e-02 - 1.00e+00 7.49e-01h 1
3 -2.1296514e+01 1.41e-01 5.53e+01 -1.0 2.05e-02 - 1.00e+00 3.54e-01h 1
4 -2.1630297e+01 3.58e-02 3.17e+01 -1.0 1.16e-02 - 1.00e+00 7.47e-01h 1
5 -2.2578297e+01 1.65e-02 1.51e+02 -1.0 3.86e-03 - 1.00e+00 5.39e-01h 1
6 -2.2539676e+01 6.45e-03 2.92e+02 -1.0 1.53e-03 - 1.00e+00 6.09e-01h 1
7 -2.2715205e+01 2.73e-03 7.87e+02 -1.0 7.11e-04 - 1.00e+00 5.76e-01h 1
8 -2.2707021e+01 1.12e-03 1.82e+03 -1.0 2.55e-04 - 1.00e+00 5.90e-01h 1
9 -2.2737663e+01 4.66e-04 4.46e+03 -1.0 1.24e-04 - 1.00e+00 5.84e-01h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10 -2.2736206e+01 1.92e-04 1.07e+04 -1.0 4.35e-05 - 1.00e+00 5.87e-01h 1
11 -2.2741487e+01 7.93e-05 2.57e+04 -1.0 2.13e-05 - 1.00e+00 5.87e-01h 1
12 -2.2741358e+01 5.59e-05 1.05e+05 -1.0 7.41e-06 - 1.00e+00 2.95e-01f 2
13 -2.2741926e+01 1.04e-05 5.16e+04 -1.0 5.55e-06 - 1.00e+00 8.14e-01h 1
14 -2.2742073e+01 7.85e-06 6.75e+05 -1.0 1.19e-06 - 1.00e+00 2.46e-01f 2
15 -2.2742265e+01 6.22e-07 1.32e+05 -1.0 8.16e-07 - 1.00e+00 9.21e-01h 1
16 -2.2742253e+01 4.43e-07 3.51e+06 -1.0 5.40e-08 - 1.00e+00 2.87e-01f 2
17 -2.2742260e+01 0.00e+00 1.00e-06 -1.0 4.46e-08 - 1.00e+00 1.00e+00h 1
18 -2.3469414e+01 2.22e-16 1.95e+06 -8.6 6.56e-03 - 7.85e-01 1.00e+00f 1
19 -2.5836304e+01 1.33e-03 9.43e+05 -8.6 2.97e-02 - 5.16e-01 8.15e-01f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
20 -2.6222452e+01 3.80e-03 3.59e+05 -8.6 1.71e-02 - 6.19e-01 2.48e-01f 1
21 -2.6342694e+01 2.87e-03 2.67e+05 -8.6 3.19e-02 - 2.57e-01 4.50e-01f 1
In iteration 21, 1 Slack too small, adjusting variable bound
22 -2.6298556e+01 2.00e-03 1.54e+05 -8.6 1.89e-02 - 4.25e-01 3.43e-01h 1
23 -2.6217699e+01 7.49e-04 9.09e+04 -8.6 1.10e-02 - 4.08e-01 8.62e-01h 1
24 -2.6145201e+01 8.64e-05 6.55e+04 -8.6 3.75e-03 - 2.79e-01 1.00e+00h 1
25 -2.6145461e+01 9.82e-06 1.93e+04 -8.6 1.52e-03 - 7.06e-01 1.00e+00h 1
26 -2.6153037e+01 5.68e-06 1.68e+04 -8.6 1.12e-03 - 1.31e-01 1.00e+00h 1
27 -2.6154383e+01 9.32e-07 1.57e+03 -8.6 5.09e-04 - 9.06e-01 1.00e+00h 1
28 -2.6155464e+01 6.07e-07 8.85e+01 -8.6 3.38e-04 - 9.44e-01 1.00e+00h 1
29 -2.6155598e+01 9.82e-08 7.77e+00 -8.6 1.32e-04 - 9.12e-01 1.00e+00h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
30 -2.6155621e+01 9.41e-09 2.27e+00 -8.6 7.26e-05 - 6.26e-01 1.00e+00h 1
31 -2.6155625e+01 9.75e-10 1.70e-03 -8.6 3.48e-05 - 9.97e-01 1.00e+00h 1
32 -2.6155625e+01 4.37e-10 1.68e-07 -8.6 2.54e-05 - 1.00e+00 1.00e+00h 1
33 -2.6155625e+01 8.48e-11 3.89e-08 -8.6 1.25e-05 - 1.00e+00 1.00e+00h 1
34 -2.6155625e+01 0.00e+00 8.13e-09 -8.6 5.73e-06 - 1.00e+00 1.00e+00h 1
Number of Iterations....: 34
(scaled) (unscaled)
Objective...............: -1.3847747204547463e+01 -2.6155624919949247e+01
Dual infeasibility......: 8.1319591060946550e-09 1.5359644359591584e-08
Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00
Complementarity.........: 6.9540333528768238e-09 1.3134778196913745e-08
Overall NLP error.......: 8.1319591060946550e-09 1.5359644359591584e-08
Number of objective function evaluations = 38
Number of objective gradient evaluations = 35
Number of equality constraint evaluations = 38
Number of inequality constraint evaluations = 38
Number of equality constraint Jacobian evaluations = 35
Number of inequality constraint Jacobian evaluations = 35
Number of Lagrangian Hessian evaluations = 34
Total CPU secs in IPOPT (w/o function evaluations) = 0.121
Total CPU secs in NLP function evaluations = 0.004
EXIT: Optimal Solution Found.
=== SOCP Result Summary ===
JuMP status = LOCALLY_SOLVED
sum(x_socp) = 0.999996, gx = 26.155540, xAx = 0.033430, 2theta = 0.033430
======= Before swap c_obj = -41.483965
iter2 = 1, c_obj = -29.510364, gx = 27.044800, xAx = 0.041800, best_f = 63, best_v = 121
iter2 = 2, c_obj = -20.269719, gx = 26.825800, xAx = 0.040400, best_f = 71, best_v = 78
iter2 = 3, c_obj = -11.162274, gx = 26.473600, xAx = 0.039000, best_f = 57, best_v = 195
iter2 = 4, c_obj = -3.258806, gx = 26.268800, xAx = 0.037800, best_f = 93, best_v = 150
iter2 = 5, c_obj = 3.269683, gx = 26.040400, xAx = 0.036800, best_f = 88, best_v = 129
iter2 = 6, c_obj = 8.527194, gx = 25.892400, xAx = 0.036000, best_f = 55, best_v = 143
iter2 = 7, c_obj = 13.723706, gx = 25.683400, xAx = 0.035200, best_f = 169, best_v = 128
iter2 = 8, c_obj = 18.852217, gx = 25.406400, xAx = 0.034400, best_f = 70, best_v = 105
iter2 = 9, c_obj = 23.962729, gx = 25.111400, xAx = 0.033600, best_f = 58, best_v = 171
iter2 = 10, c_obj = 25.066400, gx = 25.066400, xAx = 0.033400, best_f = 92, best_v = 66
iter2 = 11, c_obj = 25.072600, gx = 25.072600, xAx = 0.033400, best_f = 139, best_v = 115
iter2 = 12, c_obj = 25.090400, gx = 25.090400, xAx = 0.033400, best_f = 109, best_v = 63
No swap c_obj = 25.090400, gx = 25.090400, xAx = 0.033400
Finished ... iter2 = 13, before_cobj = -41.483965, after_cobj = 25.090400
sum(x_sa) = 1.000000, gx = 25.090400, xAx = 0.033400, 2theta = 0.033430
SOCP = 26.155540, STEEP = 25.090400, gap = 4.072330%
time(s): build = 1.605, solver = 0.172, steep = 7.340, total = 9.117
Test Summary: |
OpSel.jl | No tests
Testing OpSel tests passed
Results with Julia v1.3.0
Testing was successful .
Last evaluation was ago and took 6 minutes, 54 seconds.
Click here to download the log file.
Click here to show the log contents.
Resolving package versions...
Installed SortingAlgorithms ─────────── v0.3.1
Installed OpSel ─────────────────────── v0.1.0
Installed DiffResults ───────────────── v0.0.4
Installed Ipopt ─────────────────────── v0.6.1
Installed DataStructures ────────────── v0.17.6
Installed StaticArrays ──────────────── v0.12.1
Installed BinaryProvider ────────────── v0.5.8
Installed CategoricalArrays ─────────── v0.7.3
Installed Parsers ───────────────────── v0.3.10
Installed Missings ──────────────────── v0.4.3
Installed TableTraits ───────────────── v1.0.0
Installed Compat ────────────────────── v2.2.0
Installed InvertedIndices ───────────── v1.0.0
Installed OrderedCollections ────────── v1.1.0
Installed SpecialFunctions ──────────── v0.9.0
Installed DataAPI ───────────────────── v1.1.0
Installed JSON ──────────────────────── v0.21.0
Installed CommonSubexpressions ──────── v0.2.0
Installed JuMP ──────────────────────── v0.20.1
Installed Tables ────────────────────── v0.2.11
Installed MathOptInterface ──────────── v0.9.7
Installed NaNMath ───────────────────── v0.3.3
Installed ForwardDiff ───────────────── v0.10.7
Installed DataValueInterfaces ───────── v1.0.0
Installed OpenSpecFun_jll ───────────── v0.5.3+1
Installed DiffRules ─────────────────── v0.1.0
Installed MathProgBase ──────────────── v0.7.7
Installed IteratorInterfaceExtensions ─ v1.0.0
Installed Calculus ──────────────────── v0.5.1
Installed PooledArrays ──────────────── v0.5.2
Installed DataFrames ────────────────── v0.19.4
Installed Reexport ──────────────────── v0.2.0
Installed BenchmarkTools ────────────── v0.4.3
Updating `~/.julia/environments/v1.3/Project.toml`
[099ba0d8] + OpSel v0.1.0
Updating `~/.julia/environments/v1.3/Manifest.toml`
[6e4b80f9] + BenchmarkTools v0.4.3
[b99e7846] + BinaryProvider v0.5.8
[49dc2e85] + Calculus v0.5.1
[324d7699] + CategoricalArrays v0.7.3
[bbf7d656] + CommonSubexpressions v0.2.0
[34da2185] + Compat v2.2.0
[9a962f9c] + DataAPI v1.1.0
[a93c6f00] + DataFrames v0.19.4
[864edb3b] + DataStructures v0.17.6
[e2d170a0] + DataValueInterfaces v1.0.0
[163ba53b] + DiffResults v0.0.4
[b552c78f] + DiffRules v0.1.0
[f6369f11] + ForwardDiff v0.10.7
[41ab1584] + InvertedIndices v1.0.0
[b6b21f68] + Ipopt v0.6.1
[82899510] + IteratorInterfaceExtensions v1.0.0
[682c06a0] + JSON v0.21.0
[4076af6c] + JuMP v0.20.1
[b8f27783] + MathOptInterface v0.9.7
[fdba3010] + MathProgBase v0.7.7
[e1d29d7a] + Missings v0.4.3
[77ba4419] + NaNMath v0.3.3
[099ba0d8] + OpSel v0.1.0
[efe28fd5] + OpenSpecFun_jll v0.5.3+1
[bac558e1] + OrderedCollections v1.1.0
[69de0a69] + Parsers v0.3.10
[2dfb63ee] + PooledArrays v0.5.2
[189a3867] + Reexport v0.2.0
[a2af1166] + SortingAlgorithms v0.3.1
[276daf66] + SpecialFunctions v0.9.0
[90137ffa] + StaticArrays v0.12.1
[3783bdb8] + TableTraits v1.0.0
[bd369af6] + Tables v0.2.11
[2a0f44e3] + Base64
[ade2ca70] + Dates
[8bb1440f] + DelimitedFiles
[8ba89e20] + Distributed
[9fa8497b] + Future
[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 OpSel
Resolving package versions...
Status `/tmp/jl_izBXoK/Manifest.toml`
[6e4b80f9] BenchmarkTools v0.4.3
[b99e7846] BinaryProvider v0.5.8
[49dc2e85] Calculus v0.5.1
[324d7699] CategoricalArrays v0.7.3
[bbf7d656] CommonSubexpressions v0.2.0
[34da2185] Compat v2.2.0
[9a962f9c] DataAPI v1.1.0
[a93c6f00] DataFrames v0.19.4
[864edb3b] DataStructures v0.17.6
[e2d170a0] DataValueInterfaces v1.0.0
[163ba53b] DiffResults v0.0.4
[b552c78f] DiffRules v0.1.0
[f6369f11] ForwardDiff v0.10.7
[41ab1584] InvertedIndices v1.0.0
[b6b21f68] Ipopt v0.6.1
[82899510] IteratorInterfaceExtensions v1.0.0
[682c06a0] JSON v0.21.0
[4076af6c] JuMP v0.20.1
[b8f27783] MathOptInterface v0.9.7
[fdba3010] MathProgBase v0.7.7
[e1d29d7a] Missings v0.4.3
[77ba4419] NaNMath v0.3.3
[099ba0d8] OpSel v0.1.0
[efe28fd5] OpenSpecFun_jll v0.5.3+1
[bac558e1] OrderedCollections v1.1.0
[69de0a69] Parsers v0.3.10
[2dfb63ee] PooledArrays v0.5.2
[189a3867] Reexport v0.2.0
[a2af1166] SortingAlgorithms v0.3.1
[276daf66] SpecialFunctions v0.9.0
[90137ffa] StaticArrays v0.12.1
[3783bdb8] TableTraits v1.0.0
[bd369af6] Tables v0.2.11
[2a0f44e3] Base64 [`@stdlib/Base64`]
[ade2ca70] Dates [`@stdlib/Dates`]
[8bb1440f] DelimitedFiles [`@stdlib/DelimitedFiles`]
[8ba89e20] Distributed [`@stdlib/Distributed`]
[9fa8497b] Future [`@stdlib/Future`]
[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`]
Z = 2045, N_s = 14, N = 2800, theta = 0.03571428571428571
******************************************************************************
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...: 2045
Number of nonzeros in inequality constraint Jacobian.: 30081
Number of nonzeros in Lagrangian Hessian.............: 6036
Total number of variables............................: 2045
variables with only lower bounds: 0
variables with lower and upper bounds: 0
variables with only upper bounds: 0
Total number of equality constraints.................: 1
Total number of inequality constraints...............: 4091
inequality constraints with only lower bounds: 0
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 4091
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 -0.0000000e+00 1.00e+00 2.90e-01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 -2.0245767e+02 6.17e-01 2.18e+00 -1.7 1.57e-01 - 1.00e+00 3.83e-01h 1
2 -2.5345910e+02 2.65e-01 3.99e+00 -1.7 9.93e-02 - 1.00e+00 5.71e-01h 1
3 -3.0977733e+02 8.80e-02 5.93e+00 -1.7 3.12e-02 - 1.00e+00 6.67e-01h 1
4 -3.2160359e+02 2.48e-02 9.39e+00 -1.7 1.77e-02 - 1.00e+00 7.18e-01h 1
5 -3.2948097e+02 1.42e-02 6.76e+01 -1.7 6.57e-03 - 1.00e+00 4.27e-01h 1
6 -3.3041401e+02 4.43e-03 6.19e+01 -1.7 1.71e-03 - 1.00e+00 6.88e-01h 1
7 -3.3201918e+02 2.09e-03 2.58e+02 -1.7 1.36e-03 - 1.00e+00 5.29e-01h 1
8 -3.3206985e+02 8.00e-04 4.58e+02 -1.7 2.44e-04 - 1.00e+00 6.16e-01h 1
9 -3.3237163e+02 3.42e-04 1.27e+03 -1.7 2.42e-04 - 1.00e+00 5.73e-01h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10 -3.3237492e+02 1.39e-04 2.88e+03 -1.7 3.76e-05 - 1.00e+00 5.92e-01h 1
11 -3.3242817e+02 5.76e-05 7.08e+03 -1.7 4.19e-05 - 1.00e+00 5.86e-01h 1
12 -3.3242833e+02 4.06e-05 2.87e+04 -1.7 6.23e-06 - 1.00e+00 2.96e-01f 2
13 -3.3243597e+02 7.40e-06 1.38e+04 -1.7 7.07e-06 - 1.00e+00 8.18e-01h 1
14 -3.3243743e+02 5.55e-06 1.81e+05 -1.7 2.53e-06 - 1.00e+00 2.49e-01f 2
15 -3.3243957e+02 2.53e-07 2.00e+04 -1.7 1.26e-06 - 1.00e+00 9.54e-01h 1
16 -3.3243945e+02 1.73e-07 8.12e+05 -1.7 1.37e-07 - 1.00e+00 3.19e-01f 2
17 -3.3243949e+02 6.49e-13 2.30e-06 -1.7 3.23e-08 - 1.00e+00 1.00e+00h 1
18 -3.3255390e+02 7.91e-13 2.38e+04 -5.7 2.39e-04 - 9.88e-01 1.00e+00f 1
19 -3.3772965e+02 7.46e-13 2.37e+04 -5.7 3.02e-01 - 1.84e-03 5.75e-02f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
20 -3.5002135e+02 1.29e-03 2.12e+04 -5.7 4.57e-02 - 1.06e-01 5.89e-01f 1
21 -3.5716425e+02 1.19e-03 1.87e+04 -5.7 4.86e-02 - 1.18e-01 2.85e-01h 1
22 -3.6074876e+02 1.18e-03 1.53e+04 -5.7 1.01e-01 - 1.81e-01 1.09e-01h 1
23 -3.6534792e+02 1.14e-03 1.16e+04 -5.7 8.38e-02 - 2.46e-01 1.58e-01h 1
24 -3.7410262e+02 1.23e-03 1.10e+04 -5.7 6.31e-02 - 4.91e-02 2.37e-01f 1
25 -3.7960064e+02 1.22e-03 9.90e+03 -5.7 6.21e-02 - 9.84e-02 1.41e-01h 1
26 -3.8630974e+02 1.33e-03 8.07e+03 -5.7 7.35e-02 - 1.85e-01 1.93e-01h 1
27 -3.9364995e+02 1.33e-03 6.80e+03 -5.7 5.47e-02 - 1.58e-01 2.44e-01h 1
28 -4.0413809e+02 1.51e-03 5.95e+03 -5.7 3.67e-02 - 1.26e-01 3.20e-01f 1
29 -4.0770429e+02 1.36e-03 4.64e+03 -5.7 2.37e-02 - 2.20e-01 1.48e-01h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
30 -4.1274713e+02 1.23e-03 3.46e+03 -5.7 2.62e-02 - 2.54e-01 2.14e-01f 1
31 -4.1980970e+02 1.11e-03 2.88e+03 -5.7 1.99e-02 - 1.68e-01 3.37e-01f 1
32 -4.2426380e+02 9.13e-04 2.20e+03 -5.7 1.61e-02 - 2.36e-01 2.98e-01f 1
33 -4.2912260e+02 6.94e-04 1.46e+03 -5.7 1.45e-02 - 3.37e-01 4.20e-01f 1
34 -4.3303730e+02 4.52e-04 8.78e+02 -5.7 9.20e-03 - 3.97e-01 5.24e-01f 1
35 -4.3567823e+02 2.23e-04 6.14e+02 -5.7 5.83e-03 - 3.01e-01 6.68e-01f 1
36 -4.3714565e+02 3.65e-05 1.08e+02 -5.7 5.19e-03 - 8.25e-01 1.00e+00f 1
37 -4.3721427e+02 4.44e-16 2.60e-06 -5.7 8.36e-04 - 1.00e+00 1.00e+00h 1
38 -4.3871316e+02 1.82e-05 4.09e+00 -8.6 2.51e-03 - 7.76e-01 7.97e-01f 1
39 -4.3910600e+02 2.70e-06 2.24e+00 -8.6 7.16e-04 - 9.28e-01 9.79e-01h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
40 -4.3911615e+02 5.37e-08 6.72e-02 -8.6 1.23e-04 - 9.78e-01 1.00e+00f 1
41 -4.3911628e+02 3.33e-16 4.88e-09 -8.6 3.03e-05 - 1.00e+00 1.00e+00h 1
Number of Iterations....: 41
(scaled) (unscaled)
Objective...............: -8.2384635286027919e-01 -4.3911628492217517e+02
Dual infeasibility......: 4.8805531838169713e-09 2.6013714511233238e-06
Constraint violation....: 3.3306690738754696e-16 3.3306690738754696e-16
Complementarity.........: 4.4684712318714910e-09 2.3817286801217435e-06
Overall NLP error.......: 4.8805531838169713e-09 2.6013714511233238e-06
Number of objective function evaluations = 45
Number of objective gradient evaluations = 42
Number of equality constraint evaluations = 45
Number of inequality constraint evaluations = 45
Number of equality constraint Jacobian evaluations = 42
Number of inequality constraint Jacobian evaluations = 42
Number of Lagrangian Hessian evaluations = 41
Total CPU secs in IPOPT (w/o function evaluations) = 6.681
Total CPU secs in NLP function evaluations = 1.887
EXIT: Optimal Solution Found.
=== Result Summary ===
JuMP status = LOCALLY_SOLVED
Z = 2045, N_s = 14, N = 2800
gx = 439.116285, xAx = 0.071429, 2theta = 0.071429
time(s): build = 5.814, solver = 39.297, total = 45.111
Z = 200, N = 50, theta = 0.016714999999999997
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...: 200
Number of nonzeros in inequality constraint Jacobian.: 2700
Number of nonzeros in Lagrangian Hessian.............: 550
Total number of variables............................: 200
variables with only lower bounds: 0
variables with lower and upper bounds: 0
variables with only upper bounds: 0
Total number of equality constraints.................: 1
Total number of inequality constraints...............: 401
inequality constraints with only lower bounds: 0
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 401
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 -0.0000000e+00 1.00e+00 6.15e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 -1.3922826e+01 8.72e-01 1.26e+01 -1.0 1.37e-01 - 1.00e+00 1.28e-01h 1
2 -1.5800200e+01 2.19e-01 6.27e+00 -1.0 2.99e-02 - 1.00e+00 7.49e-01h 1
3 -2.1296514e+01 1.41e-01 5.53e+01 -1.0 2.05e-02 - 1.00e+00 3.54e-01h 1
4 -2.1630297e+01 3.58e-02 3.17e+01 -1.0 1.16e-02 - 1.00e+00 7.47e-01h 1
5 -2.2578297e+01 1.65e-02 1.51e+02 -1.0 3.86e-03 - 1.00e+00 5.39e-01h 1
6 -2.2539676e+01 6.45e-03 2.92e+02 -1.0 1.53e-03 - 1.00e+00 6.09e-01h 1
7 -2.2715205e+01 2.73e-03 7.87e+02 -1.0 7.11e-04 - 1.00e+00 5.76e-01h 1
8 -2.2707021e+01 1.12e-03 1.82e+03 -1.0 2.55e-04 - 1.00e+00 5.90e-01h 1
9 -2.2737663e+01 4.66e-04 4.46e+03 -1.0 1.24e-04 - 1.00e+00 5.84e-01h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10 -2.2736206e+01 1.92e-04 1.07e+04 -1.0 4.35e-05 - 1.00e+00 5.87e-01h 1
11 -2.2741487e+01 7.93e-05 2.57e+04 -1.0 2.13e-05 - 1.00e+00 5.87e-01h 1
12 -2.2741358e+01 5.59e-05 1.05e+05 -1.0 7.41e-06 - 1.00e+00 2.95e-01f 2
13 -2.2741926e+01 1.04e-05 5.16e+04 -1.0 5.55e-06 - 1.00e+00 8.14e-01h 1
14 -2.2742073e+01 7.85e-06 6.75e+05 -1.0 1.19e-06 - 1.00e+00 2.46e-01f 2
15 -2.2742265e+01 6.22e-07 1.32e+05 -1.0 8.16e-07 - 1.00e+00 9.21e-01h 1
16 -2.2742253e+01 4.43e-07 3.51e+06 -1.0 5.40e-08 - 1.00e+00 2.87e-01f 2
17 -2.2742260e+01 0.00e+00 1.00e-06 -1.0 4.46e-08 - 1.00e+00 1.00e+00h 1
18 -2.3469414e+01 2.22e-16 1.95e+06 -8.6 6.56e-03 - 7.85e-01 1.00e+00f 1
19 -2.5836304e+01 1.33e-03 9.43e+05 -8.6 2.97e-02 - 5.16e-01 8.15e-01f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
20 -2.6222452e+01 3.80e-03 3.59e+05 -8.6 1.71e-02 - 6.19e-01 2.48e-01f 1
21 -2.6342694e+01 2.87e-03 2.67e+05 -8.6 3.19e-02 - 2.57e-01 4.50e-01f 1
In iteration 21, 1 Slack too small, adjusting variable bound
22 -2.6298556e+01 2.00e-03 1.54e+05 -8.6 1.89e-02 - 4.25e-01 3.43e-01h 1
23 -2.6217699e+01 7.49e-04 9.09e+04 -8.6 1.10e-02 - 4.08e-01 8.62e-01h 1
24 -2.6145201e+01 8.64e-05 6.55e+04 -8.6 3.75e-03 - 2.79e-01 1.00e+00h 1
25 -2.6145461e+01 9.82e-06 1.93e+04 -8.6 1.52e-03 - 7.06e-01 1.00e+00h 1
26 -2.6153037e+01 5.68e-06 1.68e+04 -8.6 1.12e-03 - 1.31e-01 1.00e+00h 1
27 -2.6154383e+01 9.32e-07 1.57e+03 -8.6 5.09e-04 - 9.06e-01 1.00e+00h 1
28 -2.6155464e+01 6.07e-07 8.85e+01 -8.6 3.38e-04 - 9.44e-01 1.00e+00h 1
29 -2.6155598e+01 9.82e-08 7.77e+00 -8.6 1.32e-04 - 9.12e-01 1.00e+00h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
30 -2.6155621e+01 9.41e-09 2.27e+00 -8.6 7.26e-05 - 6.26e-01 1.00e+00h 1
31 -2.6155625e+01 9.75e-10 1.70e-03 -8.6 3.48e-05 - 9.97e-01 1.00e+00h 1
32 -2.6155625e+01 4.37e-10 1.68e-07 -8.6 2.54e-05 - 1.00e+00 1.00e+00h 1
33 -2.6155625e+01 8.48e-11 3.89e-08 -8.6 1.25e-05 - 1.00e+00 1.00e+00h 1
34 -2.6155625e+01 0.00e+00 8.13e-09 -8.6 5.73e-06 - 1.00e+00 1.00e+00h 1
Number of Iterations....: 34
(scaled) (unscaled)
Objective...............: -1.3847747204547463e+01 -2.6155624919949247e+01
Dual infeasibility......: 8.1319591060946550e-09 1.5359644359591584e-08
Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00
Complementarity.........: 6.9540333528768238e-09 1.3134778196913745e-08
Overall NLP error.......: 8.1319591060946550e-09 1.5359644359591584e-08
Number of objective function evaluations = 38
Number of objective gradient evaluations = 35
Number of equality constraint evaluations = 38
Number of inequality constraint evaluations = 38
Number of equality constraint Jacobian evaluations = 35
Number of inequality constraint Jacobian evaluations = 35
Number of Lagrangian Hessian evaluations = 34
Total CPU secs in IPOPT (w/o function evaluations) = 0.139
Total CPU secs in NLP function evaluations = 0.005
EXIT: Optimal Solution Found.
=== SOCP Result Summary ===
JuMP status = LOCALLY_SOLVED
sum(x_socp) = 0.999996, gx = 26.155540, xAx = 0.033430, 2theta = 0.033430
======= Before swap c_obj = -41.483965
iter2 = 1, c_obj = -29.510364, gx = 27.044800, xAx = 0.041800, best_f = 63, best_v = 121
iter2 = 2, c_obj = -20.269719, gx = 26.825800, xAx = 0.040400, best_f = 71, best_v = 78
iter2 = 3, c_obj = -11.162274, gx = 26.473600, xAx = 0.039000, best_f = 57, best_v = 195
iter2 = 4, c_obj = -3.258806, gx = 26.268800, xAx = 0.037800, best_f = 93, best_v = 150
iter2 = 5, c_obj = 3.269683, gx = 26.040400, xAx = 0.036800, best_f = 88, best_v = 129
iter2 = 6, c_obj = 8.527194, gx = 25.892400, xAx = 0.036000, best_f = 55, best_v = 143
iter2 = 7, c_obj = 13.723706, gx = 25.683400, xAx = 0.035200, best_f = 169, best_v = 128
iter2 = 8, c_obj = 18.852217, gx = 25.406400, xAx = 0.034400, best_f = 70, best_v = 105
iter2 = 9, c_obj = 23.962729, gx = 25.111400, xAx = 0.033600, best_f = 58, best_v = 171
iter2 = 10, c_obj = 25.066400, gx = 25.066400, xAx = 0.033400, best_f = 92, best_v = 66
iter2 = 11, c_obj = 25.072600, gx = 25.072600, xAx = 0.033400, best_f = 139, best_v = 115
iter2 = 12, c_obj = 25.090400, gx = 25.090400, xAx = 0.033400, best_f = 109, best_v = 63
No swap c_obj = 25.090400, gx = 25.090400, xAx = 0.033400
Finished ... iter2 = 13, before_cobj = -41.483965, after_cobj = 25.090400
sum(x_sa) = 1.000000, gx = 25.090400, xAx = 0.033400, 2theta = 0.033430
SOCP = 26.155540, STEEP = 25.090400, gap = 4.072330%
time(s): build = 1.389, solver = 0.133, steep = 4.439, total = 5.960
Test Summary: |
OpSel.jl | No tests
Testing OpSel tests passed
Results with Julia v1.3.1-pre-7704df0a5a
Testing was successful .
Last evaluation was ago and took 6 minutes, 2 seconds.
Click here to download the log file.
Click here to show the log contents.
Resolving package versions...
Installed NaNMath ───────────────────── v0.3.3
Installed OpenSpecFun_jll ───────────── v0.5.3+1
Installed Tables ────────────────────── v0.2.11
Installed OpSel ─────────────────────── v0.1.0
Installed SpecialFunctions ──────────── v0.9.0
Installed DataStructures ────────────── v0.17.6
Installed DataFrames ────────────────── v0.19.4
Installed JuMP ──────────────────────── v0.20.1
Installed Compat ────────────────────── v2.2.0
Installed StaticArrays ──────────────── v0.12.1
Installed Calculus ──────────────────── v0.5.1
Installed Missings ──────────────────── v0.4.3
Installed TableTraits ───────────────── v1.0.0
Installed DiffResults ───────────────── v0.0.4
Installed ForwardDiff ───────────────── v0.10.7
Installed BenchmarkTools ────────────── v0.4.3
Installed CommonSubexpressions ──────── v0.2.0
Installed BinaryProvider ────────────── v0.5.8
Installed InvertedIndices ───────────── v1.0.0
Installed PooledArrays ──────────────── v0.5.2
Installed DataValueInterfaces ───────── v1.0.0
Installed DiffRules ─────────────────── v0.1.0
Installed MathProgBase ──────────────── v0.7.7
Installed MathOptInterface ──────────── v0.9.7
Installed Reexport ──────────────────── v0.2.0
Installed DataAPI ───────────────────── v1.1.0
Installed IteratorInterfaceExtensions ─ v1.0.0
Installed CategoricalArrays ─────────── v0.7.3
Installed JSON ──────────────────────── v0.21.0
Installed Parsers ───────────────────── v0.3.10
Installed Ipopt ─────────────────────── v0.6.1
Installed OrderedCollections ────────── v1.1.0
Installed SortingAlgorithms ─────────── v0.3.1
Updating `~/.julia/environments/v1.3/Project.toml`
[099ba0d8] + OpSel v0.1.0
Updating `~/.julia/environments/v1.3/Manifest.toml`
[6e4b80f9] + BenchmarkTools v0.4.3
[b99e7846] + BinaryProvider v0.5.8
[49dc2e85] + Calculus v0.5.1
[324d7699] + CategoricalArrays v0.7.3
[bbf7d656] + CommonSubexpressions v0.2.0
[34da2185] + Compat v2.2.0
[9a962f9c] + DataAPI v1.1.0
[a93c6f00] + DataFrames v0.19.4
[864edb3b] + DataStructures v0.17.6
[e2d170a0] + DataValueInterfaces v1.0.0
[163ba53b] + DiffResults v0.0.4
[b552c78f] + DiffRules v0.1.0
[f6369f11] + ForwardDiff v0.10.7
[41ab1584] + InvertedIndices v1.0.0
[b6b21f68] + Ipopt v0.6.1
[82899510] + IteratorInterfaceExtensions v1.0.0
[682c06a0] + JSON v0.21.0
[4076af6c] + JuMP v0.20.1
[b8f27783] + MathOptInterface v0.9.7
[fdba3010] + MathProgBase v0.7.7
[e1d29d7a] + Missings v0.4.3
[77ba4419] + NaNMath v0.3.3
[099ba0d8] + OpSel v0.1.0
[efe28fd5] + OpenSpecFun_jll v0.5.3+1
[bac558e1] + OrderedCollections v1.1.0
[69de0a69] + Parsers v0.3.10
[2dfb63ee] + PooledArrays v0.5.2
[189a3867] + Reexport v0.2.0
[a2af1166] + SortingAlgorithms v0.3.1
[276daf66] + SpecialFunctions v0.9.0
[90137ffa] + StaticArrays v0.12.1
[3783bdb8] + TableTraits v1.0.0
[bd369af6] + Tables v0.2.11
[2a0f44e3] + Base64
[ade2ca70] + Dates
[8bb1440f] + DelimitedFiles
[8ba89e20] + Distributed
[9fa8497b] + Future
[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 OpSel
Resolving package versions...
Status `/tmp/jl_zI181F/Manifest.toml`
[6e4b80f9] BenchmarkTools v0.4.3
[b99e7846] BinaryProvider v0.5.8
[49dc2e85] Calculus v0.5.1
[324d7699] CategoricalArrays v0.7.3
[bbf7d656] CommonSubexpressions v0.2.0
[34da2185] Compat v2.2.0
[9a962f9c] DataAPI v1.1.0
[a93c6f00] DataFrames v0.19.4
[864edb3b] DataStructures v0.17.6
[e2d170a0] DataValueInterfaces v1.0.0
[163ba53b] DiffResults v0.0.4
[b552c78f] DiffRules v0.1.0
[f6369f11] ForwardDiff v0.10.7
[41ab1584] InvertedIndices v1.0.0
[b6b21f68] Ipopt v0.6.1
[82899510] IteratorInterfaceExtensions v1.0.0
[682c06a0] JSON v0.21.0
[4076af6c] JuMP v0.20.1
[b8f27783] MathOptInterface v0.9.7
[fdba3010] MathProgBase v0.7.7
[e1d29d7a] Missings v0.4.3
[77ba4419] NaNMath v0.3.3
[099ba0d8] OpSel v0.1.0
[efe28fd5] OpenSpecFun_jll v0.5.3+1
[bac558e1] OrderedCollections v1.1.0
[69de0a69] Parsers v0.3.10
[2dfb63ee] PooledArrays v0.5.2
[189a3867] Reexport v0.2.0
[a2af1166] SortingAlgorithms v0.3.1
[276daf66] SpecialFunctions v0.9.0
[90137ffa] StaticArrays v0.12.1
[3783bdb8] TableTraits v1.0.0
[bd369af6] Tables v0.2.11
[2a0f44e3] Base64 [`@stdlib/Base64`]
[ade2ca70] Dates [`@stdlib/Dates`]
[8bb1440f] DelimitedFiles [`@stdlib/DelimitedFiles`]
[8ba89e20] Distributed [`@stdlib/Distributed`]
[9fa8497b] Future [`@stdlib/Future`]
[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`]
Z = 2045, N_s = 14, N = 2800, theta = 0.03571428571428571
******************************************************************************
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...: 2045
Number of nonzeros in inequality constraint Jacobian.: 30081
Number of nonzeros in Lagrangian Hessian.............: 6036
Total number of variables............................: 2045
variables with only lower bounds: 0
variables with lower and upper bounds: 0
variables with only upper bounds: 0
Total number of equality constraints.................: 1
Total number of inequality constraints...............: 4091
inequality constraints with only lower bounds: 0
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 4091
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 -0.0000000e+00 1.00e+00 2.90e-01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 -2.0245767e+02 6.17e-01 2.18e+00 -1.7 1.57e-01 - 1.00e+00 3.83e-01h 1
2 -2.5345910e+02 2.65e-01 3.99e+00 -1.7 9.93e-02 - 1.00e+00 5.71e-01h 1
3 -3.0977733e+02 8.80e-02 5.93e+00 -1.7 3.12e-02 - 1.00e+00 6.67e-01h 1
4 -3.2160359e+02 2.48e-02 9.39e+00 -1.7 1.77e-02 - 1.00e+00 7.18e-01h 1
5 -3.2948097e+02 1.42e-02 6.76e+01 -1.7 6.57e-03 - 1.00e+00 4.27e-01h 1
6 -3.3041401e+02 4.43e-03 6.19e+01 -1.7 1.71e-03 - 1.00e+00 6.88e-01h 1
7 -3.3201918e+02 2.09e-03 2.58e+02 -1.7 1.36e-03 - 1.00e+00 5.29e-01h 1
8 -3.3206985e+02 8.00e-04 4.58e+02 -1.7 2.44e-04 - 1.00e+00 6.16e-01h 1
9 -3.3237163e+02 3.42e-04 1.27e+03 -1.7 2.42e-04 - 1.00e+00 5.73e-01h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10 -3.3237492e+02 1.39e-04 2.88e+03 -1.7 3.76e-05 - 1.00e+00 5.92e-01h 1
11 -3.3242817e+02 5.76e-05 7.08e+03 -1.7 4.19e-05 - 1.00e+00 5.86e-01h 1
12 -3.3242833e+02 4.06e-05 2.87e+04 -1.7 6.23e-06 - 1.00e+00 2.96e-01f 2
13 -3.3243597e+02 7.40e-06 1.38e+04 -1.7 7.07e-06 - 1.00e+00 8.18e-01h 1
14 -3.3243743e+02 5.55e-06 1.81e+05 -1.7 2.53e-06 - 1.00e+00 2.49e-01f 2
15 -3.3243957e+02 2.53e-07 2.00e+04 -1.7 1.26e-06 - 1.00e+00 9.54e-01h 1
16 -3.3243945e+02 1.73e-07 8.12e+05 -1.7 1.37e-07 - 1.00e+00 3.19e-01f 2
17 -3.3243949e+02 6.49e-13 2.30e-06 -1.7 3.23e-08 - 1.00e+00 1.00e+00h 1
18 -3.3255390e+02 7.91e-13 2.38e+04 -5.7 2.39e-04 - 9.88e-01 1.00e+00f 1
19 -3.3772965e+02 7.46e-13 2.37e+04 -5.7 3.02e-01 - 1.84e-03 5.75e-02f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
20 -3.5002135e+02 1.29e-03 2.12e+04 -5.7 4.57e-02 - 1.06e-01 5.89e-01f 1
21 -3.5716425e+02 1.19e-03 1.87e+04 -5.7 4.86e-02 - 1.18e-01 2.85e-01h 1
22 -3.6074876e+02 1.18e-03 1.53e+04 -5.7 1.01e-01 - 1.81e-01 1.09e-01h 1
23 -3.6534792e+02 1.14e-03 1.16e+04 -5.7 8.38e-02 - 2.46e-01 1.58e-01h 1
24 -3.7410262e+02 1.23e-03 1.10e+04 -5.7 6.31e-02 - 4.91e-02 2.37e-01f 1
25 -3.7960064e+02 1.22e-03 9.90e+03 -5.7 6.21e-02 - 9.84e-02 1.41e-01h 1
26 -3.8630974e+02 1.33e-03 8.07e+03 -5.7 7.35e-02 - 1.85e-01 1.93e-01h 1
27 -3.9364995e+02 1.33e-03 6.80e+03 -5.7 5.47e-02 - 1.58e-01 2.44e-01h 1
28 -4.0413809e+02 1.51e-03 5.95e+03 -5.7 3.67e-02 - 1.26e-01 3.20e-01f 1
29 -4.0770429e+02 1.36e-03 4.64e+03 -5.7 2.37e-02 - 2.20e-01 1.48e-01h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
30 -4.1274713e+02 1.23e-03 3.46e+03 -5.7 2.62e-02 - 2.54e-01 2.14e-01f 1
31 -4.1980970e+02 1.11e-03 2.88e+03 -5.7 1.99e-02 - 1.68e-01 3.37e-01f 1
32 -4.2426380e+02 9.13e-04 2.20e+03 -5.7 1.61e-02 - 2.36e-01 2.98e-01f 1
33 -4.2912260e+02 6.94e-04 1.46e+03 -5.7 1.45e-02 - 3.37e-01 4.20e-01f 1
34 -4.3303730e+02 4.52e-04 8.78e+02 -5.7 9.20e-03 - 3.97e-01 5.24e-01f 1
35 -4.3567823e+02 2.23e-04 6.14e+02 -5.7 5.83e-03 - 3.01e-01 6.68e-01f 1
36 -4.3714565e+02 3.65e-05 1.08e+02 -5.7 5.19e-03 - 8.25e-01 1.00e+00f 1
37 -4.3721427e+02 4.44e-16 2.60e-06 -5.7 8.36e-04 - 1.00e+00 1.00e+00h 1
38 -4.3871316e+02 1.82e-05 4.09e+00 -8.6 2.51e-03 - 7.76e-01 7.97e-01f 1
39 -4.3910600e+02 2.70e-06 2.24e+00 -8.6 7.16e-04 - 9.28e-01 9.79e-01h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
40 -4.3911615e+02 5.37e-08 6.72e-02 -8.6 1.23e-04 - 9.78e-01 1.00e+00f 1
41 -4.3911628e+02 3.33e-16 4.88e-09 -8.6 3.03e-05 - 1.00e+00 1.00e+00h 1
Number of Iterations....: 41
(scaled) (unscaled)
Objective...............: -8.2384635286027919e-01 -4.3911628492217517e+02
Dual infeasibility......: 4.8805531838169713e-09 2.6013714511233238e-06
Constraint violation....: 3.3306690738754696e-16 3.3306690738754696e-16
Complementarity.........: 4.4684712318714910e-09 2.3817286801217435e-06
Overall NLP error.......: 4.8805531838169713e-09 2.6013714511233238e-06
Number of objective function evaluations = 45
Number of objective gradient evaluations = 42
Number of equality constraint evaluations = 45
Number of inequality constraint evaluations = 45
Number of equality constraint Jacobian evaluations = 42
Number of inequality constraint Jacobian evaluations = 42
Number of Lagrangian Hessian evaluations = 41
Total CPU secs in IPOPT (w/o function evaluations) = 6.983
Total CPU secs in NLP function evaluations = 1.822
EXIT: Optimal Solution Found.
=== Result Summary ===
JuMP status = LOCALLY_SOLVED
Z = 2045, N_s = 14, N = 2800
gx = 439.116285, xAx = 0.071429, 2theta = 0.071429
time(s): build = 5.063, solver = 36.174, total = 41.237
Z = 200, N = 50, theta = 0.016714999999999997
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...: 200
Number of nonzeros in inequality constraint Jacobian.: 2700
Number of nonzeros in Lagrangian Hessian.............: 550
Total number of variables............................: 200
variables with only lower bounds: 0
variables with lower and upper bounds: 0
variables with only upper bounds: 0
Total number of equality constraints.................: 1
Total number of inequality constraints...............: 401
inequality constraints with only lower bounds: 0
inequality constraints with lower and upper bounds: 0
inequality constraints with only upper bounds: 401
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
0 -0.0000000e+00 1.00e+00 6.15e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 -1.3922826e+01 8.72e-01 1.26e+01 -1.0 1.37e-01 - 1.00e+00 1.28e-01h 1
2 -1.5800200e+01 2.19e-01 6.27e+00 -1.0 2.99e-02 - 1.00e+00 7.49e-01h 1
3 -2.1296514e+01 1.41e-01 5.53e+01 -1.0 2.05e-02 - 1.00e+00 3.54e-01h 1
4 -2.1630297e+01 3.58e-02 3.17e+01 -1.0 1.16e-02 - 1.00e+00 7.47e-01h 1
5 -2.2578297e+01 1.65e-02 1.51e+02 -1.0 3.86e-03 - 1.00e+00 5.39e-01h 1
6 -2.2539676e+01 6.45e-03 2.92e+02 -1.0 1.53e-03 - 1.00e+00 6.09e-01h 1
7 -2.2715205e+01 2.73e-03 7.87e+02 -1.0 7.11e-04 - 1.00e+00 5.76e-01h 1
8 -2.2707021e+01 1.12e-03 1.82e+03 -1.0 2.55e-04 - 1.00e+00 5.90e-01h 1
9 -2.2737663e+01 4.66e-04 4.46e+03 -1.0 1.24e-04 - 1.00e+00 5.84e-01h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10 -2.2736206e+01 1.92e-04 1.07e+04 -1.0 4.35e-05 - 1.00e+00 5.87e-01h 1
11 -2.2741487e+01 7.93e-05 2.57e+04 -1.0 2.13e-05 - 1.00e+00 5.87e-01h 1
12 -2.2741358e+01 5.59e-05 1.05e+05 -1.0 7.41e-06 - 1.00e+00 2.95e-01f 2
13 -2.2741926e+01 1.04e-05 5.16e+04 -1.0 5.55e-06 - 1.00e+00 8.14e-01h 1
14 -2.2742073e+01 7.85e-06 6.75e+05 -1.0 1.19e-06 - 1.00e+00 2.46e-01f 2
15 -2.2742265e+01 6.22e-07 1.32e+05 -1.0 8.16e-07 - 1.00e+00 9.21e-01h 1
16 -2.2742253e+01 4.43e-07 3.51e+06 -1.0 5.40e-08 - 1.00e+00 2.87e-01f 2
17 -2.2742260e+01 0.00e+00 1.00e-06 -1.0 4.46e-08 - 1.00e+00 1.00e+00h 1
18 -2.3469414e+01 2.22e-16 1.95e+06 -8.6 6.56e-03 - 7.85e-01 1.00e+00f 1
19 -2.5836304e+01 1.33e-03 9.43e+05 -8.6 2.97e-02 - 5.16e-01 8.15e-01f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
20 -2.6222452e+01 3.80e-03 3.59e+05 -8.6 1.71e-02 - 6.19e-01 2.48e-01f 1
21 -2.6342694e+01 2.87e-03 2.67e+05 -8.6 3.19e-02 - 2.57e-01 4.50e-01f 1
In iteration 21, 1 Slack too small, adjusting variable bound
22 -2.6298556e+01 2.00e-03 1.54e+05 -8.6 1.89e-02 - 4.25e-01 3.43e-01h 1
23 -2.6217699e+01 7.49e-04 9.09e+04 -8.6 1.10e-02 - 4.08e-01 8.62e-01h 1
24 -2.6145201e+01 8.64e-05 6.55e+04 -8.6 3.75e-03 - 2.79e-01 1.00e+00h 1
25 -2.6145461e+01 9.82e-06 1.93e+04 -8.6 1.52e-03 - 7.06e-01 1.00e+00h 1
26 -2.6153037e+01 5.68e-06 1.68e+04 -8.6 1.12e-03 - 1.31e-01 1.00e+00h 1
27 -2.6154383e+01 9.32e-07 1.57e+03 -8.6 5.09e-04 - 9.06e-01 1.00e+00h 1
28 -2.6155464e+01 6.07e-07 8.85e+01 -8.6 3.38e-04 - 9.44e-01 1.00e+00h 1
29 -2.6155598e+01 9.82e-08 7.77e+00 -8.6 1.32e-04 - 9.12e-01 1.00e+00h 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
30 -2.6155621e+01 9.41e-09 2.27e+00 -8.6 7.26e-05 - 6.26e-01 1.00e+00h 1
31 -2.6155625e+01 9.75e-10 1.70e-03 -8.6 3.48e-05 - 9.97e-01 1.00e+00h 1
32 -2.6155625e+01 4.37e-10 1.68e-07 -8.6 2.54e-05 - 1.00e+00 1.00e+00h 1
33 -2.6155625e+01 8.48e-11 3.89e-08 -8.6 1.25e-05 - 1.00e+00 1.00e+00h 1
34 -2.6155625e+01 0.00e+00 8.13e-09 -8.6 5.73e-06 - 1.00e+00 1.00e+00h 1
Number of Iterations....: 34
(scaled) (unscaled)
Objective...............: -1.3847747204547463e+01 -2.6155624919949247e+01
Dual infeasibility......: 8.1319591060946550e-09 1.5359644359591584e-08
Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00
Complementarity.........: 6.9540333528768238e-09 1.3134778196913745e-08
Overall NLP error.......: 8.1319591060946550e-09 1.5359644359591584e-08
Number of objective function evaluations = 38
Number of objective gradient evaluations = 35
Number of equality constraint evaluations = 38
Number of inequality constraint evaluations = 38
Number of equality constraint Jacobian evaluations = 35
Number of inequality constraint Jacobian evaluations = 35
Number of Lagrangian Hessian evaluations = 34
Total CPU secs in IPOPT (w/o function evaluations) = 0.149
Total CPU secs in NLP function evaluations = 0.006
EXIT: Optimal Solution Found.
=== SOCP Result Summary ===
JuMP status = LOCALLY_SOLVED
sum(x_socp) = 0.999996, gx = 26.155540, xAx = 0.033430, 2theta = 0.033430
======= Before swap c_obj = -41.483965
iter2 = 1, c_obj = -29.510364, gx = 27.044800, xAx = 0.041800, best_f = 63, best_v = 121
iter2 = 2, c_obj = -20.269719, gx = 26.825800, xAx = 0.040400, best_f = 71, best_v = 78
iter2 = 3, c_obj = -11.162274, gx = 26.473600, xAx = 0.039000, best_f = 57, best_v = 195
iter2 = 4, c_obj = -3.258806, gx = 26.268800, xAx = 0.037800, best_f = 93, best_v = 150
iter2 = 5, c_obj = 3.269683, gx = 26.040400, xAx = 0.036800, best_f = 88, best_v = 129
iter2 = 6, c_obj = 8.527194, gx = 25.892400, xAx = 0.036000, best_f = 55, best_v = 143
iter2 = 7, c_obj = 13.723706, gx = 25.683400, xAx = 0.035200, best_f = 169, best_v = 128
iter2 = 8, c_obj = 18.852217, gx = 25.406400, xAx = 0.034400, best_f = 70, best_v = 105
iter2 = 9, c_obj = 23.962729, gx = 25.111400, xAx = 0.033600, best_f = 58, best_v = 171
iter2 = 10, c_obj = 25.066400, gx = 25.066400, xAx = 0.033400, best_f = 92, best_v = 66
iter2 = 11, c_obj = 25.072600, gx = 25.072600, xAx = 0.033400, best_f = 139, best_v = 115
iter2 = 12, c_obj = 25.090400, gx = 25.090400, xAx = 0.033400, best_f = 109, best_v = 63
No swap c_obj = 25.090400, gx = 25.090400, xAx = 0.033400
Finished ... iter2 = 13, before_cobj = -41.483965, after_cobj = 25.090400
sum(x_sa) = 1.000000, gx = 25.090400, xAx = 0.033400, 2theta = 0.033430
SOCP = 26.155540, STEEP = 25.090400, gap = 4.072330%
time(s): build = 0.537, solver = 0.141, steep = 3.933, total = 4.611
Test Summary: |
OpSel.jl | No tests
Testing OpSel tests passed