Problem name: BMI2 from convertor pen2bmi2()
Description:  Structure PENM generated by bmi_define()
Start time:   03-Mar-2022 10:05:31
All option settings (* = set by user):
  outlev               *: 2 
  outlev_file          *: 5 
  out_filename         *: penm_log.txt
  user_prn             *: [not used]
  maxotiter            *: 100 
  maxiniter            *: 100 
  penalty_update       *: 0.5 
  penalty_update_bar   *: 0.3 
  mpenalty_update      *: 0.5 
  mpenalty_min         *: 1e-06 
  mpenalty_border      *: 1e-06 
  max_outer_iter       *: 100 
  outer_stop_limit     *: 1e-06 
  kkt_stop_limit       *: 0.0001 
  mlt_update           *: 0.3 
  mmlt_update          *: 0.1 
  uinit                *: 1 
  uinit_box            *: 1 
  uinit_eq             *: 0 
  umin                 *: 1e-10 
  pinit                *: 1 
  pinit_bar            *: 1 
  usebarrier           *: 0 
  xinit_mod            *: 0 
  max_inner_iter       *: 100 
  inner_stop_limit     *: 0.01 
  unc_dir_stop_limit   *: 0.01 
  unc_solver           *: 0 
  unc_linesearch       *: 3 
  eq_dir_stop_limit    *: 0.01 
  eq_solver            *: 0 
  eq_linesearch        *: 3 
  eq_solver_warn_max   *: 4 
  ls_short_max         *: 3 
  min_recover_strategy *: 0 
  min_recover_max      *: 3 
  phi_R                *: -0.5 
  max_ls_iter          *: 20 
  max_lseq_iter        *: 20 
  armijo_eps           *: 0.01 
  ldl_pivot            *: 1e-05 
  pert_update          *: 2 
  pert_min             *: 1e-06 
  pert_try_max         *: 50 
  pert_faster          *: 1 
  chol_ordering        *: 1 
  luk3_diag            *: 1 
 
*******************************************************************************
PenLab 1.04 (20140125)
*******************************************************************************
Number of variables                         3420
Number of matrix variables                     0
   - degrees of freedom (var. elements)        0
(Function) constraints
   - box inequalities                          0
   - linear inequalities                    6720
   - nonlinear inequalities                    0
   - linear equalities                         0
   - nonlinear equalities                      0
Matrix constraints
   - box inequalities                          0
   - linear inequalities                      10
   - nonlinear inequalities                    0
 
Min./Max. ineq-mult.:   1.000000 /  1.000000
******************** Start *********************
Objective                 0.0000000000000000E+00
Augmented Lagrangian      1.7228033598415647E+05
|f(x) - Lagr(x)|          1.7228033598415647E+05
Grad augm. lagr.          4.0762711475985576E+04
Feasibility (max)         2.9437651569637723E+02
Feasibility eqx                                 
Feasibility ineq          2.9437651569637723E+02
Feasibility box                                 
Feasibility m.ineq        0.0000000000000000E+00
Complementarity           2.9437651569637723E+02
Minimal penalty           1.6150558288984579E-01
************************************************
 
************* Start of outer step   1 **********
object(x_  0) =   1.7228033598415647E+05
||grad(x)||_2 =   4.0762711475985576E+04
        --- start of inner iter ---
 
Computing ordering
Chol fact OK in 0.160000s, total 0.160000s, no pert=0, pert=0.0000e+00, nnz=140319 (dim 3420x3420)
LS (pen): -3.4472e+05, 2 steps, Step width: 0.500000
 
object(x_  1) =   4.3013459762050028E+04
||grad(x)||_2 =   2.0380284075940053E+04
        --- end of   1 in. iter ---

Reusing ordering
Chol fact OK in 0.050000s, total 0.050000s, no pert=0, pert=0.0000e+00, nnz=140619 (dim 3420x3420)
LS (pen): -8.6146e+04, 1 steps, Step width: 1.000000
 
object(x_  2) =   9.6539686585726599E+01
||grad(x)||_2 =   9.1654146315081778E+02
        --- end of   2 in. iter ---

Reusing ordering
Chol fact OK in 0.040000s, total 0.040000s, no pert=0, pert=0.0000e+00, nnz=140619 (dim 3420x3420)
LS (pen): -1.7009e+02, 3 steps, Step width: 0.250000
 
object(x_  3) =   5.9645663143073776E+01
||grad(x)||_2 =   6.6058246753493199E+02
        --- end of   3 in. iter ---

Reusing ordering
Chol fact OK in 0.030000s, total 0.030000s, no pert=0, pert=0.0000e+00, nnz=140619 (dim 3420x3420)
LS (pen): -7.4818e+01, 3 steps, Step width: 0.250000
 
object(x_  4) =   4.3414580961407474E+01
||grad(x)||_2 =   4.7433215270899615E+02
        --- end of   4 in. iter ---

Reusing ordering
Chol fact OK in 0.040000s, total 0.040000s, no pert=0, pert=0.0000e+00, nnz=140619 (dim 3420x3420)
LS (pen): -3.8516e+01, 2 steps, Step width: 0.500000
 
object(x_  5) =   2.8902665409412247E+01
||grad(x)||_2 =   2.3716652204917199E+02
        --- end of   5 in. iter ---

Reusing ordering
Chol fact OK in 0.030000s, total 0.030000s, no pert=0, pert=0.0000e+00, nnz=140619 (dim 3420x3420)
LS (pen): -1.1089e+01, 1 steps, Step width: 1.000000
 
object(x_  6) =   2.3215887826474333E+01
||grad(x)||_2 =   4.8071126694102329E-01
        --- end of   6 in. iter ---

Reusing ordering
Chol fact OK in 0.030000s, total 0.030000s, no pert=0, pert=0.0000e+00, nnz=140619 (dim 3420x3420)
LS (pen): -6.9393e-01, 2 steps, Step width: 0.500000
 
object(x_  7) =   2.2947928857413984E+01
||grad(x)||_2 =   3.6595672163610138E-01
        --- end of   7 in. iter ---

Reusing ordering
Chol fact OK in 0.040000s, total 0.040000s, no pert=0, pert=0.0000e+00, nnz=140619 (dim 3420x3420)
LS (pen): -4.5665e-01, 1 steps, Step width: 1.000000
 
object(x_  8) =   2.2667118142349011E+01
||grad(x)||_2 =   3.5587907543915320E-01
        --- end of   8 in. iter ---

Reusing ordering
Chol fact OK in 0.030000s, total 0.030000s, no pert=0, pert=0.0000e+00, nnz=140619 (dim 3420x3420)
LS (pen): -2.5834e-01, 1 steps, Step width: 1.000000
 
object(x_  9) =   2.2497056105155000E+01
||grad(x)||_2 =   2.6569439301934678E-01
        --- end of   9 in. iter ---

Reusing ordering
Chol fact OK in 0.020000s, total 0.020000s, no pert=0, pert=0.0000e+00, nnz=140619 (dim 3420x3420)
LS (pen): -2.0152e-01, 1 steps, Step width: 1.000000
 
object(x_ 10) =   2.2363080960349997E+01
||grad(x)||_2 =   1.9167669229172016E-01
        --- end of  10 in. iter ---

Reusing ordering
Chol fact OK in 0.040000s, total 0.040000s, no pert=0, pert=0.0000e+00, nnz=140619 (dim 3420x3420)
LS (pen): -1.5467e-01, 1 steps, Step width: 1.000000
 
object(x_ 11) =   2.2261001235624228E+01
||grad(x)||_2 =   1.3222918527314606E-01
        --- end of  11 in. iter ---

Reusing ordering
Chol fact OK in 0.040000s, total 0.040000s, no pert=0, pert=0.0000e+00, nnz=140619 (dim 3420x3420)
LS (pen): -1.1054e-01, 1 steps, Step width: 1.000000
 
object(x_ 12) =   2.2188072842602701E+01
||grad(x)||_2 =   8.5417198299109751E-02
        --- end of  12 in. iter ---

Reusing ordering
Chol fact OK in 0.040000s, total 0.040000s, no pert=0, pert=0.0000e+00, nnz=140619 (dim 3420x3420)
LS (pen): -7.4579e-02, 1 steps, Step width: 1.000000
 
object(x_ 13) =   2.2139279700017997E+01
||grad(x)||_2 =   4.9616200807671519E-02
        --- end of  13 in. iter ---

Reusing ordering
Chol fact OK in 0.030000s, total 0.030000s, no pert=0, pert=0.0000e+00, nnz=140619 (dim 3420x3420)
LS (pen): -4.3739e-02, 1 steps, Step width: 1.000000
 
object(x_ 14) =   2.2111038967113370E+01
||grad(x)||_2 =   2.4755905674221302E-02
        --- end of  14 in. iter ---

Reusing ordering
Chol fact OK in 0.030000s, total 0.030000s, no pert=0, pert=0.0000e+00, nnz=140619 (dim 3420x3420)
LS (pen): -2.3692e-02, 1 steps, Step width: 1.000000
 
object(x_ 15) =   2.2095465973488061E+01
||grad(x)||_2 =   9.9795520059832860E-03
        --- end of  15 in. iter ---

Unconstr min OK
************ Result of outer step   1 **********
Objective                 1.2896261724477398E+01
Augmented Lagrangian      2.2095465973488061E+01
|f(x) - f(x_old)|         1.2896261724477398E+01
|f(x) - Lagr(x)|          9.1992042490106627E+00
Grad augm. lagr.          9.9795520059832860E-03
Feasibility (max)         4.5182740207816713E-01
Feasibility eqx                                 
Feasibility ineq          4.5182740207816713E-01
Feasibility box                                 
Feasibility m.ineq        0.0000000000000000E+00
Complementarity           6.5597540334687288E-01
Minimal penalty           1.6150558288984579E-01
Newton steps                                  15
Inner steps                                   15
Linesearch steps                              22
Time of the minimization step             4.42 s
  - factorizations in the step            0.65 s
************************************************
 
************* Start of outer step   2 **********
object(x_  0) =   6.7620068764684675E+01
||grad(x)||_2 =   1.4357921799086524E+01
        --- start of inner iter ---
 
Reusing ordering
Chol fact OK in 0.030000s, total 0.030000s, no pert=0, pert=0.0000e+00, nnz=140619 (dim 3420x3420)
LS (pen): -4.2260e+01, 6 steps, Step width: 0.031250
 
object(x_  1) =   6.6323374574260811E+01
||grad(x)||_2 =   1.3908759005560155E+01
        --- end of   1 in. iter ---

Reusing ordering
Chol fact OK in 0.040000s, total 0.040000s, no pert=0, pert=0.0000e+00, nnz=140619 (dim 3420x3420)
LS (pen): -3.4651e+01, 5 steps, Step width: 0.062500
 
object(x_  2) =   6.4226333752830016E+01
||grad(x)||_2 =   1.3038445092371541E+01
        --- end of   2 in. iter ---

Reusing ordering
Chol fact OK in 0.030000s, total 0.030000s, no pert=0, pert=0.0000e+00, nnz=140619 (dim 3420x3420)
LS (pen): -2.9749e+01, 4 steps, Step width: 0.125000
 
object(x_  3) =   6.0741467211764544E+01
||grad(x)||_2 =   1.1405461851358641E+01
        --- end of   3 in. iter ---

Reusing ordering
Chol fact OK in 0.040000s, total 0.040000s, no pert=0, pert=0.0000e+00, nnz=140619 (dim 3420x3420)
LS (pen): -2.2503e+01, 3 steps, Step width: 0.250000
 
object(x_  4) =   5.5820573057009142E+01
||grad(x)||_2 =   8.5522972130261774E+00
        --- end of   4 in. iter ---

Reusing ordering
Chol fact OK in 0.030000s, total 0.040000s, no pert=0, pert=0.0000e+00, nnz=140619 (dim 3420x3420)
LS (pen): -1.2584e+01, 2 steps, Step width: 0.500000
 
object(x_  5) =   5.1104014698391893E+01
||grad(x)||_2 =   4.2763311337091761E+00
        --- end of   5 in. iter ---

Reusing ordering
Chol fact OK in 0.030000s, total 0.030000s, no pert=0, pert=0.0000e+00, nnz=140619 (dim 3420x3420)
LS (pen): -3.1298e+00, 1 steps, Step width: 1.000000
 
object(x_  6) =   4.9538888362039209E+01
||grad(x)||_2 =   2.1478038702256959E-02
        --- end of   6 in. iter ---

Reusing ordering
Chol fact OK in 0.030000s, total 0.030000s, no pert=0, pert=0.0000e+00, nnz=140619 (dim 3420x3420)
LS (pen): -1.5249e-03, 1 steps, Step width: 1.000000
 
object(x_  7) =   4.9537934124971734E+01
||grad(x)||_2 =   8.4732670958538401E-03
        --- end of   7 in. iter ---

Unconstr min OK
************ Result of outer step   2 **********
Objective                 3.6619516637569284E+01
Augmented Lagrangian      4.9537934124971734E+01
|f(x) - f(x_old)|         2.3723254913091885E+01
|f(x) - Lagr(x)|          1.2918417487402451E+01
Grad augm. lagr.          8.4732670958538401E-03
Feasibility (max)         2.2215127542887078E-01
Feasibility eqx                                 
Feasibility ineq          2.2215127542887078E-01
Feasibility box                                 
Feasibility m.ineq        0.0000000000000000E+00
Complementarity           4.5038935625215476E-01
Minimal penalty           8.0752791444922895E-02
Newton steps                                   7
Inner steps                                    7
Linesearch steps                              22
Time of the minimization step             1.41 s
  - factorizations in the step            0.23 s
************************************************
 
************* Start of outer step   3 **********
object(x_  0) =   6.0327948131391089E+01
||grad(x)||_2 =   1.0074974306692416E+01
        --- start of inner iter ---
 
Reusing ordering
Chol fact OK in 0.040000s, total 0.040000s, no pert=0, pert=0.0000e+00, nnz=140619 (dim 3420x3420)
LS (pen): -1.1271e+01, 6 steps, Step width: 0.031250
 
object(x_  1) =   5.9981283139815439E+01
||grad(x)||_2 =   9.7601070509168899E+00
        --- end of   1 in. iter ---

Reusing ordering
Chol fact OK in 0.030000s, total 0.030000s, no pert=0, pert=0.0000e+00, nnz=140619 (dim 3420x3420)
LS (pen): -1.0469e+01, 5 steps, Step width: 0.062500
 
object(x_  2) =   5.9347541131046761E+01
||grad(x)||_2 =   9.1500119574459990E+00
        --- end of   2 in. iter ---

Reusing ordering
Chol fact OK in 0.040000s, total 0.040000s, no pert=0, pert=0.0000e+00, nnz=140619 (dim 3420x3420)
LS (pen): -9.1063e+00, 4 steps, Step width: 0.125000
 
object(x_  3) =   5.8281204888217992E+01
||grad(x)||_2 =   8.0061135770235126E+00
        --- end of   3 in. iter ---

Reusing ordering
Chol fact OK in 0.040000s, total 0.040000s, no pert=0, pert=0.0000e+00, nnz=140619 (dim 3420x3420)
LS (pen): -6.8610e+00, 3 steps, Step width: 0.250000
 
object(x_  4) =   5.6781076918417313E+01
||grad(x)||_2 =   6.0054444535838929E+00
        --- end of   4 in. iter ---

Reusing ordering
Chol fact OK in 0.120000s, total 0.120000s, no pert=0, pert=0.0000e+00, nnz=140619 (dim 3420x3420)
LS (pen): -3.8357e+00, 2 steps, Step width: 0.500000
 
object(x_  5) =   5.5343338337233938E+01
||grad(x)||_2 =   3.0110853233527468E+00
        --- end of   5 in. iter ---

Reusing ordering
Chol fact OK in 0.060000s, total 0.060000s, no pert=0, pert=0.0000e+00, nnz=140619 (dim 3420x3420)
LS (pen): -9.5755e-01, 1 steps, Step width: 1.000000
 
object(x_  6) =   5.4864145228947258E+01
||grad(x)||_2 =   3.5648577340338272E-01
        --- end of   6 in. iter ---

Reusing ordering
Chol fact OK in 0.030000s, total 0.030000s, no pert=0, pert=0.0000e+00, nnz=140619 (dim 3420x3420)
LS (pen): -3.6356e-03, 1 steps, Step width: 1.000000
 
object(x_  7) =   5.4861654605091708E+01
||grad(x)||_2 =   2.2200600377790383E-01
        --- end of   7 in. iter ---

Reusing ordering
Chol fact OK in 0.030000s, total 0.030000s, no pert=0, pert=0.0000e+00, nnz=140619 (dim 3420x3420)
LS (pen): -3.5128e-03, 1 steps, Step width: 1.000000
 
object(x_  8) =   5.4859305182791189E+01
||grad(x)||_2 =   1.7555632105224075E-01
        --- end of   8 in. iter ---

Reusing ordering
Chol fact OK in 0.030000s, total 0.030000s, no pert=0, pert=0.0000e+00, nnz=140619 (dim 3420x3420)
LS (pen): -3.0545e-03, 1 steps, Step width: 1.000000
 
object(x_  9) =   5.4857266717929292E+01
||grad(x)||_2 =   1.3826111341611513E-01
        --- end of   9 in. iter ---

Reusing ordering
Chol fact OK in 0.020000s, total 0.030000s, no pert=0, pert=0.0000e+00, nnz=140619 (dim 3420x3420)
LS (pen): -2.5589e-03, 1 steps, Step width: 1.000000
 
object(x_ 10) =   5.4855562775525371E+01
||grad(x)||_2 =   1.0378851759383260E-01
        --- end of  10 in. iter ---

Reusing ordering
Chol fact OK in 0.030000s, total 0.030000s, no pert=0, pert=0.0000e+00, nnz=140619 (dim 3420x3420)
LS (pen): -2.0368e-03, 1 steps, Step width: 1.000000
 
object(x_ 11) =   5.4854211067642247E+01
||grad(x)||_2 =   7.3319716766491252E-02
        --- end of  11 in. iter ---

Reusing ordering
Chol fact OK in 0.190000s, total 0.200000s, no pert=0, pert=0.0000e+00, nnz=140619 (dim 3420x3420)
LS (pen): -1.4975e-03, 1 steps, Step width: 1.000000
 
object(x_ 12) =   5.4853225220010792E+01
||grad(x)||_2 =   4.7256977477817590E-02
        --- end of  12 in. iter ---

Reusing ordering
Chol fact OK in 0.060000s, total 0.060000s, no pert=0, pert=0.0000e+00, nnz=140619 (dim 3420x3420)
LS (pen): -9.5788e-04, 1 steps, Step width: 1.000000
 
object(x_ 13) =   5.4852604864885890E+01
||grad(x)||_2 =   2.6556071478968379E-02
        --- end of  13 in. iter ---

Reusing ordering
Chol fact OK in 0.070000s, total 0.070000s, no pert=0, pert=0.0000e+00, nnz=140619 (dim 3420x3420)
LS (pen): -4.7545e-04, 1 steps, Step width: 1.000000
 
object(x_ 14) =   5.4852307134550244E+01
||grad(x)||_2 =   1.1918134606924711E-02
        --- end of  14 in. iter ---

Reusing ordering
Chol fact OK in 0.030000s, total 0.030000s, no pert=0, pert=0.0000e+00, nnz=140619 (dim 3420x3420)
LS (pen): -1.4467e-04, 1 steps, Step width: 1.000000
 
object(x_ 15) =   5.4852222061542491E+01
||grad(x)||_2 =   3.5454611691646456E-03
        --- end of  15 in. iter ---

Unconstr min OK
************ Result of outer step   3 **********
Objective                 5.0602204725392397E+01
Augmented Lagrangian      5.4852222061542491E+01
|f(x) - f(x_old)|         1.3982688087823114E+01
|f(x) - Lagr(x)|          4.2500173361500941E+00
Grad augm. lagr.          3.5454611691646456E-03
Feasibility (max)         1.0446613899602948E-01
Feasibility eqx                                 
Feasibility ineq          1.0446613899602948E-01
Feasibility box                                 
Feasibility m.ineq        5.4426113956477819E-03
Complementarity           2.4878458831039763E-01
Minimal penalty           4.0376395722461447E-02
Newton steps                                  15
Inner steps                                   15
Linesearch steps                              30
Time of the minimization step             4.31 s
  - factorizations in the step            0.82 s
************************************************
 
************* Start of outer step   4 **********
object(x_  0) =   5.6307178236181876E+01
||grad(x)||_2 =   4.4549289780769321E+00
        --- start of inner iter ---
 
Reusing ordering
Chol fact OK in 0.040000s, total 0.040000s, no pert=0, pert=0.0000e+00, nnz=140619 (dim 3420x3420)
LS (pen): -1.5310e+00, 5 steps, Step width: 0.062500
 
object(x_  1) =   5.6214527401070306E+01
||grad(x)||_2 =   4.1764256983529862E+00
        --- end of   1 in. iter ---

Reusing ordering
Chol fact OK in 0.040000s, total 0.040000s, no pert=0, pert=0.0000e+00, nnz=140619 (dim 3420x3420)
LS (pen): -1.3128e+00, 4 steps, Step width: 0.125000
 
object(x_  2) =   5.6061067827859276E+01
||grad(x)||_2 =   3.6572064577511201E+00
        --- end of   2 in. iter ---

Reusing ordering
Chol fact OK in 0.020000s, total 0.020000s, no pert=0, pert=0.0000e+00, nnz=140619 (dim 3420x3420)
LS (pen): -9.6717e-01, 5 steps, Step width: 0.062500
 
object(x_  3) =   5.6002509118601374E+01
||grad(x)||_2 =   3.4289320707737714E+00
        --- end of   3 in. iter ---

Reusing ordering
Chol fact OK in 0.020000s, total 0.020000s, no pert=0, pert=0.0000e+00, nnz=140619 (dim 3420x3420)
LS (pen): -8.4996e-01, 5 steps, Step width: 0.062500
 
object(x_  4) =   5.5951047102330158E+01
||grad(x)||_2 =   3.2149353485079479E+00
        --- end of   4 in. iter ---

Reusing ordering
Chol fact OK in 0.040000s, total 0.040000s, no pert=0, pert=0.0000e+00, nnz=140619 (dim 3420x3420)
LS (pen): -7.4737e-01, 3 steps, Step width: 0.250000
 
object(x_  5) =   5.5787650697391975E+01
||grad(x)||_2 =   2.4225989663964880E+00
        --- end of   5 in. iter ---

Reusing ordering
Chol fact OK in 0.030000s, total 0.030000s, no pert=0, pert=0.0000e+00, nnz=140619 (dim 3420x3420)
LS (pen): -4.1959e-01, 2 steps, Step width: 0.500000
 
object(x_  6) =   5.5630571624758552E+01
||grad(x)||_2 =   1.3667810974242132E+00
        --- end of   6 in. iter ---

Reusing ordering
Chol fact OK in 0.030000s, total 0.030000s, no pert=0, pert=0.0000e+00, nnz=140619 (dim 3420x3420)
LS (pen): -1.0693e-01, 1 steps, Step width: 1.000000
 
object(x_  7) =   5.5576472946607396E+01
||grad(x)||_2 =   7.5287549331020176E-01
        --- end of   7 in. iter ---

Reusing ordering
Chol fact OK in 0.020000s, total 0.020000s, no pert=0, pert=0.0000e+00, nnz=140619 (dim 3420x3420)
LS (pen): -3.5706e-03, 1 steps, Step width: 1.000000
 
object(x_  8) =   5.5574095192408649E+01
||grad(x)||_2 =   5.8025531671610320E-01
        --- end of   8 in. iter ---

Reusing ordering
Chol fact OK in 0.030000s, total 0.030000s, no pert=0, pert=0.0000e+00, nnz=140619 (dim 3420x3420)
LS (pen): -3.1092e-03, 1 steps, Step width: 1.000000
 
object(x_  9) =   5.5572026553155609E+01
||grad(x)||_2 =   5.1194858817231459E-01
        --- end of   9 in. iter ---

Reusing ordering
Chol fact OK in 0.020000s, total 0.020000s, no pert=0, pert=0.0000e+00, nnz=140619 (dim 3420x3420)
LS (pen): -2.7932e-03, 1 steps, Step width: 1.000000
 
object(x_ 10) =   5.5570169335997832E+01
||grad(x)||_2 =   4.4945340886569274E-01
        --- end of  10 in. iter ---

Reusing ordering
Chol fact OK in 0.030000s, total 0.030000s, no pert=0, pert=0.0000e+00, nnz=140619 (dim 3420x3420)
LS (pen): -2.5107e-03, 1 steps, Step width: 1.000000
 
object(x_ 11) =   5.5568488867941966E+01
||grad(x)||_2 =   3.8065307852214542E-01
        --- end of  11 in. iter ---

Reusing ordering
Chol fact OK in 0.030000s, total 0.030000s, no pert=0, pert=0.0000e+00, nnz=140619 (dim 3420x3420)
LS (pen): -2.2820e-03, 1 steps, Step width: 1.000000
 
object(x_ 12) =   5.5566967967861046E+01
||grad(x)||_2 =   3.2281451897654340E-01
        --- end of  12 in. iter ---

Reusing ordering
Chol fact OK in 0.020000s, total 0.020000s, no pert=0, pert=0.0000e+00, nnz=140619 (dim 3420x3420)
LS (pen): -2.0212e-03, 1 steps, Step width: 1.000000
 
object(x_ 13) =   5.5565616833081485E+01
||grad(x)||_2 =   2.6515382932516313E-01
        --- end of  13 in. iter ---

Reusing ordering
Chol fact OK in 0.030000s, total 0.030000s, no pert=0, pert=0.0000e+00, nnz=140619 (dim 3420x3420)
LS (pen): -1.7745e-03, 1 steps, Step width: 1.000000
 
object(x_ 14) =   5.5564433065505376E+01
||grad(x)||_2 =   2.1281655610867856E-01
        --- end of  14 in. iter ---

Reusing ordering
Chol fact OK in 0.030000s, total 0.030000s, no pert=0, pert=0.0000e+00, nnz=140619 (dim 3420x3420)
LS (pen): -1.5092e-03, 1 steps, Step width: 1.000000
 
object(x_ 15) =   5.5563426704065712E+01
||grad(x)||_2 =   1.6435897027584037E-01
        --- end of  15 in. iter ---

Reusing ordering
Chol fact OK in 0.030000s, total 0.030000s, no pert=0, pert=0.0000e+00, nnz=140619 (dim 3420x3420)
LS (pen): -1.2362e-03, 1 steps, Step width: 1.000000
 
object(x_ 16) =   5.5562604820744809E+01
||grad(x)||_2 =   1.2052243011707271E-01
        --- end of  16 in. iter ---

Reusing ordering
Chol fact OK in 0.020000s, total 0.020000s, no pert=0, pert=0.0000e+00, nnz=140619 (dim 3420x3420)
LS (pen): -9.4941e-04, 1 steps, Step width: 1.000000
 
object(x_ 17) =   5.5561976990686567E+01
||grad(x)||_2 =   8.2135970969483232E-02
        --- end of  17 in. iter ---

Reusing ordering
Chol fact OK in 0.040000s, total 0.040000s, no pert=0, pert=0.0000e+00, nnz=140619 (dim 3420x3420)
LS (pen): -6.5652e-04, 1 steps, Step width: 1.000000
 
object(x_ 18) =   5.5561547768359041E+01
||grad(x)||_2 =   5.0117493336826198E-02
        --- end of  18 in. iter ---

Reusing ordering
Chol fact OK in 0.030000s, total 0.030000s, no pert=0, pert=0.0000e+00, nnz=140619 (dim 3420x3420)
LS (pen): -3.7670e-04, 1 steps, Step width: 1.000000
 
object(x_ 19) =   5.5561307238170158E+01
||grad(x)||_2 =   2.5708710190457298E-02
        --- end of  19 in. iter ---

Reusing ordering
Chol fact OK in 0.020000s, total 0.020000s, no pert=0, pert=0.0000e+00, nnz=140619 (dim 3420x3420)
LS (pen): -1.5212e-04, 1 steps, Step width: 1.000000
 
object(x_ 20) =   5.5561214568395187E+01
||grad(x)||_2 =   9.7579066262583666E-03
        --- end of  20 in. iter ---

Unconstr min OK
************ Result of outer step   4 **********
Objective                 5.4622900338426149E+01
Augmented Lagrangian      5.5561214568395187E+01
|f(x) - f(x_old)|         4.0206956130337517E+00
|f(x) - Lagr(x)|          9.3831422996903768E-01
Grad augm. lagr.          9.7579066262583666E-03
Feasibility (max)         5.5751269813304333E-02
Feasibility eqx                                 
Feasibility ineq          5.5751269813304333E-02
Feasibility box                                 
Feasibility m.ineq        4.8902400191842207E-03
Complementarity           1.9198797899482489E-01
Minimal penalty           2.0188197861230724E-02
Newton steps                                  20
Inner steps                                   20
Linesearch steps                              38
Time of the minimization step             3.86 s
  - factorizations in the step            0.57 s
************************************************
 
************* Start of outer step   5 **********
object(x_  0) =   5.5879959436965429E+01
||grad(x)||_2 =   1.6508991376442781E+00
        --- start of inner iter ---
 
Reusing ordering
Chol fact OK in 0.040000s, total 0.040000s, no pert=0, pert=0.0000e+00, nnz=140619 (dim 3420x3420)
LS (pen): -2.3873e-01, 4 steps, Step width: 0.125000
 
object(x_  1) =   5.5851999166903916E+01
||grad(x)||_2 =   1.4488580805897389E+00
        --- end of   1 in. iter ---

Reusing ordering
Chol fact OK in 0.020000s, total 0.020000s, no pert=0, pert=0.0000e+00, nnz=140619 (dim 3420x3420)
LS (pen): -1.8266e-01, 3 steps, Step width: 0.250000
 
object(x_  2) =   5.5812130895019948E+01
||grad(x)||_2 =   1.1343799562443000E+00
        --- end of   2 in. iter ---

Reusing ordering
Chol fact OK in 0.030000s, total 0.030000s, no pert=0, pert=0.0000e+00, nnz=140619 (dim 3420x3420)
LS (pen): -1.0178e-01, 3 steps, Step width: 0.250000
 
object(x_  3) =   5.5789852679942349E+01
||grad(x)||_2 =   8.9010073905745790E-01
        --- end of   3 in. iter ---

Reusing ordering
Chol fact OK in 0.030000s, total 0.030000s, no pert=0, pert=0.0000e+00, nnz=140619 (dim 3420x3420)
LS (pen): -5.9221e-02, 5 steps, Step width: 0.062500
 
object(x_  4) =   5.5786266586147391E+01
||grad(x)||_2 =   8.3714095408140454E-01
        --- end of   4 in. iter ---

Reusing ordering
Chol fact OK in 0.030000s, total 0.030000s, no pert=0, pert=0.0000e+00, nnz=140619 (dim 3420x3420)
LS (pen): -5.2606e-02, 7 steps, Step width: 0.015625
 
object(x_  5) =   5.5785451045602521E+01
||grad(x)||_2 =   8.2423510781905396E-01
        --- end of   5 in. iter ---

Reusing ordering
Chol fact OK in 0.040000s, total 0.040000s, no pert=0, pert=0.0000e+00, nnz=140619 (dim 3420x3420)
LS (pen): -5.0541e-02, 7 steps, Step width: 0.015625
 
object(x_  6) =   5.5784667581396583E+01
||grad(x)||_2 =   8.1153550245625783E-01
        --- end of   6 in. iter ---

Reusing ordering
Chol fact OK in 0.060000s, total 0.060000s, no pert=0, pert=0.0000e+00, nnz=140619 (dim 3420x3420)
LS (pen): -4.8428e-02, 5 steps, Step width: 0.062500
 
object(x_  7) =   5.5781735427707844E+01
||grad(x)||_2 =   7.6366949462323874E-01
        --- end of   7 in. iter ---

Reusing ordering
Chol fact OK in 0.020000s, total 0.020000s, no pert=0, pert=0.0000e+00, nnz=140619 (dim 3420x3420)
LS (pen): -4.3228e-02, 2 steps, Step width: 0.500000
 
object(x_  8) =   5.5765645162534248E+01
||grad(x)||_2 =   8.3192702049574652E-01
        --- end of   8 in. iter ---

Reusing ordering
Chol fact OK in 0.020000s, total 0.020000s, no pert=0, pert=0.0000e+00, nnz=140619 (dim 3420x3420)
LS (pen): -1.2334e-02, 1 steps, Step width: 1.000000
 
object(x_  9) =   5.5759095756487127E+01
||grad(x)||_2 =   9.4657530178244231E-01
        --- end of   9 in. iter ---

Reusing ordering
Chol fact OK in 0.030000s, total 0.030000s, no pert=0, pert=0.0000e+00, nnz=140619 (dim 3420x3420)
LS (pen): -2.3491e-03, 1 steps, Step width: 1.000000
 
object(x_ 10) =   5.5757521144519224E+01
||grad(x)||_2 =   7.2525997729663949E-01
        --- end of  10 in. iter ---

Reusing ordering
Chol fact OK in 0.030000s, total 0.030000s, no pert=0, pert=0.0000e+00, nnz=140619 (dim 3420x3420)
LS (pen): -2.1886e-03, 1 steps, Step width: 1.000000
 
object(x_ 11) =   5.5756060911275128E+01
||grad(x)||_2 =   6.2386173241493781E-01
        --- end of  11 in. iter ---

Reusing ordering
Chol fact OK in 0.030000s, total 0.040000s, no pert=0, pert=0.0000e+00, nnz=140619 (dim 3420x3420)
LS (pen): -1.9816e-03, 1 steps, Step width: 1.000000
 
object(x_ 12) =   5.5754752355240917E+01
||grad(x)||_2 =   5.4620784421330137E-01
        --- end of  12 in. iter ---

Reusing ordering
Chol fact OK in 0.040000s, total 0.040000s, no pert=0, pert=0.0000e+00, nnz=140619 (dim 3420x3420)
LS (pen): -1.7312e-03, 1 steps, Step width: 1.000000
 
object(x_ 13) =   5.5753592874737841E+01
||grad(x)||_2 =   4.4883525790640777E-01
        --- end of  13 in. iter ---

Reusing ordering
Chol fact OK in 0.030000s, total 0.030000s, no pert=0, pert=0.0000e+00, nnz=140619 (dim 3420x3420)
LS (pen): -1.5578e-03, 1 steps, Step width: 1.000000
 
object(x_ 14) =   5.5752558967734842E+01
||grad(x)||_2 =   3.7366940845957247E-01
        --- end of  14 in. iter ---

Reusing ordering
Chol fact OK in 0.040000s, total 0.040000s, no pert=0, pert=0.0000e+00, nnz=140619 (dim 3420x3420)
LS (pen): -1.3405e-03, 1 steps, Step width: 1.000000
 
object(x_ 15) =   5.5751662655444392E+01
||grad(x)||_2 =   2.9694062248385805E-01
        --- end of  15 in. iter ---

Reusing ordering
Chol fact OK in 0.030000s, total 0.030000s, no pert=0, pert=0.0000e+00, nnz=140619 (dim 3420x3420)
LS (pen): -1.1501e-03, 1 steps, Step width: 1.000000
 
object(x_ 16) =   5.5750897441610512E+01
||grad(x)||_2 =   2.2923220526941349E-01
        --- end of  16 in. iter ---

Reusing ordering
Chol fact OK in 0.030000s, total 0.030000s, no pert=0, pert=0.0000e+00, nnz=140619 (dim 3420x3420)
LS (pen): -9.3672e-04, 1 steps, Step width: 1.000000
 
object(x_ 17) =   5.5750274317009385E+01
||grad(x)||_2 =   1.6830315568121254E-01
        --- end of  17 in. iter ---

Reusing ordering
Chol fact OK in 0.030000s, total 0.030000s, no pert=0, pert=0.0000e+00, nnz=140619 (dim 3420x3420)
LS (pen): -7.2306e-04, 1 steps, Step width: 1.000000
 
object(x_ 18) =   5.5749796183129000E+01
||grad(x)||_2 =   1.1472384967462525E-01
        --- end of  18 in. iter ---

Reusing ordering
Chol fact OK in 0.030000s, total 0.030000s, no pert=0, pert=0.0000e+00, nnz=140619 (dim 3420x3420)
LS (pen): -5.0314e-04, 1 steps, Step width: 1.000000
 
object(x_ 19) =   5.5749466914018321E+01
||grad(x)||_2 =   7.0517499540217340E-02
        --- end of  19 in. iter ---

Reusing ordering
Chol fact OK in 0.030000s, total 0.030000s, no pert=0, pert=0.0000e+00, nnz=140619 (dim 3420x3420)
LS (pen): -2.9344e-04, 1 steps, Step width: 1.000000
 
object(x_ 20) =   5.5749279124558747E+01
||grad(x)||_2 =   3.6603917794300674E-02
        --- end of  20 in. iter ---

Reusing ordering
Chol fact OK in 0.030000s, total 0.030000s, no pert=0, pert=0.0000e+00, nnz=140619 (dim 3420x3420)
LS (pen): -1.2254e-04, 1 steps, Step width: 1.000000
 
object(x_ 21) =   5.5749204132409830E+01
||grad(x)||_2 =   1.4264215812652609E-02
        --- end of  21 in. iter ---

Reusing ordering
Chol fact OK in 0.040000s, total 0.040000s, no pert=0, pert=0.0000e+00, nnz=140619 (dim 3420x3420)
LS (pen): -2.6518e-05, 1 steps, Step width: 1.000000
 
object(x_ 22) =   5.5749189110810320E+01
||grad(x)||_2 =   3.1520243413833524E-03
        --- end of  22 in. iter ---

Unconstr min OK
************ Result of outer step   5 **********
Objective                 5.5438635079182248E+01
Augmented Lagrangian      5.5749189110810320E+01
|f(x) - f(x_old)|         8.1573474075609909E-01
|f(x) - Lagr(x)|          3.1055403162807238E-01
Grad augm. lagr.          3.1520243413833524E-03
Feasibility (max)         3.9869232879778574E-02
Feasibility eqx                                 
Feasibility ineq          3.9869232879778574E-02
Feasibility box                                 
Feasibility m.ineq        1.8973290637983964E-03
Complementarity           1.1701844405121060E-01
Minimal penalty           1.0094098930615362E-02
Newton steps                                  22
Inner steps                                   22
Linesearch steps                              50
Time of the minimization step             4.56 s
  - factorizations in the step            0.71 s
************************************************
 
************* Start of outer step   6 **********
object(x_  0) =   5.5943494638574755E+01
||grad(x)||_2 =   1.4937092474201368E+00
        --- start of inner iter ---
 
Reusing ordering
Chol fact OK in 0.020000s, total 0.020000s, no pert=0, pert=0.0000e+00, nnz=140619 (dim 3420x3420)
LS (pen): -1.0971e-01, 3 steps, Step width: 0.250000
 
object(x_  1) =   5.5919812208278529E+01
||grad(x)||_2 =   1.2459317158782521E+00
        --- end of   1 in. iter ---

Reusing ordering
Chol fact OK in 0.030000s, total 0.030000s, no pert=0, pert=0.0000e+00, nnz=140619 (dim 3420x3420)
LS (pen): -5.8288e-02, 1 steps, Step width: 1.000000
 
object(x_  2) =   5.5890734708345633E+01
||grad(x)||_2 =   9.7031075372388709E-01
        --- end of   2 in. iter ---

Reusing ordering
Chol fact OK in 0.030000s, total 0.030000s, no pert=0, pert=0.0000e+00, nnz=140619 (dim 3420x3420)
LS (pen): -1.2946e-03, 1 steps, Step width: 1.000000
 
object(x_  3) =   5.5889972047513730E+01
||grad(x)||_2 =   6.9099876152870987E-01
        --- end of   3 in. iter ---

Reusing ordering
Chol fact OK in 0.030000s, total 0.030000s, no pert=0, pert=0.0000e+00, nnz=140619 (dim 3420x3420)
LS (pen): -9.7729e-04, 1 steps, Step width: 1.000000
 
object(x_  4) =   5.5889324099897074E+01
||grad(x)||_2 =   4.4994962519142295E-01
        --- end of   4 in. iter ---

Reusing ordering
Chol fact OK in 0.040000s, total 0.040000s, no pert=0, pert=0.0000e+00, nnz=140619 (dim 3420x3420)
LS (pen): -8.1942e-04, 1 steps, Step width: 1.000000
 
object(x_  5) =   5.5888781297440808E+01
||grad(x)||_2 =   3.3998920151495604E-01
        --- end of   5 in. iter ---

Reusing ordering
Chol fact OK in 0.040000s, total 0.040000s, no pert=0, pert=0.0000e+00, nnz=140619 (dim 3420x3420)
LS (pen): -6.5885e-04, 1 steps, Step width: 1.000000
 
object(x_  6) =   5.5888342849172794E+01
||grad(x)||_2 =   2.4933261075311755E-01
        --- end of   6 in. iter ---

Reusing ordering
Chol fact OK in 0.020000s, total 0.020000s, no pert=0, pert=0.0000e+00, nnz=140619 (dim 3420x3420)
LS (pen): -5.1150e-04, 1 steps, Step width: 1.000000
 
object(x_  7) =   5.5888005371515113E+01
||grad(x)||_2 =   1.7359685280840653E-01
        --- end of   7 in. iter ---

Reusing ordering
Chol fact OK in 0.030000s, total 0.030000s, no pert=0, pert=0.0000e+00, nnz=140619 (dim 3420x3420)
LS (pen): -3.6104e-04, 1 steps, Step width: 1.000000
 
object(x_  8) =   5.5887768231507927E+01
||grad(x)||_2 =   1.1069801751782662E-01
        --- end of   8 in. iter ---

Reusing ordering
Chol fact OK in 0.030000s, total 0.030000s, no pert=0, pert=0.0000e+00, nnz=140619 (dim 3420x3420)
LS (pen): -2.2606e-04, 1 steps, Step width: 1.000000
 
object(x_  9) =   5.5887622098260529E+01
||grad(x)||_2 =   6.1343081494979038E-02
        --- end of   9 in. iter ---

Reusing ordering
Chol fact OK in 0.030000s, total 0.030000s, no pert=0, pert=0.0000e+00, nnz=140619 (dim 3420x3420)
LS (pen): -1.1057e-04, 1 steps, Step width: 1.000000
 
object(x_ 10) =   5.5887552925203146E+01
||grad(x)||_2 =   2.7259381293333561E-02
        --- end of  10 in. iter ---

Reusing ordering
Chol fact OK in 0.020000s, total 0.020000s, no pert=0, pert=0.0000e+00, nnz=140619 (dim 3420x3420)
LS (pen): -3.3274e-05, 1 steps, Step width: 1.000000
 
object(x_ 11) =   5.5887533377587921E+01
||grad(x)||_2 =   7.9743705237627915E-03
        --- end of  11 in. iter ---

Unconstr min OK
************ Result of outer step   6 **********
Objective                 5.5670358661870381E+01
Augmented Lagrangian      5.5887533377587921E+01
|f(x) - f(x_old)|         2.3172358268813298E-01
|f(x) - Lagr(x)|          2.1717471571754032E-01
Grad augm. lagr.          7.9743705237627915E-03
Feasibility (max)         3.3660569881331960E-02
Feasibility eqx                                 
Feasibility ineq          3.3660569881331960E-02
Feasibility box                                 
Feasibility m.ineq        2.4702731997440137E-03
Complementarity           2.0521226053182740E-01
Minimal penalty           5.0470494653076809E-03
Newton steps                                  11
Inner steps                                   11
Linesearch steps                              13
Time of the minimization step             2.08 s
  - factorizations in the step            0.32 s
************************************************
 
************* Start of outer step   7 **********
object(x_  0) =   5.6186216485495201E+01
||grad(x)||_2 =   6.7063086223139514E+00
        --- start of inner iter ---
 
Reusing ordering
Chol fact OK in 0.020000s, total 0.020000s, no pert=0, pert=0.0000e+00, nnz=140619 (dim 3420x3420)
LS (pen): -2.0636e-01, 2 steps, Step width: 0.500000
 
object(x_  1) =   5.6108842986797711E+01
||grad(x)||_2 =   3.3907387737598391E+00
        --- end of   1 in. iter ---

Reusing ordering
Chol fact OK in 0.020000s, total 0.020000s, no pert=0, pert=0.0000e+00, nnz=140619 (dim 3420x3420)
LS (pen): -5.1702e-02, 1 steps, Step width: 1.000000
 
object(x_  2) =   5.6082957310534091E+01
||grad(x)||_2 =   3.8112695379853045E-01
        --- end of   2 in. iter ---

Reusing ordering
Chol fact OK in 0.020000s, total 0.020000s, no pert=0, pert=0.0000e+00, nnz=140619 (dim 3420x3420)
LS (pen): -1.5974e-04, 1 steps, Step width: 1.000000
 
object(x_  3) =   5.6082853284810248E+01
||grad(x)||_2 =   1.7387981595125668E-01
        --- end of   3 in. iter ---

Reusing ordering
Chol fact OK in 0.020000s, total 0.020000s, no pert=0, pert=0.0000e+00, nnz=140619 (dim 3420x3420)
LS (pen): -8.2403e-05, 1 steps, Step width: 1.000000
 
object(x_  4) =   5.6082801232585851E+01
||grad(x)||_2 =   7.7784299486204800E-02
        --- end of   4 in. iter ---

Reusing ordering
Chol fact OK in 0.030000s, total 0.030000s, no pert=0, pert=0.0000e+00, nnz=140619 (dim 3420x3420)
LS (pen): -2.9331e-05, 1 steps, Step width: 1.000000
 
object(x_  5) =   5.6082783361088239E+01
||grad(x)||_2 =   3.3219146928539854E-02
        --- end of   5 in. iter ---

Reusing ordering
Chol fact OK in 0.030000s, total 0.030000s, no pert=0, pert=0.0000e+00, nnz=140619 (dim 3420x3420)
LS (pen): -7.7564e-06, 1 steps, Step width: 1.000000
 
object(x_  6) =   5.6082778523483505E+01
||grad(x)||_2 =   1.4426412141905180E-02
        --- end of   6 in. iter ---

Reusing ordering
Chol fact OK in 0.030000s, total 0.030000s, no pert=0, pert=0.0000e+00, nnz=140619 (dim 3420x3420)
LS (pen): -3.3906e-06, 1 steps, Step width: 1.000000
 
object(x_  7) =   5.6082776303553402E+01
||grad(x)||_2 =   6.3634358163871876E-03
        --- end of   7 in. iter ---

Unconstr min OK
************ Result of outer step   7 **********
Objective                 5.5870205893984760E+01
Augmented Lagrangian      5.6082776303553402E+01
|f(x) - f(x_old)|         1.9984723211437938E-01
|f(x) - Lagr(x)|          2.1257040956864159E-01
Grad augm. lagr.          6.3634358163871876E-03
Feasibility (max)         1.9402544262064406E-02
Feasibility eqx                                 
Feasibility ineq          1.9402544262064406E-02
Feasibility box                                 
Feasibility m.ineq        1.8281457886274190E-03
Complementarity           2.6517354059676362E-01
Minimal penalty           2.5235247326538405E-03
Newton steps                                   7
Inner steps                                    7
Linesearch steps                               8
Time of the minimization step             1.23 s
  - factorizations in the step            0.17 s
************************************************
 
************* Start of outer step   8 **********
object(x_  0) =   5.6497610047626921E+01
||grad(x)||_2 =   1.8797047727731897E+01
        --- start of inner iter ---
 
Reusing ordering
Chol fact OK in 0.030000s, total 0.030000s, no pert=0, pert=0.0000e+00, nnz=140619 (dim 3420x3420)
LS (pen): -5.1085e-01, 1 steps, Step width: 1.000000
 
object(x_  1) =   5.6242208701389345E+01
||grad(x)||_2 =   4.2995179750164653E-01
        --- end of   1 in. iter ---

Reusing ordering
Chol fact OK in 0.030000s, total 0.030000s, no pert=0, pert=0.0000e+00, nnz=140619 (dim 3420x3420)
LS (pen): -5.6153e-05, 1 steps, Step width: 1.000000
 
object(x_  2) =   5.6242172214629022E+01
||grad(x)||_2 =   1.9020235782307329E-01
        --- end of   2 in. iter ---

Reusing ordering
Chol fact OK in 0.030000s, total 0.030000s, no pert=0, pert=0.0000e+00, nnz=140619 (dim 3420x3420)
LS (pen): -3.1796e-05, 1 steps, Step width: 1.000000
 
object(x_  3) =   5.6242151114266512E+01
||grad(x)||_2 =   8.4361423437138108E-02
        --- end of   3 in. iter ---

Reusing ordering
Chol fact OK in 0.080000s, total 0.090000s, no pert=0, pert=0.0000e+00, nnz=140619 (dim 3420x3420)
LS (pen): -2.0672e-05, 1 steps, Step width: 1.000000
 
object(x_  4) =   5.6242137346666219E+01
||grad(x)||_2 =   3.7362807765530227E-02
        --- end of   4 in. iter ---

Reusing ordering
Chol fact OK in 0.030000s, total 0.030000s, no pert=0, pert=0.0000e+00, nnz=140619 (dim 3420x3420)
LS (pen): -1.3599e-05, 1 steps, Step width: 1.000000
 
object(x_  5) =   5.6242128308455698E+01
||grad(x)||_2 =   1.6454130482696179E-02
        --- end of   5 in. iter ---

Reusing ordering
Chol fact OK in 0.030000s, total 0.040000s, no pert=0, pert=0.0000e+00, nnz=140619 (dim 3420x3420)
LS (pen): -8.6873e-06, 1 steps, Step width: 1.000000
 
object(x_  6) =   5.6242122566283250E+01
||grad(x)||_2 =   7.1308566909884623E-03
        --- end of   6 in. iter ---

Unconstr min OK
************ Result of outer step   8 **********
Objective                 5.6149264682466914E+01
Augmented Lagrangian      5.6242122566283250E+01
|f(x) - f(x_old)|         2.7905878848215337E-01
|f(x) - Lagr(x)|          9.2857883816336084E-02
Grad augm. lagr.          7.1308566909884623E-03
Feasibility (max)         4.5624373082077205E-03
Feasibility eqx                                 
Feasibility ineq          4.5624373082077205E-03
Feasibility box                                 
Feasibility m.ineq        1.9446268773294336E-04
Complementarity           9.8769167118854057E-02
Minimal penalty           1.9912187343596711E-03
Newton steps                                   6
Inner steps                                    6
Linesearch steps                               6
Time of the minimization step             1.19 s
  - factorizations in the step            0.23 s
************************************************
 
************* Start of outer step   9 **********
object(x_  0) =   5.6327562286257056E+01
||grad(x)||_2 =   9.3945913436036985E+00
        --- start of inner iter ---
 
Reusing ordering
Chol fact OK in 0.060000s, total 0.060000s, no pert=0, pert=0.0000e+00, nnz=140619 (dim 3420x3420)
LS (pen): -1.1374e-01, 1 steps, Step width: 1.000000
 
object(x_  1) =   5.6270726757509813E+01
||grad(x)||_2 =   4.3864773193454804E-02
        --- end of   1 in. iter ---

Reusing ordering
Chol fact OK in 0.030000s, total 0.030000s, no pert=0, pert=0.0000e+00, nnz=140619 (dim 3420x3420)
LS (pen): -3.9005e-06, 1 steps, Step width: 1.000000
 
object(x_  2) =   5.6270724467926435E+01
||grad(x)||_2 =   2.0756033708150398E-03
        --- end of   2 in. iter ---

Unconstr min OK
************ Result of outer step   9 **********
Objective                 5.6255411289698984E+01
Augmented Lagrangian      5.6270724467926435E+01
|f(x) - f(x_old)|         1.0614660723206981E-01
|f(x) - Lagr(x)|          1.5313178227451374E-02
Grad augm. lagr.          2.0756033708150398E-03
Feasibility (max)         1.3746593343009930E-03
Feasibility eqx                                 
Feasibility ineq          1.3746593343009930E-03
Feasibility box                                 
Feasibility m.ineq        1.2535618329052999E-05
Complementarity           9.8056611660847816E-03
Minimal penalty           9.9560936717983553E-04
Newton steps                                   2
Inner steps                                    2
Linesearch steps                               2
Time of the minimization step              0.6 s
  - factorizations in the step            0.09 s
************************************************
 
************* Start of outer step  10 **********
object(x_  0) =   5.6275561756219282E+01
||grad(x)||_2 =   9.1551238329609164E-01
        --- start of inner iter ---
 
Reusing ordering
Chol fact OK in 0.030000s, total 0.030000s, no pert=0, pert=0.0000e+00, nnz=140619 (dim 3420x3420)
LS (pen): -5.8079e-03, 1 steps, Step width: 1.000000
 
object(x_  1) =   5.6272671182354465E+01
||grad(x)||_2 =   2.9805695579197169E-02
        --- end of   1 in. iter ---

Reusing ordering
Chol fact OK in 0.030000s, total 0.030000s, no pert=0, pert=0.0000e+00, nnz=140619 (dim 3420x3420)
LS (pen): -3.3453e-07, 1 steps, Step width: 1.000000
 
object(x_  2) =   5.6272671014915943E+01
||grad(x)||_2 =   3.4007275854927681E-05
        --- end of   2 in. iter ---

Unconstr min OK
************ Result of outer step  10 **********
Objective                 5.6270757860615667E+01
Augmented Lagrangian      5.6272671014915943E+01
|f(x) - f(x_old)|         1.5346570916683788E-02
|f(x) - Lagr(x)|          1.9131543002757212E-03
Grad augm. lagr.          3.4007275854927681E-05
Feasibility (max)         2.6761861510785252E-04
Feasibility eqx                                 
Feasibility ineq          2.6761861510785252E-04
Feasibility box                                 
Feasibility m.ineq        2.0543301136178317E-07
Complementarity           1.2823521919029159E-03
Minimal penalty           4.9780468358991776E-04
Newton steps                                   2
Inner steps                                    2
Linesearch steps                               2
Time of the minimization step             0.37 s
  - factorizations in the step            0.06 s
************************************************
 
************* Start of outer step  11 **********
object(x_  0) =   5.6273014375851389E+01
||grad(x)||_2 =   1.7640463044404106E-01
        --- start of inner iter ---
 
Reusing ordering
Chol fact OK in 0.030000s, total 0.030000s, no pert=0, pert=0.0000e+00, nnz=140619 (dim 3420x3420)
LS (pen): -4.2058e-04, 3 steps, Step width: 0.250000
 
object(x_  1) =   5.6272922489655635E+01
||grad(x)||_2 =   1.3230511620934066E-01
        --- end of   1 in. iter ---

Reusing ordering
Chol fact OK in 0.020000s, total 0.020000s, no pert=0, pert=0.0000e+00, nnz=140619 (dim 3420x3420)
LS (pen): -2.3585e-04, 1 steps, Step width: 1.000000
 
object(x_  2) =   5.6272804558402591E+01
||grad(x)||_2 =   2.5140874646246340E-04
        --- end of   2 in. iter ---

Unconstr min OK
************ Result of outer step  11 **********
Objective                 5.6272614373709231E+01
Augmented Lagrangian      5.6272804558402591E+01
|f(x) - f(x_old)|         1.8565130935641605E-03
|f(x) - Lagr(x)|          1.9018469335918553E-04
Grad augm. lagr.          2.5140874646246340E-04
Feasibility (max)         3.5590776205166903E-05
Feasibility eqx                                 
Feasibility ineq          3.5590776205166903E-05
Feasibility box                                 
Feasibility m.ineq        7.5432086840205919E-08
Complementarity           1.2759438586996036E-04
Minimal penalty           2.4890234179495888E-04
Newton steps                                   2
Inner steps                                    2
Linesearch steps                               4
Time of the minimization step             0.34 s
  - factorizations in the step            0.05 s
************************************************
 
************* Start of outer step  12 **********
object(x_  0) =   5.6272814613707851E+01
||grad(x)||_2 =   2.0829438315247622E-02
        --- start of inner iter ---
 
Reusing ordering
Chol fact OK in 0.030000s, total 0.030000s, no pert=0, pert=0.0000e+00, nnz=140619 (dim 3420x3420)
LS (pen): -1.2548e-05, 1 steps, Step width: 1.000000
 
object(x_  1) =   5.6272808339486438E+01
||grad(x)||_2 =   3.1646109478002830E-05
        --- end of   1 in. iter ---

Unconstr min OK
************ Result of outer step  12 **********
Objective                 5.6272796460740395E+01
Augmented Lagrangian      5.6272808339486438E+01
|f(x) - f(x_old)|         1.8208703116329161E-04
|f(x) - Lagr(x)|          1.1878746043691990E-05
Grad augm. lagr.          3.1646109478002830E-05
Feasibility (max)         3.3787753222713578E-06
Feasibility eqx                                 
Feasibility ineq          3.3787753222713578E-06
Feasibility box                                 
Feasibility m.ineq        5.0000000000000001E-09
Complementarity           6.9898669546239736E-06
Minimal penalty           1.2445117089747944E-04
Newton steps                                   1
Inner steps                                    1
Linesearch steps                               1
Time of the minimization step             0.19 s
  - factorizations in the step            0.03 s
************************************************
 
************* Start of outer step  13 **********
object(x_  0) =   5.6272808457057415E+01
||grad(x)||_2 =   2.6885240162009497E-03
        --- start of inner iter ---
 
Reusing ordering
Chol fact OK in 0.030000s, total 0.030000s, no pert=0, pert=0.0000e+00, nnz=140619 (dim 3420x3420)
LS (pen): -1.4964e-07, 1 steps, Step width: 1.000000
 
object(x_  1) =   5.6272808382750213E+01
||grad(x)||_2 =   1.1180143601632574E-04
        --- end of   1 in. iter ---

Unconstr min OK
************ Result of outer step  13 **********
Objective                 5.6272807945940137E+01
Augmented Lagrangian      5.6272808382750213E+01
|f(x) - f(x_old)|         1.1485199742367058E-05
|f(x) - Lagr(x)|          4.3681007610985034E-07
Grad augm. lagr.          1.1180143601632574E-04
Feasibility (max)         2.0762028377068521E-06
Feasibility eqx                                 
Feasibility ineq          1.6765971214839432E-07
Feasibility box                                 
Feasibility m.ineq        2.0762028377068521E-06
Complementarity           3.4708548707823081E-07
Minimal penalty           6.2225585448739721E-05
Newton steps                                   1
Inner steps                                    1
Linesearch steps                               1
Time of the minimization step             0.18 s
  - factorizations in the step            0.03 s
************************************************
 
************* Start of outer step  14 **********
object(x_  0) =   5.6272808383380706E+01
||grad(x)||_2 =   3.2943661678690015E-04
        --- start of inner iter ---
 
Reusing ordering
Chol fact OK in 0.110000s, total 0.110000s, no pert=0, pert=0.0000e+00, nnz=140619 (dim 3420x3420)
LS (pen): -1.3180e-09, 1 steps, Step width: 1.000000
 
object(x_  1) =   5.6272808382685547E+01
||grad(x)||_2 =   3.5348021612597225E-05
        --- end of   1 in. iter ---

Unconstr min OK
************ Result of outer step  14 **********
Objective                 5.6272808374630216E+01
Augmented Lagrangian      5.6272808382685547E+01
|f(x) - f(x_old)|         4.2869007899071221E-07
|f(x) - Lagr(x)|          8.0553306247566070E-09
Grad augm. lagr.          3.5348021612597225E-05
Feasibility (max)         4.2636225884583752E-09
Feasibility eqx                                 
Feasibility ineq          4.2636225884583752E-09
Feasibility box                                 
Feasibility m.ineq        1.0000000000000000E-10
Complementarity           8.8267669744666852E-09
Minimal penalty           3.1112792724369860E-05
Newton steps                                   1
Inner steps                                    1
Linesearch steps                               1
Time of the minimization step             0.37 s
  - factorizations in the step            0.11 s
************************************************
 
*******************************************************************************
PenLab converged: optimal solution
*******************************************************************************
Objective                 5.6272808374630216E+01
Augmented Lagrangian      5.6272808382685547E+01
Relative precision        1.4314783387260687E-10
Compl. Slackness          8.8267669744666852E-09
Grad augm. lagr.          3.5348021612597225E-05
Feasibility (max)         4.2636225884583752E-09
Feasibility eqx                                 
Feasibility ineq          4.2636225884583752E-09
Feasibility box                                 
Minimal penalty           1.2207031250000000E-04
Newton steps                                 112
Inner steps                                  112
Linesearch steps                             200
Number of evaluations of
   - function values                         214
   - gradient values                         126
   - hessian values                          112
Time statistics
   - total process time                  26.21 s
   - all minimization steps              25.11 s
   - all factorizations                   4.07 s
   - function values evaluation              1 s
   - gradient values evaluation           3.07 s
   - hessian values evaluation           16.49 s
*******************************************************************************
 
