sifdecoder -A pc64.lnx.gfo -st   BIGBANK

 Problem name: BIGBANK

 Double precision version will be formed

 The objective function uses 1 nonlinear group
 
 There are 1112 linear equality constraints
 
 There are 1922 variables bounded from below and above 
 There are 308 fixed variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully
xx pprojparm->cholmod: 1

 Problem: BIGBANK (n = 2230)
walltime at start:     0.000000

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 4.494707e-07 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 4.494707448640967e-07    
Final f                               : -4.205693299537716e+06   

Iterations of gradient projection (GP): 110       
Iterations of active set GP           : 2414      
Function evaluation in main code      : 1         
Function evaluations in GP            : 285       
Function evaluations in active set GP : 4004      
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 248       
Gradient evaluations in active set GP : 3525      


PPROJ run statistics (Version 2.0, May 1, 2018):

No. blocks in multilevel partition of A . 167
Depth of multilevel partition tree ...... 1
Phase 1 iterations ...................... 10
Coordinate ascent iterations ............ 1
    variables freed in coordinate ascent  2
    rows dropped in coordinate ascent ... 0
Gradient ascent iterations .............. 0
    variables freed in gradient ascent .. 0
    rows dropped in gradient ascent ..... 0
Preconditioned CG iterations ............ 0
    variables freed in CG ............... 0
    rows dropped in CG .................. 0
SpaRSA iterations ....................... 1815
    change in column activity ........... 39127
    change in row activity .............. 0
    failures of Armijo step ............. 398
Proximal updates ........................ 1830
Cholesky factorizations ................. 1080
    nonzeros in final factor ............ 6170 99.0% sparse
    rows dropped from L ................. 0
    rows added to L ..................... 0
    rank 1 downdates to L ............... 13424
    rank 1 updates to L ................. 112249
    Size breakdown of the updates ([size]: number of this size):
        updowns [  1]: 4290
        updowns [  2]: 1380
        updowns [  3]: 979
        updowns [  4]: 813
        updowns [  5]: 592
        updowns [  6]: 439
        updowns [  7]: 331
        updowns [  8]: 254
        updowns [  9]: 205
        updowns [ 10]: 170
        updowns [ 11]: 148
        updowns [ 12]: 114
        updowns [ 13]: 122
        updowns [ 14]: 106
        updowns [ 15]: 73
        updowns [ 16]: 77
        updowns [ 17]: 67
        updowns [ 18]: 76
        updowns [ 19]: 68
        updowns [ 20]: 69
        updowns [ 21]: 53
        updowns [ 22]: 52
        updowns [ 23]: 47
        updowns [ 24]: 35
        updowns [ 25]: 32
        updowns [ 26]: 32
        updowns [ 27]: 21
        updowns [ 28]: 20
        updowns [ 29]: 18
        updowns [ 30]: 26
        updowns [ 31]: 19
        updowns [ 32]: 15
        updowns [ 33]: 22
        updowns [ 34]: 24
        updowns [ 35]: 20
        updowns [ 36]: 18
        updowns [ 37]: 12
        updowns [ 38]: 19
        updowns [ 39]: 16
        updowns [ 40]: 11
        updowns [ 41]: 13
        updowns [ 42]: 14
        updowns [ 43]: 9
        updowns [ 44]: 7
        updowns [ 45]: 11
        updowns [ 46]: 9
        updowns [ 47]: 14
        updowns [ 48]: 11
        updowns [ 49]: 12
        updowns [ 50]: 10
        updowns [ 51]: 10
        updowns [ 52]: 6
        updowns [ 53]: 5
        updowns [ 54]: 9
        updowns [ 55]: 4
        updowns [ 56]: 9
        updowns [ 57]: 6
        updowns [ 58]: 9
        updowns [ 59]: 12
        updowns [ 60]: 10
        updowns [ 61]: 6
        updowns [ 62]: 10
        updowns [ 63]: 4
        updowns [ 64]: 7
        updowns [ 65]: 11
        updowns [ 66]: 6
        updowns [ 67]: 5
        updowns [ 68]: 8
        updowns [ 69]: 5
        updowns [ 70]: 8
        updowns [ 71]: 3
        updowns [ 72]: 5
        updowns [ 73]: 6
        updowns [ 74]: 4
        updowns [ 75]: 7
        updowns [ 76]: 5
        updowns [ 77]: 3
        updowns [ 78]: 4
        updowns [ 79]: 5
        updowns [ 80]: 8
        updowns [ 81]: 2
        updowns [ 82]: 6
        updowns [ 83]: 3
        updowns [ 84]: 2
        updowns [ 85]: 5
        updowns [ 86]: 5
        updowns [ 87]: 4
        updowns [ 88]: 1
        updowns [ 89]: 5
        updowns [ 90]: 3
        updowns [ 91]: 3
        updowns [ 92]: 3
        updowns [ 93]: 2
        updowns [ 94]: 3
        updowns [ 95]: 4
        updowns [ 96]: 2
        updowns [ 97]: 3
        updowns [ 98]: 6
        updowns [ 99]: 4
        updowns [100]: 7
        updowns [101]: 6
        updowns [102]: 2
        updowns [104]: 1
        updowns [105]: 1
        updowns [106]: 2
        updowns [107]: 2
        updowns [108]: 2
        updowns [109]: 3
        updowns [110]: 3
        updowns [111]: 3
        updowns [112]: 1
        updowns [113]: 1
        updowns [114]: 2
        updowns [115]: 2
        updowns [117]: 3
        updowns [118]: 4
        updowns [119]: 1
        updowns [120]: 4
        updowns [121]: 3
        updowns [122]: 3
        updowns [124]: 1
        updowns [125]: 2
        updowns [126]: 7
        updowns [127]: 3
        updowns [128]: 4
        updowns [129]: 3
        updowns [130]: 2
        updowns [>=131]: 126
    No. of solves by depth in the multilevel partition tree:
        (deeper <=> further from root of tree <=> fewer flops)
        depth [ 0]: 4551
        depth [ 1]: 548375

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 2.348900e-03
Initialization (includes partition) ..... 8.335662e-02
Phase 1 ................................. 1.120403e-01
Coordinate ascent ....................... 4.482269e-05
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 6.008148e-05
DASA .................................... 2.444405e+00
DASA line search ........................ 5.040255e-01
Check error ............................. 1.958742e-01
Proximal update ......................... 1.380324e-01
Invert permutation ...................... 8.046150e-03
Row modifications of Cholesky factor .... 8.000612e-03
Column modifications of Cholesky factor . 2.542558e-01
Cholesky factorization .................. 2.200615e-01
Partial Cholesky factorization .......... 1.282911e-01
Back solves ............................. 4.261975e-01
Forward solves .......................... 7.804728e-02


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             : -4.205693299537716e+06
sup-norm of gradient:  4.494707448640967e-07
Number of iterations: 11068     
Function evaluations: 20014     
Gradient evaluations: 13159     

!!   BIGBANK   2230     110     285     248   11068   20014   13159    2526    1080     0    4.4947074e-07   -4.2056933e+06    7.465219
 Final f                         = -4.2056933e+06  
 Function value at final x       = -4.2056933e+06  
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   DALLASM

 Problem name: DALLASM

 Double precision version will be formed

 The objective function uses 1 nonlinear group
 
 There are 151 linear equality constraints
 
 There are 196 variables bounded from below and above 
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully
xx pprojparm->cholmod: 1

 Problem: DALLASM (n = 196)
walltime at start:     0.000001

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 9.451431e-07 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 9.451431076668015e-07    
Final f                               : -4.819818819205834e+04   

Iterations of gradient projection (GP): 4         
Iterations of active set GP           : 15        
Function evaluation in main code      : 1         
Function evaluations in GP            : 6         
Function evaluations in active set GP : 15        
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 4         
Gradient evaluations in active set GP : 15        


PPROJ run statistics (Version 2.0, May 1, 2018):

No. blocks in multilevel partition of A . 1
Depth of multilevel partition tree ...... 0
Phase 1 iterations ...................... 5
Coordinate ascent iterations ............ 1
    variables freed in coordinate ascent  2
    rows dropped in coordinate ascent ... 0
Gradient ascent iterations .............. 0
    variables freed in gradient ascent .. 0
    rows dropped in gradient ascent ..... 0
Preconditioned CG iterations ............ 0
    variables freed in CG ............... 0
    rows dropped in CG .................. 0
SpaRSA iterations ....................... 14
    change in column activity ........... 11
    change in row activity .............. 0
    failures of Armijo step ............. 5
Proximal updates ........................ 14
Cholesky factorizations ................. 2
    nonzeros in final factor ............ 504 95.6% sparse
    rows dropped from L ................. 0
    rows added to L ..................... 0
    rank 1 downdates to L ............... 49
    rank 1 updates to L ................. 113
    Size breakdown of the updates ([size]: number of this size):
        updowns [  1]: 42
        updowns [  2]: 11
        updowns [  3]: 5
        updowns [  5]: 2
        updowns [  6]: 5
        updowns [  7]: 3
        updowns [ 10]: 1
        updowns [ 12]: 1
    No. of solves:   65

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 1.180172e-04
Initialization (includes partition) ..... 2.670288e-04
Phase 1 ................................. 3.533363e-04
Coordinate ascent ....................... 7.867813e-06
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 7.152557e-06
DASA .................................... 1.223326e-03
DASA line search ........................ 1.955032e-04
Check error ............................. 2.462864e-04
Proximal update ......................... 1.838207e-04
Invert permutation ...................... 2.074242e-05
Row modifications of Cholesky factor .... 2.741814e-05
Column modifications of Cholesky factor . 2.484322e-04
Cholesky factorization .................. 8.797646e-05
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 1.153946e-04
Forward solves .......................... 5.078316e-05


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             : -4.819818819205230e+04
sup-norm of gradient:  9.451431076668015e-07
Number of iterations: 525       
Function evaluations: 951       
Gradient evaluations: 680       
Subspace iterations: 37        
Number of subspaces: 10        


!!   DALLASM    196       4       6       4     525     951     680      22       2     0    9.4514311e-07   -4.8198188e+04    0.099987
 Final f                         = -4.8198188e+04  
 Function value at final x       = -4.8198188e+04  
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   DALLASS

 Problem name: DALLASS

 Double precision version will be formed

 The objective function uses 1 nonlinear group
 
 There are 31 linear equality constraints
 
 There are 46 variables bounded from below and above 
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully
xx pprojparm->cholmod: 1

 Problem: DALLASS (n = 46)
walltime at start:     0.000001

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 9.316875e-07 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 9.316875101278432e-07    
Final f                               : -3.239322429887752e+04   

Iterations of gradient projection (GP): 5         
Iterations of active set GP           : 16        
Function evaluation in main code      : 1         
Function evaluations in GP            : 12        
Function evaluations in active set GP : 16        
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 5         
Gradient evaluations in active set GP : 16        


PPROJ run statistics (Version 2.0, May 1, 2018):

No. blocks in multilevel partition of A . 1
Depth of multilevel partition tree ...... 0
Phase 1 iterations ...................... 5
Coordinate ascent iterations ............ 15
    variables freed in coordinate ascent  14
    rows dropped in coordinate ascent ... 0
Gradient ascent iterations .............. 0
    variables freed in gradient ascent .. 0
    rows dropped in gradient ascent ..... 0
Preconditioned CG iterations ............ 0
    variables freed in CG ............... 0
    rows dropped in CG .................. 0
SpaRSA iterations ....................... 12
    change in column activity ........... 9
    change in row activity .............. 0
    failures of Armijo step ............. 6
Proximal updates ........................ 12
Cholesky factorizations ................. 3
    nonzeros in final factor ............ 106 78.6% sparse
    rows dropped from L ................. 0
    rows added to L ..................... 0
    rank 1 downdates to L ............... 12
    rank 1 updates to L ................. 21
    Size breakdown of the updates ([size]: number of this size):
        updowns [  1]: 20
        updowns [  2]: 2
        updowns [  3]: 3
    No. of solves:   22

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 6.484985e-05
Initialization (includes partition) ..... 1.394749e-04
Phase 1 ................................. 1.299381e-04
Coordinate ascent ....................... 3.647804e-05
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 3.099442e-06
DASA .................................... 3.867149e-04
DASA line search ........................ 3.266335e-05
Check error ............................. 8.463860e-05
Proximal update ......................... 6.365776e-05
Invert permutation ...................... 1.573563e-05
Row modifications of Cholesky factor .... 5.960464e-06
Column modifications of Cholesky factor . 7.224083e-05
Cholesky factorization .................. 4.005432e-05
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 2.169609e-05
Forward solves .......................... 1.883507e-05


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             : -3.239322429887679e+04
sup-norm of gradient:  9.316875101278432e-07
Number of iterations: 313       
Function evaluations: 579       
Gradient evaluations: 463       
Subspace iterations: 121       
Number of subspaces: 16        


!!   DALLASS     46       5      12       5     313     579     463      24       3     0    9.3168751e-07   -3.2393224e+04    0.015323
 Final f                         = -3.2393224e+04  
 Function value at final x       = -3.2393224e+04  
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   DTOC1L

 Problem name: DTOC1L

 Double precision version will be formed

 The objective function uses 5998 nonlinear groups
 
 There are 3996 linear equality constraints
 
 There are 5994 free variables
 There are 4 fixed variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully
xx pprojparm->cholmod: 1

 Problem: DTOC1L (n = 5998)
walltime at start:     0.000001

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 2.761726e-07 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 2.761725642966284e-07    
Final f                               : 3.943043545506466e+00    

Iterations of gradient projection (GP): 0         
Iterations of active set GP           : 1         
Function evaluation in main code      : 1         
Function evaluations in GP            : 0         
Function evaluations in active set GP : 1         
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 0         
Gradient evaluations in active set GP : 1         


PPROJ run statistics (Version 2.0, May 1, 2018):

No. blocks in multilevel partition of A . 15
Depth of multilevel partition tree ...... 3
Phase 1 iterations ...................... 15
Coordinate ascent iterations ............ 1
    variables freed in coordinate ascent  0
    rows dropped in coordinate ascent ... 0
Gradient ascent iterations .............. 0
    variables freed in gradient ascent .. 0
    rows dropped in gradient ascent ..... 0
Preconditioned CG iterations ............ 0
    variables freed in CG ............... 0
    rows dropped in CG .................. 0
SpaRSA iterations ....................... 1
    change in column activity ........... 0
    change in row activity .............. 0
    failures of Armijo step ............. 1
Proximal updates ........................ 1
Cholesky factorizations ................. 1
    nonzeros in final factor ............ 37872 99.5% sparse
    rows dropped from L ................. 0
    rows added to L ..................... 0
    rank 1 downdates to L ............... 0
    rank 1 updates to L ................. 0
    Size breakdown of the updates ([size]: number of this size):
    No. of solves by depth in the multilevel partition tree:
        (deeper <=> further from root of tree <=> fewer flops)
        depth [ 0]: 1
        depth [ 1]: 2
        depth [ 2]: 4
        depth [ 3]: 8

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 6.245852e-03
Initialization (includes partition) ..... 6.958246e-03
Phase 1 ................................. 1.046109e-02
Coordinate ascent ....................... 1.220703e-04
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 2.260208e-04
DASA .................................... 2.867937e-03
DASA line search ........................ 2.465248e-04
Check error ............................. 1.866817e-04
Proximal update ......................... 2.539158e-04
Invert permutation ...................... 2.217293e-05
Row modifications of Cholesky factor .... 2.861023e-06
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 1.592159e-03
Partial Cholesky factorization .......... 9.799004e-05
Back solves ............................. 1.840591e-04
Forward solves .......................... 9.822845e-05


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             :  3.943043545511419e+00
sup-norm of gradient:  2.761725642966284e-07
Number of iterations: 12        
Function evaluations: 24        
Gradient evaluations: 12        

!!    DTOC1L   5998       0       0       0      12      24      12       3       1     0    2.7617256e-07    3.9430435e+00    0.033715
 Final f                         = 3.9430435e+00   
 Function value at final x       = 3.9430435e+00   
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   DUAL1

 Problem name: DUAL1

 Double precision version will be formed

 The objective function uses 1 nonlinear group
 
 There is 1 linear equality constraint
 
 There are 85 variables bounded from below and above 
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully
xx pprojparm->cholmod: 1

 Problem: DUAL1 (n = 85)
the problem has a quadratic objective
number of variables: 85
number of free variables: 85
number of equations: 1
number of free equations: 1
walltime at start:     0.000001

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 7.068469e-07 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 7.068468905326196e-07    
Final f                               : 3.501296781595034e-02    

Iterations of gradient projection (GP): 4         
Iterations of active set GP           : 45        
Function evaluation in main code      : 0         
Function evaluations in GP            : 0         
Function evaluations in active set GP : 0         
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 4         
Gradient evaluations in active set GP : 45        


PPROJ run statistics (Version 2.0, May 1, 2018):

No. blocks in multilevel partition of A . 1
Depth of multilevel partition tree ...... 0
Phase 1 iterations ...................... 5
Coordinate ascent iterations ............ 1
    variables freed in coordinate ascent  65
    rows dropped in coordinate ascent ... 0
Gradient ascent iterations .............. 0
    variables freed in gradient ascent .. 0
    rows dropped in gradient ascent ..... 0
Preconditioned CG iterations ............ 0
    variables freed in CG ............... 0
    rows dropped in CG .................. 0
SpaRSA iterations ....................... 27
    change in column activity ........... 20
    change in row activity .............. 0
    failures of Armijo step ............. 13
Proximal updates ........................ 27
Cholesky factorizations ................. 27
    nonzeros in final factor ............ 1  0.0% sparse
    rows dropped from L ................. 0
    rows added to L ..................... 0
    rank 1 downdates to L ............... 30
    rank 1 updates to L ................. 20
    Size breakdown of the updates ([size]: number of this size):
        updowns [  1]: 34
        updowns [  2]: 3
        updowns [  3]: 2
        updowns [  4]: 1
    No. of solves:   27

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 2.503395e-05
Initialization (includes partition) ..... 1.070499e-04
Phase 1 ................................. 1.459122e-04
Coordinate ascent ....................... 6.198883e-06
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 3.099442e-06
DASA .................................... 3.921986e-04
DASA line search ........................ 3.027916e-05
Check error ............................. 1.184940e-04
Proximal update ......................... 1.311302e-04
Invert permutation ...................... 4.577637e-05
Row modifications of Cholesky factor .... 0.000000e+00
Column modifications of Cholesky factor . 5.912781e-05
Cholesky factorization .................. 9.608269e-05
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 1.764297e-05
Forward solves .......................... 1.883507e-05


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             :  3.501296781595034e-02
sup-norm of gradient:  7.068468905326196e-07
Number of iterations: 176       
Function evaluations: 0         
Gradient evaluations: 176       

!!     DUAL1     85       4       0       4     176       0     176      51      27     0    7.0684689e-07    3.5012968e-02    0.003608
 Final f                         = 3.5012968e-02   
 Function value at final x       = 3.5012968e-02   
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   DUAL2

 Problem name: DUAL2

 Double precision version will be formed

 The objective function uses 1 nonlinear group
 
 There is 1 linear equality constraint
 
 There are 96 variables bounded from below and above 
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully
xx pprojparm->cholmod: 1

 Problem: DUAL2 (n = 96)
the problem has a quadratic objective
number of variables: 96
number of free variables: 96
number of equations: 1
number of free equations: 1
walltime at start:     0.000001

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 8.798494e-07 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 8.798494008786968e-07    
Final f                               : 3.373367136437526e-02    

Iterations of gradient projection (GP): 1         
Iterations of active set GP           : 5         
Function evaluation in main code      : 0         
Function evaluations in GP            : 0         
Function evaluations in active set GP : 0         
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 1         
Gradient evaluations in active set GP : 5         


PPROJ run statistics (Version 2.0, May 1, 2018):

No. blocks in multilevel partition of A . 1
Depth of multilevel partition tree ...... 0
Phase 1 iterations ...................... 5
Coordinate ascent iterations ............ 1
    variables freed in coordinate ascent  59
    rows dropped in coordinate ascent ... 0
Gradient ascent iterations .............. 0
    variables freed in gradient ascent .. 0
    rows dropped in gradient ascent ..... 0
Preconditioned CG iterations ............ 0
    variables freed in CG ............... 0
    rows dropped in CG .................. 0
SpaRSA iterations ....................... 2
    change in column activity ........... 35
    change in row activity .............. 0
    failures of Armijo step ............. 3
Proximal updates ........................ 2
Cholesky factorizations ................. 2
    nonzeros in final factor ............ 1  0.0% sparse
    rows dropped from L ................. 0
    rows added to L ..................... 0
    rank 1 downdates to L ............... 4
    rank 1 updates to L ................. 0
    Size breakdown of the updates ([size]: number of this size):
        updowns [  1]: 4
    No. of solves:   2

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 2.312660e-05
Initialization (includes partition) ..... 5.269051e-05
Phase 1 ................................. 6.747246e-05
Coordinate ascent ....................... 5.006790e-06
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 2.002716e-05
DASA .................................... 6.985664e-05
DASA line search ........................ 1.907349e-06
Check error ............................. 1.335144e-05
Proximal update ......................... 1.192093e-05
Invert permutation ...................... 9.775162e-06
Row modifications of Cholesky factor .... 0.000000e+00
Column modifications of Cholesky factor . 1.072884e-05
Cholesky factorization .................. 1.692772e-05
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 2.145767e-06
Forward solves .......................... 3.099442e-06


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             :  3.373367136437526e-02
sup-norm of gradient:  8.798494008786968e-07
Number of iterations: 59        
Function evaluations: 0         
Gradient evaluations: 59        

!!     DUAL2     96       1       0       1      59       0      59       8       2     0    8.7984940e-07    3.3733671e-02    0.001404
 Final f                         = 3.3733671e-02   
 Function value at final x       = 3.3733671e-02   
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   DUAL3

 Problem name: DUAL3

 Double precision version will be formed

 The objective function uses 1 nonlinear group
 
 There is 1 linear equality constraint
 
 There are 111 variables bounded from below and above 
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully
xx pprojparm->cholmod: 1

 Problem: DUAL3 (n = 111)
the problem has a quadratic objective
number of variables: 111
number of free variables: 111
number of equations: 1
number of free equations: 1
walltime at start:     0.000001

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 8.015879e-07 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 8.015879278162698e-07    
Final f                               : 1.357558327515731e-01    

Iterations of gradient projection (GP): 2         
Iterations of active set GP           : 19        
Function evaluation in main code      : 0         
Function evaluations in GP            : 0         
Function evaluations in active set GP : 0         
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 2         
Gradient evaluations in active set GP : 19        


PPROJ run statistics (Version 2.0, May 1, 2018):

No. blocks in multilevel partition of A . 1
Depth of multilevel partition tree ...... 0
Phase 1 iterations ...................... 5
Coordinate ascent iterations ............ 0
    variables freed in coordinate ascent  0
    rows dropped in coordinate ascent ... 0
Gradient ascent iterations .............. 0
    variables freed in gradient ascent .. 0
    rows dropped in gradient ascent ..... 0
Preconditioned CG iterations ............ 0
    variables freed in CG ............... 0
    rows dropped in CG .................. 0
SpaRSA iterations ....................... 8
    change in column activity ........... 1
    change in row activity .............. 0
    failures of Armijo step ............. 5
Proximal updates ........................ 8
Cholesky factorizations ................. 8
    nonzeros in final factor ............ 1  0.0% sparse
    rows dropped from L ................. 0
    rows added to L ..................... 0
    rank 1 downdates to L ............... 16
    rank 1 updates to L ................. 13
    Size breakdown of the updates ([size]: number of this size):
        updowns [  1]: 16
        updowns [  2]: 1
        updowns [  5]: 1
        updowns [  6]: 1
    No. of solves:   8

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 2.217293e-05
Initialization (includes partition) ..... 7.104874e-05
Phase 1 ................................. 9.846687e-05
Coordinate ascent ....................... 0.000000e+00
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 3.099442e-06
DASA .................................... 1.428127e-04
DASA line search ........................ 9.059906e-06
Check error ............................. 4.148483e-05
Proximal update ......................... 4.529953e-05
Invert permutation ...................... 1.645088e-05
Row modifications of Cholesky factor .... 0.000000e+00
Column modifications of Cholesky factor . 4.029274e-05
Cholesky factorization .................. 4.243851e-05
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 4.291534e-06
Forward solves .......................... 6.675720e-06


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             :  1.357558327515731e-01
sup-norm of gradient:  8.015879278162698e-07
Number of iterations: 70        
Function evaluations: 0         
Gradient evaluations: 70        

!!     DUAL3    111       2       0       2      70       0      70      23       8     0    8.0158793e-07    1.3575583e-01    0.002217
 Final f                         = 1.3575583e-01   
 Function value at final x       = 1.3575583e-01   
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   DUAL4

 Problem name: DUAL4

 Double precision version will be formed

 The objective function uses 1 nonlinear group
 
 There is 1 linear equality constraint
 
 There are 75 variables bounded from below and above 
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully
xx pprojparm->cholmod: 1

 Problem: DUAL4 (n = 75)
the problem has a quadratic objective
number of variables: 75
number of free variables: 75
number of equations: 1
number of free equations: 1
walltime at start:     0.000000

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 9.455585e-07 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 9.455584887744381e-07    
Final f                               : 7.460906493590005e-01    

Iterations of gradient projection (GP): 2         
Iterations of active set GP           : 11        
Function evaluation in main code      : 0         
Function evaluations in GP            : 0         
Function evaluations in active set GP : 0         
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 2         
Gradient evaluations in active set GP : 11        


PPROJ run statistics (Version 2.0, May 1, 2018):

No. blocks in multilevel partition of A . 1
Depth of multilevel partition tree ...... 0
Phase 1 iterations ...................... 5
Coordinate ascent iterations ............ 1
    variables freed in coordinate ascent  44
    rows dropped in coordinate ascent ... 0
Gradient ascent iterations .............. 0
    variables freed in gradient ascent .. 0
    rows dropped in gradient ascent ..... 0
Preconditioned CG iterations ............ 0
    variables freed in CG ............... 0
    rows dropped in CG .................. 0
SpaRSA iterations ....................... 7
    change in column activity ........... 29
    change in row activity .............. 0
    failures of Armijo step ............. 6
Proximal updates ........................ 7
Cholesky factorizations ................. 7
    nonzeros in final factor ............ 1  0.0% sparse
    rows dropped from L ................. 0
    rows added to L ..................... 0
    rank 1 downdates to L ............... 5
    rank 1 updates to L ................. 0
    Size breakdown of the updates ([size]: number of this size):
        updowns [  1]: 5
    No. of solves:   7

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 2.312660e-05
Initialization (includes partition) ..... 5.817413e-05
Phase 1 ................................. 6.723404e-05
Coordinate ascent ....................... 4.053116e-06
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 3.099442e-06
DASA .................................... 1.292229e-04
DASA line search ........................ 9.775162e-06
Check error ............................. 3.719330e-05
Proximal update ......................... 3.719330e-05
Invert permutation ...................... 1.430511e-05
Row modifications of Cholesky factor .... 0.000000e+00
Column modifications of Cholesky factor . 9.775162e-06
Cholesky factorization .................. 3.051758e-05
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 5.245209e-06
Forward solves .......................... 7.152557e-06


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             :  7.460906493590005e-01
sup-norm of gradient:  9.455584887744381e-07
Number of iterations: 28        
Function evaluations: 0         
Gradient evaluations: 28        

!!     DUAL4     75       2       0       2      28       0      28      15       7     0    9.4555849e-07    7.4609065e-01    0.000869
 Final f                         = 7.4609065e-01   
 Function value at final x       = 7.4609065e-01   
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   DUALC1

 Problem name: DUALC1

 Double precision version will be formed

 The objective function uses 1 nonlinear group
 
 There is 1 linear equality constraint
 There are 214 linear inequality constraints
 
 There are 9 variables bounded from below and above 
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully
xx pprojparm->cholmod: 1

 Problem: DUALC1 (n = 9)
the problem has a quadratic objective
number of variables: 9
number of free variables: 9
number of equations: 215
number of free equations: 215
walltime at start:     0.000000

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 5.491714e-10 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 5.491713750416238e-10    
Final f                               : 6.155251685906654e+03    

Iterations of gradient projection (GP): 1         
Iterations of active set GP           : 6         
Function evaluation in main code      : 0         
Function evaluations in GP            : 0         
Function evaluations in active set GP : 0         
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 1         
Gradient evaluations in active set GP : 6         


PPROJ run statistics (Version 2.0, May 1, 2018):

No. blocks in multilevel partition of A . 1
Depth of multilevel partition tree ...... 0
Phase 1 iterations ...................... 5
Coordinate ascent iterations ............ 4
    variables freed in coordinate ascent  1
    rows dropped in coordinate ascent ... 0
Gradient ascent iterations .............. 2
    variables freed in gradient ascent .. 0
    rows dropped in gradient ascent ..... 0
Preconditioned CG iterations ............ 4
    variables freed in CG ............... 1
    rows dropped in CG .................. 0
SpaRSA iterations ....................... 5
    change in column activity ........... 1
    change in row activity .............. 0
    failures of Armijo step ............. 11
Proximal updates ........................ 6
Cholesky factorizations ................. 10
    nonzeros in final factor ............ 1 100.0% sparse
    rows dropped from L ................. 0
    rows added to L ..................... 0
    rank 1 downdates to L ............... 2
    rank 1 updates to L ................. 0
    Size breakdown of the updates ([size]: number of this size):
        updowns [  1]: 2
    No. of solves:   10

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 5.984306e-05
Initialization (includes partition) ..... 1.475811e-04
Phase 1 ................................. 1.537800e-04
Coordinate ascent ....................... 5.006790e-06
SSOR0 ................................... 4.291534e-06
SSOR1 ................................... 1.478195e-05
SpaRSA .................................. 6.914139e-06
DASA .................................... 2.965927e-04
DASA line search ........................ 9.775162e-06
Check error ............................. 7.319450e-05
Proximal update ......................... 7.557869e-05
Invert permutation ...................... 6.914139e-06
Row modifications of Cholesky factor .... 0.000000e+00
Column modifications of Cholesky factor . 8.344650e-06
Cholesky factorization .................. 9.727478e-05
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 5.006790e-06
Forward solves .......................... 9.059906e-06


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             :  6.155251685906654e+03
sup-norm of gradient:  5.491713750416238e-10
Number of iterations: 6         
Function evaluations: 0         
Gradient evaluations: 6         

!!    DUALC1      9       1       0       1       6       0       6       9      10     0    5.4917138e-10    6.1552517e+03    0.000988
 Final f                         = 6.1552517e+03   
 Function value at final x       = 6.1552517e+03   
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   DUALC2

 Problem name: DUALC2

 Double precision version will be formed

 The objective function uses 1 nonlinear group
 
 There is 1 linear equality constraint
 There are 228 linear inequality constraints
 
 There are 7 variables bounded from below and above 
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully
xx pprojparm->cholmod: 1

 Problem: DUALC2 (n = 7)
the problem has a quadratic objective
number of variables: 7
number of free variables: 7
number of equations: 229
number of free equations: 229
walltime at start:     0.000001

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 3.270202e-10 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 3.270201887062285e-10    
Final f                               : 3.551306384537145e+03    

Iterations of gradient projection (GP): 1         
Iterations of active set GP           : 6         
Function evaluation in main code      : 0         
Function evaluations in GP            : 0         
Function evaluations in active set GP : 0         
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 1         
Gradient evaluations in active set GP : 6         


PPROJ run statistics (Version 2.0, May 1, 2018):

No. blocks in multilevel partition of A . 1
Depth of multilevel partition tree ...... 0
Phase 1 iterations ...................... 6
Coordinate ascent iterations ............ 5
    variables freed in coordinate ascent  1
    rows dropped in coordinate ascent ... 3
Gradient ascent iterations .............. 1
    variables freed in gradient ascent .. 0
    rows dropped in gradient ascent ..... 0
Preconditioned CG iterations ............ 3
    variables freed in CG ............... 1
    rows dropped in CG .................. 0
SpaRSA iterations ....................... 5
    change in column activity ........... 0
    change in row activity .............. 0
    failures of Armijo step ............. 11
Proximal updates ........................ 6
Cholesky factorizations ................. 8
    nonzeros in final factor ............ 1 100.0% sparse
    rows dropped from L ................. 1
    rows added to L ..................... 0
    rank 1 downdates to L ............... 2
    rank 1 updates to L ................. 0
    Size breakdown of the updates ([size]: number of this size):
        updowns [  1]: 2
    No. of solves:   9

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 6.508827e-05
Initialization (includes partition) ..... 1.533031e-04
Phase 1 ................................. 1.559258e-04
Coordinate ascent ....................... 6.198883e-06
SSOR0 ................................... 2.861023e-06
SSOR1 ................................... 1.788139e-05
SpaRSA .................................. 7.867813e-06
DASA .................................... 3.068447e-04
DASA line search ........................ 1.192093e-05
Check error ............................. 6.628036e-05
Proximal update ......................... 7.295609e-05
Invert permutation ...................... 7.390976e-06
Row modifications of Cholesky factor .... 1.811981e-05
Column modifications of Cholesky factor . 4.053116e-06
Cholesky factorization .................. 8.988380e-05
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 6.914139e-06
Forward solves .......................... 6.198883e-06


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             :  3.551306384537145e+03
sup-norm of gradient:  3.270201887062285e-10
Number of iterations: 6         
Function evaluations: 0         
Gradient evaluations: 6         

!!    DUALC2      7       1       0       1       6       0       6       9       8     0    3.2702019e-10    3.5513064e+03    0.001017
 Final f                         = 3.5513064e+03   
 Function value at final x       = 3.5513064e+03   
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   DUALC5

 Problem name: DUALC5

 Double precision version will be formed

 The objective function uses 1 nonlinear group
 
 There is 1 linear equality constraint
 There are 277 linear inequality constraints
 
 There are 8 variables bounded from below and above 
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully
xx pprojparm->cholmod: 1

 Problem: DUALC5 (n = 8)
the problem has a quadratic objective
number of variables: 8
number of free variables: 8
number of equations: 278
number of free equations: 278
walltime at start:     0.000000

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 2.967369e-10 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 2.967368573081330e-10    
Final f                               : 4.272325678478180e+02    

Iterations of gradient projection (GP): 1         
Iterations of active set GP           : 3         
Function evaluation in main code      : 0         
Function evaluations in GP            : 0         
Function evaluations in active set GP : 0         
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 1         
Gradient evaluations in active set GP : 3         


PPROJ run statistics (Version 2.0, May 1, 2018):

No. blocks in multilevel partition of A . 1
Depth of multilevel partition tree ...... 0
Phase 1 iterations ...................... 6
Coordinate ascent iterations ............ 2
    variables freed in coordinate ascent  0
    rows dropped in coordinate ascent ... 0
Gradient ascent iterations .............. 1
    variables freed in gradient ascent .. 0
    rows dropped in gradient ascent ..... 0
Preconditioned CG iterations ............ 1
    variables freed in CG ............... 0
    rows dropped in CG .................. 0
SpaRSA iterations ....................... 3
    change in column activity ........... 0
    change in row activity .............. 0
    failures of Armijo step ............. 1
Proximal updates ........................ 3
Cholesky factorizations ................. 3
    nonzeros in final factor ............ 1 100.0% sparse
    rows dropped from L ................. 0
    rows added to L ..................... 0
    rank 1 downdates to L ............... 1
    rank 1 updates to L ................. 0
    Size breakdown of the updates ([size]: number of this size):
        updowns [  1]: 1
    No. of solves:   3

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 6.890297e-05
Initialization (includes partition) ..... 1.630783e-04
Phase 1 ................................. 1.444817e-04
Coordinate ascent ....................... 1.907349e-06
SSOR0 ................................... 2.145767e-06
SSOR1 ................................... 5.960464e-06
SpaRSA .................................. 1.406670e-05
DASA .................................... 1.258850e-04
DASA line search ........................ 2.861023e-06
Check error ............................. 3.314018e-05
Proximal update ......................... 4.339218e-05
Invert permutation ...................... 8.106232e-06
Row modifications of Cholesky factor .... 0.000000e+00
Column modifications of Cholesky factor . 7.152557e-06
Cholesky factorization .................. 5.292892e-05
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 9.536743e-07
Forward solves .......................... 1.907349e-06


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             :  4.272325678478180e+02
sup-norm of gradient:  2.967368573081330e-10
Number of iterations: 5         
Function evaluations: 0         
Gradient evaluations: 5         

!!    DUALC5      8       1       0       1       5       0       5       6       3     0    2.9673686e-10    4.2723257e+02    0.000755
 Final f                         = 4.2723257e+02   
 Function value at final x       = 4.2723257e+02   
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   DUALC8

 Problem name: DUALC8

 Double precision version will be formed

 The objective function uses 1 nonlinear group
 
 There is 1 linear equality constraint
 There are 502 linear inequality constraints
 
 There are 8 variables bounded from below and above 
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully
xx pprojparm->cholmod: 1

 Problem: DUALC8 (n = 8)
the problem has a quadratic objective
number of variables: 8
number of free variables: 8
number of equations: 503
number of free equations: 503
walltime at start:     0.000000

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 2.309389e-07 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 2.309388946741819e-07    
Final f                               : 1.830936123927945e+04    

Iterations of gradient projection (GP): 2         
Iterations of active set GP           : 5         
Function evaluation in main code      : 0         
Function evaluations in GP            : 0         
Function evaluations in active set GP : 0         
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 2         
Gradient evaluations in active set GP : 5         


PPROJ run statistics (Version 2.0, May 1, 2018):

No. blocks in multilevel partition of A . 1
Depth of multilevel partition tree ...... 0
Phase 1 iterations ...................... 7
Coordinate ascent iterations ............ 2
    variables freed in coordinate ascent  1
    rows dropped in coordinate ascent ... 4
Gradient ascent iterations .............. 1
    variables freed in gradient ascent .. 0
    rows dropped in gradient ascent ..... 0
Preconditioned CG iterations ............ 3
    variables freed in CG ............... 1
    rows dropped in CG .................. 0
SpaRSA iterations ....................... 4
    change in column activity ........... 1
    change in row activity .............. 0
    failures of Armijo step ............. 10
Proximal updates ........................ 5
Cholesky factorizations ................. 7
    nonzeros in final factor ............ 1 100.0% sparse
    rows dropped from L ................. 1
    rows added to L ..................... 0
    rank 1 downdates to L ............... 2
    rank 1 updates to L ................. 0
    Size breakdown of the updates ([size]: number of this size):
        updowns [  1]: 2
    No. of solves:   8

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 1.080036e-04
Initialization (includes partition) ..... 2.663136e-04
Phase 1 ................................. 3.383160e-04
Coordinate ascent ....................... 2.145767e-06
SSOR0 ................................... 2.861023e-06
SSOR1 ................................... 2.098083e-05
SpaRSA .................................. 1.597404e-05
DASA .................................... 4.284382e-04
DASA line search ........................ 9.775162e-06
Check error ............................. 9.703636e-05
Proximal update ......................... 1.251698e-04
Invert permutation ...................... 9.775162e-06
Row modifications of Cholesky factor .... 1.597404e-05
Column modifications of Cholesky factor . 3.814697e-06
Cholesky factorization .................. 1.480579e-04
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 5.006790e-06
Forward solves .......................... 5.722046e-06


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             :  1.830936123925275e+04
sup-norm of gradient:  4.908361006528139e-08
Number of iterations: 7         
Function evaluations: 0         
Gradient evaluations: 7         

!!    DUALC8      8       2       0       2       7       0       7      10       7     0    2.3093889e-07    1.8309361e+04    0.001666
 Final f                         = 1.8309361e+04   
 Function value at final x       = 1.8309361e+04   
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   EQC

 Problem name: EQC

 Double precision version will be formed

 The objective function uses 17 nonlinear groups
 
 There are 3 linear inequality constraints
 
 There are 7 variables bounded from below and above 
 There are 2 fixed variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully
xx pprojparm->cholmod: 1

 Problem: EQC (n = 9)
walltime at start:     0.000000

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 0.000000e+00 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 0.000000000000000e+00    
Final f                               : -8.295477053187734e+02   

Iterations of gradient projection (GP): 1         
Iterations of active set GP           : 0         
Function evaluation in main code      : 1         
Function evaluations in GP            : 1         
Function evaluations in active set GP : 0         
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 1         
Gradient evaluations in active set GP : 0         


PPROJ run statistics (Version 2.0, May 1, 2018):

No. blocks in multilevel partition of A . 3
Depth of multilevel partition tree ...... 1
Phase 1 iterations ...................... 5
Coordinate ascent iterations ............ 0
    variables freed in coordinate ascent  0
    rows dropped in coordinate ascent ... 0
Gradient ascent iterations .............. 0
    variables freed in gradient ascent .. 0
    rows dropped in gradient ascent ..... 0
Preconditioned CG iterations ............ 0
    variables freed in CG ............... 0
    rows dropped in CG .................. 0
SpaRSA iterations ....................... 0
    change in column activity ........... 0
    change in row activity .............. 0
    failures of Armijo step ............. 0
Proximal updates ........................ 0
Cholesky factorizations ................. 0
    nonzeros in final factor ............ 0 100.0% sparse
    rows dropped from L ................. 0
    rows added to L ..................... 0
    rank 1 downdates to L ............... 0
    rank 1 updates to L ................. 0
    Size breakdown of the updates ([size]: number of this size):
    No. of solves by depth in the multilevel partition tree:
        (deeper <=> further from root of tree <=> fewer flops)
        depth [ 0]: 0
        depth [ 1]: 0

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 3.385544e-05
Initialization (includes partition) ..... 5.793571e-05
Phase 1 ................................. 2.646446e-05
Coordinate ascent ....................... 0.000000e+00
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 0.000000e+00
DASA .................................... 0.000000e+00
DASA line search ........................ 0.000000e+00
Check error ............................. 0.000000e+00
Proximal update ......................... 0.000000e+00
Invert permutation ...................... 5.960464e-06
Row modifications of Cholesky factor .... 0.000000e+00
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 0.000000e+00
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 0.000000e+00
Forward solves .......................... 0.000000e+00


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Number of iterations: 0         
Function evaluations: 0         
Gradient evaluations: 0         

!!       EQC      9       1       1       1       0       0       0       4       0     0    0.0000000e+00   -8.2954771e+02    0.000171
 Final f                         = -8.2954771e+02  
 Function value at final x       = -8.2954771e+02  
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   EXPFITA

 Problem name: EXPFITA

 Double precision version will be formed

 The objective function uses 1 nonlinear group
 
 There are 22 linear inequality constraints
 
 There are 5 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully
xx pprojparm->cholmod: 1

 Problem: EXPFITA (n = 5)
walltime at start:     0.000001

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 7.710721e-07 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 7.710721151284270e-07    
Final f                               : 1.136611929982712e-03    

Iterations of gradient projection (GP): 2         
Iterations of active set GP           : 8         
Function evaluation in main code      : 1         
Function evaluations in GP            : 2         
Function evaluations in active set GP : 8         
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 2         
Gradient evaluations in active set GP : 8         


PPROJ run statistics (Version 2.0, May 1, 2018):

No. blocks in multilevel partition of A . 1
Depth of multilevel partition tree ...... 0
Phase 1 iterations ...................... 5
Coordinate ascent iterations ............ 7
    variables freed in coordinate ascent  0
    rows dropped in coordinate ascent ... 17
Gradient ascent iterations .............. 0
    variables freed in gradient ascent .. 0
    rows dropped in gradient ascent ..... 0
Preconditioned CG iterations ............ 0
    variables freed in CG ............... 0
    rows dropped in CG .................. 0
SpaRSA iterations ....................... 5
    change in column activity ........... 0
    change in row activity .............. 1
    failures of Armijo step ............. 1
Proximal updates ........................ 4
Cholesky factorizations ................. 5
    nonzeros in final factor ............ 10 96.0% sparse
    rows dropped from L ................. 43
    rows added to L ..................... 37
    rank 1 downdates to L ............... 0
    rank 1 updates to L ................. 0
    Size breakdown of the updates ([size]: number of this size):
    No. of solves:   39

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 2.479553e-05
Initialization (includes partition) ..... 6.008148e-05
Phase 1 ................................. 5.078316e-05
Coordinate ascent ....................... 8.106232e-06
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 1.907349e-06
DASA .................................... 3.857613e-04
DASA line search ........................ 4.029274e-05
Check error ............................. 5.078316e-05
Proximal update ......................... 2.074242e-05
Invert permutation ...................... 1.382828e-05
Row modifications of Cholesky factor .... 1.392365e-04
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 3.099442e-05
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 1.978874e-05
Forward solves .......................... 9.775162e-06


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             :  1.136611930028599e-03
sup-norm of gradient:  7.710721151284270e-07
Number of iterations: 9         
Function evaluations: 13        
Gradient evaluations: 9         

!!   EXPFITA      5       2       2       2       9      13       9      13       5     0    7.7107212e-07    1.1366119e-03    0.000792
 Final f                         = 1.1366119e-03   
 Function value at final x       = 1.1366119e-03   
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   EXPFITB

 Problem name: EXPFITB

 Double precision version will be formed

 The objective function uses 1 nonlinear group
 
 There are 102 linear inequality constraints
 
 There are 5 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully
xx pprojparm->cholmod: 1

 Problem: EXPFITB (n = 5)
walltime at start:     0.000000

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 2.113498e-07 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 2.113498303522561e-07    
Final f                               : 5.019365530619394e-03    

Iterations of gradient projection (GP): 9         
Iterations of active set GP           : 8         
Function evaluation in main code      : 1         
Function evaluations in GP            : 9         
Function evaluations in active set GP : 8         
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 9         
Gradient evaluations in active set GP : 8         


PPROJ run statistics (Version 2.0, May 1, 2018):

No. blocks in multilevel partition of A . 1
Depth of multilevel partition tree ...... 0
Phase 1 iterations ...................... 5
Coordinate ascent iterations ............ 47
    variables freed in coordinate ascent  0
    rows dropped in coordinate ascent ... 245
Gradient ascent iterations .............. 82
    variables freed in gradient ascent .. 0
    rows dropped in gradient ascent ..... 47
Preconditioned CG iterations ............ 143
    variables freed in CG ............... 0
    rows dropped in CG .................. 25
SpaRSA iterations ....................... 25
    change in column activity ........... 0
    change in row activity .............. 7
    failures of Armijo step ............. 7
Proximal updates ........................ 19
Cholesky factorizations ................. 32
    nonzeros in final factor ............ 10 99.8% sparse
    rows dropped from L ................. 571
    rows added to L ..................... 65
    rank 1 downdates to L ............... 0
    rank 1 updates to L ................. 0
    Size breakdown of the updates ([size]: number of this size):
    No. of solves:   582

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 3.409386e-05
Initialization (includes partition) ..... 9.942055e-05
Phase 1 ................................. 1.363754e-04
Coordinate ascent ....................... 7.462502e-05
SSOR0 ................................... 9.822845e-05
SSOR1 ................................... 1.242161e-04
SpaRSA .................................. 4.053116e-06
DASA .................................... 5.831480e-03
DASA line search ........................ 6.463528e-04
Check error ............................. 2.870560e-04
Proximal update ......................... 1.144409e-04
Invert permutation ...................... 2.241135e-05
Row modifications of Cholesky factor .... 2.113819e-03
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 6.835461e-04
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 5.218983e-04
Forward solves .......................... 4.339218e-05


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             :  5.019365530712000e-03
sup-norm of gradient:  2.113498303522561e-07
Number of iterations: 7         
Function evaluations: 8         
Gradient evaluations: 7         

!!   EXPFITB      5       9       9       9       7       8       7      23      32     0    2.1134983e-07    5.0193655e-03    0.006894
 Final f                         = 5.0193655e-03   
 Function value at final x       = 5.0193655e-03   
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   EXPFITC

 Problem name: EXPFITC

 Double precision version will be formed

 The objective function uses 1 nonlinear group
 
 There are 502 linear inequality constraints
 
 There are 5 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully
xx pprojparm->cholmod: 1

 Problem: EXPFITC (n = 5)
walltime at start:     0.000001

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 3.318405e-10 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 3.318405251105661e-10    
Final f                               : 2.330257260017091e-02    

Iterations of gradient projection (GP): 7         
Iterations of active set GP           : 9         
Function evaluation in main code      : 1         
Function evaluations in GP            : 8         
Function evaluations in active set GP : 9         
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 7         
Gradient evaluations in active set GP : 9         


PPROJ run statistics (Version 2.0, May 1, 2018):

No. blocks in multilevel partition of A . 1
Depth of multilevel partition tree ...... 0
Phase 1 iterations ...................... 7
Coordinate ascent iterations ............ 80
    variables freed in coordinate ascent  0
    rows dropped in coordinate ascent ... 1838
Gradient ascent iterations .............. 1179
    variables freed in gradient ascent .. 0
    rows dropped in gradient ascent ..... 1795
Preconditioned CG iterations ............ 338
    variables freed in CG ............... 0
    rows dropped in CG .................. 118
SpaRSA iterations ....................... 23
    change in column activity ........... 0
    change in row activity .............. 4
    failures of Armijo step ............. 6
Proximal updates ........................ 19
Cholesky factorizations ................. 25
    nonzeros in final factor ............ 6 100.0% sparse
    rows dropped from L ................. 1913
    rows added to L ..................... 874
    rank 1 downdates to L ............... 0
    rank 1 updates to L ................. 0
    Size breakdown of the updates ([size]: number of this size):
    No. of solves:   1584

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 8.296967e-05
Initialization (includes partition) ..... 2.150536e-04
Phase 1 ................................. 5.350113e-04
Coordinate ascent ....................... 2.233982e-04
SSOR0 ................................... 4.321098e-03
SSOR1 ................................... 6.110668e-04
SpaRSA .................................. 1.406670e-05
DASA .................................... 8.937836e-02
DASA line search ........................ 3.011227e-03
Check error ............................. 1.256943e-03
Proximal update ......................... 3.080368e-04
Invert permutation ...................... 2.408028e-05
Row modifications of Cholesky factor .... 6.436229e-02
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 5.278587e-03
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 6.604433e-03
Forward solves .......................... 1.635551e-04


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             :  2.330257260643317e-02
sup-norm of gradient:  3.318405251105661e-10
Number of iterations: 8         
Function evaluations: 12        
Gradient evaluations: 8         

!!   EXPFITC      5       7       8       7       8      12       8      23      25     0    3.3184053e-10    2.3302573e-02    0.092675
 Final f                         = 2.3302573e-02   
 Function value at final x       = 2.3302573e-02   
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   GMNCASE2

 Problem name: GMNCASE2

 Double precision version will be formed

 The objective function uses 1 nonlinear group
 
 There are 1050 linear inequality constraints
 
 There are 175 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully
xx pprojparm->cholmod: 1

 Problem: GMNCASE2 (n = 175)
the problem has a quadratic objective
number of variables: 175
number of free variables: 175
number of equations: 1050
number of free equations: 1050
walltime at start:     0.000000

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 4.545315e-07 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 4.545314921935648e-07    
Final f                               : -9.944449513707826e-01   

Iterations of gradient projection (GP): 0         
Iterations of active set GP           : 5         
Function evaluation in main code      : 0         
Function evaluations in GP            : 0         
Function evaluations in active set GP : 0         
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 0         
Gradient evaluations in active set GP : 5         


PPROJ run statistics (Version 2.0, May 1, 2018):

No. blocks in multilevel partition of A . 1
Depth of multilevel partition tree ...... 0
Phase 1 iterations ...................... 10
Coordinate ascent iterations ............ 6
    variables freed in coordinate ascent  0
    rows dropped in coordinate ascent ... 2
Gradient ascent iterations .............. 0
    variables freed in gradient ascent .. 0
    rows dropped in gradient ascent ..... 0
Preconditioned CG iterations ............ 0
    variables freed in CG ............... 0
    rows dropped in CG .................. 0
SpaRSA iterations ....................... 5
    change in column activity ........... 0
    change in row activity .............. 0
    failures of Armijo step ............. 2
Proximal updates ........................ 5
Cholesky factorizations ................. 2
    nonzeros in final factor ............ 3240 99.4% sparse
    rows dropped from L ................. 28
    rows added to L ..................... 14
    rank 1 downdates to L ............... 0
    rank 1 updates to L ................. 0
    Size breakdown of the updates ([size]: number of this size):
    No. of solves:   8

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 1.285815e-02
Initialization (includes partition) ..... 1.347327e-02
Phase 1 ................................. 2.520561e-03
Coordinate ascent ....................... 7.605553e-05
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 1.389980e-04
DASA .................................... 6.562710e-03
DASA line search ........................ 4.839897e-05
Check error ............................. 5.562305e-04
Proximal update ......................... 7.843971e-04
Invert permutation ...................... 9.059906e-06
Row modifications of Cholesky factor .... 4.646778e-04
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 4.971027e-03
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 1.716614e-05
Forward solves .......................... 1.931190e-05


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             : -9.944449513707826e-01
sup-norm of gradient:  4.545314921935648e-07
Number of iterations: 35        
Function evaluations: 0         
Gradient evaluations: 35        

!!  GMNCASE2    175       0       0       0      35       0      35       7       2     0    4.5453149e-07   -9.9444495e-01    0.028521
 Final f                         = -9.9444495e-01  
 Function value at final x       = -9.9444495e-01  
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   GMNCASE3

 Problem name: GMNCASE3

 Double precision version will be formed

 The objective function uses 1 nonlinear group
 
 There are 1050 linear inequality constraints
 
 There are 175 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully
xx pprojparm->cholmod: 1

 Problem: GMNCASE3 (n = 175)
the problem has a quadratic objective
number of variables: 175
number of free variables: 175
number of equations: 1050
number of free equations: 1050
walltime at start:     0.000000

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 1.955104e-07 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 1.955104211645470e-07    
Final f                               : 1.525146674529672e+00    

Iterations of gradient projection (GP): 0         
Iterations of active set GP           : 6         
Function evaluation in main code      : 0         
Function evaluations in GP            : 0         
Function evaluations in active set GP : 0         
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 0         
Gradient evaluations in active set GP : 6         


PPROJ run statistics (Version 2.0, May 1, 2018):

No. blocks in multilevel partition of A . 1
Depth of multilevel partition tree ...... 0
Phase 1 iterations ...................... 10
Coordinate ascent iterations ............ 4
    variables freed in coordinate ascent  0
    rows dropped in coordinate ascent ... 1
Gradient ascent iterations .............. 0
    variables freed in gradient ascent .. 0
    rows dropped in gradient ascent ..... 0
Preconditioned CG iterations ............ 0
    variables freed in CG ............... 0
    rows dropped in CG .................. 0
SpaRSA iterations ....................... 4
    change in column activity ........... 0
    change in row activity .............. 0
    failures of Armijo step ............. 2
Proximal updates ........................ 4
Cholesky factorizations ................. 2
    nonzeros in final factor ............ 3240 99.4% sparse
    rows dropped from L ................. 20
    rows added to L ..................... 7
    rank 1 downdates to L ............... 0
    rank 1 updates to L ................. 0
    Size breakdown of the updates ([size]: number of this size):
    No. of solves:   5

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 1.290202e-02
Initialization (includes partition) ..... 1.353312e-02
Phase 1 ................................. 2.719641e-03
Coordinate ascent ....................... 5.364418e-05
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 1.399517e-04
DASA .................................... 6.239176e-03
DASA line search ........................ 3.266335e-05
Check error ............................. 4.029274e-04
Proximal update ......................... 6.182194e-04
Invert permutation ...................... 9.059906e-06
Row modifications of Cholesky factor .... 3.721714e-04
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 5.053043e-03
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 1.311302e-05
Forward solves .......................... 1.668930e-05


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             :  1.525146674529672e+00
sup-norm of gradient:  1.955104211645470e-07
Number of iterations: 33        
Function evaluations: 0         
Gradient evaluations: 33        

!!  GMNCASE3    175       0       0       0      33       0      33       8       2     0    1.9551042e-07    1.5251467e+00    0.028535
 Final f                         = 1.5251467e+00   
 Function value at final x       = 1.5251467e+00   
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   GMNCASE4

 Problem name: GMNCASE4

 Double precision version will be formed

 The objective function uses 1 nonlinear group
 
 There are 350 linear inequality constraints
 
 There are 175 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully
xx pprojparm->cholmod: 1

 Problem: GMNCASE4 (n = 175)
the problem has a quadratic objective
number of variables: 175
number of free variables: 175
number of equations: 350
number of free equations: 350
walltime at start:     0.000000

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 7.288162e-11 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 7.288161567309270e-11    
Final f                               : 5.946884924456252e+03    

Iterations of gradient projection (GP): 0         
Iterations of active set GP           : 0         
Function evaluation in main code      : 0         
Function evaluations in GP            : 0         
Function evaluations in active set GP : 0         
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 0         
Gradient evaluations in active set GP : 0         


PPROJ run statistics (Version 2.0, May 1, 2018):

No. blocks in multilevel partition of A . 1
Depth of multilevel partition tree ...... 0
Phase 1 iterations ...................... 7
Coordinate ascent iterations ............ 2
    variables freed in coordinate ascent  0
    rows dropped in coordinate ascent ... 19
Gradient ascent iterations .............. 0
    variables freed in gradient ascent .. 0
    rows dropped in gradient ascent ..... 0
Preconditioned CG iterations ............ 0
    variables freed in CG ............... 0
    rows dropped in CG .................. 0
SpaRSA iterations ....................... 2
    change in column activity ........... 0
    change in row activity .............. 1
    failures of Armijo step ............. 0
Proximal updates ........................ 2
Cholesky factorizations ................. 2
    nonzeros in final factor ............ 26665 56.6% sparse
    rows dropped from L ................. 247
    rows added to L ..................... 0
    rank 1 downdates to L ............... 0
    rank 1 updates to L ................. 0
    Size breakdown of the updates ([size]: number of this size):
    No. of solves:   83

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 5.221367e-04
Initialization (includes partition) ..... 1.019001e-03
Phase 1 ................................. 3.340006e-03
Coordinate ascent ....................... 1.480579e-04
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 9.417534e-05
DASA .................................... 5.690408e-02
DASA line search ........................ 1.906872e-03
Check error ............................. 1.409054e-04
Proximal update ......................... 3.266335e-04
Invert permutation ...................... 1.308918e-04
Row modifications of Cholesky factor .... 2.451420e-02
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 2.815413e-02
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 1.553059e-03
Forward solves .......................... 5.507469e-05


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Number of iterations: 0         
Function evaluations: 0         
Gradient evaluations: 0         

!!  GMNCASE4    175       0       0       0       0       0       0       2       2     0    7.2881616e-11    5.9468849e+03    0.062306
 Final f                         = 5.9468849e+03   
 Function value at final x       = 5.9468849e+03   
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   GRIDNETD

 Problem name: GRIDNETD

 Double precision version will be formed

 The objective function uses 1 nonlinear group
 
 There are 3844 linear equality constraints
 
 There are 4899 free variables
 There are 241 variables bounded only from below 
 There are 4 variables bounded from below and above 
 There are 2420 fixed variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully
xx pprojparm->cholmod: 1

 Problem: GRIDNETD (n = 7564)
walltime at start:     0.000000

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 8.717877e-07 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 8.717876825162165e-07    
Final f                               : 5.707119019105057e+02    

Iterations of gradient projection (GP): 1         
Iterations of active set GP           : 11        
Function evaluation in main code      : 1         
Function evaluations in GP            : 2         
Function evaluations in active set GP : 11        
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 1         
Gradient evaluations in active set GP : 11        


PPROJ run statistics (Version 2.0, May 1, 2018):

No. blocks in multilevel partition of A . 40
Depth of multilevel partition tree ...... 3
Phase 1 iterations ...................... 15
Coordinate ascent iterations ............ 1
    variables freed in coordinate ascent  3
    rows dropped in coordinate ascent ... 0
Gradient ascent iterations .............. 0
    variables freed in gradient ascent .. 0
    rows dropped in gradient ascent ..... 0
Preconditioned CG iterations ............ 0
    variables freed in CG ............... 0
    rows dropped in CG .................. 0
SpaRSA iterations ....................... 6
    change in column activity ........... 1
    change in row activity .............. 0
    failures of Armijo step ............. 3
Proximal updates ........................ 6
Cholesky factorizations ................. 2
    nonzeros in final factor ............ 14470 99.8% sparse
    rows dropped from L ................. 0
    rows added to L ..................... 0
    rank 1 downdates to L ............... 8
    rank 1 updates to L ................. 149
    Size breakdown of the updates ([size]: number of this size):
        updowns [  1]: 14
        updowns [  2]: 2
        updowns [  3]: 3
        updowns [  4]: 1
        updowns [  5]: 2
        updowns [  7]: 1
        updowns [ 11]: 1
        updowns [ 12]: 1
        updowns [ 41]: 1
        updowns [ 45]: 1
    No. of solves by depth in the multilevel partition tree:
        (deeper <=> further from root of tree <=> fewer flops)
        depth [ 0]: 10
        depth [ 1]: 36
        depth [ 2]: 115
        depth [ 3]: 161

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 5.897045e-03
Initialization (includes partition) ..... 7.681608e-03
Phase 1 ................................. 9.527922e-03
Coordinate ascent ....................... 8.296967e-05
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 1.869202e-04
DASA .................................... 8.524656e-03
DASA line search ........................ 1.935244e-03
Check error ............................. 1.303673e-03
Proximal update ......................... 1.379490e-03
Invert permutation ...................... 1.194477e-04
Row modifications of Cholesky factor .... 3.051758e-05
Column modifications of Cholesky factor . 5.288124e-04
Cholesky factorization .................. 1.411915e-03
Partial Cholesky factorization .......... 1.306534e-04
Back solves ............................. 1.197100e-03
Forward solves .......................... 6.642342e-04


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             :  5.707119019796614e+02
sup-norm of gradient:  8.717876825162165e-07
Number of iterations: 46        
Function evaluations: 83        
Gradient evaluations: 52        

!!  GRIDNETD   7564       1       2       1      46      83      52      14       2     0    8.7178768e-07    5.7071190e+02    0.086049
 Final f                         = 5.7071190e+02   
 Function value at final x       = 5.7071190e+02   
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   GRIDNETE

 Problem name: GRIDNETE

 Double precision version will be formed

 The objective function uses 1 nonlinear group
 
 There are 3844 linear equality constraints
 
 There are 7564 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully
xx pprojparm->cholmod: 1

 Problem: GRIDNETE (n = 7564)
walltime at start:     0.000001

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 8.783139e-07 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 8.783139471973955e-07    
Final f                               : 2.064805091605128e+02    

Iterations of gradient projection (GP): 0         
Iterations of active set GP           : 1         
Function evaluation in main code      : 1         
Function evaluations in GP            : 0         
Function evaluations in active set GP : 1         
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 0         
Gradient evaluations in active set GP : 1         


PPROJ run statistics (Version 2.0, May 1, 2018):

No. blocks in multilevel partition of A . 15
Depth of multilevel partition tree ...... 3
Phase 1 iterations ...................... 15
Coordinate ascent iterations ............ 2
    variables freed in coordinate ascent  0
    rows dropped in coordinate ascent ... 0
Gradient ascent iterations .............. 2
    variables freed in gradient ascent .. 0
    rows dropped in gradient ascent ..... 0
Preconditioned CG iterations ............ 6
    variables freed in CG ............... 0
    rows dropped in CG .................. 0
SpaRSA iterations ....................... 2
    change in column activity ........... 0
    change in row activity .............. 0
    failures of Armijo step ............. 0
Proximal updates ........................ 2
Cholesky factorizations ................. 2
    nonzeros in final factor ............ 65319 99.1% sparse
    rows dropped from L ................. 0
    rows added to L ..................... 0
    rank 1 downdates to L ............... 0
    rank 1 updates to L ................. 0
    Size breakdown of the updates ([size]: number of this size):
    No. of solves by depth in the multilevel partition tree:
        (deeper <=> further from root of tree <=> fewer flops)
        depth [ 0]: 2
        depth [ 1]: 4
        depth [ 2]: 8
        depth [ 3]: 16

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 1.094222e-02
Initialization (includes partition) ..... 1.154900e-02
Phase 1 ................................. 1.032186e-02
Coordinate ascent ....................... 1.931190e-04
SSOR0 ................................... 3.659725e-04
SSOR1 ................................... 1.235008e-03
SpaRSA .................................. 1.499653e-04
DASA .................................... 1.389813e-02
DASA line search ........................ 4.854202e-04
Check error ............................. 3.352165e-04
Proximal update ......................... 4.863739e-04
Invert permutation ...................... 2.121925e-05
Row modifications of Cholesky factor .... 1.907349e-06
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 3.378868e-03
Partial Cholesky factorization .......... 6.482363e-03
Back solves ............................. 4.980564e-04
Forward solves .......................... 3.185272e-04


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             :  2.064805091618872e+02
sup-norm of gradient:  8.783139471973955e-07
Number of iterations: 48        
Function evaluations: 96        
Gradient evaluations: 48        

!!  GRIDNETE   7564       0       0       0      48      96      48       3       2     0    8.7831395e-07    2.0648051e+02    0.100479
 Final f                         = 2.0648051e+02   
 Function value at final x       = 2.0648051e+02   
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   GRIDNETF

 Problem name: GRIDNETF

 Double precision version will be formed

 The objective function uses 1 nonlinear group
 
 There are 3844 linear equality constraints
 
 There are 5043 free variables
 There are 2521 variables bounded only from below 
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully
xx pprojparm->cholmod: 1

 Problem: GRIDNETF (n = 7564)
walltime at start:     0.000001

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 8.025892e-07 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 8.025891999495790e-07    
Final f                               : 2.435423262366721e+02    

Iterations of gradient projection (GP): 3         
Iterations of active set GP           : 22        
Function evaluation in main code      : 1         
Function evaluations in GP            : 4         
Function evaluations in active set GP : 25        
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 3         
Gradient evaluations in active set GP : 22        


PPROJ run statistics (Version 2.0, May 1, 2018):

No. blocks in multilevel partition of A . 15
Depth of multilevel partition tree ...... 3
Phase 1 iterations ...................... 15
Coordinate ascent iterations ............ 1
    variables freed in coordinate ascent  9
    rows dropped in coordinate ascent ... 0
Gradient ascent iterations .............. 48
    variables freed in gradient ascent .. 181
    rows dropped in gradient ascent ..... 0
Preconditioned CG iterations ............ 3
    variables freed in CG ............... 298
    rows dropped in CG .................. 0
SpaRSA iterations ....................... 23
    change in column activity ........... 26
    change in row activity .............. 0
    failures of Armijo step ............. 12
Proximal updates ........................ 23
Cholesky factorizations ................. 6
    nonzeros in final factor ............ 52882 99.3% sparse
    rows dropped from L ................. 0
    rows added to L ..................... 0
    rank 1 downdates to L ............... 294
    rank 1 updates to L ................. 2011
    Size breakdown of the updates ([size]: number of this size):
        updowns [  1]: 19
        updowns [  2]: 11
        updowns [  3]: 8
        updowns [  4]: 7
        updowns [  5]: 9
        updowns [  6]: 4
        updowns [  7]: 2
        updowns [  8]: 5
        updowns [  9]: 1
        updowns [ 11]: 1
        updowns [ 12]: 1
        updowns [ 13]: 1
        updowns [ 15]: 1
        updowns [ 17]: 1
        updowns [ 20]: 2
        updowns [ 21]: 1
        updowns [ 22]: 2
        updowns [ 23]: 1
        updowns [ 25]: 1
        updowns [ 27]: 2
        updowns [ 28]: 2
        updowns [ 29]: 1
        updowns [ 30]: 3
        updowns [ 33]: 2
        updowns [ 34]: 1
        updowns [ 37]: 1
        updowns [ 38]: 1
        updowns [ 49]: 1
        updowns [ 51]: 1
        updowns [ 64]: 1
        updowns [ 75]: 1
        updowns [ 86]: 1
        updowns [ 92]: 1
        updowns [ 95]: 1
        updowns [150]: 1
        updowns [152]: 1
        updowns [178]: 1
        updowns [212]: 1
        updowns [251]: 1
    No. of solves by depth in the multilevel partition tree:
        (deeper <=> further from root of tree <=> fewer flops)
        depth [ 0]: 48
        depth [ 1]: 94
        depth [ 2]: 180
        depth [ 3]: 348

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 1.091409e-02
Initialization (includes partition) ..... 1.662660e-02
Phase 1 ................................. 1.626897e-02
Coordinate ascent ....................... 1.320839e-04
SSOR0 ................................... 9.061098e-03
SSOR1 ................................... 7.598400e-04
SpaRSA .................................. 2.670288e-04
DASA .................................... 1.025834e-01
DASA line search ........................ 1.169133e-02
Check error ............................. 6.942511e-03
Proximal update ......................... 5.875111e-03
Invert permutation ...................... 2.272129e-04
Row modifications of Cholesky factor .... 1.249313e-04
Column modifications of Cholesky factor . 1.915121e-02
Cholesky factorization .................. 7.764816e-03
Partial Cholesky factorization .......... 1.486349e-02
Back solves ............................. 1.212811e-02
Forward solves .......................... 1.042795e-02


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             :  2.435423262408396e+02
sup-norm of gradient:  8.025891999495790e-07
Number of iterations: 40        
Function evaluations: 76        
Gradient evaluations: 43        

!!  GRIDNETF   7564       3       4       3      40      76      43      28       6     0    8.0258920e-07    2.4354233e+02    0.220193
 Final f                         = 2.4354233e+02   
 Function value at final x       = 2.4354233e+02   
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   GRIDNETG

 Problem name: GRIDNETG

 Double precision version will be formed

 The objective function uses 1 nonlinear group
 
 There are 3844 linear equality constraints
 
 There are 4899 free variables
 There are 241 variables bounded only from below 
 There are 4 variables bounded from below and above 
 There are 2420 fixed variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully
xx pprojparm->cholmod: 1

 Problem: GRIDNETG (n = 7564)
walltime at start:     0.000001

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 4.702363e-07 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 4.702362841613184e-07    
Final f                               : 6.157842031355798e+02    

Iterations of gradient projection (GP): 1         
Iterations of active set GP           : 11        
Function evaluation in main code      : 1         
Function evaluations in GP            : 2         
Function evaluations in active set GP : 13        
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 1         
Gradient evaluations in active set GP : 11        


PPROJ run statistics (Version 2.0, May 1, 2018):

No. blocks in multilevel partition of A . 40
Depth of multilevel partition tree ...... 3
Phase 1 iterations ...................... 15
Coordinate ascent iterations ............ 1
    variables freed in coordinate ascent  3
    rows dropped in coordinate ascent ... 0
Gradient ascent iterations .............. 0
    variables freed in gradient ascent .. 0
    rows dropped in gradient ascent ..... 0
Preconditioned CG iterations ............ 0
    variables freed in CG ............... 0
    rows dropped in CG .................. 0
SpaRSA iterations ....................... 8
    change in column activity ........... 2
    change in row activity .............. 0
    failures of Armijo step ............. 7
Proximal updates ........................ 8
Cholesky factorizations ................. 2
    nonzeros in final factor ............ 14479 99.8% sparse
    rows dropped from L ................. 0
    rows added to L ..................... 0
    rank 1 downdates to L ............... 25
    rank 1 updates to L ................. 189
    Size breakdown of the updates ([size]: number of this size):
        updowns [  1]: 14
        updowns [  2]: 4
        updowns [  3]: 4
        updowns [  4]: 5
        updowns [  5]: 2
        updowns [  7]: 3
        updowns [  8]: 1
        updowns [ 11]: 1
        updowns [ 12]: 2
        updowns [ 41]: 1
        updowns [ 45]: 1
    No. of solves by depth in the multilevel partition tree:
        (deeper <=> further from root of tree <=> fewer flops)
        depth [ 0]: 13
        depth [ 1]: 53
        depth [ 2]: 178
        depth [ 3]: 252

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 5.947113e-03
Initialization (includes partition) ..... 7.770538e-03
Phase 1 ................................. 9.570837e-03
Coordinate ascent ....................... 8.296967e-05
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 1.850128e-04
DASA .................................... 1.185870e-02
DASA line search ........................ 2.808809e-03
Check error ............................. 2.134323e-03
Proximal update ......................... 1.849890e-03
Invert permutation ...................... 1.225471e-04
Row modifications of Cholesky factor .... 2.717972e-05
Column modifications of Cholesky factor . 6.167889e-04
Cholesky factorization .................. 1.418352e-03
Partial Cholesky factorization .......... 1.292229e-04
Back solves ............................. 1.738310e-03
Forward solves .......................... 1.063347e-03


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             :  6.157842032178270e+02
sup-norm of gradient:  4.702362841613184e-07
Number of iterations: 56        
Function evaluations: 100       
Gradient evaluations: 64        

!!  GRIDNETG   7564       1       2       1      56     100      64      14       2     0    4.7023628e-07    6.1578420e+02    0.102422
 Final f                         = 6.1578420e+02   
 Function value at final x       = 6.1578420e+02   
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   GRIDNETH

 Problem name: GRIDNETH

 Double precision version will be formed

 The objective function uses 1 nonlinear group
 
 There are 3844 linear equality constraints
 
 There are 7564 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully
xx pprojparm->cholmod: 1

 Problem: GRIDNETH (n = 7564)
walltime at start:     0.000000

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 8.605162e-07 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 8.605161953070817e-07    
Final f                               : 2.064805091605429e+02    

Iterations of gradient projection (GP): 0         
Iterations of active set GP           : 1         
Function evaluation in main code      : 1         
Function evaluations in GP            : 0         
Function evaluations in active set GP : 1         
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 0         
Gradient evaluations in active set GP : 1         


PPROJ run statistics (Version 2.0, May 1, 2018):

No. blocks in multilevel partition of A . 15
Depth of multilevel partition tree ...... 3
Phase 1 iterations ...................... 15
Coordinate ascent iterations ............ 2
    variables freed in coordinate ascent  0
    rows dropped in coordinate ascent ... 0
Gradient ascent iterations .............. 2
    variables freed in gradient ascent .. 0
    rows dropped in gradient ascent ..... 0
Preconditioned CG iterations ............ 6
    variables freed in CG ............... 0
    rows dropped in CG .................. 0
SpaRSA iterations ....................... 2
    change in column activity ........... 0
    change in row activity .............. 0
    failures of Armijo step ............. 1
Proximal updates ........................ 2
Cholesky factorizations ................. 2
    nonzeros in final factor ............ 65319 99.1% sparse
    rows dropped from L ................. 0
    rows added to L ..................... 0
    rank 1 downdates to L ............... 0
    rank 1 updates to L ................. 0
    Size breakdown of the updates ([size]: number of this size):
    No. of solves by depth in the multilevel partition tree:
        (deeper <=> further from root of tree <=> fewer flops)
        depth [ 0]: 2
        depth [ 1]: 4
        depth [ 2]: 8
        depth [ 3]: 16

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 1.093721e-02
Initialization (includes partition) ..... 1.153183e-02
Phase 1 ................................. 1.030540e-02
Coordinate ascent ....................... 2.119541e-04
SSOR0 ................................... 3.631115e-04
SSOR1 ................................... 1.239061e-03
SpaRSA .................................. 1.909733e-04
DASA .................................... 1.399398e-02
DASA line search ........................ 4.889965e-04
Check error ............................. 3.371239e-04
Proximal update ......................... 4.892349e-04
Invert permutation ...................... 2.002716e-05
Row modifications of Cholesky factor .... 3.814697e-06
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 3.385067e-03
Partial Cholesky factorization .......... 6.508589e-03
Back solves ............................. 5.035400e-04
Forward solves .......................... 3.192425e-04


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             :  2.064805091619174e+02
sup-norm of gradient:  8.605161953070817e-07
Number of iterations: 48        
Function evaluations: 96        
Gradient evaluations: 48        

!!  GRIDNETH   7564       0       0       0      48      96      48       3       2     0    8.6051620e-07    2.0648051e+02    0.100460
 Final f                         = 2.0648051e+02   
 Function value at final x       = 2.0648051e+02   
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   GRIDNETI

 Problem name: GRIDNETI

 Double precision version will be formed

 The objective function uses 1 nonlinear group
 
 There are 3844 linear equality constraints
 
 There are 5043 free variables
 There are 2521 variables bounded only from below 
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully
xx pprojparm->cholmod: 1

 Problem: GRIDNETI (n = 7564)
walltime at start:     0.000000

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 7.515424e-07 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 7.515424496295450e-07    
Final f                               : 2.435423262499826e+02    

Iterations of gradient projection (GP): 3         
Iterations of active set GP           : 22        
Function evaluation in main code      : 1         
Function evaluations in GP            : 4         
Function evaluations in active set GP : 25        
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 3         
Gradient evaluations in active set GP : 22        


PPROJ run statistics (Version 2.0, May 1, 2018):

No. blocks in multilevel partition of A . 15
Depth of multilevel partition tree ...... 3
Phase 1 iterations ...................... 15
Coordinate ascent iterations ............ 1
    variables freed in coordinate ascent  9
    rows dropped in coordinate ascent ... 0
Gradient ascent iterations .............. 48
    variables freed in gradient ascent .. 181
    rows dropped in gradient ascent ..... 0
Preconditioned CG iterations ............ 3
    variables freed in CG ............... 298
    rows dropped in CG .................. 0
SpaRSA iterations ....................... 23
    change in column activity ........... 25
    change in row activity .............. 0
    failures of Armijo step ............. 15
Proximal updates ........................ 23
Cholesky factorizations ................. 6
    nonzeros in final factor ............ 52882 99.3% sparse
    rows dropped from L ................. 0
    rows added to L ..................... 0
    rank 1 downdates to L ............... 293
    rank 1 updates to L ................. 2010
    Size breakdown of the updates ([size]: number of this size):
        updowns [  1]: 19
        updowns [  2]: 13
        updowns [  3]: 6
        updowns [  4]: 9
        updowns [  5]: 7
        updowns [  6]: 4
        updowns [  7]: 2
        updowns [  8]: 5
        updowns [  9]: 1
        updowns [ 11]: 1
        updowns [ 12]: 1
        updowns [ 13]: 1
        updowns [ 15]: 1
        updowns [ 17]: 1
        updowns [ 20]: 2
        updowns [ 21]: 1
        updowns [ 22]: 2
        updowns [ 23]: 1
        updowns [ 25]: 1
        updowns [ 27]: 1
        updowns [ 28]: 3
        updowns [ 29]: 1
        updowns [ 30]: 3
        updowns [ 33]: 2
        updowns [ 34]: 1
        updowns [ 37]: 1
        updowns [ 38]: 1
        updowns [ 49]: 1
        updowns [ 51]: 1
        updowns [ 65]: 1
        updowns [ 75]: 1
        updowns [ 86]: 1
        updowns [ 92]: 1
        updowns [ 95]: 1
        updowns [150]: 1
        updowns [152]: 1
        updowns [178]: 1
        updowns [212]: 1
        updowns [251]: 1
    No. of solves by depth in the multilevel partition tree:
        (deeper <=> further from root of tree <=> fewer flops)
        depth [ 0]: 48
        depth [ 1]: 94
        depth [ 2]: 180
        depth [ 3]: 347

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 1.094818e-02
Initialization (includes partition) ..... 1.680660e-02
Phase 1 ................................. 1.617217e-02
Coordinate ascent ....................... 1.380444e-04
SSOR0 ................................... 9.135962e-03
SSOR1 ................................... 7.760525e-04
SpaRSA .................................. 1.969337e-04
DASA .................................... 1.032443e-01
DASA line search ........................ 1.171684e-02
Check error ............................. 6.929159e-03
Proximal update ......................... 5.933523e-03
Invert permutation ...................... 2.338886e-04
Row modifications of Cholesky factor .... 1.132488e-04
Column modifications of Cholesky factor . 1.935863e-02
Cholesky factorization .................. 7.792950e-03
Partial Cholesky factorization .......... 1.491284e-02
Back solves ............................. 1.208568e-02
Forward solves .......................... 1.044202e-02


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             :  2.435423262540583e+02
sup-norm of gradient:  7.515424496295450e-07
Number of iterations: 40        
Function evaluations: 77        
Gradient evaluations: 42        

!!  GRIDNETI   7564       3       4       3      40      77      42      28       6     0    7.5154245e-07    2.4354233e+02    0.221454
 Final f                         = 2.4354233e+02   
 Function value at final x       = 2.4354233e+02   
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   HAGER1

 Problem name: HAGER1

 Double precision version will be formed

 The objective function uses 2501 nonlinear groups
 
 There are 2500 linear equality constraints
 
 There are 5000 free variables
 There is 1 fixed variable
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully
xx pprojparm->cholmod: 1

 Problem: HAGER1 (n = 5001)
walltime at start:     0.000000

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 2.369946e-08 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 2.369946321692995e-08    
Final f                               : 8.807970809155822e-01    

Iterations of gradient projection (GP): 0         
Iterations of active set GP           : 1         
Function evaluation in main code      : 1         
Function evaluations in GP            : 0         
Function evaluations in active set GP : 1         
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 0         
Gradient evaluations in active set GP : 1         


PPROJ run statistics (Version 2.0, May 1, 2018):

No. blocks in multilevel partition of A . 15
Depth of multilevel partition tree ...... 3
Phase 1 iterations ...................... 13
Coordinate ascent iterations ............ 2
    variables freed in coordinate ascent  0
    rows dropped in coordinate ascent ... 0
Gradient ascent iterations .............. 0
    variables freed in gradient ascent .. 0
    rows dropped in gradient ascent ..... 0
Preconditioned CG iterations ............ 0
    variables freed in CG ............... 0
    rows dropped in CG .................. 0
SpaRSA iterations ....................... 2
    change in column activity ........... 0
    change in row activity .............. 0
    failures of Armijo step ............. 1
Proximal updates ........................ 2
Cholesky factorizations ................. 2
    nonzeros in final factor ............ 7288 99.8% sparse
    rows dropped from L ................. 0
    rows added to L ..................... 0
    rank 1 downdates to L ............... 0
    rank 1 updates to L ................. 0
    Size breakdown of the updates ([size]: number of this size):
    No. of solves by depth in the multilevel partition tree:
        (deeper <=> further from root of tree <=> fewer flops)
        depth [ 0]: 2
        depth [ 1]: 6
        depth [ 2]: 14
        depth [ 3]: 8

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 2.409935e-03
Initialization (includes partition) ..... 2.777100e-03
Phase 1 ................................. 1.011801e-02
Coordinate ascent ....................... 2.188683e-04
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 9.012222e-05
DASA .................................... 2.985954e-03
DASA line search ........................ 4.146099e-04
Check error ............................. 3.409386e-04
Proximal update ......................... 2.784729e-04
Invert permutation ...................... 1.311302e-05
Row modifications of Cholesky factor .... 2.861023e-06
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 8.449554e-04
Partial Cholesky factorization .......... 4.458427e-05
Back solves ............................. 4.022121e-04
Forward solves .......................... 1.924038e-04


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             :  8.807970809156176e-01
sup-norm of gradient:  2.369946321692995e-08
Number of iterations: 3         
Function evaluations: 6         
Gradient evaluations: 3         

!!    HAGER1   5001       0       0       0       3       6       3       3       2     0    2.3699463e-08    8.8079708e-01    0.018741
 Final f                         = 8.8079708e-01   
 Function value at final x       = 8.8079708e-01   
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   HAGER2

 Problem name: HAGER2

 Double precision version will be formed

 The objective function uses 5000 nonlinear groups
 
 There are 2500 linear equality constraints
 
 There are 5000 free variables
 There is 1 fixed variable
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully
xx pprojparm->cholmod: 1

 Problem: HAGER2 (n = 5001)
walltime at start:     0.000000

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 5.726208e-08 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 5.726207554586533e-08    
Final f                               : 4.320822586636269e-01    

Iterations of gradient projection (GP): 0         
Iterations of active set GP           : 1         
Function evaluation in main code      : 1         
Function evaluations in GP            : 0         
Function evaluations in active set GP : 1         
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 0         
Gradient evaluations in active set GP : 1         


PPROJ run statistics (Version 2.0, May 1, 2018):

No. blocks in multilevel partition of A . 15
Depth of multilevel partition tree ...... 3
Phase 1 iterations ...................... 13
Coordinate ascent iterations ............ 2
    variables freed in coordinate ascent  0
    rows dropped in coordinate ascent ... 0
Gradient ascent iterations .............. 0
    variables freed in gradient ascent .. 0
    rows dropped in gradient ascent ..... 0
Preconditioned CG iterations ............ 0
    variables freed in CG ............... 0
    rows dropped in CG .................. 0
SpaRSA iterations ....................... 2
    change in column activity ........... 0
    change in row activity .............. 0
    failures of Armijo step ............. 0
Proximal updates ........................ 2
Cholesky factorizations ................. 2
    nonzeros in final factor ............ 7288 99.8% sparse
    rows dropped from L ................. 0
    rows added to L ..................... 0
    rank 1 downdates to L ............... 0
    rank 1 updates to L ................. 0
    Size breakdown of the updates ([size]: number of this size):
    No. of solves by depth in the multilevel partition tree:
        (deeper <=> further from root of tree <=> fewer flops)
        depth [ 0]: 2
        depth [ 1]: 6
        depth [ 2]: 14
        depth [ 3]: 8

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 2.441168e-03
Initialization (includes partition) ..... 2.821922e-03
Phase 1 ................................. 1.018906e-02
Coordinate ascent ....................... 2.582073e-04
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 8.893013e-05
DASA .................................... 2.951860e-03
DASA line search ........................ 4.360676e-04
Check error ............................. 3.497601e-04
Proximal update ......................... 2.789497e-04
Invert permutation ...................... 1.287460e-05
Row modifications of Cholesky factor .... 3.814697e-06
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 8.330345e-04
Partial Cholesky factorization .......... 4.673004e-05
Back solves ............................. 3.898144e-04
Forward solves .......................... 1.907349e-04


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             :  4.320822590564583e-01
sup-norm of gradient:  5.726207554586533e-08
Number of iterations: 2         
Function evaluations: 4         
Gradient evaluations: 2         

!!    HAGER2   5001       0       0       0       2       4       2       3       2     0    5.7262076e-08    4.3208226e-01    0.019552
 Final f                         = 4.3208226e-01   
 Function value at final x       = 4.3208226e-01   
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   HAGER3

 Problem name: HAGER3

 Double precision version will be formed

 The objective function uses 5000 nonlinear groups
 
 There are 2500 linear equality constraints
 
 There are 5000 free variables
 There is 1 fixed variable
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully
xx pprojparm->cholmod: 1

 Problem: HAGER3 (n = 5001)
walltime at start:     0.000001

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 5.916466e-08 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 5.916465586918752e-08    
Final f                               : 1.409612553702352e-01    

Iterations of gradient projection (GP): 0         
Iterations of active set GP           : 1         
Function evaluation in main code      : 1         
Function evaluations in GP            : 0         
Function evaluations in active set GP : 1         
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 0         
Gradient evaluations in active set GP : 1         


PPROJ run statistics (Version 2.0, May 1, 2018):

No. blocks in multilevel partition of A . 15
Depth of multilevel partition tree ...... 3
Phase 1 iterations ...................... 13
Coordinate ascent iterations ............ 2
    variables freed in coordinate ascent  0
    rows dropped in coordinate ascent ... 0
Gradient ascent iterations .............. 0
    variables freed in gradient ascent .. 0
    rows dropped in gradient ascent ..... 0
Preconditioned CG iterations ............ 0
    variables freed in CG ............... 0
    rows dropped in CG .................. 0
SpaRSA iterations ....................... 2
    change in column activity ........... 0
    change in row activity .............. 0
    failures of Armijo step ............. 0
Proximal updates ........................ 2
Cholesky factorizations ................. 2
    nonzeros in final factor ............ 7288 99.8% sparse
    rows dropped from L ................. 0
    rows added to L ..................... 0
    rank 1 downdates to L ............... 0
    rank 1 updates to L ................. 0
    Size breakdown of the updates ([size]: number of this size):
    No. of solves by depth in the multilevel partition tree:
        (deeper <=> further from root of tree <=> fewer flops)
        depth [ 0]: 2
        depth [ 1]: 6
        depth [ 2]: 14
        depth [ 3]: 8

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 2.414942e-03
Initialization (includes partition) ..... 2.799988e-03
Phase 1 ................................. 1.021004e-02
Coordinate ascent ....................... 2.667904e-04
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 9.608269e-05
DASA .................................... 2.987862e-03
DASA line search ........................ 4.422665e-04
Check error ............................. 3.492832e-04
Proximal update ......................... 2.870560e-04
Invert permutation ...................... 1.287460e-05
Row modifications of Cholesky factor .... 5.006790e-06
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 8.389950e-04
Partial Cholesky factorization .......... 4.625320e-05
Back solves ............................. 3.983974e-04
Forward solves .......................... 1.909733e-04


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             :  1.409612556294952e-01
sup-norm of gradient:  5.916465586918752e-08
Number of iterations: 2         
Function evaluations: 4         
Gradient evaluations: 2         

!!    HAGER3   5001       0       0       0       2       4       2       3       2     0    5.9164656e-08    1.4096126e-01    0.020031
 Final f                         = 1.4096126e-01   
 Function value at final x       = 1.4096126e-01   
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   HAGER4

 Problem name: HAGER4

 Double precision version will be formed

 The objective function uses 1 nonlinear group
 
 There are 2500 linear equality constraints
 
 There are 2500 free variables
 There are 2500 variables bounded only from above 
 There is 1 fixed variable
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully
xx pprojparm->cholmod: 1

 Problem: HAGER4 (n = 5001)
walltime at start:     0.000001

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 9.845861e-07 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 9.845860532862387e-07    
Final f                               : 2.794084067845239e+00    

Iterations of gradient projection (GP): 1         
Iterations of active set GP           : 3         
Function evaluation in main code      : 1         
Function evaluations in GP            : 1         
Function evaluations in active set GP : 3         
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 1         
Gradient evaluations in active set GP : 3         


PPROJ run statistics (Version 2.0, May 1, 2018):

No. blocks in multilevel partition of A . 15
Depth of multilevel partition tree ...... 3
Phase 1 iterations ...................... 13
Coordinate ascent iterations ............ 5
    variables freed in coordinate ascent  0
    rows dropped in coordinate ascent ... 0
Gradient ascent iterations .............. 0
    variables freed in gradient ascent .. 0
    rows dropped in gradient ascent ..... 0
Preconditioned CG iterations ............ 0
    variables freed in CG ............... 0
    rows dropped in CG .................. 0
SpaRSA iterations ....................... 3
    change in column activity ........... 0
    change in row activity .............. 0
    failures of Armijo step ............. 1
Proximal updates ........................ 3
Cholesky factorizations ................. 9
    nonzeros in final factor ............ 7288 99.8% sparse
    rows dropped from L ................. 0
    rows added to L ..................... 0
    rank 1 downdates to L ............... 7
    rank 1 updates to L ................. 0
    Size breakdown of the updates ([size]: number of this size):
        updowns [  7]: 1
    No. of solves by depth in the multilevel partition tree:
        (deeper <=> further from root of tree <=> fewer flops)
        depth [ 0]: 10
        depth [ 1]: 30
        depth [ 2]: 70
        depth [ 3]: 40

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 2.408981e-03
Initialization (includes partition) ..... 3.005266e-03
Phase 1 ................................. 5.949497e-03
Coordinate ascent ....................... 2.930164e-04
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 1.399517e-04
DASA .................................... 7.329464e-03
DASA line search ........................ 1.334906e-03
Check error ............................. 1.315117e-03
Proximal update ......................... 4.386902e-04
Invert permutation ...................... 3.504753e-05
Row modifications of Cholesky factor .... 1.907349e-05
Column modifications of Cholesky factor . 9.417534e-05
Cholesky factorization .................. 2.950907e-03
Partial Cholesky factorization .......... 2.102852e-04
Back solves ............................. 5.829334e-04
Forward solves .......................... 4.103184e-04


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             :  2.794256324971653e+00
sup-norm of gradient:  1.459248928800181e-06
Number of iterations: 1         
Function evaluations: 2         
Gradient evaluations: 1         

!!    HAGER4   5001       1       1       1       1       2       1       6       9     0    9.8458605e-07    2.7940841e+00    0.020174
 Final f                         = 2.7940841e+00   
 Function value at final x       = 2.7940841e+00   
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   HIMMELBI

 Problem name: HIMMELBI

 Double precision version will be formed

 The objective function uses 20 nonlinear groups
 
 There are 12 linear inequality constraints
 
 There are 100 variables bounded from below and above 
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully
xx pprojparm->cholmod: 1

 Problem: HIMMELBI (n = 100)
walltime at start:     0.000001

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 8.599032e-07 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 8.599032238413955e-07    
Final f                               : -1.735569579855782e+03   

Iterations of gradient projection (GP): 2         
Iterations of active set GP           : 31        
Function evaluation in main code      : 1         
Function evaluations in GP            : 3         
Function evaluations in active set GP : 39        
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 2         
Gradient evaluations in active set GP : 31        


PPROJ run statistics (Version 2.0, May 1, 2018):

No. blocks in multilevel partition of A . 1
Depth of multilevel partition tree ...... 0
Phase 1 iterations ...................... 5
Coordinate ascent iterations ............ 8
    variables freed in coordinate ascent  4
    rows dropped in coordinate ascent ... 0
Gradient ascent iterations .............. 0
    variables freed in gradient ascent .. 0
    rows dropped in gradient ascent ..... 0
Preconditioned CG iterations ............ 0
    variables freed in CG ............... 0
    rows dropped in CG .................. 0
SpaRSA iterations ....................... 18
    change in column activity ........... 32
    change in row activity .............. 0
    failures of Armijo step ............. 7
Proximal updates ........................ 18
Cholesky factorizations ................. 5
    nonzeros in final factor ............ 11 85.9% sparse
    rows dropped from L ................. 2
    rows added to L ..................... 4
    rank 1 downdates to L ............... 49
    rank 1 updates to L ................. 19
    Size breakdown of the updates ([size]: number of this size):
        updowns [  1]: 26
        updowns [  2]: 2
        updowns [  3]: 2
        updowns [  7]: 1
        updowns [ 12]: 1
        updowns [ 13]: 1
    No. of solves:   19

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 5.793571e-05
Initialization (includes partition) ..... 1.404285e-04
Phase 1 ................................. 1.223087e-04
Coordinate ascent ....................... 1.263618e-05
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 5.006790e-06
DASA .................................... 4.017353e-04
DASA line search ........................ 2.574921e-05
Check error ............................. 9.059906e-05
Proximal update ......................... 1.003742e-04
Invert permutation ...................... 2.932549e-05
Row modifications of Cholesky factor .... 2.479553e-05
Column modifications of Cholesky factor . 1.308918e-04
Cholesky factorization .................. 4.482269e-05
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 1.096725e-05
Forward solves .......................... 1.406670e-05


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             : -1.735569579855782e+03
sup-norm of gradient:  8.599032238413955e-07
Number of iterations: 59        
Function evaluations: 104       
Gradient evaluations: 59        

!!  HIMMELBI    100       2       3       2      59     104      59      35       5     0    8.5990322e-07   -1.7355696e+03    0.004210
 Final f                         = -1.7355696e+03  
 Function value at final x       = -1.7355696e+03  
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   HONG

 Problem name: HONG

 Double precision version will be formed

 The objective function uses 1 nonlinear group
 
 There is 1 linear equality constraint
 
 There are 4 variables bounded from below and above 
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully
xx pprojparm->cholmod: 1

 Problem: HONG (n = 4)
walltime at start:     0.000000

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 7.583759e-07 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 7.583759191742701e-07    
Final f                               : 2.257108736348865e+01    

Iterations of gradient projection (GP): 1         
Iterations of active set GP           : 1         
Function evaluation in main code      : 1         
Function evaluations in GP            : 1         
Function evaluations in active set GP : 1         
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 1         
Gradient evaluations in active set GP : 1         


PPROJ run statistics (Version 2.0, May 1, 2018):

No. blocks in multilevel partition of A . 1
Depth of multilevel partition tree ...... 0
Phase 1 iterations ...................... 5
Coordinate ascent iterations ............ 1
    variables freed in coordinate ascent  0
    rows dropped in coordinate ascent ... 0
Gradient ascent iterations .............. 0
    variables freed in gradient ascent .. 0
    rows dropped in gradient ascent ..... 0
Preconditioned CG iterations ............ 0
    variables freed in CG ............... 0
    rows dropped in CG .................. 0
SpaRSA iterations ....................... 2
    change in column activity ........... 0
    change in row activity .............. 0
    failures of Armijo step ............. 0
Proximal updates ........................ 2
Cholesky factorizations ................. 2
    nonzeros in final factor ............ 1  0.0% sparse
    rows dropped from L ................. 0
    rows added to L ..................... 0
    rank 1 downdates to L ............... 0
    rank 1 updates to L ................. 0
    Size breakdown of the updates ([size]: number of this size):
    No. of solves:   2

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 2.503395e-05
Initialization (includes partition) ..... 5.006790e-05
Phase 1 ................................. 2.765656e-05
Coordinate ascent ....................... 0.000000e+00
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 9.536743e-07
DASA .................................... 4.291534e-05
DASA line search ........................ 2.145767e-06
Check error ............................. 1.287460e-05
Proximal update ......................... 5.960464e-06
Invert permutation ...................... 2.861023e-06
Row modifications of Cholesky factor .... 0.000000e+00
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 1.096725e-05
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 1.907349e-06
Forward solves .......................... 1.907349e-06


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             :  2.257108736348907e+01
sup-norm of gradient:  7.583759191742701e-07
Number of iterations: 5         
Function evaluations: 10        
Gradient evaluations: 5         

!!      HONG      4       1       1       1       5      10       5       4       2     0    7.5837592e-07    2.2571087e+01    0.000267
 Final f                         = 2.2571087e+01   
 Function value at final x       = 2.2571087e+01   
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   HS105

 Problem name: HS105

 Double precision version will be formed

 The objective function uses 235 nonlinear groups
 
 There is 1 linear inequality constraint
 
 There are 8 variables bounded from below and above 
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully
xx pprojparm->cholmod: 1

 Problem: HS105 (n = 8)
walltime at start:     0.000001

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 2.745314e-07 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 2.745314341689070e-07    
Final f                               : 1.044725129680992e+03    

Iterations of gradient projection (GP): 2         
Iterations of active set GP           : 8         
Function evaluation in main code      : 1         
Function evaluations in GP            : 5         
Function evaluations in active set GP : 10        
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 2         
Gradient evaluations in active set GP : 8         


PPROJ run statistics (Version 2.0, May 1, 2018):

No. blocks in multilevel partition of A . 1
Depth of multilevel partition tree ...... 0
Phase 1 iterations ...................... 5
Coordinate ascent iterations ............ 3
    variables freed in coordinate ascent  0
    rows dropped in coordinate ascent ... 0
Gradient ascent iterations .............. 3
    variables freed in gradient ascent .. 0
    rows dropped in gradient ascent ..... 0
Preconditioned CG iterations ............ 3
    variables freed in CG ............... 0
    rows dropped in CG .................. 0
SpaRSA iterations ....................... 3
    change in column activity ........... 0
    change in row activity .............. 0
    failures of Armijo step ............. 0
Proximal updates ........................ 3
Cholesky factorizations ................. 0
    nonzeros in final factor ............ 0 100.0% sparse
    rows dropped from L ................. 0
    rows added to L ..................... 0
    rank 1 downdates to L ............... 0
    rank 1 updates to L ................. 0
    Size breakdown of the updates ([size]: number of this size):
    No. of solves:   0

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 2.098083e-05
Initialization (includes partition) ..... 4.577637e-05
Phase 1 ................................. 2.861023e-05
Coordinate ascent ....................... 9.536743e-07
SSOR0 ................................... 4.053116e-06
SSOR1 ................................... 5.006790e-06
SpaRSA .................................. 9.536743e-07
DASA .................................... 2.694130e-05
DASA line search ........................ 0.000000e+00
Check error ............................. 1.668930e-05
Proximal update ......................... 1.382828e-05
Invert permutation ...................... 6.437302e-06
Row modifications of Cholesky factor .... 0.000000e+00
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 0.000000e+00
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 0.000000e+00
Forward solves .......................... 0.000000e+00


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             :  1.044725129680992e+03
sup-norm of gradient:  2.745314341689070e-07
Number of iterations: 56        
Function evaluations: 117       
Gradient evaluations: 66        

!!     HS105      8       2       5       2      56     117      66      12       0     0    2.7453143e-07    1.0447251e+03    0.013955
 Final f                         = 1.0447251e+03   
 Function value at final x       = 1.0447251e+03   
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   HS112

 Problem name: HS112

 Double precision version will be formed

 The objective function uses 1 nonlinear group
 
 There are 3 linear equality constraints
 
 There are 10 variables bounded only from below 
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully
xx pprojparm->cholmod: 1

 Problem: HS112 (n = 10)
walltime at start:     0.000001

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 2.429831e-08 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 2.429831180705833e-08    
Final f                               : -4.776109085936810e+01   

Iterations of gradient projection (GP): 2         
Iterations of active set GP           : 3         
Function evaluation in main code      : 1         
Function evaluations in GP            : 6         
Function evaluations in active set GP : 6         
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 2         
Gradient evaluations in active set GP : 3         


PPROJ run statistics (Version 2.0, May 1, 2018):

No. blocks in multilevel partition of A . 1
Depth of multilevel partition tree ...... 0
Phase 1 iterations ...................... 5
Coordinate ascent iterations ............ 8
    variables freed in coordinate ascent  6
    rows dropped in coordinate ascent ... 0
Gradient ascent iterations .............. 0
    variables freed in gradient ascent .. 0
    rows dropped in gradient ascent ..... 0
Preconditioned CG iterations ............ 0
    variables freed in CG ............... 0
    rows dropped in CG .................. 0
SpaRSA iterations ....................... 6
    change in column activity ........... 17
    change in row activity .............. 0
    failures of Armijo step ............. 0
Proximal updates ........................ 6
Cholesky factorizations ................. 10
    nonzeros in final factor ............ 6  0.0% sparse
    rows dropped from L ................. 0
    rows added to L ..................... 0
    rank 1 downdates to L ............... 0
    rank 1 updates to L ................. 0
    Size breakdown of the updates ([size]: number of this size):
    No. of solves:   10

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 2.193451e-05
Initialization (includes partition) ..... 4.911423e-05
Phase 1 ................................. 3.814697e-05
Coordinate ascent ....................... 8.821487e-06
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 9.536743e-07
DASA .................................... 1.332760e-04
DASA line search ........................ 1.096725e-05
Check error ............................. 3.433228e-05
Proximal update ......................... 2.312660e-05
Invert permutation ...................... 8.344650e-06
Row modifications of Cholesky factor .... 0.000000e+00
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 3.385544e-05
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 5.006790e-06
Forward solves .......................... 9.298325e-06


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             : -4.776109085936587e+01
sup-norm of gradient:  2.429831180705833e-08
Number of iterations: 23        
Function evaluations: 46        
Gradient evaluations: 27        

!!     HS112     10       2       6       2      23      46      27       8      10     0    2.4298312e-08   -4.7761091e+01    0.000604
 Final f                         = -4.7761091e+01  
 Function value at final x       = -4.7761091e+01  
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   HS119

 Problem name: HS119

 Double precision version will be formed

 The objective function uses 16 nonlinear groups
 
 There are 8 linear equality constraints
 
 There are 16 variables bounded from below and above 
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully
xx pprojparm->cholmod: 1

 Problem: HS119 (n = 16)
walltime at start:     0.000001

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 1.115542e-08 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 1.115542245036516e-08    
Final f                               : 2.448996975167498e+02    

Iterations of gradient projection (GP): 0         
Iterations of active set GP           : 4         
Function evaluation in main code      : 1         
Function evaluations in GP            : 0         
Function evaluations in active set GP : 4         
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 0         
Gradient evaluations in active set GP : 4         


PPROJ run statistics (Version 2.0, May 1, 2018):

No. blocks in multilevel partition of A . 1
Depth of multilevel partition tree ...... 0
Phase 1 iterations ...................... 5
Coordinate ascent iterations ............ 6
    variables freed in coordinate ascent  1
    rows dropped in coordinate ascent ... 0
Gradient ascent iterations .............. 0
    variables freed in gradient ascent .. 0
    rows dropped in gradient ascent ..... 0
Preconditioned CG iterations ............ 0
    variables freed in CG ............... 0
    rows dropped in CG .................. 0
SpaRSA iterations ....................... 5
    change in column activity ........... 2
    change in row activity .............. 0
    failures of Armijo step ............. 2
Proximal updates ........................ 5
Cholesky factorizations ................. 2
    nonzeros in final factor ............ 36  0.0% sparse
    rows dropped from L ................. 0
    rows added to L ..................... 0
    rank 1 downdates to L ............... 5
    rank 1 updates to L ................. 12
    Size breakdown of the updates ([size]: number of this size):
        updowns [  1]: 8
        updowns [  2]: 2
        updowns [  5]: 1
    No. of solves:   13

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 2.908707e-05
Initialization (includes partition) ..... 5.793571e-05
Phase 1 ................................. 6.198883e-05
Coordinate ascent ....................... 6.675720e-06
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 1.907349e-06
DASA .................................... 1.833439e-04
DASA line search ........................ 1.263618e-05
Check error ............................. 3.409386e-05
Proximal update ......................... 2.288818e-05
Invert permutation ...................... 5.245209e-06
Row modifications of Cholesky factor .... 4.291534e-06
Column modifications of Cholesky factor . 4.196167e-05
Cholesky factorization .................. 2.193451e-05
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 9.059906e-06
Forward solves .......................... 4.768372e-06


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             :  2.448996975168007e+02
sup-norm of gradient:  1.115542245036516e-08
Number of iterations: 4         
Function evaluations: 8         
Gradient evaluations: 4         

!!     HS119     16       0       0       0       4       8       4       6       2     0    1.1155422e-08    2.4489970e+02    0.000584
 Final f                         = 2.4489970e+02   
 Function value at final x       = 2.4489970e+02   
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   HS24

 Problem name: HS24

 Double precision version will be formed

 The objective function uses 1 nonlinear group
 
 There are 3 linear inequality constraints
 
 There are 2 variables bounded only from below 
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully
xx pprojparm->cholmod: 1

 Problem: HS24 (n = 2)
walltime at start:     0.000001

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 5.662137e-14 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 5.662137425588298e-14    
Final f                               : -1.000000082692019e+00   

Iterations of gradient projection (GP): 0         
Iterations of active set GP           : 1         
Function evaluation in main code      : 1         
Function evaluations in GP            : 0         
Function evaluations in active set GP : 1         
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 0         
Gradient evaluations in active set GP : 1         


PPROJ run statistics (Version 2.0, May 1, 2018):

No. blocks in multilevel partition of A . 1
Depth of multilevel partition tree ...... 0
Phase 1 iterations ...................... 5
Coordinate ascent iterations ............ 0
    variables freed in coordinate ascent  0
    rows dropped in coordinate ascent ... 0
Gradient ascent iterations .............. 0
    variables freed in gradient ascent .. 0
    rows dropped in gradient ascent ..... 0
Preconditioned CG iterations ............ 0
    variables freed in CG ............... 0
    rows dropped in CG .................. 0
SpaRSA iterations ....................... 1
    change in column activity ........... 0
    change in row activity .............. 0
    failures of Armijo step ............. 0
Proximal updates ........................ 1
Cholesky factorizations ................. 1
    nonzeros in final factor ............ 1 83.3% sparse
    rows dropped from L ................. 0
    rows added to L ..................... 1
    rank 1 downdates to L ............... 0
    rank 1 updates to L ................. 0
    Size breakdown of the updates ([size]: number of this size):
    No. of solves:   1

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 2.813339e-05
Initialization (includes partition) ..... 5.316734e-05
Phase 1 ................................. 3.576279e-05
Coordinate ascent ....................... 0.000000e+00
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 7.867813e-06
DASA .................................... 4.100800e-05
DASA line search ........................ 1.907349e-06
Check error ............................. 1.215935e-05
Proximal update ......................... 6.914139e-06
Invert permutation ...................... 4.768372e-06
Row modifications of Cholesky factor .... 8.106232e-06
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 1.502037e-05
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 0.000000e+00
Forward solves .......................... 9.536743e-07


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             : -1.000000082692005e+00
sup-norm of gradient:  1.717347671762134e-01
Number of iterations: 1         
Function evaluations: 2         
Gradient evaluations: 1         

!!      HS24      2       0       0       0       1       2       1       3       1     0    5.6621374e-14   -1.0000001e+00    0.000268
 Final f                         = -1.0000001e+00  
 Function value at final x       = -1.0000001e+00  
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   HS36

 Problem name: HS36

 Double precision version will be formed

 The objective function uses 1 nonlinear group
 
 There is 1 linear inequality constraint
 
 There are 3 variables bounded from below and above 
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully
xx pprojparm->cholmod: 1

 Problem: HS36 (n = 3)
walltime at start:     0.000001

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 6.252776e-12 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 6.252776074688882e-12    
Final f                               : -3.300000000000131e+03   

Iterations of gradient projection (GP): 1         
Iterations of active set GP           : 1         
Function evaluation in main code      : 1         
Function evaluations in GP            : 1         
Function evaluations in active set GP : 1         
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 1         
Gradient evaluations in active set GP : 1         


PPROJ run statistics (Version 2.0, May 1, 2018):

No. blocks in multilevel partition of A . 1
Depth of multilevel partition tree ...... 0
Phase 1 iterations ...................... 5
Coordinate ascent iterations ............ 2
    variables freed in coordinate ascent  0
    rows dropped in coordinate ascent ... 0
Gradient ascent iterations .............. 0
    variables freed in gradient ascent .. 0
    rows dropped in gradient ascent ..... 0
Preconditioned CG iterations ............ 0
    variables freed in CG ............... 0
    rows dropped in CG .................. 0
SpaRSA iterations ....................... 3
    change in column activity ........... 0
    change in row activity .............. 0
    failures of Armijo step ............. 0
Proximal updates ........................ 3
Cholesky factorizations ................. 3
    nonzeros in final factor ............ 1  0.0% sparse
    rows dropped from L ................. 0
    rows added to L ..................... 0
    rank 1 downdates to L ............... 0
    rank 1 updates to L ................. 0
    Size breakdown of the updates ([size]: number of this size):
    No. of solves:   3

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 2.908707e-05
Initialization (includes partition) ..... 5.817413e-05
Phase 1 ................................. 3.671646e-05
Coordinate ascent ....................... 2.145767e-06
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 9.536743e-07
DASA .................................... 6.890297e-05
DASA line search ........................ 4.768372e-06
Check error ............................. 2.121925e-05
Proximal update ......................... 1.192093e-05
Invert permutation ...................... 7.867813e-06
Row modifications of Cholesky factor .... 0.000000e+00
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 1.883507e-05
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 2.861023e-06
Forward solves .......................... 4.291534e-06


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Number of iterations: 0         
Function evaluations: 0         
Gradient evaluations: 0         

!!      HS36      3       1       1       1       0       0       0       4       3     0    6.2527761e-12   -3.3000000e+03    0.000318
 Final f                         = -3.3000000e+03  
 Function value at final x       = -3.3000000e+03  
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   HS37

 Problem name: HS37

 Double precision version will be formed

 The objective function uses 1 nonlinear group
 
 There are 2 linear inequality constraints
 
 There are 3 variables bounded from below and above 
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully
xx pprojparm->cholmod: 1

 Problem: HS37 (n = 3)
walltime at start:     0.000001

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 3.379961e-08 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 3.379961222016448e-08    
Final f                               : -3.456000000000205e+03   

Iterations of gradient projection (GP): 1         
Iterations of active set GP           : 1         
Function evaluation in main code      : 1         
Function evaluations in GP            : 1         
Function evaluations in active set GP : 1         
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 1         
Gradient evaluations in active set GP : 1         


PPROJ run statistics (Version 2.0, May 1, 2018):

No. blocks in multilevel partition of A . 1
Depth of multilevel partition tree ...... 0
Phase 1 iterations ...................... 5
Coordinate ascent iterations ............ 1
    variables freed in coordinate ascent  0
    rows dropped in coordinate ascent ... 0
Gradient ascent iterations .............. 0
    variables freed in gradient ascent .. 0
    rows dropped in gradient ascent ..... 0
Preconditioned CG iterations ............ 0
    variables freed in CG ............... 0
    rows dropped in CG .................. 0
SpaRSA iterations ....................... 2
    change in column activity ........... 0
    change in row activity .............. 0
    failures of Armijo step ............. 1
Proximal updates ........................ 2
Cholesky factorizations ................. 2
    nonzeros in final factor ............ 1 66.7% sparse
    rows dropped from L ................. 0
    rows added to L ..................... 0
    rank 1 downdates to L ............... 0
    rank 1 updates to L ................. 0
    Size breakdown of the updates ([size]: number of this size):
    No. of solves:   2

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 2.288818e-05
Initialization (includes partition) ..... 4.673004e-05
Phase 1 ................................. 3.099442e-05
Coordinate ascent ....................... 9.536743e-07
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 2.145767e-06
DASA .................................... 4.720688e-05
DASA line search ........................ 3.099442e-06
Check error ............................. 1.096725e-05
Proximal update ......................... 8.344650e-06
Invert permutation ...................... 5.245209e-06
Row modifications of Cholesky factor .... 0.000000e+00
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 1.430511e-05
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 1.907349e-06
Forward solves .......................... 2.145767e-06


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             : -3.456000000000002e+03
sup-norm of gradient:  3.379961222016448e-08
Number of iterations: 3         
Function evaluations: 6         
Gradient evaluations: 3         

!!      HS37      3       1       1       1       3       6       3       4       2     0    3.3799612e-08   -3.4560000e+03    0.000263
 Final f                         = -3.4560000e+03  
 Function value at final x       = -3.4560000e+03  
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   HS41

 Problem name: HS41

 Double precision version will be formed

 The objective function uses 1 nonlinear group
 
 There is 1 linear equality constraint
 
 There are 4 variables bounded from below and above 
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully
xx pprojparm->cholmod: 1

 Problem: HS41 (n = 4)
walltime at start:     0.000001

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 2.271587e-07 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 2.271587336230303e-07    
Final f                               : 1.925925925926049e+00    

Iterations of gradient projection (GP): 0         
Iterations of active set GP           : 2         
Function evaluation in main code      : 1         
Function evaluations in GP            : 0         
Function evaluations in active set GP : 2         
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 0         
Gradient evaluations in active set GP : 2         


PPROJ run statistics (Version 2.0, May 1, 2018):

No. blocks in multilevel partition of A . 1
Depth of multilevel partition tree ...... 0
Phase 1 iterations ...................... 5
Coordinate ascent iterations ............ 0
    variables freed in coordinate ascent  0
    rows dropped in coordinate ascent ... 0
Gradient ascent iterations .............. 0
    variables freed in gradient ascent .. 0
    rows dropped in gradient ascent ..... 0
Preconditioned CG iterations ............ 0
    variables freed in CG ............... 0
    rows dropped in CG .................. 0
SpaRSA iterations ....................... 1
    change in column activity ........... 0
    change in row activity .............. 0
    failures of Armijo step ............. 0
Proximal updates ........................ 1
Cholesky factorizations ................. 1
    nonzeros in final factor ............ 1  0.0% sparse
    rows dropped from L ................. 0
    rows added to L ..................... 0
    rank 1 downdates to L ............... 0
    rank 1 updates to L ................. 0
    Size breakdown of the updates ([size]: number of this size):
    No. of solves:   1

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 2.908707e-05
Initialization (includes partition) ..... 5.698204e-05
Phase 1 ................................. 3.695488e-05
Coordinate ascent ....................... 0.000000e+00
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 6.914139e-06
DASA .................................... 4.196167e-05
DASA line search ........................ 1.907349e-06
Check error ............................. 9.775162e-06
Proximal update ......................... 6.675720e-06
Invert permutation ...................... 5.722046e-06
Row modifications of Cholesky factor .... 0.000000e+00
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 1.621246e-05
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 0.000000e+00
Forward solves .......................... 1.907349e-06


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             :  1.925925925926057e+00
sup-norm of gradient:  2.271587336230303e-07
Number of iterations: 3         
Function evaluations: 6         
Gradient evaluations: 3         

!!      HS41      4       0       0       0       3       6       3       4       1     0    2.2715873e-07    1.9259259e+00    0.000276
 Final f                         = 1.9259259e+00   
 Function value at final x       = 1.9259259e+00   
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   HS49

 Problem name: HS49

 Double precision version will be formed

 The objective function uses 1 nonlinear group
 
 There are 2 linear equality constraints
 
 There are 5 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully
xx pprojparm->cholmod: 1

 Problem: HS49 (n = 5)
walltime at start:     0.000001

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 3.113731e-07 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 3.113730802084547e-07    
Final f                               : 2.308278040061817e-11    

Iterations of gradient projection (GP): 0         
Iterations of active set GP           : 1         
Function evaluation in main code      : 1         
Function evaluations in GP            : 0         
Function evaluations in active set GP : 1         
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 0         
Gradient evaluations in active set GP : 1         


PPROJ run statistics (Version 2.0, May 1, 2018):

No. blocks in multilevel partition of A . 1
Depth of multilevel partition tree ...... 0
Phase 1 iterations ...................... 5
Coordinate ascent iterations ............ 0
    variables freed in coordinate ascent  0
    rows dropped in coordinate ascent ... 0
Gradient ascent iterations .............. 0
    variables freed in gradient ascent .. 0
    rows dropped in gradient ascent ..... 0
Preconditioned CG iterations ............ 0
    variables freed in CG ............... 0
    rows dropped in CG .................. 0
SpaRSA iterations ....................... 1
    change in column activity ........... 0
    change in row activity .............. 0
    failures of Armijo step ............. 0
Proximal updates ........................ 1
Cholesky factorizations ................. 1
    nonzeros in final factor ............ 3  0.0% sparse
    rows dropped from L ................. 0
    rows added to L ..................... 0
    rank 1 downdates to L ............... 0
    rank 1 updates to L ................. 0
    Size breakdown of the updates ([size]: number of this size):
    No. of solves:   1

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 2.789497e-05
Initialization (includes partition) ..... 5.412102e-05
Phase 1 ................................. 3.409386e-05
Coordinate ascent ....................... 0.000000e+00
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 7.867813e-06
DASA .................................... 5.006790e-05
DASA line search ........................ 2.861023e-06
Check error ............................. 1.096725e-05
Proximal update ......................... 5.006790e-06
Invert permutation ...................... 6.198883e-06
Row modifications of Cholesky factor .... 0.000000e+00
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 1.907349e-05
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 9.536743e-07
Forward solves .......................... 1.907349e-06


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             :  3.024207500282027e-11
sup-norm of gradient:  3.113730802084547e-07
Number of iterations: 14        
Function evaluations: 28        
Gradient evaluations: 14        

!!      HS49      5       0       0       0      14      28      14       3       1     0    3.1137308e-07    2.3082780e-11    0.000293
 Final f                         = 2.3082780e-11   
 Function value at final x       = 2.3082780e-11   
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   HS50

 Problem name: HS50

 Double precision version will be formed

 The objective function uses 1 nonlinear group
 
 There are 3 linear equality constraints
 
 There are 5 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully
xx pprojparm->cholmod: 1

 Problem: HS50 (n = 5)
walltime at start:     0.000000

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 1.755041e-12 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 1.755040557327447e-12    
Final f                               : 4.656080162339169e-26    

Iterations of gradient projection (GP): 0         
Iterations of active set GP           : 1         
Function evaluation in main code      : 1         
Function evaluations in GP            : 0         
Function evaluations in active set GP : 2         
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 0         
Gradient evaluations in active set GP : 1         


PPROJ run statistics (Version 2.0, May 1, 2018):

No. blocks in multilevel partition of A . 1
Depth of multilevel partition tree ...... 0
Phase 1 iterations ...................... 5
Coordinate ascent iterations ............ 1
    variables freed in coordinate ascent  0
    rows dropped in coordinate ascent ... 0
Gradient ascent iterations .............. 0
    variables freed in gradient ascent .. 0
    rows dropped in gradient ascent ..... 0
Preconditioned CG iterations ............ 0
    variables freed in CG ............... 0
    rows dropped in CG .................. 0
SpaRSA iterations ....................... 1
    change in column activity ........... 0
    change in row activity .............. 0
    failures of Armijo step ............. 0
Proximal updates ........................ 1
Cholesky factorizations ................. 1
    nonzeros in final factor ............ 6  0.0% sparse
    rows dropped from L ................. 0
    rows added to L ..................... 0
    rank 1 downdates to L ............... 0
    rank 1 updates to L ................. 0
    Size breakdown of the updates ([size]: number of this size):
    No. of solves:   1

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 2.717972e-05
Initialization (includes partition) ..... 5.531311e-05
Phase 1 ................................. 3.647804e-05
Coordinate ascent ....................... 9.536743e-07
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 7.152557e-06
DASA .................................... 4.315376e-05
DASA line search ........................ 2.145767e-06
Check error ............................. 1.096725e-05
Proximal update ......................... 5.245209e-06
Invert permutation ...................... 5.006790e-06
Row modifications of Cholesky factor .... 0.000000e+00
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 1.406670e-05
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 0.000000e+00
Forward solves .......................... 2.145767e-06


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             :  1.246092681006800e-11
sup-norm of gradient:  1.755040557327447e-12
Number of iterations: 10        
Function evaluations: 20        
Gradient evaluations: 10        

!!      HS50      5       0       0       0      10      20      10       3       1     0    1.7550406e-12    4.6560802e-26    0.000282
 Final f                         = 4.6560802e-26   
 Function value at final x       = 4.6560802e-26   
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   HS54

 Problem name: HS54

 Double precision version will be formed

 The objective function uses 1 nonlinear group
 
 There is 1 linear equality constraint
 
 There are 6 variables bounded from below and above 
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully
xx pprojparm->cholmod: 1

 Problem: HS54 (n = 6)
walltime at start:     0.000000

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 4.014581e-07 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 4.014580797440046e-07    
Final f                               : -8.674088253776221e-01   

Iterations of gradient projection (GP): 0         
Iterations of active set GP           : 1         
Function evaluation in main code      : 1         
Function evaluations in GP            : 0         
Function evaluations in active set GP : 5         
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 0         
Gradient evaluations in active set GP : 1         


PPROJ run statistics (Version 2.0, May 1, 2018):

No. blocks in multilevel partition of A . 1
Depth of multilevel partition tree ...... 0
Phase 1 iterations ...................... 5
Coordinate ascent iterations ............ 2
    variables freed in coordinate ascent  0
    rows dropped in coordinate ascent ... 0
Gradient ascent iterations .............. 0
    variables freed in gradient ascent .. 0
    rows dropped in gradient ascent ..... 0
Preconditioned CG iterations ............ 0
    variables freed in CG ............... 0
    rows dropped in CG .................. 0
SpaRSA iterations ....................... 3
    change in column activity ........... 0
    change in row activity .............. 0
    failures of Armijo step ............. 0
Proximal updates ........................ 3
Cholesky factorizations ................. 3
    nonzeros in final factor ............ 1  0.0% sparse
    rows dropped from L ................. 0
    rows added to L ..................... 0
    rank 1 downdates to L ............... 0
    rank 1 updates to L ................. 0
    Size breakdown of the updates ([size]: number of this size):
    No. of solves:   3

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 2.098083e-05
Initialization (includes partition) ..... 4.386902e-05
Phase 1 ................................. 2.813339e-05
Coordinate ascent ....................... 2.861023e-06
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 9.536743e-07
DASA .................................... 5.888939e-05
DASA line search ........................ 1.907349e-06
Check error ............................. 1.549721e-05
Proximal update ......................... 1.144409e-05
Invert permutation ...................... 4.768372e-06
Row modifications of Cholesky factor .... 0.000000e+00
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 1.740456e-05
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 1.907349e-06
Forward solves .......................... 3.814697e-06


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             : -8.674088199111348e-01
sup-norm of gradient:  4.014580797440046e-07
Number of iterations: 11        
Function evaluations: 28        
Gradient evaluations: 18        

!!      HS54      6       0       0       0      11      28      18       4       3     0    4.0145808e-07   -8.6740883e-01    0.000297
 Final f                         = -8.6740883e-01  
 Function value at final x       = -8.6740883e-01  
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   HS55

 Problem name: HS55

 Double precision version will be formed

 The objective function uses 1 nonlinear group
 
 There are 6 linear equality constraints
 
 There are 4 variables bounded only from below 
 There are 2 variables bounded from below and above 
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully
xx pprojparm->cholmod: 1

 Problem: HS55 (n = 6)
walltime at start:     0.000000

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 7.651657e-13 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 7.651657085716579e-13    
Final f                               : 6.666666666666802e+00    

Iterations of gradient projection (GP): 0         
Iterations of active set GP           : 0         
Function evaluation in main code      : 1         
Function evaluations in GP            : 0         
Function evaluations in active set GP : 0         
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 0         
Gradient evaluations in active set GP : 0         


PPROJ run statistics (Version 2.0, May 1, 2018):

No. blocks in multilevel partition of A . 1
Depth of multilevel partition tree ...... 0
Phase 1 iterations ...................... 5
Coordinate ascent iterations ............ 2
    variables freed in coordinate ascent  0
    rows dropped in coordinate ascent ... 0
Gradient ascent iterations .............. 0
    variables freed in gradient ascent .. 0
    rows dropped in gradient ascent ..... 0
Preconditioned CG iterations ............ 0
    variables freed in CG ............... 0
    rows dropped in CG .................. 0
SpaRSA iterations ....................... 2
    change in column activity ........... 0
    change in row activity .............. 0
    failures of Armijo step ............. 1
Proximal updates ........................ 2
Cholesky factorizations ................. 2
    nonzeros in final factor ............ 16 23.8% sparse
    rows dropped from L ................. 0
    rows added to L ..................... 0
    rank 1 downdates to L ............... 0
    rank 1 updates to L ................. 0
    Size breakdown of the updates ([size]: number of this size):
    No. of solves:   2

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 3.504753e-05
Initialization (includes partition) ..... 5.793571e-05
Phase 1 ................................. 3.314018e-05
Coordinate ascent ....................... 3.099442e-06
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 1.192093e-06
DASA .................................... 5.412102e-05
DASA line search ........................ 4.053116e-06
Check error ............................. 1.096725e-05
Proximal update ......................... 8.106232e-06
Invert permutation ...................... 9.536743e-07
Row modifications of Cholesky factor .... 0.000000e+00
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 1.597404e-05
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 9.536743e-07
Forward solves .......................... 1.907349e-06


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Number of iterations: 0         
Function evaluations: 0         
Gradient evaluations: 0         

!!      HS55      6       0       0       0       0       0       0       2       2     0    7.6516571e-13    6.6666667e+00    0.000227
 Final f                         = 6.6666667e+00   
 Function value at final x       = 6.6666667e+00   
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   HS62

 Problem name: HS62

 Double precision version will be formed

 The objective function uses 1 nonlinear group
 
 There is 1 linear equality constraint
 
 There are 3 variables bounded from below and above 
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully
xx pprojparm->cholmod: 1

 Problem: HS62 (n = 3)
walltime at start:     0.000001

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 7.851161e-07 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 7.851160717109451e-07    
Final f                               : -2.627251464797164e+04   

Iterations of gradient projection (GP): 1         
Iterations of active set GP           : 1         
Function evaluation in main code      : 1         
Function evaluations in GP            : 2         
Function evaluations in active set GP : 2         
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 1         
Gradient evaluations in active set GP : 1         


PPROJ run statistics (Version 2.0, May 1, 2018):

No. blocks in multilevel partition of A . 1
Depth of multilevel partition tree ...... 0
Phase 1 iterations ...................... 5
Coordinate ascent iterations ............ 2
    variables freed in coordinate ascent  0
    rows dropped in coordinate ascent ... 0
Gradient ascent iterations .............. 0
    variables freed in gradient ascent .. 0
    rows dropped in gradient ascent ..... 0
Preconditioned CG iterations ............ 0
    variables freed in CG ............... 0
    rows dropped in CG .................. 0
SpaRSA iterations ....................... 3
    change in column activity ........... 1
    change in row activity .............. 0
    failures of Armijo step ............. 3
Proximal updates ........................ 3
Cholesky factorizations ................. 3
    nonzeros in final factor ............ 1  0.0% sparse
    rows dropped from L ................. 0
    rows added to L ..................... 0
    rank 1 downdates to L ............... 0
    rank 1 updates to L ................. 0
    Size breakdown of the updates ([size]: number of this size):
    No. of solves:   3

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 2.002716e-05
Initialization (includes partition) ..... 4.100800e-05
Phase 1 ................................. 2.431870e-05
Coordinate ascent ....................... 1.907349e-06
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 9.536743e-07
DASA .................................... 5.984306e-05
DASA line search ........................ 1.907349e-06
Check error ............................. 1.597404e-05
Proximal update ......................... 1.430511e-05
Invert permutation ...................... 5.006790e-06
Row modifications of Cholesky factor .... 0.000000e+00
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 1.907349e-05
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 3.337860e-06
Forward solves .......................... 3.814697e-06


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             : -2.627251464797159e+04
sup-norm of gradient:  7.851160717109451e-07
Number of iterations: 10        
Function evaluations: 20        
Gradient evaluations: 10        

!!      HS62      3       1       2       1      10      20      10       5       3     0    7.8511607e-07   -2.6272515e+04    0.000298
 Final f                         = -2.6272515e+04  
 Function value at final x       = -2.6272515e+04  
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   HS86

 Problem name: HS86

 Double precision version will be formed

 The objective function uses 1 nonlinear group
 
 There are 10 linear inequality constraints
 
 There are 5 variables bounded only from below 
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully
xx pprojparm->cholmod: 1

 Problem: HS86 (n = 5)
walltime at start:     0.000000

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 1.445101e-09 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 1.445100920708948e-09    
Final f                               : -3.234867896572663e+01   

Iterations of gradient projection (GP): 2         
Iterations of active set GP           : 3         
Function evaluation in main code      : 1         
Function evaluations in GP            : 2         
Function evaluations in active set GP : 4         
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 2         
Gradient evaluations in active set GP : 3         


PPROJ run statistics (Version 2.0, May 1, 2018):

No. blocks in multilevel partition of A . 1
Depth of multilevel partition tree ...... 0
Phase 1 iterations ...................... 5
Coordinate ascent iterations ............ 3
    variables freed in coordinate ascent  0
    rows dropped in coordinate ascent ... 0
Gradient ascent iterations .............. 0
    variables freed in gradient ascent .. 0
    rows dropped in gradient ascent ..... 0
Preconditioned CG iterations ............ 0
    variables freed in CG ............... 0
    rows dropped in CG .................. 0
SpaRSA iterations ....................... 3
    change in column activity ........... 0
    change in row activity .............. 0
    failures of Armijo step ............. 2
Proximal updates ........................ 3
Cholesky factorizations ................. 4
    nonzeros in final factor ............ 6 89.1% sparse
    rows dropped from L ................. 0
    rows added to L ..................... 1
    rank 1 downdates to L ............... 0
    rank 1 updates to L ................. 0
    Size breakdown of the updates ([size]: number of this size):
    No. of solves:   4

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 2.503395e-05
Initialization (includes partition) ..... 5.388260e-05
Phase 1 ................................. 4.577637e-05
Coordinate ascent ....................... 1.907349e-06
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 1.907349e-06
DASA .................................... 8.010864e-05
DASA line search ........................ 5.960464e-06
Check error ............................. 1.502037e-05
Proximal update ......................... 1.049042e-05
Invert permutation ...................... 9.059906e-06
Row modifications of Cholesky factor .... 1.406670e-05
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 2.765656e-05
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 9.536743e-07
Forward solves .......................... 3.814697e-06


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             : -3.234867896572270e+01
sup-norm of gradient:  1.445100920708948e-09
Number of iterations: 5         
Function evaluations: 9         
Gradient evaluations: 6         

!!      HS86      5       2       2       2       5       9       6       7       4     0    1.4451009e-09   -3.2348679e+01    0.000379
 Final f                         = -3.2348679e+01  
 Function value at final x       = -3.2348679e+01  
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   HS9

 Problem name: HS9

 Double precision version will be formed

 The objective function uses 1 nonlinear group
 
 There is 1 linear equality constraint
 
 There are 2 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully
xx pprojparm->cholmod: 1

 Problem: HS9 (n = 2)
walltime at start:     0.000001

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 1.659360e-12 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 1.659360149286471e-12    
Final f                               : -5.000000000000013e-01   

Iterations of gradient projection (GP): 0         
Iterations of active set GP           : 1         
Function evaluation in main code      : 1         
Function evaluations in GP            : 0         
Function evaluations in active set GP : 1         
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 0         
Gradient evaluations in active set GP : 1         


PPROJ run statistics (Version 2.0, May 1, 2018):

No. blocks in multilevel partition of A . 1
Depth of multilevel partition tree ...... 0
Phase 1 iterations ...................... 5
Coordinate ascent iterations ............ 0
    variables freed in coordinate ascent  0
    rows dropped in coordinate ascent ... 0
Gradient ascent iterations .............. 0
    variables freed in gradient ascent .. 0
    rows dropped in gradient ascent ..... 0
Preconditioned CG iterations ............ 0
    variables freed in CG ............... 0
    rows dropped in CG .................. 0
SpaRSA iterations ....................... 1
    change in column activity ........... 0
    change in row activity .............. 0
    failures of Armijo step ............. 0
Proximal updates ........................ 1
Cholesky factorizations ................. 1
    nonzeros in final factor ............ 1  0.0% sparse
    rows dropped from L ................. 0
    rows added to L ..................... 0
    rank 1 downdates to L ............... 0
    rank 1 updates to L ................. 0
    Size breakdown of the updates ([size]: number of this size):
    No. of solves:   1

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 1.883507e-05
Initialization (includes partition) ..... 3.981590e-05
Phase 1 ................................. 2.527237e-05
Coordinate ascent ....................... 0.000000e+00
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 6.198883e-06
DASA .................................... 3.290176e-05
DASA line search ........................ 9.536743e-07
Check error ............................. 7.867813e-06
Proximal update ......................... 4.768372e-06
Invert permutation ...................... 4.053116e-06
Row modifications of Cholesky factor .... 0.000000e+00
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 1.001358e-05
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 1.192093e-06
Forward solves .......................... 1.907349e-06


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             : -4.999999999999998e-01
sup-norm of gradient:  1.659360149286471e-12
Number of iterations: 4         
Function evaluations: 9         
Gradient evaluations: 5         

!!       HS9      2       0       0       0       4       9       5       3       1     0    1.6593601e-12   -5.0000000e-01    0.000223
 Final f                         = -5.0000000e-01  
 Function value at final x       = -5.0000000e-01  
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   HUBFIT

 Problem name: HUBFIT

 Double precision version will be formed

 The objective function uses 5 nonlinear groups
 
 There is 1 linear inequality constraint
 
 There is 1 free variable 
 There is 1 variable bounded only from below 
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully
xx pprojparm->cholmod: 1

 Problem: HUBFIT (n = 2)
walltime at start:     0.000001

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 1.072753e-14 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 1.072752997544058e-14    
Final f                               : 1.689349393939367e-02    

Iterations of gradient projection (GP): 1         
Iterations of active set GP           : 1         
Function evaluation in main code      : 1         
Function evaluations in GP            : 1         
Function evaluations in active set GP : 1         
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 1         
Gradient evaluations in active set GP : 1         


PPROJ run statistics (Version 2.0, May 1, 2018):

No. blocks in multilevel partition of A . 1
Depth of multilevel partition tree ...... 0
Phase 1 iterations ...................... 5
Coordinate ascent iterations ............ 0
    variables freed in coordinate ascent  0
    rows dropped in coordinate ascent ... 0
Gradient ascent iterations .............. 0
    variables freed in gradient ascent .. 0
    rows dropped in gradient ascent ..... 0
Preconditioned CG iterations ............ 0
    variables freed in CG ............... 0
    rows dropped in CG .................. 0
SpaRSA iterations ....................... 1
    change in column activity ........... 0
    change in row activity .............. 0
    failures of Armijo step ............. 1
Proximal updates ........................ 1
Cholesky factorizations ................. 1
    nonzeros in final factor ............ 1  0.0% sparse
    rows dropped from L ................. 0
    rows added to L ..................... 0
    rank 1 downdates to L ............... 0
    rank 1 updates to L ................. 0
    Size breakdown of the updates ([size]: number of this size):
    No. of solves:   1

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 2.193451e-05
Initialization (includes partition) ..... 4.625320e-05
Phase 1 ................................. 2.861023e-05
Coordinate ascent ....................... 0.000000e+00
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 6.914139e-06
DASA .................................... 3.409386e-05
DASA line search ........................ 2.145767e-06
Check error ............................. 9.059906e-06
Proximal update ......................... 5.006790e-06
Invert permutation ...................... 5.960464e-06
Row modifications of Cholesky factor .... 0.000000e+00
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 1.096725e-05
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 0.000000e+00
Forward solves .......................... 1.907349e-06


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             :  1.689349393938636e-02
sup-norm of gradient:  9.658940314238862e-15
Number of iterations: 1         
Function evaluations: 2         
Gradient evaluations: 1         

!!    HUBFIT      2       1       1       1       1       2       1       5       1     0    1.0727530e-14    1.6893494e-02    0.000224
 Final f                         = 1.6893494e-02   
 Function value at final x       = 1.6893494e-02   
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   HYDROELL

 Problem name: HYDROELL

 Double precision version will be formed

 The objective function uses 1 nonlinear group
 
 There are 1008 linear inequality constraints
 
 There are 1007 variables bounded from below and above 
 There are 2 fixed variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully
xx pprojparm->cholmod: 1

 Problem: HYDROELL (n = 1009)
walltime at start:     0.000001

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 6.403425e-08 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 6.403425109373308e-08    
Final f                               : -3.585546798588495e+06   

Iterations of gradient projection (GP): 1         
Iterations of active set GP           : 2         
Function evaluation in main code      : 1         
Function evaluations in GP            : 1         
Function evaluations in active set GP : 2         
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 1         
Gradient evaluations in active set GP : 2         


PPROJ run statistics (Version 2.0, May 1, 2018):

No. blocks in multilevel partition of A . 7
Depth of multilevel partition tree ...... 2
Phase 1 iterations ...................... 10
Coordinate ascent iterations ............ 3
    variables freed in coordinate ascent  91
    rows dropped in coordinate ascent ... 0
Gradient ascent iterations .............. 2
    variables freed in gradient ascent .. 0
    rows dropped in gradient ascent ..... 0
Preconditioned CG iterations ............ 42
    variables freed in CG ............... 2
    rows dropped in CG .................. 0
SpaRSA iterations ....................... 4
    change in column activity ........... 54
    change in row activity .............. 90
    failures of Armijo step ............. 12
Proximal updates ........................ 6
Cholesky factorizations ................. 44
    nonzeros in final factor ............ 1271 99.8% sparse
    rows dropped from L ................. 156
    rows added to L ..................... 783
    rank 1 downdates to L ............... 63
    rank 1 updates to L ................. 1065
    Size breakdown of the updates ([size]: number of this size):
        updowns [  1]: 90
        updowns [  2]: 14
        updowns [  3]: 5
        updowns [  4]: 4
        updowns [  5]: 4
        updowns [  6]: 21
        updowns [  8]: 3
        updowns [  9]: 2
        updowns [ 10]: 6
        updowns [ 11]: 18
        updowns [ 12]: 10
        updowns [ 15]: 1
        updowns [ 17]: 1
        updowns [ 18]: 19
        updowns [ 19]: 1
        updowns [ 20]: 1
    No. of solves by depth in the multilevel partition tree:
        (deeper <=> further from root of tree <=> fewer flops)
        depth [ 0]: 0
        depth [ 1]: 175
        depth [ 2]: 1133

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 8.459091e-04
Initialization (includes partition) ..... 1.068830e-03
Phase 1 ................................. 4.069805e-04
Coordinate ascent ....................... 1.215935e-05
SSOR0 ................................... 1.502037e-05
SSOR1 ................................... 2.169609e-04
SpaRSA .................................. 3.004074e-05
DASA .................................... 1.598597e-02
DASA line search ........................ 4.163265e-03
Check error ............................. 4.491568e-03
Proximal update ......................... 2.574921e-04
Invert permutation ...................... 2.098083e-05
Row modifications of Cholesky factor .... 1.003742e-03
Column modifications of Cholesky factor . 9.942055e-04
Cholesky factorization .................. 1.856089e-03
Partial Cholesky factorization .......... 1.001358e-05
Back solves ............................. 1.525164e-03
Forward solves .......................... 7.383823e-04


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Number of iterations: 0         
Function evaluations: 0         
Gradient evaluations: 0         

!!  HYDROELL   1009       1       1       1       0       0       0       6      44     0    6.4034251e-08   -3.5855468e+06    0.020800
 Final f                         = -3.5855468e+06  
 Function value at final x       = -3.5855468e+06  
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   HYDROELM

 Problem name: HYDROELM

 Double precision version will be formed

 The objective function uses 1 nonlinear group
 
 There are 504 linear inequality constraints
 
 There are 503 variables bounded from below and above 
 There are 2 fixed variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully
xx pprojparm->cholmod: 1

 Problem: HYDROELM (n = 505)
walltime at start:     0.000001

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 2.502278e-08 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 2.502277687352751e-08    
Final f                               : -3.582015495693359e+06   

Iterations of gradient projection (GP): 1         
Iterations of active set GP           : 2         
Function evaluation in main code      : 1         
Function evaluations in GP            : 1         
Function evaluations in active set GP : 2         
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 1         
Gradient evaluations in active set GP : 2         


PPROJ run statistics (Version 2.0, May 1, 2018):

No. blocks in multilevel partition of A . 3
Depth of multilevel partition tree ...... 1
Phase 1 iterations ...................... 7
Coordinate ascent iterations ............ 3
    variables freed in coordinate ascent  83
    rows dropped in coordinate ascent ... 0
Gradient ascent iterations .............. 2
    variables freed in gradient ascent .. 0
    rows dropped in gradient ascent ..... 0
Preconditioned CG iterations ............ 31
    variables freed in CG ............... 3
    rows dropped in CG .................. 0
SpaRSA iterations ....................... 4
    change in column activity ........... 60
    change in row activity .............. 50
    failures of Armijo step ............. 12
Proximal updates ........................ 7
Cholesky factorizations ................. 8
    nonzeros in final factor ............ 594 99.5% sparse
    rows dropped from L ................. 82
    rows added to L ..................... 393
    rank 1 downdates to L ............... 26
    rank 1 updates to L ................. 317
    Size breakdown of the updates ([size]: number of this size):
        updowns [  1]: 41
        updowns [  2]: 4
        updowns [  3]: 3
        updowns [  4]: 5
        updowns [  5]: 3
        updowns [  6]: 10
        updowns [  7]: 2
        updowns [  8]: 1
        updowns [ 11]: 1
        updowns [ 12]: 12
        updowns [ 13]: 1
    No. of solves by depth in the multilevel partition tree:
        (deeper <=> further from root of tree <=> fewer flops)
        depth [ 0]: 0
        depth [ 1]: 271

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 4.079342e-04
Initialization (includes partition) ..... 5.443096e-04
Phase 1 ................................. 1.924038e-04
Coordinate ascent ....................... 1.096725e-05
SSOR0 ................................... 1.192093e-05
SSOR1 ................................... 1.471043e-04
SpaRSA .................................. 2.312660e-05
DASA .................................... 4.127026e-03
DASA line search ........................ 8.907318e-04
Check error ............................. 1.276493e-03
Proximal update ......................... 1.254082e-04
Invert permutation ...................... 1.263618e-05
Row modifications of Cholesky factor .... 4.358292e-04
Column modifications of Cholesky factor . 3.819466e-04
Cholesky factorization .................. 2.470016e-04
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 3.573895e-04
Forward solves .......................... 1.389980e-04


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Number of iterations: 0         
Function evaluations: 0         
Gradient evaluations: 0         

!!  HYDROELM    505       1       1       1       0       0       0       6       8     0    2.5022777e-08   -3.5820155e+06    0.006090
 Final f                         = -3.5820155e+06  
 Function value at final x       = -3.5820155e+06  
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   HYDROELS

 Problem name: HYDROELS

 Double precision version will be formed

 The objective function uses 1 nonlinear group
 
 There are 168 linear inequality constraints
 
 There are 167 variables bounded from below and above 
 There are 2 fixed variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully
xx pprojparm->cholmod: 1

 Problem: HYDROELS (n = 169)
walltime at start:     0.000000

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 1.247003e-08 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 1.247002501258976e-08    
Final f                               : -3.582268299810012e+06   

Iterations of gradient projection (GP): 1         
Iterations of active set GP           : 2         
Function evaluation in main code      : 1         
Function evaluations in GP            : 1         
Function evaluations in active set GP : 2         
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 1         
Gradient evaluations in active set GP : 2         


PPROJ run statistics (Version 2.0, May 1, 2018):

No. blocks in multilevel partition of A . 1
Depth of multilevel partition tree ...... 0
Phase 1 iterations ...................... 5
Coordinate ascent iterations ............ 3
    variables freed in coordinate ascent  62
    rows dropped in coordinate ascent ... 0
Gradient ascent iterations .............. 2
    variables freed in gradient ascent .. 0
    rows dropped in gradient ascent ..... 0
Preconditioned CG iterations ............ 66
    variables freed in CG ............... 8
    rows dropped in CG .................. 0
SpaRSA iterations ....................... 8
    change in column activity ........... 49
    change in row activity .............. 38
    failures of Armijo step ............. 16
Proximal updates ........................ 9
Cholesky factorizations ................. 8
    nonzeros in final factor ............ 182 98.7% sparse
    rows dropped from L ................. 24
    rows added to L ..................... 130
    rank 1 downdates to L ............... 7
    rank 1 updates to L ................. 102
    Size breakdown of the updates ([size]: number of this size):
        updowns [  1]: 25
        updowns [  2]: 3
        updowns [  3]: 2
        updowns [  4]: 1
        updowns [  5]: 3
        updowns [  6]: 3
        updowns [ 11]: 1
        updowns [ 12]: 2
    No. of solves:   71

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 8.606911e-05
Initialization (includes partition) ..... 1.471043e-04
Phase 1 ................................. 9.202957e-05
Coordinate ascent ....................... 8.106232e-06
SSOR0 ................................... 8.106232e-06
SSOR1 ................................... 1.721382e-04
SpaRSA .................................. 1.096725e-05
DASA .................................... 1.222134e-03
DASA line search ........................ 1.540184e-04
Check error ............................. 2.789497e-04
Proximal update ......................... 8.440018e-05
Invert permutation ...................... 8.821487e-06
Row modifications of Cholesky factor .... 1.106262e-04
Column modifications of Cholesky factor . 9.441376e-05
Cholesky factorization .................. 1.130104e-04
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 6.604195e-05
Forward solves .......................... 3.099442e-05


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Number of iterations: 0         
Function evaluations: 0         
Gradient evaluations: 0         

!!  HYDROELS    169       1       1       1       0       0       0       6       8     0    1.2470025e-08   -3.5822683e+06    0.001926
 Final f                         = -3.5822683e+06  
 Function value at final x       = -3.5822683e+06  
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   LIN

 Problem name: LIN

 Double precision version will be formed

 The objective function uses 1 nonlinear group
 
 There are 2 linear equality constraints
 
 There are 4 variables bounded from below and above 
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully
xx pprojparm->cholmod: 1

 Problem: LIN (n = 4)
walltime at start:     0.000001

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 3.783583e-10 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 3.783583446707096e-10    
Final f                               : -1.757754317621738e-02   

Iterations of gradient projection (GP): 1         
Iterations of active set GP           : 1         
Function evaluation in main code      : 1         
Function evaluations in GP            : 1         
Function evaluations in active set GP : 2         
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 1         
Gradient evaluations in active set GP : 1         


PPROJ run statistics (Version 2.0, May 1, 2018):

No. blocks in multilevel partition of A . 2
Depth of multilevel partition tree ...... 1
Phase 1 iterations ...................... 5
Coordinate ascent iterations ............ 2
    variables freed in coordinate ascent  4
    rows dropped in coordinate ascent ... 0
Gradient ascent iterations .............. 2
    variables freed in gradient ascent .. 0
    rows dropped in gradient ascent ..... 0
Preconditioned CG iterations ............ 2
    variables freed in CG ............... 0
    rows dropped in CG .................. 0
SpaRSA iterations ....................... 2
    change in column activity ........... 0
    change in row activity .............. 0
    failures of Armijo step ............. 10
Proximal updates ........................ 2
Cholesky factorizations ................. 2
    nonzeros in final factor ............ 2 33.3% sparse
    rows dropped from L ................. 0
    rows added to L ..................... 0
    rank 1 downdates to L ............... 0
    rank 1 updates to L ................. 0
    Size breakdown of the updates ([size]: number of this size):
    No. of solves by depth in the multilevel partition tree:
        (deeper <=> further from root of tree <=> fewer flops)
        depth [ 0]: 2
        depth [ 1]: 2

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 4.291534e-05
Initialization (includes partition) ..... 7.319450e-05
Phase 1 ................................. 3.385544e-05
Coordinate ascent ....................... 1.907349e-06
SSOR0 ................................... 3.099442e-06
SSOR1 ................................... 6.914139e-06
SpaRSA .................................. 3.814697e-06
DASA .................................... 8.893013e-05
DASA line search ........................ 6.198883e-06
Check error ............................. 1.478195e-05
Proximal update ......................... 9.536743e-06
Invert permutation ...................... 5.722046e-06
Row modifications of Cholesky factor .... 2.145767e-06
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 1.788139e-05
Partial Cholesky factorization .......... 1.907349e-06
Back solves ............................. 1.907349e-06
Forward solves .......................... 3.337860e-06


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             : -1.757754317621667e-02
sup-norm of gradient:  3.783583446707096e-10
Number of iterations: 1         
Function evaluations: 2         
Gradient evaluations: 1         

!!       LIN      4       1       1       1       1       2       1       5       2     0    3.7835834e-10   -1.7577543e-02    0.000352
 Final f                         = -1.7577543e-02  
 Function value at final x       = -1.7577543e-02  
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   LOADBAL

 Problem name: LOADBAL

 Double precision version will be formed

 The objective function uses 51 nonlinear groups
 
 There are 11 linear equality constraints
 There are 20 linear inequality constraints
 
 There are 20 variables bounded only from below 
 There are 11 variables bounded from below and above 
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully
xx pprojparm->cholmod: 1

 Problem: LOADBAL (n = 31)
walltime at start:     0.000001

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 4.561474e-07 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 4.561474282880398e-07    
Final f                               : 4.528510394395828e-01    

Iterations of gradient projection (GP): 1         
Iterations of active set GP           : 8         
Function evaluation in main code      : 1         
Function evaluations in GP            : 2         
Function evaluations in active set GP : 11        
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 1         
Gradient evaluations in active set GP : 8         


PPROJ run statistics (Version 2.0, May 1, 2018):

No. blocks in multilevel partition of A . 1
Depth of multilevel partition tree ...... 0
Phase 1 iterations ...................... 5
Coordinate ascent iterations ............ 12
    variables freed in coordinate ascent  16
    rows dropped in coordinate ascent ... 4
Gradient ascent iterations .............. 0
    variables freed in gradient ascent .. 0
    rows dropped in gradient ascent ..... 0
Preconditioned CG iterations ............ 0
    variables freed in CG ............... 0
    rows dropped in CG .................. 0
SpaRSA iterations ....................... 10
    change in column activity ........... 10
    change in row activity .............. 0
    failures of Armijo step ............. 5
Proximal updates ........................ 9
Cholesky factorizations ................. 5
    nonzeros in final factor ............ 21 95.8% sparse
    rows dropped from L ................. 1
    rows added to L ..................... 7
    rank 1 downdates to L ............... 10
    rank 1 updates to L ................. 6
    Size breakdown of the updates ([size]: number of this size):
        updowns [  1]: 11
        updowns [  2]: 1
        updowns [  3]: 1
    No. of solves:   15

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 5.006790e-05
Initialization (includes partition) ..... 9.822845e-05
Phase 1 ................................. 7.033348e-05
Coordinate ascent ....................... 1.788139e-05
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 3.099442e-06
DASA .................................... 2.608299e-04
DASA line search ........................ 1.668930e-05
Check error ............................. 6.365776e-05
Proximal update ......................... 4.291534e-05
Invert permutation ...................... 8.821487e-06
Row modifications of Cholesky factor .... 3.099442e-05
Column modifications of Cholesky factor . 2.670288e-05
Cholesky factorization .................. 3.886223e-05
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 9.298325e-06
Forward solves .......................... 9.536743e-06


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             :  4.528510394425120e-01
sup-norm of gradient:  4.561474282880398e-07
Number of iterations: 10        
Function evaluations: 18        
Gradient evaluations: 10        

!!   LOADBAL     31       1       2       1      10      18      10      12       5     0    4.5614743e-07    4.5285104e-01    0.000899
 Final f                         = 4.5285104e-01   
 Function value at final x       = 4.5285104e-01   
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   LSNNODOC

 Problem name: LSNNODOC

 Double precision version will be formed

 The objective function uses 1 nonlinear group
 
 There are 4 linear equality constraints
 
 There are 2 free variables
 There are 3 variables bounded from below and above 
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully
xx pprojparm->cholmod: 1

 Problem: LSNNODOC (n = 5)
walltime at start:     0.000000

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 1.119105e-12 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 1.119104808822158e-12    
Final f                               : 1.231124487914435e+02    

Iterations of gradient projection (GP): 1         
Iterations of active set GP           : 2         
Function evaluation in main code      : 1         
Function evaluations in GP            : 1         
Function evaluations in active set GP : 2         
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 1         
Gradient evaluations in active set GP : 2         


PPROJ run statistics (Version 2.0, May 1, 2018):

No. blocks in multilevel partition of A . 1
Depth of multilevel partition tree ...... 0
Phase 1 iterations ...................... 5
Coordinate ascent iterations ............ 3
    variables freed in coordinate ascent  3
    rows dropped in coordinate ascent ... 0
Gradient ascent iterations .............. 0
    variables freed in gradient ascent .. 0
    rows dropped in gradient ascent ..... 0
Preconditioned CG iterations ............ 0
    variables freed in CG ............... 0
    rows dropped in CG .................. 0
SpaRSA iterations ....................... 3
    change in column activity ........... 1
    change in row activity .............. 0
    failures of Armijo step ............. 2
Proximal updates ........................ 3
Cholesky factorizations ................. 3
    nonzeros in final factor ............ 9 10.0% sparse
    rows dropped from L ................. 0
    rows added to L ..................... 0
    rank 1 downdates to L ............... 1
    rank 1 updates to L ................. 0
    Size breakdown of the updates ([size]: number of this size):
        updowns [  1]: 1
    No. of solves:   3

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 3.194809e-05
Initialization (includes partition) ..... 5.793571e-05
Phase 1 ................................. 3.290176e-05
Coordinate ascent ....................... 1.907349e-06
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 9.536743e-07
DASA .................................... 6.318092e-05
DASA line search ........................ 3.099442e-06
Check error ............................. 1.192093e-05
Proximal update ......................... 1.096725e-05
Invert permutation ...................... 5.960464e-06
Row modifications of Cholesky factor .... 0.000000e+00
Column modifications of Cholesky factor . 6.914139e-06
Cholesky factorization .................. 1.692772e-05
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 2.145767e-06
Forward solves .......................... 5.006790e-06


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             :  1.231124487914517e+02
sup-norm of gradient:  3.057753799820549e+01
Number of iterations: 1         
Function evaluations: 1         
Gradient evaluations: 1         

!!  LSNNODOC      5       1       1       1       1       1       1       5       3     0    1.1191048e-12    1.2311245e+02    0.000296
 Final f                         = 1.2311245e+02   
 Function value at final x       = 1.2311245e+02   
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   ODFITS

 Problem name: ODFITS

 Double precision version will be formed

 The objective function uses 10 nonlinear groups
 
 There are 6 linear equality constraints
 
 There are 10 variables bounded only from below 
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully
xx pprojparm->cholmod: 1

 Problem: ODFITS (n = 10)
walltime at start:     0.000000

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 2.871987e-08 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 2.871987195935885e-08    
Final f                               : -2.380026775403124e+03   

Iterations of gradient projection (GP): 0         
Iterations of active set GP           : 1         
Function evaluation in main code      : 1         
Function evaluations in GP            : 0         
Function evaluations in active set GP : 1         
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 0         
Gradient evaluations in active set GP : 1         


PPROJ run statistics (Version 2.0, May 1, 2018):

No. blocks in multilevel partition of A . 2
Depth of multilevel partition tree ...... 1
Phase 1 iterations ...................... 5
Coordinate ascent iterations ............ 2
    variables freed in coordinate ascent  0
    rows dropped in coordinate ascent ... 0
Gradient ascent iterations .............. 0
    variables freed in gradient ascent .. 0
    rows dropped in gradient ascent ..... 0
Preconditioned CG iterations ............ 0
    variables freed in CG ............... 0
    rows dropped in CG .................. 0
SpaRSA iterations ....................... 2
    change in column activity ........... 0
    change in row activity .............. 0
    failures of Armijo step ............. 0
Proximal updates ........................ 2
Cholesky factorizations ................. 2
    nonzeros in final factor ............ 12 42.9% sparse
    rows dropped from L ................. 0
    rows added to L ..................... 0
    rank 1 downdates to L ............... 0
    rank 1 updates to L ................. 0
    Size breakdown of the updates ([size]: number of this size):
    No. of solves by depth in the multilevel partition tree:
        (deeper <=> further from root of tree <=> fewer flops)
        depth [ 0]: 2
        depth [ 1]: 2

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 3.409386e-05
Initialization (includes partition) ..... 6.008148e-05
Phase 1 ................................. 3.504753e-05
Coordinate ascent ....................... 3.337860e-06
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 9.536743e-07
DASA .................................... 7.295609e-05
DASA line search ........................ 5.006790e-06
Check error ............................. 1.192093e-05
Proximal update ......................... 9.059906e-06
Invert permutation ...................... 2.861023e-06
Row modifications of Cholesky factor .... 2.145767e-06
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 1.621246e-05
Partial Cholesky factorization .......... 1.907349e-06
Back solves ............................. 9.536743e-07
Forward solves .......................... 4.053116e-06


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             : -2.380026775403071e+03
sup-norm of gradient:  2.871987195935885e-08
Number of iterations: 8         
Function evaluations: 16        
Gradient evaluations: 8         

!!    ODFITS     10       0       0       0       8      16       8       3       2     0    2.8719872e-08   -2.3800268e+03    0.000345
 Final f                         = -2.3800268e+03  
 Function value at final x       = -2.3800268e+03  
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   PENTAGON

 Problem name: PENTAGON

 Double precision version will be formed

 The objective function uses 1 nonlinear group
 
 There are 15 linear inequality constraints
 
 There are 6 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully
xx pprojparm->cholmod: 1

 Problem: PENTAGON (n = 6)
walltime at start:     0.000001

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 2.133831e-07 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 2.133831170346309e-07    
Final f                               : 1.365216752183141e-04    

Iterations of gradient projection (GP): 0         
Iterations of active set GP           : 2         
Function evaluation in main code      : 1         
Function evaluations in GP            : 0         
Function evaluations in active set GP : 2         
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 0         
Gradient evaluations in active set GP : 2         


PPROJ run statistics (Version 2.0, May 1, 2018):

No. blocks in multilevel partition of A . 3
Depth of multilevel partition tree ...... 1
Phase 1 iterations ...................... 5
Coordinate ascent iterations ............ 0
    variables freed in coordinate ascent  0
    rows dropped in coordinate ascent ... 0
Gradient ascent iterations .............. 0
    variables freed in gradient ascent .. 0
    rows dropped in gradient ascent ..... 0
Preconditioned CG iterations ............ 0
    variables freed in CG ............... 0
    rows dropped in CG .................. 0
SpaRSA iterations ....................... 2
    change in column activity ........... 0
    change in row activity .............. 0
    failures of Armijo step ............. 1
Proximal updates ........................ 2
Cholesky factorizations ................. 2
    nonzeros in final factor ............ 3 97.5% sparse
    rows dropped from L ................. 1
    rows added to L ..................... 1
    rank 1 downdates to L ............... 0
    rank 1 updates to L ................. 0
    Size breakdown of the updates ([size]: number of this size):
    No. of solves by depth in the multilevel partition tree:
        (deeper <=> further from root of tree <=> fewer flops)
        depth [ 0]: 2
        depth [ 1]: 4

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 3.409386e-05
Initialization (includes partition) ..... 6.294250e-05
Phase 1 ................................. 4.196167e-05
Coordinate ascent ....................... 0.000000e+00
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 2.145767e-06
DASA .................................... 8.702278e-05
DASA line search ........................ 6.675720e-06
Check error ............................. 1.215935e-05
Proximal update ......................... 1.001358e-05
Invert permutation ...................... 7.152557e-06
Row modifications of Cholesky factor .... 1.883507e-05
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 1.716614e-05
Partial Cholesky factorization .......... 9.536743e-07
Back solves ............................. 2.861023e-06
Forward solves .......................... 4.053116e-06


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             :  1.365216752183521e-04
sup-norm of gradient:  2.133831170346309e-07
Number of iterations: 7         
Function evaluations: 14        
Gradient evaluations: 9         

!!  PENTAGON      6       0       0       0       7      14       9       4       2     0    2.1338312e-07    1.3652168e-04    0.000356
 Final f                         = 1.3652168e-04   
 Function value at final x       = 1.3652168e-04   
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   QC

 Problem name: QC

 Double precision version will be formed

 The objective function uses 17 nonlinear groups
 
 There are 4 linear inequality constraints
 
 There are 7 variables bounded from below and above 
 There are 2 fixed variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully
xx pprojparm->cholmod: 1

 Problem: QC (n = 9)
walltime at start:     0.000001

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 0.000000e+00 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 0.000000000000000e+00    
Final f                               : -9.565377333039573e+02   

Iterations of gradient projection (GP): 1         
Iterations of active set GP           : 5         
Function evaluation in main code      : 1         
Function evaluations in GP            : 1         
Function evaluations in active set GP : 5         
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 1         
Gradient evaluations in active set GP : 5         


PPROJ run statistics (Version 2.0, May 1, 2018):

No. blocks in multilevel partition of A . 4
Depth of multilevel partition tree ...... 1
Phase 1 iterations ...................... 5
Coordinate ascent iterations ............ 1
    variables freed in coordinate ascent  0
    rows dropped in coordinate ascent ... 0
Gradient ascent iterations .............. 1
    variables freed in gradient ascent .. 0
    rows dropped in gradient ascent ..... 0
Preconditioned CG iterations ............ 1
    variables freed in CG ............... 0
    rows dropped in CG .................. 0
SpaRSA iterations ....................... 1
    change in column activity ........... 0
    change in row activity .............. 0
    failures of Armijo step ............. 0
Proximal updates ........................ 1
Cholesky factorizations ................. 0
    nonzeros in final factor ............ 0 100.0% sparse
    rows dropped from L ................. 0
    rows added to L ..................... 0
    rank 1 downdates to L ............... 0
    rank 1 updates to L ................. 0
    Size breakdown of the updates ([size]: number of this size):
    No. of solves by depth in the multilevel partition tree:
        (deeper <=> further from root of tree <=> fewer flops)
        depth [ 0]: 0
        depth [ 1]: 0

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 3.504753e-05
Initialization (includes partition) ..... 6.389618e-05
Phase 1 ................................. 3.027916e-05
Coordinate ascent ....................... 0.000000e+00
SSOR0 ................................... 2.145767e-06
SSOR1 ................................... 1.907349e-06
SpaRSA .................................. 2.145767e-06
DASA .................................... 1.502037e-05
DASA line search ........................ 0.000000e+00
Check error ............................. 8.106232e-06
Proximal update ......................... 7.152557e-06
Invert permutation ...................... 6.914139e-06
Row modifications of Cholesky factor .... 0.000000e+00
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 0.000000e+00
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 0.000000e+00
Forward solves .......................... 0.000000e+00


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             : -9.565377333039573e+02
sup-norm of gradient:  5.172572909420166e+00
Number of iterations: 5         
Function evaluations: 8         
Gradient evaluations: 8         

!!        QC      9       1       1       1       5       8       8       8       0     0    0.0000000e+00   -9.5653773e+02    0.000313
 Final f                         = -9.5653773e+02  
 Function value at final x       = -9.5653773e+02  
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   QCNEW

 Problem name: QCNEW

 Double precision version will be formed

 The objective function uses 17 nonlinear groups
 
 There are 3 linear inequality constraints
 
 There are 7 variables bounded from below and above 
 There are 2 fixed variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully
xx pprojparm->cholmod: 1

 Problem: QCNEW (n = 9)
walltime at start:     0.000000

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 0.000000e+00 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 0.000000000000000e+00    
Final f                               : -8.065218543888329e+02   

Iterations of gradient projection (GP): 1         
Iterations of active set GP           : 0         
Function evaluation in main code      : 1         
Function evaluations in GP            : 1         
Function evaluations in active set GP : 0         
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 1         
Gradient evaluations in active set GP : 0         


PPROJ run statistics (Version 2.0, May 1, 2018):

No. blocks in multilevel partition of A . 3
Depth of multilevel partition tree ...... 1
Phase 1 iterations ...................... 5
Coordinate ascent iterations ............ 0
    variables freed in coordinate ascent  0
    rows dropped in coordinate ascent ... 0
Gradient ascent iterations .............. 0
    variables freed in gradient ascent .. 0
    rows dropped in gradient ascent ..... 0
Preconditioned CG iterations ............ 0
    variables freed in CG ............... 0
    rows dropped in CG .................. 0
SpaRSA iterations ....................... 0
    change in column activity ........... 0
    change in row activity .............. 0
    failures of Armijo step ............. 0
Proximal updates ........................ 0
Cholesky factorizations ................. 0
    nonzeros in final factor ............ 0 100.0% sparse
    rows dropped from L ................. 0
    rows added to L ..................... 0
    rank 1 downdates to L ............... 0
    rank 1 updates to L ................. 0
    Size breakdown of the updates ([size]: number of this size):
    No. of solves by depth in the multilevel partition tree:
        (deeper <=> further from root of tree <=> fewer flops)
        depth [ 0]: 0
        depth [ 1]: 0

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 9.298325e-05
Initialization (includes partition) ..... 1.211166e-04
Phase 1 ................................. 3.290176e-05
Coordinate ascent ....................... 0.000000e+00
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 0.000000e+00
DASA .................................... 0.000000e+00
DASA line search ........................ 0.000000e+00
Check error ............................. 0.000000e+00
Proximal update ......................... 0.000000e+00
Invert permutation ...................... 5.960464e-06
Row modifications of Cholesky factor .... 0.000000e+00
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 0.000000e+00
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 0.000000e+00
Forward solves .......................... 0.000000e+00


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Number of iterations: 0         
Function evaluations: 0         
Gradient evaluations: 0         

!!     QCNEW      9       1       1       1       0       0       0       4       0     0    0.0000000e+00   -8.0652185e+02    0.000254
 Final f                         = -8.0652185e+02  
 Function value at final x       = -8.0652185e+02  
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   SMBANK

 Problem name: SMBANK

 Double precision version will be formed

 The objective function uses 1 nonlinear group
 
 There are 64 linear equality constraints
 
 There are 117 variables bounded from below and above 
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully
xx pprojparm->cholmod: 1

 Problem: SMBANK (n = 117)
walltime at start:     0.000001

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 6.690964e-07 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 6.690963759202820e-07    
Final f                               : -7.129291999999873e+06   

Iterations of gradient projection (GP): 20        
Iterations of active set GP           : 58        
Function evaluation in main code      : 1         
Function evaluations in GP            : 108       
Function evaluations in active set GP : 147       
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 33        
Gradient evaluations in active set GP : 83        


PPROJ run statistics (Version 2.0, May 1, 2018):

No. blocks in multilevel partition of A . 1
Depth of multilevel partition tree ...... 0
Phase 1 iterations ...................... 5
Coordinate ascent iterations ............ 125
    variables freed in coordinate ascent  252
    rows dropped in coordinate ascent ... 0
Gradient ascent iterations .............. 0
    variables freed in gradient ascent .. 0
    rows dropped in gradient ascent ..... 0
Preconditioned CG iterations ............ 0
    variables freed in CG ............... 0
    rows dropped in CG .................. 0
SpaRSA iterations ....................... 86
    change in column activity ........... 487
    change in row activity .............. 0
    failures of Armijo step ............. 10
Proximal updates ........................ 86
Cholesky factorizations ................. 57
    nonzeros in final factor ............ 297 85.7% sparse
    rows dropped from L ................. 0
    rows added to L ..................... 0
    rank 1 downdates to L ............... 225
    rank 1 updates to L ................. 372
    Size breakdown of the updates ([size]: number of this size):
        updowns [  1]: 120
        updowns [  2]: 31
        updowns [  3]: 27
        updowns [  4]: 14
        updowns [  5]: 12
        updowns [  6]: 6
        updowns [  7]: 7
        updowns [  8]: 3
        updowns [ 14]: 2
        updowns [ 15]: 1
        updowns [ 16]: 3
        updowns [ 18]: 1
    No. of solves:   234

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 7.891655e-05
Initialization (includes partition) ..... 4.079342e-04
Phase 1 ................................. 5.161762e-04
Coordinate ascent ....................... 4.508495e-04
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 5.006790e-06
DASA .................................... 4.807472e-03
DASA line search ........................ 4.279613e-04
Check error ............................. 1.070023e-03
Proximal update ......................... 6.897449e-04
Invert permutation ...................... 8.916855e-05
Row modifications of Cholesky factor .... 5.769730e-05
Column modifications of Cholesky factor . 7.810593e-04
Cholesky factorization .................. 1.032352e-03
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 2.782345e-04
Forward solves .......................... 1.871586e-04


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             : -7.129291999999873e+06
sup-norm of gradient:  6.690963759202820e-07
Number of iterations: 899       
Function evaluations: 1661      
Gradient evaluations: 1375      
Subspace iterations: 361       
Number of subspaces: 45        


!!    SMBANK    117      20     108      33     899    1661    1375     101      57     0    6.6909638e-07   -7.1292920e+06    0.048842
 Final f                         = -7.1292920e+06  
 Function value at final x       = -7.1292920e+06  
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   SPANHYD

 Problem name: SPANHYD

 Double precision version will be formed

 The objective function uses 1 nonlinear group
 
 There are 33 linear equality constraints
 
 There are 81 variables bounded from below and above 
 There are 16 fixed variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully
xx pprojparm->cholmod: 1

 Problem: SPANHYD (n = 97)
walltime at start:     0.000001

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 4.163608e-09 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 4.163608124940765e-09    
Final f                               : 2.397380007047549e+02    

Iterations of gradient projection (GP): 4         
Iterations of active set GP           : 10        
Function evaluation in main code      : 1         
Function evaluations in GP            : 6         
Function evaluations in active set GP : 10        
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 4         
Gradient evaluations in active set GP : 10        


PPROJ run statistics (Version 2.0, May 1, 2018):

No. blocks in multilevel partition of A . 1
Depth of multilevel partition tree ...... 0
Phase 1 iterations ...................... 5
Coordinate ascent iterations ............ 43
    variables freed in coordinate ascent  106
    rows dropped in coordinate ascent ... 0
Gradient ascent iterations .............. 0
    variables freed in gradient ascent .. 0
    rows dropped in gradient ascent ..... 0
Preconditioned CG iterations ............ 0
    variables freed in CG ............... 0
    rows dropped in CG .................. 0
SpaRSA iterations ....................... 15
    change in column activity ........... 61
    change in row activity .............. 0
    failures of Armijo step ............. 4
Proximal updates ........................ 29
Cholesky factorizations ................. 53
    nonzeros in final factor ............ 105 81.3% sparse
    rows dropped from L ................. 0
    rows added to L ..................... 0
    rank 1 downdates to L ............... 33
    rank 1 updates to L ................. 53
    Size breakdown of the updates ([size]: number of this size):
        updowns [  1]: 53
        updowns [  2]: 8
        updowns [  3]: 3
        updowns [  4]: 2
    No. of solves:   112

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 6.508827e-05
Initialization (includes partition) ..... 1.263618e-04
Phase 1 ................................. 1.518726e-04
Coordinate ascent ....................... 1.392365e-04
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 4.053116e-06
DASA .................................... 1.729727e-03
DASA line search ........................ 1.807213e-04
Check error ............................. 4.112720e-04
Proximal update ......................... 1.721382e-04
Invert permutation ...................... 1.502037e-05
Row modifications of Cholesky factor .... 1.621246e-05
Column modifications of Cholesky factor . 1.478195e-04
Cholesky factorization .................. 4.701614e-04
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 1.003742e-04
Forward solves .......................... 8.702278e-05


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             :  2.397380007047549e+02
sup-norm of gradient:  2.161139071518714e-09
Number of iterations: 12        
Function evaluations: 24        
Gradient evaluations: 12        
Subspace iterations: 1         
Number of subspaces: 1         


!!   SPANHYD     97       4       6       4      12      24      12      18      53     0    4.1636081e-09    2.3973800e+02    0.002883
 Final f                         = 2.3973800e+02   
 Function value at final x       = 2.3973800e+02   
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   STANCMIN

 Problem name: STANCMIN

 Double precision version will be formed

 The objective function uses 1 nonlinear group
 
 There are 2 linear inequality constraints
 
 There are 3 variables bounded only from below 
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully
xx pprojparm->cholmod: 1

 Problem: STANCMIN (n = 3)
walltime at start:     0.000000

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 1.592371e-11 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 1.592370679759370e-11    
Final f                               : 4.249999999967638e+00    

Iterations of gradient projection (GP): 0         
Iterations of active set GP           : 0         
Function evaluation in main code      : 1         
Function evaluations in GP            : 0         
Function evaluations in active set GP : 0         
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 0         
Gradient evaluations in active set GP : 0         


PPROJ run statistics (Version 2.0, May 1, 2018):

No. blocks in multilevel partition of A . 1
Depth of multilevel partition tree ...... 0
Phase 1 iterations ...................... 5
Coordinate ascent iterations ............ 3
    variables freed in coordinate ascent  0
    rows dropped in coordinate ascent ... 0
Gradient ascent iterations .............. 0
    variables freed in gradient ascent .. 0
    rows dropped in gradient ascent ..... 0
Preconditioned CG iterations ............ 0
    variables freed in CG ............... 0
    rows dropped in CG .................. 0
SpaRSA iterations ....................... 2
    change in column activity ........... 1
    change in row activity .............. 0
    failures of Armijo step ............. 0
Proximal updates ........................ 2
Cholesky factorizations ................. 5
    nonzeros in final factor ............ 3  0.0% sparse
    rows dropped from L ................. 0
    rows added to L ..................... 0
    rank 1 downdates to L ............... 0
    rank 1 updates to L ................. 0
    Size breakdown of the updates ([size]: number of this size):
    No. of solves:   5

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 2.002716e-05
Initialization (includes partition) ..... 4.291534e-05
Phase 1 ................................. 3.004074e-05
Coordinate ascent ....................... 2.861023e-06
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 9.536743e-07
DASA .................................... 7.390976e-05
DASA line search ........................ 4.291534e-06
Check error ............................. 3.218651e-05
Proximal update ......................... 8.106232e-06
Invert permutation ...................... 2.145767e-06
Row modifications of Cholesky factor .... 0.000000e+00
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 1.788139e-05
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 4.053116e-06
Forward solves .......................... 5.245209e-06


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Number of iterations: 0         
Function evaluations: 0         
Gradient evaluations: 0         

!!  STANCMIN      3       0       0       0       0       0       0       2       5     0    1.5923707e-11    4.2500000e+00    0.000234
 Final f                         = 4.2500000e+00   
 Function value at final x       = 4.2500000e+00   
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   STEENBRB

 Problem name: STEENBRB

 Double precision version will be formed

 The objective function uses 1 nonlinear group
 
 There are 108 linear equality constraints
 
 There are 468 variables bounded only from below 
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully
xx pprojparm->cholmod: 1

 Problem: STEENBRB (n = 468)
walltime at start:     0.000001

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 7.102954e-07 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 7.102953569586290e-07    
Final f                               : 9.075855377455964e+03    

Iterations of gradient projection (GP): 3         
Iterations of active set GP           : 25        
Function evaluation in main code      : 1         
Function evaluations in GP            : 3         
Function evaluations in active set GP : 29        
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 3         
Gradient evaluations in active set GP : 25        


PPROJ run statistics (Version 2.0, May 1, 2018):

No. blocks in multilevel partition of A . 12
Depth of multilevel partition tree ...... 1
Phase 1 iterations ...................... 5
Coordinate ascent iterations ............ 3
    variables freed in coordinate ascent  11
    rows dropped in coordinate ascent ... 0
Gradient ascent iterations .............. 0
    variables freed in gradient ascent .. 0
    rows dropped in gradient ascent ..... 0
Preconditioned CG iterations ............ 0
    variables freed in CG ............... 0
    rows dropped in CG .................. 0
SpaRSA iterations ....................... 28
    change in column activity ........... 187
    change in row activity .............. 0
    failures of Armijo step ............. 5
Proximal updates ........................ 29
Cholesky factorizations ................. 9
    nonzeros in final factor ............ 198 96.6% sparse
    rows dropped from L ................. 0
    rows added to L ..................... 0
    rank 1 downdates to L ............... 144
    rank 1 updates to L ................. 257
    Size breakdown of the updates ([size]: number of this size):
        updowns [  1]: 37
        updowns [  2]: 13
        updowns [  3]: 6
        updowns [  4]: 9
        updowns [  5]: 1
        updowns [  6]: 3
        updowns [  7]: 2
        updowns [  8]: 2
        updowns [  9]: 3
        updowns [ 10]: 2
        updowns [ 11]: 2
        updowns [ 12]: 1
        updowns [ 13]: 1
        updowns [ 16]: 1
        updowns [ 20]: 1
        updowns [ 21]: 1
        updowns [ 29]: 1
        updowns [ 51]: 1
    No. of solves by depth in the multilevel partition tree:
        (deeper <=> further from root of tree <=> fewer flops)
        depth [ 0]: 45
        depth [ 1]: 497

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 1.089573e-04
Initialization (includes partition) ..... 2.675056e-04
Phase 1 ................................. 3.728867e-04
Coordinate ascent ....................... 2.002716e-05
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 1.287460e-05
DASA .................................... 3.124714e-03
DASA line search ........................ 5.939007e-04
Check error ............................. 3.435612e-04
Proximal update ......................... 3.345013e-04
Invert permutation ...................... 2.932549e-05
Row modifications of Cholesky factor .... 6.723404e-05
Column modifications of Cholesky factor . 3.123283e-04
Cholesky factorization .................. 2.484322e-04
Partial Cholesky factorization .......... 1.788139e-05
Back solves ............................. 3.962517e-04
Forward solves .......................... 9.465218e-05


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             :  9.075855377462447e+03
sup-norm of gradient:  7.102953569586290e-07
Number of iterations: 88        
Function evaluations: 211       
Gradient evaluations: 134       
Subspace iterations: 18        
Number of subspaces: 3         


!!  STEENBRB    468       3       3       3      88     211     134      31       9     0    7.1029536e-07    9.0758554e+03    0.007202
 Final f                         = 9.0758554e+03   
 Function value at final x       = 9.0758554e+03   
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   STEENBRC

 Problem name: STEENBRC

 Double precision version will be formed

 The objective function uses 1 nonlinear group
 
 There are 126 linear equality constraints
 
 There are 540 variables bounded only from below 
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully
xx pprojparm->cholmod: 1

 Problem: STEENBRC (n = 540)
walltime at start:     0.000000

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 8.017083e-07 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 8.017083347907055e-07    
Final f                               : 2.750493684968765e+04    

Iterations of gradient projection (GP): 3         
Iterations of active set GP           : 31        
Function evaluation in main code      : 1         
Function evaluations in GP            : 3         
Function evaluations in active set GP : 48        
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 3         
Gradient evaluations in active set GP : 31        


PPROJ run statistics (Version 2.0, May 1, 2018):

No. blocks in multilevel partition of A . 14
Depth of multilevel partition tree ...... 1
Phase 1 iterations ...................... 5
Coordinate ascent iterations ............ 2
    variables freed in coordinate ascent  20
    rows dropped in coordinate ascent ... 0
Gradient ascent iterations .............. 0
    variables freed in gradient ascent .. 0
    rows dropped in gradient ascent ..... 0
Preconditioned CG iterations ............ 0
    variables freed in CG ............... 0
    rows dropped in CG .................. 0
SpaRSA iterations ....................... 29
    change in column activity ........... 332
    change in row activity .............. 0
    failures of Armijo step ............. 4
Proximal updates ........................ 30
Cholesky factorizations ................. 10
    nonzeros in final factor ............ 242 97.0% sparse
    rows dropped from L ................. 0
    rows added to L ..................... 0
    rank 1 downdates to L ............... 219
    rank 1 updates to L ................. 420
    Size breakdown of the updates ([size]: number of this size):
        updowns [  1]: 49
        updowns [  2]: 18
        updowns [  3]: 8
        updowns [  4]: 5
        updowns [  5]: 9
        updowns [  6]: 4
        updowns [  7]: 1
        updowns [  8]: 1
        updowns [  9]: 5
        updowns [ 10]: 4
        updowns [ 11]: 2
        updowns [ 12]: 1
        updowns [ 13]: 1
        updowns [ 15]: 1
        updowns [ 16]: 1
        updowns [ 19]: 1
        updowns [ 21]: 1
        updowns [ 22]: 1
        updowns [ 23]: 2
        updowns [ 35]: 1
        updowns [ 40]: 1
        updowns [>= 69]: 1
    No. of solves by depth in the multilevel partition tree:
        (deeper <=> further from root of tree <=> fewer flops)
        depth [ 0]: 57
        depth [ 1]: 687

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 1.270771e-04
Initialization (includes partition) ..... 3.223419e-04
Phase 1 ................................. 4.534721e-04
Coordinate ascent ....................... 1.907349e-05
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 5.006790e-06
DASA .................................... 4.086733e-03
DASA line search ........................ 8.010864e-04
Check error ............................. 4.146099e-04
Proximal update ......................... 3.695488e-04
Invert permutation ...................... 3.528595e-05
Row modifications of Cholesky factor .... 7.271767e-05
Column modifications of Cholesky factor . 4.529953e-04
Cholesky factorization .................. 2.925396e-04
Partial Cholesky factorization .......... 2.002716e-05
Back solves ............................. 5.528927e-04
Forward solves .......................... 1.201630e-04


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             :  2.750493684970306e+04
sup-norm of gradient:  8.017083347907055e-07
Number of iterations: 276       
Function evaluations: 750       
Gradient evaluations: 521       
Subspace iterations: 80        
Number of subspaces: 7         


!!  STEENBRC    540       3       3       3     276     750     521      37      10     0    8.0170833e-07    2.7504937e+04    0.017381
 Final f                         = 2.7504937e+04   
 Function value at final x       = 2.7504937e+04   
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   STEENBRD

 Problem name: STEENBRD

 Double precision version will be formed

 The objective function uses 1 nonlinear group
 
 There are 108 linear equality constraints
 
 There are 468 variables bounded only from below 
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully
xx pprojparm->cholmod: 1

 Problem: STEENBRD (n = 468)
walltime at start:     0.000001

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 9.941087e-07 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 9.941087489463013e-07    
Final f                               : 9.144724935978862e+03    

Iterations of gradient projection (GP): 2         
Iterations of active set GP           : 32        
Function evaluation in main code      : 1         
Function evaluations in GP            : 3         
Function evaluations in active set GP : 39        
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 2         
Gradient evaluations in active set GP : 32        


PPROJ run statistics (Version 2.0, May 1, 2018):

No. blocks in multilevel partition of A . 12
Depth of multilevel partition tree ...... 1
Phase 1 iterations ...................... 5
Coordinate ascent iterations ............ 4
    variables freed in coordinate ascent  23
    rows dropped in coordinate ascent ... 0
Gradient ascent iterations .............. 0
    variables freed in gradient ascent .. 0
    rows dropped in gradient ascent ..... 0
Preconditioned CG iterations ............ 0
    variables freed in CG ............... 0
    rows dropped in CG .................. 0
SpaRSA iterations ....................... 25
    change in column activity ........... 159
    change in row activity .............. 0
    failures of Armijo step ............. 14
Proximal updates ........................ 25
Cholesky factorizations ................. 11
    nonzeros in final factor ............ 200 96.6% sparse
    rows dropped from L ................. 0
    rows added to L ..................... 0
    rank 1 downdates to L ............... 186
    rank 1 updates to L ................. 318
    Size breakdown of the updates ([size]: number of this size):
        updowns [  1]: 35
        updowns [  2]: 17
        updowns [  3]: 10
        updowns [  4]: 6
        updowns [  5]: 2
        updowns [  6]: 3
        updowns [  7]: 3
        updowns [  8]: 4
        updowns [  9]: 3
        updowns [ 10]: 3
        updowns [ 12]: 1
        updowns [ 14]: 1
        updowns [ 15]: 2
        updowns [ 20]: 2
        updowns [ 27]: 1
        updowns [ 29]: 1
        updowns [ 42]: 1
        updowns [ 49]: 1
    No. of solves by depth in the multilevel partition tree:
        (deeper <=> further from root of tree <=> fewer flops)
        depth [ 0]: 45
        depth [ 1]: 557

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 1.111031e-04
Initialization (includes partition) ..... 2.949238e-04
Phase 1 ................................. 4.017353e-04
Coordinate ascent ....................... 2.670288e-05
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 4.053116e-06
DASA .................................... 3.468513e-03
DASA line search ........................ 6.794930e-04
Check error ............................. 3.707409e-04
Proximal update ......................... 2.877712e-04
Invert permutation ...................... 3.194809e-05
Row modifications of Cholesky factor .... 7.081032e-05
Column modifications of Cholesky factor . 3.838539e-04
Cholesky factorization .................. 2.894402e-04
Partial Cholesky factorization .......... 2.050400e-05
Back solves ............................. 4.649162e-04
Forward solves .......................... 1.118183e-04


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             :  9.144724935985703e+03
sup-norm of gradient:  9.941087489463013e-07
Number of iterations: 148       
Function evaluations: 326       
Gradient evaluations: 202       
Subspace iterations: 50        
Number of subspaces: 7         


!!  STEENBRD    468       2       3       2     148     326     202      37      11     0    9.9410875e-07    9.1447249e+03    0.008931
 Final f                         = 9.1447249e+03   
 Function value at final x       = 9.1447249e+03   
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   STEENBRE

 Problem name: STEENBRE

 Double precision version will be formed

 The objective function uses 1 nonlinear group
 
 There are 126 linear equality constraints
 
 There are 540 variables bounded only from below 
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully
xx pprojparm->cholmod: 1

 Problem: STEENBRE (n = 540)
walltime at start:     0.000000

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 6.910090e-07 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 6.910090157171388e-07    
Final f                               : 2.745916333041736e+04    

Iterations of gradient projection (GP): 4         
Iterations of active set GP           : 33        
Function evaluation in main code      : 1         
Function evaluations in GP            : 11        
Function evaluations in active set GP : 51        
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 4         
Gradient evaluations in active set GP : 33        


PPROJ run statistics (Version 2.0, May 1, 2018):

No. blocks in multilevel partition of A . 14
Depth of multilevel partition tree ...... 1
Phase 1 iterations ...................... 5
Coordinate ascent iterations ............ 2
    variables freed in coordinate ascent  14
    rows dropped in coordinate ascent ... 0
Gradient ascent iterations .............. 0
    variables freed in gradient ascent .. 0
    rows dropped in gradient ascent ..... 0
Preconditioned CG iterations ............ 0
    variables freed in CG ............... 0
    rows dropped in CG .................. 0
SpaRSA iterations ....................... 32
    change in column activity ........... 173
    change in row activity .............. 0
    failures of Armijo step ............. 15
Proximal updates ........................ 33
Cholesky factorizations ................. 11
    nonzeros in final factor ............ 242 97.0% sparse
    rows dropped from L ................. 0
    rows added to L ..................... 0
    rank 1 downdates to L ............... 256
    rank 1 updates to L ................. 398
    Size breakdown of the updates ([size]: number of this size):
        updowns [  1]: 33
        updowns [  2]: 18
        updowns [  3]: 13
        updowns [  4]: 8
        updowns [  5]: 3
        updowns [  6]: 8
        updowns [  7]: 6
        updowns [  8]: 4
        updowns [  9]: 4
        updowns [ 10]: 1
        updowns [ 11]: 1
        updowns [ 12]: 2
        updowns [ 13]: 1
        updowns [ 14]: 1
        updowns [ 15]: 1
        updowns [ 16]: 3
        updowns [ 23]: 2
        updowns [ 26]: 1
        updowns [ 40]: 1
        updowns [ 41]: 1
        updowns [ 53]: 1
    No. of solves by depth in the multilevel partition tree:
        (deeper <=> further from root of tree <=> fewer flops)
        depth [ 0]: 66
        depth [ 1]: 809

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 1.180172e-04
Initialization (includes partition) ..... 3.468990e-04
Phase 1 ................................. 5.002022e-04
Coordinate ascent ....................... 1.811981e-05
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 5.960464e-06
DASA .................................... 4.728556e-03
DASA line search ........................ 1.006365e-03
Check error ............................. 5.576611e-04
Proximal update ......................... 4.460812e-04
Invert permutation ...................... 4.100800e-05
Row modifications of Cholesky factor .... 8.225441e-05
Column modifications of Cholesky factor . 4.277229e-04
Cholesky factorization .................. 3.046989e-04
Partial Cholesky factorization .......... 1.931190e-05
Back solves ............................. 6.477833e-04
Forward solves .......................... 1.542568e-04


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             :  2.745916333047784e+04
sup-norm of gradient:  6.910090157171388e-07
Number of iterations: 335       
Function evaluations: 859       
Gradient evaluations: 571       
Subspace iterations: 110       
Number of subspaces: 10        


!!  STEENBRE    540       4      11       4     335     859     571      41      11     0    6.9100902e-07    2.7459163e+04    0.020199
 Final f                         = 2.7459163e+04   
 Function value at final x       = 2.7459163e+04   
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   STEENBRF

 Problem name: STEENBRF

 Double precision version will be formed

 The objective function uses 1 nonlinear group
 
 There are 108 linear equality constraints
 
 There are 468 variables bounded only from below 
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully
xx pprojparm->cholmod: 1

 Problem: STEENBRF (n = 468)
walltime at start:     0.000000

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 3.481295e-07 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 3.481294880390562e-07    
Final f                               : 8.991848220142454e+03    

Iterations of gradient projection (GP): 1         
Iterations of active set GP           : 21        
Function evaluation in main code      : 1         
Function evaluations in GP            : 1         
Function evaluations in active set GP : 26        
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 1         
Gradient evaluations in active set GP : 21        


PPROJ run statistics (Version 2.0, May 1, 2018):

No. blocks in multilevel partition of A . 12
Depth of multilevel partition tree ...... 1
Phase 1 iterations ...................... 5
Coordinate ascent iterations ............ 3
    variables freed in coordinate ascent  11
    rows dropped in coordinate ascent ... 0
Gradient ascent iterations .............. 0
    variables freed in gradient ascent .. 0
    rows dropped in gradient ascent ..... 0
Preconditioned CG iterations ............ 0
    variables freed in CG ............... 0
    rows dropped in CG .................. 0
SpaRSA iterations ....................... 24
    change in column activity ........... 182
    change in row activity .............. 0
    failures of Armijo step ............. 9
Proximal updates ........................ 25
Cholesky factorizations ................. 9
    nonzeros in final factor ............ 196 96.7% sparse
    rows dropped from L ................. 0
    rows added to L ..................... 0
    rank 1 downdates to L ............... 130
    rank 1 updates to L ................. 243
    Size breakdown of the updates ([size]: number of this size):
        updowns [  1]: 30
        updowns [  2]: 10
        updowns [  3]: 3
        updowns [  4]: 8
        updowns [  5]: 2
        updowns [  6]: 3
        updowns [  7]: 1
        updowns [  8]: 2
        updowns [  9]: 3
        updowns [ 10]: 2
        updowns [ 11]: 3
        updowns [ 13]: 1
        updowns [ 16]: 1
        updowns [ 20]: 1
        updowns [ 21]: 1
        updowns [ 30]: 1
        updowns [ 51]: 1
    No. of solves by depth in the multilevel partition tree:
        (deeper <=> further from root of tree <=> fewer flops)
        depth [ 0]: 40
        depth [ 1]: 435

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 1.091957e-04
Initialization (includes partition) ..... 2.517700e-04
Phase 1 ................................. 3.519058e-04
Coordinate ascent ....................... 1.978874e-05
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 5.006790e-06
DASA .................................... 2.783775e-03
DASA line search ........................ 5.152225e-04
Check error ............................. 2.765656e-04
Proximal update ......................... 2.815723e-04
Invert permutation ...................... 2.431870e-05
Row modifications of Cholesky factor .... 5.245209e-05
Column modifications of Cholesky factor . 2.977848e-04
Cholesky factorization .................. 2.436638e-04
Partial Cholesky factorization .......... 1.931190e-05
Back solves ............................. 3.747940e-04
Forward solves .......................... 8.654594e-05


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             :  8.991848220228083e+03
sup-norm of gradient:  3.481294880390562e-07
Number of iterations: 117       
Function evaluations: 281       
Gradient evaluations: 175       
Subspace iterations: 31        
Number of subspaces: 3         


!!  STEENBRF    468       1       1       1     117     281     175      25       9     0    3.4812949e-07    8.9918482e+03    0.007393
 Final f                         = 8.9918482e+03   
 Function value at final x       = 8.9918482e+03   
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   STEENBRG

 Problem name: STEENBRG

 Double precision version will be formed

 The objective function uses 1 nonlinear group
 
 There are 126 linear equality constraints
 
 There are 540 variables bounded only from below 
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully
xx pprojparm->cholmod: 1

 Problem: STEENBRG (n = 540)
walltime at start:     0.000000

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 7.753090e-07 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 7.753089635853527e-07    
Final f                               : 2.742092966559834e+04    

Iterations of gradient projection (GP): 7         
Iterations of active set GP           : 42        
Function evaluation in main code      : 1         
Function evaluations in GP            : 17        
Function evaluations in active set GP : 54        
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 10        
Gradient evaluations in active set GP : 44        


PPROJ run statistics (Version 2.0, May 1, 2018):

No. blocks in multilevel partition of A . 14
Depth of multilevel partition tree ...... 1
Phase 1 iterations ...................... 5
Coordinate ascent iterations ............ 2
    variables freed in coordinate ascent  20
    rows dropped in coordinate ascent ... 0
Gradient ascent iterations .............. 0
    variables freed in gradient ascent .. 0
    rows dropped in gradient ascent ..... 0
Preconditioned CG iterations ............ 0
    variables freed in CG ............... 0
    rows dropped in CG .................. 0
SpaRSA iterations ....................... 43
    change in column activity ........... 378
    change in row activity .............. 0
    failures of Armijo step ............. 7
Proximal updates ........................ 44
Cholesky factorizations ................. 10
    nonzeros in final factor ............ 242 97.0% sparse
    rows dropped from L ................. 0
    rows added to L ..................... 0
    rank 1 downdates to L ............... 293
    rank 1 updates to L ................. 494
    Size breakdown of the updates ([size]: number of this size):
        updowns [  1]: 76
        updowns [  2]: 27
        updowns [  3]: 19
        updowns [  4]: 7
        updowns [  5]: 8
        updowns [  6]: 8
        updowns [  7]: 1
        updowns [  8]: 1
        updowns [  9]: 6
        updowns [ 10]: 6
        updowns [ 11]: 2
        updowns [ 12]: 1
        updowns [ 13]: 1
        updowns [ 14]: 1
        updowns [ 15]: 1
        updowns [ 16]: 1
        updowns [ 19]: 1
        updowns [ 21]: 1
        updowns [ 22]: 1
        updowns [ 23]: 2
        updowns [ 35]: 1
        updowns [ 40]: 1
        updowns [>= 69]: 1
    No. of solves by depth in the multilevel partition tree:
        (deeper <=> further from root of tree <=> fewer flops)
        depth [ 0]: 88
        depth [ 1]: 947

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 1.220703e-04
Initialization (includes partition) ..... 3.859997e-04
Phase 1 ................................. 5.383492e-04
Coordinate ascent ....................... 1.811981e-05
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 5.006790e-06
DASA .................................... 5.590916e-03
DASA line search ........................ 1.142025e-03
Check error ............................. 6.101131e-04
Proximal update ......................... 5.590916e-04
Invert permutation ...................... 4.673004e-05
Row modifications of Cholesky factor .... 1.103878e-04
Column modifications of Cholesky factor . 5.509853e-04
Cholesky factorization .................. 3.042221e-04
Partial Cholesky factorization .......... 2.074242e-05
Back solves ............................. 7.729530e-04
Forward solves .......................... 1.666546e-04


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             :  2.742092966563303e+04
sup-norm of gradient:  7.753089635853527e-07
Number of iterations: 362       
Function evaluations: 915       
Gradient evaluations: 604       
Subspace iterations: 81        
Number of subspaces: 9         


!!  STEENBRG    540       7      17      10     362     915     604      52      10     0    7.7530896e-07    2.7420930e+04    0.021360
 Final f                         = 2.7420930e+04   
 Function value at final x       = 2.7420930e+04   
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   TFI3

 Problem name: TFI3

 Double precision version will be formed

 The objective function uses 1 nonlinear group
 
 There are 101 linear inequality constraints
 
 There are 3 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully
xx pprojparm->cholmod: 1

 Problem: TFI3 (n = 3)
walltime at start:     0.000000

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 6.900813e-12 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 6.900813254162586e-12    
Final f                               : 4.301157878304718e+00    

Iterations of gradient projection (GP): 2         
Iterations of active set GP           : 2         
Function evaluation in main code      : 1         
Function evaluations in GP            : 2         
Function evaluations in active set GP : 2         
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 2         
Gradient evaluations in active set GP : 2         


PPROJ run statistics (Version 2.0, May 1, 2018):

No. blocks in multilevel partition of A . 1
Depth of multilevel partition tree ...... 0
Phase 1 iterations ...................... 5
Coordinate ascent iterations ............ 10
    variables freed in coordinate ascent  0
    rows dropped in coordinate ascent ... 27
Gradient ascent iterations .............. 72
    variables freed in gradient ascent .. 0
    rows dropped in gradient ascent ..... 62
Preconditioned CG iterations ............ 28
    variables freed in CG ............... 0
    rows dropped in CG .................. 63
SpaRSA iterations ....................... 7
    change in column activity ........... 0
    change in row activity .............. 2
    failures of Armijo step ............. 1
Proximal updates ........................ 5
Cholesky factorizations ................. 6
    nonzeros in final factor ............ 6 99.9% sparse
    rows dropped from L ................. 139
    rows added to L ..................... 9
    rank 1 downdates to L ............... 0
    rank 1 updates to L ................. 0
    Size breakdown of the updates ([size]: number of this size):
    No. of solves:   105

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 4.196167e-05
Initialization (includes partition) ..... 9.632111e-05
Phase 1 ................................. 9.179115e-05
Coordinate ascent ....................... 1.406670e-05
SSOR0 ................................... 1.077652e-04
SSOR1 ................................... 8.392334e-05
SpaRSA .................................. 4.053116e-06
DASA .................................... 2.125025e-03
DASA line search ........................ 1.249313e-04
Check error ............................. 7.224083e-05
Proximal update ......................... 3.027916e-05
Invert permutation ...................... 9.775162e-06
Row modifications of Cholesky factor .... 9.443760e-04
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 4.029274e-04
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 1.385212e-04
Forward solves .......................... 1.287460e-05


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Number of iterations: 0         
Function evaluations: 0         
Gradient evaluations: 0         

!!      TFI3      3       2       2       2       0       0       0       7       6     0    6.9008133e-12    4.3011579e+00    0.002541
 Final f                         = 4.3011579e+00   
 Function value at final x       = 4.3011579e+00   
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   WATER

 Problem name: WATER

 Double precision version will be formed

 The objective function uses 1 linear group
 The objective function uses 8 nonlinear groups
 
 There are 10 linear equality constraints
 
 There are 31 variables bounded from below and above 
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully
xx pprojparm->cholmod: 1

 Problem: WATER (n = 31)
walltime at start:     0.000000

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 7.237944e-07 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 7.237943811244651e-07    
Final f                               : 1.054937946581441e+04    

Iterations of gradient projection (GP): 1         
Iterations of active set GP           : 7         
Function evaluation in main code      : 1         
Function evaluations in GP            : 2         
Function evaluations in active set GP : 8         
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 1         
Gradient evaluations in active set GP : 7         


PPROJ run statistics (Version 2.0, May 1, 2018):

No. blocks in multilevel partition of A . 1
Depth of multilevel partition tree ...... 0
Phase 1 iterations ...................... 5
Coordinate ascent iterations ............ 8
    variables freed in coordinate ascent  3
    rows dropped in coordinate ascent ... 0
Gradient ascent iterations .............. 0
    variables freed in gradient ascent .. 0
    rows dropped in gradient ascent ..... 0
Preconditioned CG iterations ............ 0
    variables freed in CG ............... 0
    rows dropped in CG .................. 0
SpaRSA iterations ....................... 6
    change in column activity ........... 4
    change in row activity .............. 0
    failures of Armijo step ............. 2
Proximal updates ........................ 6
Cholesky factorizations ................. 3
    nonzeros in final factor ............ 34 38.2% sparse
    rows dropped from L ................. 0
    rows added to L ..................... 0
    rank 1 downdates to L ............... 10
    rank 1 updates to L ................. 2
    Size breakdown of the updates ([size]: number of this size):
        updowns [  1]: 5
        updowns [  2]: 2
        updowns [  3]: 1
    No. of solves:   8

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 4.816055e-05
Initialization (includes partition) ..... 8.988380e-05
Phase 1 ................................. 7.200241e-05
Coordinate ascent ....................... 1.382828e-05
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 1.907349e-06
DASA .................................... 1.747608e-04
DASA line search ........................ 9.059906e-06
Check error ............................. 4.792213e-05
Proximal update ......................... 2.837181e-05
Invert permutation ...................... 5.722046e-06
Row modifications of Cholesky factor .... 0.000000e+00
Column modifications of Cholesky factor . 3.695488e-05
Cholesky factorization .................. 2.694130e-05
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 7.629395e-06
Forward solves .......................... 7.867813e-06


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             :  1.054937946582709e+04
sup-norm of gradient:  7.237943811244651e-07
Number of iterations: 11        
Function evaluations: 21        
Gradient evaluations: 11        
Subspace iterations: 4         
Number of subspaces: 1         


!!     WATER     31       1       2       1      11      21      11      10       3     0    7.2379438e-07    1.0549379e+04    0.000729
 Final f                         = 1.0549379e+04   
 Function value at final x       = 1.0549379e+04   
 ====================================================

