Skip to content

Instantly share code, notes, and snippets.

@bchretien
Created January 4, 2015 13:39
Show Gist options
  • Save bchretien/8bf5fbf3e90f918f18ed to your computer and use it in GitHub Desktop.
Save bchretien/8bf5fbf3e90f918f18ed to your computer and use it in GitHub Desktop.
******************************************************************************
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 trunk, 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.............: 0
Total number of variables............................: 2
variables with only lower bounds: 1
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 9.0900000e+02 0.00e+00 1.00e+02 0.0 0.00e+00 - 0.00e+00 0.00e+00 0
1 2.6290934e+01 0.00e+00 9.58e+00 1.4 1.00e+02 - 9.57e-01 3.12e-02f 6
2 1.0829775e-01 0.00e+00 2.77e-01 -7.5 3.46e-01 - 1.00e+00 5.00e-01f 2
3 9.2112970e-02 0.00e+00 6.09e-02 -4.7 5.16e-03 - 1.00e+00 1.00e+00f 1
4 9.1369784e-02 0.00e+00 8.38e-03 -6.6 9.47e-04 - 1.00e+00 1.00e+00f 1
5 9.1325188e-02 0.00e+00 8.95e-03 -8.4 1.85e-04 - 1.00e+00 1.00e+00f 1
6 8.7041679e-02 0.00e+00 6.37e-02 -11.0 2.25e-02 - 1.00e+00 1.00e+00f 1
7 6.6709041e-02 0.00e+00 1.19e-01 -11.0 1.06e-01 - 1.00e+00 1.00e+00f 1
8 4.8088411e-02 0.00e+00 3.66e-01 -11.0 1.90e+01 - 1.00e+00 2.00e-02f 4
9 3.9643744e-02 0.00e+00 5.86e-02 -11.0 2.45e-01 - 1.00e+00 1.00e+00f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
10 2.5321043e-02 0.00e+00 2.28e-02 -11.0 9.01e-02 - 1.00e+00 1.00e+00f 1
11 1.8458601e-02 0.00e+00 1.82e-01 -11.0 2.99e-01 - 1.00e+00 5.00e-01f 2
12 1.1355980e-02 0.00e+00 6.37e-02 -11.0 1.86e-02 - 1.00e+00 1.00e+00f 1
13 6.0175823e-03 0.00e+00 2.24e-02 -11.0 5.27e-02 - 1.00e+00 1.00e+00f 1
14 5.2443766e-03 0.00e+00 7.43e-02 -11.0 1.20e+00 - 1.00e+00 3.12e-02f 6
15 1.4371689e-03 0.00e+00 3.59e-02 -11.0 5.71e-02 - 1.00e+00 1.00e+00f 1
16 2.9630625e-04 0.00e+00 9.38e-03 -11.0 3.15e-02 - 1.00e+00 1.00e+00f 1
17 6.6746409e-05 0.00e+00 1.35e-02 -11.0 3.09e-02 - 1.00e+00 1.00e+00f 1
18 1.3669628e-05 0.00e+00 6.05e-03 -11.0 8.93e-04 - 1.00e+00 1.00e+00f 1
19 6.1631909e-10 0.00e+00 8.29e-06 -11.0 1.32e-03 - 1.00e+00 1.00e+00f 1
iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls
20 3.4191292e-12 0.00e+00 9.01e-07 -11.0 4.52e-05 - 1.00e+00 1.00e+00f 1
21 5.0069951e-18 0.00e+00 3.51e-09 -11.0 3.54e-06 - 1.00e+00 1.00e+00f 1
Number of Iterations....: 21
(scaled) (unscaled)
Objective...............: 2.0810453596161274e-19 5.0069951352364023e-18
Dual infeasibility......: 3.5062553419494093e-09 8.4360503527302779e-08
Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00
Complementarity.........: 9.9999999999799580e-12 2.4059999999951778e-10
Overall NLP error.......: 3.5062553419494093e-09 8.4360503527302779e-08
Number of objective function evaluations = 57
Number of objective gradient evaluations = 22
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 = 0
Total CPU secs in IPOPT (w/o function evaluations) = 0.017
Total CPU secs in NLP function evaluations = 0.000
EXIT: Optimal Solution Found.
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment