Home Explore Help
Register Sign In
lij
/
PS_Method_CCS_test
1
0
Fork 0
Files Issues 0 Pull Requests 0 Wiki
Tree: 6f9ff47688
Branches Tags
PS_Method_CC...
/
Ipopt_Cpp_example
/
Debug
/
ipopt.out

ipopt.out 3.0 KB
History Raw

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455 
  1. 

  2. ******************************************************************************
    3. 

  3. This program contains Ipopt, a library for large-scale nonlinear optimization.
    4. 

  4.  Ipopt is released as open source code under the Eclipse Public License (EPL).
    5. 

  5.          For more information visit http://projects.coin-or.org/Ipopt
    6. 

  6. ******************************************************************************
    7. 

  7. 

  8. This is Ipopt version 3.12.7, running with linear solver ma27.
    9. 

  9. 

  10. Number of nonzeros in equality constraint Jacobian...:        4
    11. 

  11. Number of nonzeros in inequality constraint Jacobian.:        4
    12. 

  12. Number of nonzeros in Lagrangian Hessian.............:       10
    13. 

  13. 

  14. Total number of variables............................:        4
    15. 

  15.                      variables with only lower bounds:        0
    16. 

  16.                 variables with lower and upper bounds:        4
    17. 

  17.                      variables with only upper bounds:        0
    18. 

  18. Total number of equality constraints.................:        1
    19. 

  19. Total number of inequality constraints...............:        1
    20. 

  20.         inequality constraints with only lower bounds:        1
    21. 

  21.    inequality constraints with lower and upper bounds:        0
    22. 

  22.         inequality constraints with only upper bounds:        0
    23. 

  23. 

  24. iter    objective    inf_pr   inf_du lg(mu)  ||d||  lg(rg) alpha_du alpha_pr  ls
    25. 

  25.    0  1.6109693e+01 1.12e+01 5.28e-01   0.0 0.00e+00    -  0.00e+00 0.00e+00   0
    26. 

  26.    1  1.7410406e+01 7.49e-01 2.25e+01  -0.3 7.97e-01    -  3.19e-01 1.00e+00f  1
    27. 

  27.    2  1.8001613e+01 7.52e-03 4.96e+00  -0.3 5.60e-02   2.0 9.97e-01 1.00e+00h  1
    28. 

  28.    3  1.7199482e+01 4.00e-02 4.24e-01  -1.0 9.91e-01    -  9.98e-01 1.00e+00f  1
    29. 

  29.    4  1.6940955e+01 1.59e-01 4.58e-02  -1.4 2.88e-01    -  9.66e-01 1.00e+00h  1
    30. 

  30.    5  1.7003411e+01 2.16e-02 8.42e-03  -2.9 7.03e-02    -  9.68e-01 1.00e+00h  1
    31. 

  31.    6  1.7013974e+01 2.03e-04 8.65e-05  -4.5 6.22e-03    -  1.00e+00 1.00e+00h  1
    32. 

  32.    7  1.7014017e+01 2.76e-07 2.18e-07 -10.3 1.43e-04    -  9.99e-01 1.00e+00h  1
    33. 

  33.    8  1.7014017e+01 2.13e-14 2.29e-14 -11.0 1.04e-07    -  1.00e+00 1.00e+00h  1
    34. 

  34. 

  35. Number of Iterations....: 8
    36. 

  36. 

  37.                                    (scaled)                 (unscaled)
    38. 

  38. Objective...............:   1.7014017140224134e+01    1.7014017140224134e+01
    39. 

  39. Dual infeasibility......:   2.2928101314633036e-14    2.2928101314633036e-14
    40. 

  40. Constraint violation....:   2.1316282072803006e-14    2.1316282072803006e-14
    41. 

  41. Complementarity.........:   1.0023967333275279e-11    1.0023967333275279e-11
    42. 

  42. Overall NLP error.......:   1.0023967333275279e-11    1.0023967333275279e-11
    43. 

  43. 

  44. 

  45. Number of objective function evaluations             = 9
    46. 

  46. Number of objective gradient evaluations             = 9
    47. 

  47. Number of equality constraint evaluations            = 9
    48. 

  48. Number of inequality constraint evaluations          = 9
    49. 

  49. Number of equality constraint Jacobian evaluations   = 9
    50. 

  50. Number of inequality constraint Jacobian evaluations = 9
    51. 

  51. Number of Lagrangian Hessian evaluations             = 8
    52. 

  52. Total CPU secs in IPOPT (w/o function evaluations)   =      5.191
    53. 

  53. Total CPU secs in NLP function evaluations           =      0.002
    54. 

  54. 

  55. EXIT: Optimal Solution Found.
    56.