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 7.049565e-07 satisfies error tolerance 1.000000e-06.


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

Iterations of gradient projection (GP): 73        
Iterations of active set GP           : 1691      
Function evaluation in main code      : 1         
Function evaluations in GP            : 211       
Function evaluations in active set GP : 2949      
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 161       
Gradient evaluations in active set GP : 2554      


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 ....................... 1332
    change in column activity ........... 32581
    change in row activity .............. 0
    failures of Armijo step ............. 261
Proximal updates ........................ 1339
Cholesky factorizations ................. 904
    nonzeros in final factor ............ 6170 99.0% sparse
    rows dropped from L ................. 0
    rows added to L ..................... 0
    rank 1 downdates to L ............... 10594
    rank 1 updates to L ................. 98407
    Size breakdown of the updates ([size]: number of this size):
        updowns [  1]: 3375
        updowns [  2]: 1176
        updowns [  3]: 829
        updowns [  4]: 646
        updowns [  5]: 476
        updowns [  6]: 364
        updowns [  7]: 264
        updowns [  8]: 207
        updowns [  9]: 178
        updowns [ 10]: 142
        updowns [ 11]: 109
        updowns [ 12]: 103
        updowns [ 13]: 97
        updowns [ 14]: 98
        updowns [ 15]: 76
        updowns [ 16]: 75
        updowns [ 17]: 62
        updowns [ 18]: 72
        updowns [ 19]: 59
        updowns [ 20]: 48
        updowns [ 21]: 46
        updowns [ 22]: 42
        updowns [ 23]: 32
        updowns [ 24]: 21
        updowns [ 25]: 29
        updowns [ 26]: 33
        updowns [ 27]: 20
        updowns [ 28]: 13
        updowns [ 29]: 19
        updowns [ 30]: 18
        updowns [ 31]: 17
        updowns [ 32]: 23
        updowns [ 33]: 21
        updowns [ 34]: 16
        updowns [ 35]: 11
        updowns [ 36]: 15
        updowns [ 37]: 15
        updowns [ 38]: 13
        updowns [ 39]: 12
        updowns [ 40]: 18
        updowns [ 41]: 16
        updowns [ 42]: 10
        updowns [ 43]: 10
        updowns [ 44]: 6
        updowns [ 45]: 4
        updowns [ 46]: 6
        updowns [ 47]: 6
        updowns [ 48]: 10
        updowns [ 49]: 10
        updowns [ 50]: 13
        updowns [ 51]: 2
        updowns [ 52]: 2
        updowns [ 53]: 13
        updowns [ 54]: 5
        updowns [ 55]: 3
        updowns [ 56]: 6
        updowns [ 57]: 8
        updowns [ 58]: 9
        updowns [ 59]: 6
        updowns [ 60]: 7
        updowns [ 61]: 5
        updowns [ 62]: 12
        updowns [ 63]: 4
        updowns [ 64]: 4
        updowns [ 65]: 5
        updowns [ 66]: 4
        updowns [ 67]: 6
        updowns [ 68]: 5
        updowns [ 69]: 3
        updowns [ 70]: 8
        updowns [ 71]: 1
        updowns [ 72]: 4
        updowns [ 73]: 7
        updowns [ 74]: 3
        updowns [ 75]: 6
        updowns [ 76]: 4
        updowns [ 77]: 3
        updowns [ 78]: 2
        updowns [ 79]: 8
        updowns [ 80]: 4
        updowns [ 81]: 1
        updowns [ 82]: 6
        updowns [ 83]: 5
        updowns [ 84]: 2
        updowns [ 85]: 3
        updowns [ 86]: 3
        updowns [ 87]: 4
        updowns [ 88]: 3
        updowns [ 89]: 1
        updowns [ 90]: 2
        updowns [ 91]: 1
        updowns [ 92]: 3
        updowns [ 93]: 3
        updowns [ 94]: 3
        updowns [ 95]: 4
        updowns [ 97]: 2
        updowns [ 98]: 5
        updowns [ 99]: 4
        updowns [100]: 2
        updowns [101]: 1
        updowns [102]: 2
        updowns [103]: 1
        updowns [104]: 1
        updowns [105]: 1
        updowns [106]: 2
        updowns [107]: 2
        updowns [108]: 3
        updowns [109]: 2
        updowns [110]: 4
        updowns [111]: 3
        updowns [112]: 1
        updowns [114]: 2
        updowns [115]: 1
        updowns [116]: 3
        updowns [117]: 3
        updowns [118]: 2
        updowns [120]: 2
        updowns [121]: 3
        updowns [122]: 4
        updowns [123]: 1
        updowns [125]: 2
        updowns [126]: 4
        updowns [127]: 3
        updowns [128]: 3
        updowns [129]: 1
        updowns [130]: 3
        updowns [>=131]: 113
    No. of solves by depth in the multilevel partition tree:
        (deeper <=> further from root of tree <=> fewer flops)
        depth [ 0]: 3609
        depth [ 1]: 424335

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 2.321959e-03
Initialization (includes partition) ..... 6.774044e-02
Phase 1 ................................. 8.958101e-02
Coordinate ascent ....................... 4.386902e-05
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 6.890297e-05
DASA .................................... 2.036397e+00
DASA line search ........................ 4.155235e-01
Check error ............................. 1.611083e-01
Proximal update ......................... 1.089828e-01
Invert permutation ...................... 6.155968e-03
Row modifications of Cholesky factor .... 6.896496e-03
Column modifications of Cholesky factor . 2.407341e-01
Cholesky factorization .................. 2.033868e-01
Partial Cholesky factorization .......... 1.180429e-01
Back solves ............................. 3.458371e-01
Forward solves .......................... 6.707573e-02


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

Final f             : -4.205693299537716e+06
sup-norm of gradient:  8.470681215189078e-07
Number of iterations: 9840      
Function evaluations: 17452     
Gradient evaluations: 12087     

!!   BIGBANK   2230      73     211     161    9840   17452   12087    1767     904     0    7.0495648e-07   -4.2056933e+06    7.077018
 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.189709e-04
Initialization (includes partition) ..... 2.641678e-04
Phase 1 ................................. 3.700256e-04
Coordinate ascent ....................... 9.059906e-06
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 6.914139e-06
DASA .................................... 1.221657e-03
DASA line search ........................ 1.950264e-04
Check error ............................. 2.529621e-04
Proximal update ......................... 1.776218e-04
Invert permutation ...................... 2.288818e-05
Row modifications of Cholesky factor .... 2.384186e-05
Column modifications of Cholesky factor . 2.541542e-04
Cholesky factorization .................. 8.392334e-05
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 1.161098e-04
Forward solves .......................... 4.911423e-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.100988
 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.000000

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 ...... 5.722046e-05
Initialization (includes partition) ..... 1.266003e-04
Phase 1 ................................. 1.204014e-04
Coordinate ascent ....................... 3.337860e-05
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 1.907349e-06
DASA .................................... 4.012585e-04
DASA line search ........................ 4.696846e-05
Check error ............................. 7.987022e-05
Proximal update ......................... 6.413460e-05
Invert permutation ...................... 1.835823e-05
Row modifications of Cholesky factor .... 1.907349e-06
Column modifications of Cholesky factor . 7.224083e-05
Cholesky factorization .................. 3.981590e-05
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 2.145767e-05
Forward solves .......................... 1.597404e-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.015376
 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.000000

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.317854e-03
Initialization (includes partition) ..... 7.019997e-03
Phase 1 ................................. 1.050639e-02
Coordinate ascent ....................... 1.230240e-04
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 2.260208e-04
DASA .................................... 2.905846e-03
DASA line search ........................ 2.524853e-04
Check error ............................. 1.790524e-04
Proximal update ......................... 2.570152e-04
Invert permutation ...................... 1.978874e-05
Row modifications of Cholesky factor .... 1.907349e-06
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 1.602173e-03
Partial Cholesky factorization .......... 1.025200e-04
Back solves ............................. 1.850128e-04
Forward solves .......................... 9.894371e-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.033880
 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.029968e-04
Phase 1 ................................. 1.533031e-04
Coordinate ascent ....................... 5.960464e-06
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 2.861023e-06
DASA .................................... 4.036427e-04
DASA line search ........................ 3.218651e-05
Check error ............................. 1.237392e-04
Proximal update ......................... 1.349449e-04
Invert permutation ...................... 4.100800e-05
Row modifications of Cholesky factor .... 0.000000e+00
Column modifications of Cholesky factor . 6.604195e-05
Cholesky factorization .................. 1.013279e-04
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 1.573563e-05
Forward solves .......................... 2.145767e-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.003595
 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.000000

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.503395e-05
Initialization (includes partition) ..... 5.555153e-05
Phase 1 ................................. 6.151199e-05
Coordinate ascent ....................... 6.198883e-06
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 2.002716e-05
DASA .................................... 7.605553e-05
DASA line search ........................ 3.099442e-06
Check error ............................. 1.525879e-05
Proximal update ......................... 1.144409e-05
Invert permutation ...................... 8.344650e-06
Row modifications of Cholesky factor .... 0.000000e+00
Column modifications of Cholesky factor . 1.215935e-05
Cholesky factorization .................. 1.621246e-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             :  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.001421
 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.598763e-05
Initialization (includes partition) ..... 7.867813e-05
Phase 1 ................................. 1.027584e-04
Coordinate ascent ....................... 0.000000e+00
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 4.053116e-06
DASA .................................... 1.475811e-04
DASA line search ........................ 8.821487e-06
Check error ............................. 4.816055e-05
Proximal update ......................... 4.887581e-05
Invert permutation ...................... 2.264977e-05
Row modifications of Cholesky factor .... 0.000000e+00
Column modifications of Cholesky factor . 4.816055e-05
Cholesky factorization .................. 4.291534e-05
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 4.053116e-06
Forward solves .......................... 5.960464e-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.002287
 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.000001

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.503395e-05
Initialization (includes partition) ..... 5.912781e-05
Phase 1 ................................. 6.747246e-05
Coordinate ascent ....................... 3.814697e-06
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 3.099442e-06
DASA .................................... 1.289845e-04
DASA line search ........................ 9.298325e-06
Check error ............................. 3.433228e-05
Proximal update ......................... 3.576279e-05
Invert permutation ...................... 1.192093e-05
Row modifications of Cholesky factor .... 0.000000e+00
Column modifications of Cholesky factor . 1.096725e-05
Cholesky factorization .................. 3.218651e-05
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 2.861023e-06
Forward solves .......................... 5.006790e-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.000865
 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 ...... 6.198883e-05
Initialization (includes partition) ..... 1.447201e-04
Phase 1 ................................. 1.578331e-04
Coordinate ascent ....................... 3.814697e-06
SSOR0 ................................... 4.053116e-06
SSOR1 ................................... 1.525879e-05
SpaRSA .................................. 6.914139e-06
DASA .................................... 3.151894e-04
DASA line search ........................ 8.821487e-06
Check error ............................. 7.390976e-05
Proximal update ......................... 8.034706e-05
Invert permutation ...................... 5.960464e-06
Row modifications of Cholesky factor .... 0.000000e+00
Column modifications of Cholesky factor . 8.821487e-06
Cholesky factorization .................. 1.089573e-04
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 4.768372e-06
Forward solves .......................... 7.629395e-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.001068
 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.318092e-05
Initialization (includes partition) ..... 1.473427e-04
Phase 1 ................................. 1.590252e-04
Coordinate ascent ....................... 5.960464e-06
SSOR0 ................................... 2.861023e-06
SSOR1 ................................... 1.788139e-05
SpaRSA .................................. 8.106232e-06
DASA .................................... 2.968311e-04
DASA line search ........................ 1.001358e-05
Check error ............................. 6.556511e-05
Proximal update ......................... 7.390976e-05
Invert permutation ...................... 8.344650e-06
Row modifications of Cholesky factor .... 1.287460e-05
Column modifications of Cholesky factor . 4.053116e-06
Cholesky factorization .................. 8.988380e-05
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 5.006790e-06
Forward solves .......................... 7.152557e-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.001004
 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.000001

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 ...... 7.605553e-05
Initialization (includes partition) ..... 1.678467e-04
Phase 1 ................................. 1.411438e-04
Coordinate ascent ....................... 3.099442e-06
SSOR0 ................................... 1.907349e-06
SSOR1 ................................... 4.053116e-06
SpaRSA .................................. 1.311302e-05
DASA .................................... 1.323223e-04
DASA line search ........................ 4.053116e-06
Check error ............................. 3.290176e-05
Proximal update ......................... 4.434586e-05
Invert permutation ...................... 5.960464e-06
Row modifications of Cholesky factor .... 0.000000e+00
Column modifications of Cholesky factor . 6.914139e-06
Cholesky factorization .................. 5.197525e-05
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 1.907349e-06
Forward solves .......................... 4.053116e-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.000763
 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.000001

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.149178e-04
Initialization (includes partition) ..... 2.787113e-04
Phase 1 ................................. 3.454685e-04
Coordinate ascent ....................... 4.053116e-06
SSOR0 ................................... 3.099442e-06
SSOR1 ................................... 2.288818e-05
SpaRSA .................................. 1.502037e-05
DASA .................................... 4.508495e-04
DASA line search ........................ 9.059906e-06
Check error ............................. 1.015663e-04
Proximal update ......................... 1.254082e-04
Invert permutation ...................... 1.025200e-05
Row modifications of Cholesky factor .... 1.692772e-05
Column modifications of Cholesky factor . 4.053116e-06
Cholesky factorization .................. 1.590252e-04
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 3.099442e-06
Forward solves .......................... 1.215935e-05


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.001745
 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.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                               : -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.600121e-05
Initialization (includes partition) ..... 6.103516e-05
Phase 1 ................................. 2.813339e-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 ...................... 4.053116e-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.000177
 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.000000

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 ...... 3.290176e-05
Initialization (includes partition) ..... 7.510185e-05
Phase 1 ................................. 5.197525e-05
Coordinate ascent ....................... 9.298325e-06
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 3.099442e-06
DASA .................................... 3.948212e-04
DASA line search ........................ 3.790855e-05
Check error ............................. 5.173683e-05
Proximal update ......................... 1.978874e-05
Invert permutation ...................... 1.406670e-05
Row modifications of Cholesky factor .... 1.487732e-04
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 3.266335e-05
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 2.694130e-05
Forward solves .......................... 1.025200e-05


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.000845
 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.600121e-05
Initialization (includes partition) ..... 1.063347e-04
Phase 1 ................................. 1.404285e-04
Coordinate ascent ....................... 7.033348e-05
SSOR0 ................................... 1.008511e-04
SSOR1 ................................... 1.232624e-04
SpaRSA .................................. 4.053116e-06
DASA .................................... 5.834818e-03
DASA line search ........................ 6.492138e-04
Check error ............................. 2.923012e-04
Proximal update ......................... 1.208782e-04
Invert permutation ...................... 1.835823e-05
Row modifications of Cholesky factor .... 2.077341e-03
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 7.128716e-04
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 5.149841e-04
Forward solves .......................... 3.910065e-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.006936
 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.000000

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.583069e-05
Initialization (includes partition) ..... 2.274513e-04
Phase 1 ................................. 5.376339e-04
Coordinate ascent ....................... 2.250671e-04
SSOR0 ................................... 4.343271e-03
SSOR1 ................................... 6.184578e-04
SpaRSA .................................. 1.382828e-05
DASA .................................... 8.919644e-02
DASA line search ........................ 3.056765e-03
Check error ............................. 1.251936e-03
Proximal update ......................... 3.006458e-04
Invert permutation ...................... 2.598763e-05
Row modifications of Cholesky factor .... 6.398249e-02
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 5.262136e-03
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 6.657839e-03
Forward solves .......................... 1.611710e-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.092530
 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.286793e-02
Initialization (includes partition) ..... 1.347804e-02
Phase 1 ................................. 2.531052e-03
Coordinate ascent ....................... 7.915497e-05
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 1.409054e-04
DASA .................................... 6.610870e-03
DASA line search ........................ 5.006790e-05
Check error ............................. 5.545616e-04
Proximal update ......................... 7.665157e-04
Invert permutation ...................... 1.192093e-05
Row modifications of Cholesky factor .... 4.765987e-04
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 4.997015e-03
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 2.169609e-05
Forward solves .......................... 2.312660e-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.028679
 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.000001

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.293993e-02
Initialization (includes partition) ..... 1.357794e-02
Phase 1 ................................. 2.708673e-03
Coordinate ascent ....................... 5.626678e-05
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 1.420975e-04
DASA .................................... 6.115913e-03
DASA line search ........................ 3.290176e-05
Check error ............................. 3.972054e-04
Proximal update ......................... 6.210804e-04
Invert permutation ...................... 9.059906e-06
Row modifications of Cholesky factor .... 3.726482e-04
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 4.919052e-03
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 1.382828e-05
Forward solves .......................... 1.597404e-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.028394
 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.240440e-04
Initialization (includes partition) ..... 1.024961e-03
Phase 1 ................................. 3.346920e-03
Coordinate ascent ....................... 1.549721e-04
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 9.512901e-05
DASA .................................... 5.719304e-02
DASA line search ........................ 1.906872e-03
Check error ............................. 1.463890e-04
Proximal update ......................... 3.271103e-04
Invert permutation ...................... 1.301765e-04
Row modifications of Cholesky factor .... 2.439666e-02
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 2.854323e-02
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 1.557589e-03
Forward solves .......................... 5.793571e-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.062649
 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.921125e-03
Initialization (includes partition) ..... 7.744551e-03
Phase 1 ................................. 9.497881e-03
Coordinate ascent ....................... 8.392334e-05
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 1.871586e-04
DASA .................................... 8.559227e-03
DASA line search ........................ 1.923800e-03
Check error ............................. 1.246214e-03
Proximal update ......................... 1.324654e-03
Invert permutation ...................... 1.099110e-04
Row modifications of Cholesky factor .... 2.694130e-05
Column modifications of Cholesky factor . 5.283356e-04
Cholesky factorization .................. 1.415014e-03
Partial Cholesky factorization .......... 1.316071e-04
Back solves ............................. 1.206398e-03
Forward solves .......................... 6.721020e-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.086122
 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.095796e-02
Initialization (includes partition) ..... 1.156831e-02
Phase 1 ................................. 1.031113e-02
Coordinate ascent ....................... 1.962185e-04
SSOR0 ................................... 3.600121e-04
SSOR1 ................................... 1.240969e-03
SpaRSA .................................. 1.499653e-04
DASA .................................... 1.403594e-02
DASA line search ........................ 4.949570e-04
Check error ............................. 3.461838e-04
Proximal update ......................... 4.947186e-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.401995e-03
Partial Cholesky factorization .......... 6.567240e-03
Back solves ............................. 5.023479e-04
Forward solves .......................... 3.261566e-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.100680
 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.094604e-02
Initialization (includes partition) ..... 1.671195e-02
Phase 1 ................................. 1.612163e-02
Coordinate ascent ....................... 1.308918e-04
SSOR0 ................................... 9.097099e-03
SSOR1 ................................... 7.591248e-04
SpaRSA .................................. 2.670288e-04
DASA .................................... 1.029692e-01
DASA line search ........................ 1.163864e-02
Check error ............................. 6.505489e-03
Proximal update ......................... 5.685091e-03
Invert permutation ...................... 2.353191e-04
Row modifications of Cholesky factor .... 1.146793e-04
Column modifications of Cholesky factor . 1.919985e-02
Cholesky factorization .................. 7.756948e-03
Partial Cholesky factorization .......... 1.499295e-02
Back solves ............................. 1.215792e-02
Forward solves .......................... 1.066852e-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.220409
 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.944014e-03
Initialization (includes partition) ..... 7.767916e-03
Phase 1 ................................. 9.651184e-03
Coordinate ascent ....................... 8.320808e-05
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 1.869202e-04
DASA .................................... 1.184559e-02
DASA line search ........................ 2.794743e-03
Check error ............................. 2.056122e-03
Proximal update ......................... 1.775265e-03
Invert permutation ...................... 1.192093e-04
Row modifications of Cholesky factor .... 4.816055e-05
Column modifications of Cholesky factor . 6.167889e-04
Cholesky factorization .................. 1.411915e-03
Partial Cholesky factorization .......... 1.320839e-04
Back solves ............................. 1.750469e-03
Forward solves .......................... 1.092911e-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.101829
 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.000001

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.095700e-02
Initialization (includes partition) ..... 1.157236e-02
Phase 1 ................................. 1.032782e-02
Coordinate ascent ....................... 2.048016e-04
SSOR0 ................................... 3.592968e-04
SSOR1 ................................... 1.245022e-03
SpaRSA .................................. 1.900196e-04
DASA .................................... 1.409316e-02
DASA line search ........................ 4.897118e-04
Check error ............................. 3.333092e-04
Proximal update ......................... 5.049706e-04
Invert permutation ...................... 2.026558e-05
Row modifications of Cholesky factor .... 2.861023e-06
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 3.403187e-03
Partial Cholesky factorization .......... 6.592035e-03
Back solves ............................. 4.940033e-04
Forward solves .......................... 3.199577e-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.101316
 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.000001

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.093006e-02
Initialization (includes partition) ..... 1.670122e-02
Phase 1 ................................. 1.606488e-02
Coordinate ascent ....................... 1.311302e-04
SSOR0 ................................... 9.094954e-03
SSOR1 ................................... 7.870197e-04
SpaRSA .................................. 1.909733e-04
DASA .................................... 1.035295e-01
DASA line search ........................ 1.176476e-02
Check error ............................. 6.462097e-03
Proximal update ......................... 5.689859e-03
Invert permutation ...................... 2.353191e-04
Row modifications of Cholesky factor .... 1.113415e-04
Column modifications of Cholesky factor . 1.921344e-02
Cholesky factorization .................. 7.761955e-03
Partial Cholesky factorization .......... 1.508713e-02
Back solves ............................. 1.220632e-02
Forward solves .......................... 1.063371e-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.221782
 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.000001

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.466202e-03
Initialization (includes partition) ..... 2.847195e-03
Phase 1 ................................. 1.013517e-02
Coordinate ascent ....................... 2.200603e-04
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 9.298325e-05
DASA .................................... 3.005028e-03
DASA line search ........................ 4.138947e-04
Check error ............................. 3.440380e-04
Proximal update ......................... 2.789497e-04
Invert permutation ...................... 1.668930e-05
Row modifications of Cholesky factor .... 3.814697e-06
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 8.568764e-04
Partial Cholesky factorization .......... 4.458427e-05
Back solves ............................. 4.005432e-04
Forward solves .......................... 1.931190e-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.018934
 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.470970e-03
Initialization (includes partition) ..... 2.848864e-03
Phase 1 ................................. 1.021385e-02
Coordinate ascent ....................... 2.601147e-04
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 8.893013e-05
DASA .................................... 2.970934e-03
DASA line search ........................ 4.439354e-04
Check error ............................. 3.554821e-04
Proximal update ......................... 2.779961e-04
Invert permutation ...................... 1.192093e-05
Row modifications of Cholesky factor .... 2.861023e-06
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 8.549690e-04
Partial Cholesky factorization .......... 4.410744e-05
Back solves ............................. 3.955364e-04
Forward solves .......................... 1.842976e-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.019706
 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.427101e-03
Initialization (includes partition) ..... 2.810240e-03
Phase 1 ................................. 1.020789e-02
Coordinate ascent ....................... 2.567768e-04
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 9.012222e-05
DASA .................................... 2.974987e-03
DASA line search ........................ 4.451275e-04
Check error ............................. 3.411770e-04
Proximal update ......................... 2.799034e-04
Invert permutation ...................... 1.215935e-05
Row modifications of Cholesky factor .... 6.198883e-06
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 8.540154e-04
Partial Cholesky factorization .......... 4.482269e-05
Back solves ............................. 3.914833e-04
Forward solves .......................... 1.842976e-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.020046
 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.485991e-03
Initialization (includes partition) ..... 3.095865e-03
Phase 1 ................................. 5.994797e-03
Coordinate ascent ....................... 2.949238e-04
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 1.380444e-04
DASA .................................... 7.385254e-03
DASA line search ........................ 1.349449e-03
Check error ............................. 1.297235e-03
Proximal update ......................... 4.334450e-04
Invert permutation ...................... 3.504753e-05
Row modifications of Cholesky factor .... 2.002716e-05
Column modifications of Cholesky factor . 1.130104e-04
Cholesky factorization .................. 2.949953e-03
Partial Cholesky factorization .......... 2.045631e-04
Back solves ............................. 5.750656e-04
Forward solves .......................... 4.074574e-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.020444
 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 ...... 4.601479e-05
Initialization (includes partition) ..... 1.254082e-04
Phase 1 ................................. 1.244545e-04
Coordinate ascent ....................... 1.239777e-05
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 4.053116e-06
DASA .................................... 3.626347e-04
DASA line search ........................ 2.193451e-05
Check error ............................. 9.036064e-05
Proximal update ......................... 9.751320e-05
Invert permutation ...................... 2.861023e-05
Row modifications of Cholesky factor .... 2.336502e-05
Column modifications of Cholesky factor . 9.751320e-05
Cholesky factorization .................. 4.005432e-05
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 1.263618e-05
Forward solves .......................... 1.287460e-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.004111
 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.000001

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 ...... 3.290176e-05
Initialization (includes partition) ..... 5.984306e-05
Phase 1 ................................. 3.314018e-05
Coordinate ascent ....................... 1.907349e-06
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 9.536743e-07
DASA .................................... 5.698204e-05
DASA line search ........................ 2.145767e-06
Check error ............................. 1.597404e-05
Proximal update ......................... 8.106232e-06
Invert permutation ...................... 8.106232e-06
Row modifications of Cholesky factor .... 0.000000e+00
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 1.931190e-05
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 1.907349e-06
Forward solves .......................... 2.861023e-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.000325
 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.000000

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

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


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

Iterations of gradient projection (GP): 2         
Iterations of active set GP           : 8         
Function evaluation in main code      : 1         
Function evaluations in GP            : 6         
Function evaluations in active set GP : 9         
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 ............ 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 ............ 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 ............. 0
Proximal updates ........................ 2
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.717972e-05
Initialization (includes partition) ..... 5.984306e-05
Phase 1 ................................. 4.124641e-05
Coordinate ascent ....................... 1.907349e-06
SSOR0 ................................... 1.907349e-06
SSOR1 ................................... 4.053116e-06
SpaRSA .................................. 1.192093e-06
DASA .................................... 2.598763e-05
DASA line search ........................ 0.000000e+00
Check error ............................. 1.478195e-05
Proximal update ......................... 1.335144e-05
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             :  1.044725129680993e+03
sup-norm of gradient:  4.148044114463488e-07
Number of iterations: 50        
Function evaluations: 109       
Gradient evaluations: 65        

!!     HS105      8       2       6       2      50     109      65      12       0     0    4.1480441e-07    1.0447251e+03    0.013468
 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 ...... 3.194809e-05
Initialization (includes partition) ..... 6.651878e-05
Phase 1 ................................. 4.839897e-05
Coordinate ascent ....................... 1.096725e-05
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 9.536743e-07
DASA .................................... 1.497269e-04
DASA line search ........................ 9.298325e-06
Check error ............................. 4.386902e-05
Proximal update ......................... 2.264977e-05
Invert permutation ...................... 1.096725e-05
Row modifications of Cholesky factor .... 0.000000e+00
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 3.671646e-05
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 8.821487e-06
Forward solves .......................... 1.025200e-05


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.000675
 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.000000

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 ...... 3.600121e-05
Initialization (includes partition) ..... 7.176399e-05
Phase 1 ................................. 6.866455e-05
Coordinate ascent ....................... 7.867813e-06
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 1.907349e-06
DASA .................................... 2.062321e-04
DASA line search ........................ 1.621246e-05
Check error ............................. 3.981590e-05
Proximal update ......................... 2.217293e-05
Invert permutation ...................... 5.722046e-06
Row modifications of Cholesky factor .... 3.099442e-06
Column modifications of Cholesky factor . 5.102158e-05
Cholesky factorization .................. 2.408028e-05
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 7.629395e-06
Forward solves .......................... 7.390976e-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.000638
 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 ...... 3.314018e-05
Initialization (includes partition) ..... 5.698204e-05
Phase 1 ................................. 3.790855e-05
Coordinate ascent ....................... 0.000000e+00
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 7.867813e-06
DASA .................................... 4.482269e-05
DASA line search ........................ 1.907349e-06
Check error ............................. 1.311302e-05
Proximal update ......................... 5.006790e-06
Invert permutation ...................... 4.291534e-06
Row modifications of Cholesky factor .... 6.914139e-06
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 1.692772e-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.000278
 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 ...... 3.790855e-05
Initialization (includes partition) ..... 6.437302e-05
Phase 1 ................................. 3.719330e-05
Coordinate ascent ....................... 2.861023e-06
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 1.907349e-06
DASA .................................... 7.009506e-05
DASA line search ........................ 4.053116e-06
Check error ............................. 1.978874e-05
Proximal update ......................... 1.072884e-05
Invert permutation ...................... 5.960464e-06
Row modifications of Cholesky factor .... 0.000000e+00
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 2.098083e-05
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 9.536743e-07
Forward solves .......................... 4.053116e-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.000304
 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 ...... 3.099442e-05
Initialization (includes partition) ..... 5.984306e-05
Phase 1 ................................. 3.790855e-05
Coordinate ascent ....................... 1.907349e-06
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 2.145767e-06
DASA .................................... 5.888939e-05
DASA line search ........................ 2.861023e-06
Check error ............................. 1.621246e-05
Proximal update ......................... 9.059906e-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.788139e-05
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 1.192093e-06
Forward solves .......................... 2.861023e-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.000315
 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 ...... 3.099442e-05
Initialization (includes partition) ..... 5.912781e-05
Phase 1 ................................. 3.814697e-05
Coordinate ascent ....................... 0.000000e+00
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 7.867813e-06
DASA .................................... 4.506111e-05
DASA line search ........................ 2.861023e-06
Check error ............................. 1.382828e-05
Proximal update ......................... 5.245209e-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.597404e-05
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 9.536743e-07
Forward solves .......................... 2.145767e-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.000285
 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.000000

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 ...... 3.099442e-05
Initialization (includes partition) ..... 5.888939e-05
Phase 1 ................................. 3.623962e-05
Coordinate ascent ....................... 0.000000e+00
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 6.914139e-06
DASA .................................... 4.291534e-05
DASA line search ........................ 1.907349e-06
Check error ............................. 9.059906e-06
Proximal update ......................... 4.768372e-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.621246e-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             :  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.000294
 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.000001

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.598763e-05
Initialization (includes partition) ..... 5.102158e-05
Phase 1 ................................. 3.290176e-05
Coordinate ascent ....................... 1.907349e-06
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 5.006790e-06
DASA .................................... 4.506111e-05
DASA line search ........................ 1.907349e-06
Check error ............................. 1.406670e-05
Proximal update ......................... 3.814697e-06
Invert permutation ...................... 4.768372e-06
Row modifications of Cholesky factor .... 0.000000e+00
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 1.311302e-05
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 1.192093e-06
Forward solves .......................... 9.536743e-07


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.000259
 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.000001

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

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


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 2.090467955330505e-07    
Final f                               : -8.674088253776232e-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.908707e-05
Initialization (includes partition) ..... 5.984306e-05
Phase 1 ................................. 3.170967e-05
Coordinate ascent ....................... 4.291534e-06
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 9.536743e-07
DASA .................................... 6.675720e-05
DASA line search ........................ 5.006790e-06
Check error ............................. 1.597404e-05
Proximal update ......................... 1.192093e-05
Invert permutation ...................... 5.722046e-06
Row modifications of Cholesky factor .... 0.000000e+00
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 1.978874e-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             : -8.674088199111353e-01
sup-norm of gradient:  2.090467955330505e-07
Number of iterations: 11        
Function evaluations: 29        
Gradient evaluations: 19        

!!      HS54      6       0       0       0      11      29      19       4       3     0    2.0904680e-07   -8.6740883e-01    0.000354
 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 ...... 4.196167e-05
Initialization (includes partition) ..... 6.008148e-05
Phase 1 ................................. 3.099442e-05
Coordinate ascent ....................... 3.099442e-06
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 1.907349e-06
DASA .................................... 5.388260e-05
DASA line search ........................ 4.053116e-06
Check error ............................. 1.478195e-05
Proximal update ......................... 9.536743e-06
Invert permutation ...................... 1.907349e-06
Row modifications of Cholesky factor .... 0.000000e+00
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 1.811981e-05
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 9.536743e-07
Forward solves .......................... 3.099442e-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.000228
 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.000000

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.908707e-05
Initialization (includes partition) ..... 5.602837e-05
Phase 1 ................................. 3.194809e-05
Coordinate ascent ....................... 3.099442e-06
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 9.536743e-07
DASA .................................... 7.128716e-05
DASA line search ........................ 3.099442e-06
Check error ............................. 1.668930e-05
Proximal update ......................... 1.215935e-05
Invert permutation ...................... 5.960464e-06
Row modifications of Cholesky factor .... 0.000000e+00
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 2.217293e-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             : -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.000353
 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.000001

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.598763e-05
Initialization (includes partition) ..... 5.555153e-05
Phase 1 ................................. 4.673004e-05
Coordinate ascent ....................... 4.053116e-06
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 2.145767e-06
DASA .................................... 8.392334e-05
DASA line search ........................ 5.245209e-06
Check error ............................. 1.597404e-05
Proximal update ......................... 1.430511e-05
Invert permutation ...................... 5.960464e-06
Row modifications of Cholesky factor .... 1.382828e-05
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 2.670288e-05
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 1.907349e-06
Forward solves .......................... 4.291534e-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.000384
 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 ...... 2.908707e-05
Initialization (includes partition) ..... 5.292892e-05
Phase 1 ................................. 2.598763e-05
Coordinate ascent ....................... 0.000000e+00
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 5.960464e-06
DASA .................................... 3.480911e-05
DASA line search ........................ 1.907349e-06
Check error ............................. 9.059906e-06
Proximal update ......................... 3.814697e-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.192093e-05
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 9.536743e-07
Forward solves .......................... 9.536743e-07


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.000231
 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.000000

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.312660e-05
Initialization (includes partition) ..... 4.506111e-05
Phase 1 ................................. 3.170967e-05
Coordinate ascent ....................... 0.000000e+00
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 5.006790e-06
DASA .................................... 3.504753e-05
DASA line search ........................ 2.861023e-06
Check error ............................. 2.336502e-05
Proximal update ......................... 3.814697e-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.215935e-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             :  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.000238
 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.890629e-04
Initialization (includes partition) ..... 1.116991e-03
Phase 1 ................................. 4.086494e-04
Coordinate ascent ....................... 1.597404e-05
SSOR0 ................................... 1.597404e-05
SSOR1 ................................... 2.260208e-04
SpaRSA .................................. 3.099442e-05
DASA .................................... 1.602340e-02
DASA line search ........................ 4.190683e-03
Check error ............................. 4.573107e-03
Proximal update ......................... 1.873970e-04
Invert permutation ...................... 2.050400e-05
Row modifications of Cholesky factor .... 1.028538e-03
Column modifications of Cholesky factor . 9.925365e-04
Cholesky factorization .................. 1.823902e-03
Partial Cholesky factorization .......... 1.215935e-05
Back solves ............................. 1.525879e-03
Forward solves .......................... 7.300377e-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.020915
 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.000000

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.241467e-04
Initialization (includes partition) ..... 5.643368e-04
Phase 1 ................................. 1.966953e-04
Coordinate ascent ....................... 9.775162e-06
SSOR0 ................................... 1.311302e-05
SSOR1 ................................... 1.459122e-04
SpaRSA .................................. 2.479553e-05
DASA .................................... 4.151821e-03
DASA line search ........................ 8.733273e-04
Check error ............................. 1.304150e-03
Proximal update ......................... 1.335144e-04
Invert permutation ...................... 1.263618e-05
Row modifications of Cholesky factor .... 4.529953e-04
Column modifications of Cholesky factor . 3.788471e-04
Cholesky factorization .................. 2.534389e-04
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 3.569126e-04
Forward solves .......................... 1.497269e-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.006166
 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.797646e-05
Initialization (includes partition) ..... 1.523495e-04
Phase 1 ................................. 9.083748e-05
Coordinate ascent ....................... 9.059906e-06
SSOR0 ................................... 7.152557e-06
SSOR1 ................................... 1.721382e-04
SpaRSA .................................. 1.001358e-05
DASA .................................... 1.241922e-03
DASA line search ........................ 1.571178e-04
Check error ............................. 2.861023e-04
Proximal update ......................... 9.250641e-05
Invert permutation ...................... 9.298325e-06
Row modifications of Cholesky factor .... 1.173019e-04
Column modifications of Cholesky factor . 8.869171e-05
Cholesky factorization .................. 1.149178e-04
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 6.842613e-05
Forward solves .......................... 3.409386e-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.001958
 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 ...... 3.814697e-05
Initialization (includes partition) ..... 6.699562e-05
Phase 1 ................................. 3.814697e-05
Coordinate ascent ....................... 1.907349e-06
SSOR0 ................................... 4.291534e-06
SSOR1 ................................... 7.152557e-06
SpaRSA .................................. 4.053116e-06
DASA .................................... 8.511543e-05
DASA line search ........................ 5.960464e-06
Check error ............................. 1.287460e-05
Proximal update ......................... 1.120567e-05
Invert permutation ...................... 8.106232e-06
Row modifications of Cholesky factor .... 2.145767e-06
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 1.716614e-05
Partial Cholesky factorization .......... 9.536743e-07
Back solves ............................. 3.099442e-06
Forward solves .......................... 4.768372e-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.000339
 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 ...... 4.816055e-05
Initialization (includes partition) ..... 9.441376e-05
Phase 1 ................................. 7.152557e-05
Coordinate ascent ....................... 1.764297e-05
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 2.145767e-06
DASA .................................... 2.632141e-04
DASA line search ........................ 1.931190e-05
Check error ............................. 1.018047e-04
Proximal update ......................... 4.720688e-05
Invert permutation ...................... 1.072884e-05
Row modifications of Cholesky factor .... 2.884865e-05
Column modifications of Cholesky factor . 2.837181e-05
Cholesky factorization .................. 3.814697e-05
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 9.059906e-06
Forward solves .......................... 1.168251e-05


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.000918
 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.000001

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.600121e-05
Initialization (includes partition) ..... 6.389618e-05
Phase 1 ................................. 3.409386e-05
Coordinate ascent ....................... 4.053116e-06
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 1.907349e-06
DASA .................................... 6.580353e-05
DASA line search ........................ 2.861023e-06
Check error ............................. 1.358986e-05
Proximal update ......................... 1.096725e-05
Invert permutation ...................... 6.675720e-06
Row modifications of Cholesky factor .... 0.000000e+00
Column modifications of Cholesky factor . 8.106232e-06
Cholesky factorization .................. 1.907349e-05
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 3.099442e-06
Forward solves .......................... 1.907349e-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.000309
 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.000001

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 ...... 4.100800e-05
Initialization (includes partition) ..... 6.699562e-05
Phase 1 ................................. 3.314018e-05
Coordinate ascent ....................... 2.861023e-06
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 1.192093e-06
DASA .................................... 8.487701e-05
DASA line search ........................ 6.198883e-06
Check error ............................. 1.502037e-05
Proximal update ......................... 6.675720e-06
Invert permutation ...................... 2.145767e-06
Row modifications of Cholesky factor .... 1.907349e-06
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 2.098083e-05
Partial Cholesky factorization .......... 1.907349e-06
Back solves ............................. 1.907349e-06
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.000366
 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 ...... 4.005432e-05
Initialization (includes partition) ..... 6.890297e-05
Phase 1 ................................. 4.482269e-05
Coordinate ascent ....................... 0.000000e+00
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 1.907349e-06
DASA .................................... 8.392334e-05
DASA line search ........................ 6.675720e-06
Check error ............................. 1.287460e-05
Proximal update ......................... 1.025200e-05
Invert permutation ...................... 5.006790e-06
Row modifications of Cholesky factor .... 1.597404e-05
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 1.883507e-05
Partial Cholesky factorization .......... 9.536743e-07
Back solves ............................. 5.245209e-06
Forward solves .......................... 2.861023e-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.000355
 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.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                               : -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.198883e-05
Phase 1 ................................. 2.908707e-05
Coordinate ascent ....................... 9.536743e-07
SSOR0 ................................... 2.145767e-06
SSOR1 ................................... 9.536743e-07
SpaRSA .................................. 2.861023e-06
DASA .................................... 1.811981e-05
DASA line search ........................ 0.000000e+00
Check error ............................. 1.096725e-05
Proximal update ......................... 5.245209e-06
Invert permutation ...................... 9.059906e-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.000321
 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.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                               : -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 ...... 4.601479e-05
Initialization (includes partition) ..... 7.700920e-05
Phase 1 ................................. 3.480911e-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 ...................... 7.152557e-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.000209
 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 9.788249e-07 satisfies error tolerance 1.000000e-06.


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

Iterations of gradient projection (GP): 19        
Iterations of active set GP           : 54        
Function evaluation in main code      : 1         
Function evaluations in GP            : 106       
Function evaluations in active set GP : 137       
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 37        
Gradient evaluations in active set GP : 82        


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 ............ 117
    variables freed in coordinate ascent  236
    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 ....................... 81
    change in column activity ........... 448
    change in row activity .............. 0
    failures of Armijo step ............. 10
Proximal updates ........................ 81
Cholesky factorizations ................. 52
    nonzeros in final factor ............ 297 85.7% sparse
    rows dropped from L ................. 0
    rows added to L ..................... 0
    rank 1 downdates to L ............... 222
    rank 1 updates to L ................. 337
    Size breakdown of the updates ([size]: number of this size):
        updowns [  1]: 107
        updowns [  2]: 32
        updowns [  3]: 22
        updowns [  4]: 15
        updowns [  5]: 14
        updowns [  6]: 4
        updowns [  7]: 5
        updowns [  8]: 3
        updowns [ 14]: 2
        updowns [ 15]: 1
        updowns [ 16]: 3
        updowns [ 18]: 1
    No. of solves:   215

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 9.393692e-05
Initialization (includes partition) ..... 4.124641e-04
Phase 1 ................................. 4.785061e-04
Coordinate ascent ....................... 4.100800e-04
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 4.053116e-06
DASA .................................... 4.479647e-03
DASA line search ........................ 4.127026e-04
Check error ............................. 9.210110e-04
Proximal update ......................... 6.272793e-04
Invert permutation ...................... 8.583069e-05
Row modifications of Cholesky factor .... 5.364418e-05
Column modifications of Cholesky factor . 7.433891e-04
Cholesky factorization .................. 9.553432e-04
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 2.360344e-04
Forward solves .......................... 1.714230e-04


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

Final f             : -7.129291999999870e+06
sup-norm of gradient:  9.788249069608845e-07
Number of iterations: 883       
Function evaluations: 1616      
Gradient evaluations: 1380      
Subspace iterations: 368       
Number of subspaces: 44        


!!    SMBANK    117      19     106      37     883    1616    1380      95      52     0    9.7882491e-07   -7.1292920e+06    0.049325
 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.484985e-05
Initialization (includes partition) ..... 1.289845e-04
Phase 1 ................................. 1.511574e-04
Coordinate ascent ....................... 1.373291e-04
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 4.053116e-06
DASA .................................... 1.736879e-03
DASA line search ........................ 1.699924e-04
Check error ............................. 4.167557e-04
Proximal update ......................... 1.735687e-04
Invert permutation ...................... 1.716614e-05
Row modifications of Cholesky factor .... 1.692772e-05
Column modifications of Cholesky factor . 1.511574e-04
Cholesky factorization .................. 4.773140e-04
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 1.010895e-04
Forward solves .......................... 8.296967e-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.002894
 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.000001

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 ...... 3.099442e-05
Initialization (includes partition) ..... 5.793571e-05
Phase 1 ................................. 4.005432e-05
Coordinate ascent ....................... 2.861023e-06
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 9.536743e-07
DASA .................................... 8.988380e-05
DASA line search ........................ 7.152557e-06
Check error ............................. 2.312660e-05
Proximal update ......................... 8.821487e-06
Invert permutation ...................... 9.536743e-07
Row modifications of Cholesky factor .... 0.000000e+00
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 2.169609e-05
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 3.814697e-06
Forward solves .......................... 5.960464e-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.000282
 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 9.791309e-07 satisfies error tolerance 1.000000e-06.


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

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


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 ....................... 32
    change in column activity ........... 195
    change in row activity .............. 0
    failures of Armijo step ............. 5
Proximal updates ........................ 33
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 ............... 157
    rank 1 updates to L ................. 270
    Size breakdown of the updates ([size]: number of this size):
        updowns [  1]: 41
        updowns [  2]: 18
        updowns [  3]: 6
        updowns [  4]: 9
        updowns [  5]: 2
        updowns [  6]: 3
        updowns [  7]: 3
        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]: 49
        depth [ 1]: 546

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 1.120567e-04
Initialization (includes partition) ..... 2.906322e-04
Phase 1 ................................. 4.181862e-04
Coordinate ascent ....................... 2.098083e-05
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 5.006790e-06
DASA .................................... 3.394842e-03
DASA line search ........................ 6.654263e-04
Check error ............................. 3.528595e-04
Proximal update ......................... 3.676414e-04
Invert permutation ...................... 3.194809e-05
Row modifications of Cholesky factor .... 7.319450e-05
Column modifications of Cholesky factor . 3.378391e-04
Cholesky factorization .................. 2.374649e-04
Partial Cholesky factorization .......... 1.502037e-05
Back solves ............................. 4.239082e-04
Forward solves .......................... 1.070499e-04


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

Final f             :  9.075855380014829e+03
sup-norm of gradient:  9.791309106095200e-07
Number of iterations: 96        
Function evaluations: 241       
Gradient evaluations: 167       
Subspace iterations: 23        
Number of subspaces: 4         


!!  STEENBRB    468       3       3       3      96     241     167      36       9     0    9.7913091e-07    9.0758554e+03    0.007964
 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.000001

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

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


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 8.377161930563093e-07    
Final f                               : 2.750493682549134e+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 : 39        
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 ....................... 28
    change in column activity ........... 330
    change in row activity .............. 0
    failures of Armijo step ............. 5
Proximal updates ........................ 29
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 ............... 214
    rank 1 updates to L ................. 415
    Size breakdown of the updates ([size]: number of this size):
        updowns [  1]: 44
        updowns [  2]: 18
        updowns [  3]: 8
        updowns [  4]: 5
        updowns [  5]: 8
        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]: 56
        depth [ 1]: 670

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 1.220703e-04
Initialization (includes partition) ..... 3.154278e-04
Phase 1 ................................. 4.384518e-04
Coordinate ascent ....................... 1.907349e-05
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 7.152557e-06
DASA .................................... 4.024744e-03
DASA line search ........................ 7.839203e-04
Check error ............................. 4.231930e-04
Proximal update ......................... 3.793240e-04
Invert permutation ...................... 3.695488e-05
Row modifications of Cholesky factor .... 8.082390e-05
Column modifications of Cholesky factor . 4.162788e-04
Cholesky factorization .................. 2.889633e-04
Partial Cholesky factorization .......... 2.074242e-05
Back solves ............................. 5.335808e-04
Forward solves .......................... 1.332760e-04


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

Final f             :  2.750493682551108e+04
sup-norm of gradient:  8.377161930563093e-07
Number of iterations: 322       
Function evaluations: 809       
Gradient evaluations: 547       
Subspace iterations: 54        
Number of subspaces: 7         


!!  STEENBRC    540       3       3       3     322     809     547      37      10     0    8.3771619e-07    2.7504937e+04    0.017286
 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 5.879051e-07 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 5.879051020431453e-07    
Final f                               : 9.144724933571864e+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.070499e-04
Initialization (includes partition) ..... 2.806187e-04
Phase 1 ................................. 3.974438e-04
Coordinate ascent ....................... 2.503395e-05
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 3.814697e-06
DASA .................................... 3.453016e-03
DASA line search ........................ 6.766319e-04
Check error ............................. 3.628731e-04
Proximal update ......................... 2.746582e-04
Invert permutation ...................... 3.194809e-05
Row modifications of Cholesky factor .... 6.484985e-05
Column modifications of Cholesky factor . 3.638268e-04
Cholesky factorization .................. 2.796650e-04
Partial Cholesky factorization .......... 1.668930e-05
Back solves ............................. 4.527569e-04
Forward solves .......................... 1.051426e-04


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

Final f             :  9.144724933578706e+03
sup-norm of gradient:  5.879051020431453e-07
Number of iterations: 166       
Function evaluations: 367       
Gradient evaluations: 228       
Subspace iterations: 55        
Number of subspaces: 7         


!!  STEENBRD    468       2       3       2     166     367     228      37      11     0    5.8790510e-07    9.1447249e+03    0.009228
 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 5.466225e-07 satisfies error tolerance 1.000000e-06.


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

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


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 ....................... 28
    change in column activity ........... 172
    change in row activity .............. 0
    failures of Armijo step ............. 10
Proximal updates ........................ 29
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 ............... 242
    rank 1 updates to L ................. 384
    Size breakdown of the updates ([size]: number of this size):
        updowns [  1]: 36
        updowns [  2]: 18
        updowns [  3]: 12
        updowns [  4]: 5
        updowns [  5]: 3
        updowns [  6]: 7
        updowns [  7]: 7
        updowns [  8]: 3
        updowns [  9]: 3
        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]: 62
        depth [ 1]: 756

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 1.380444e-04
Initialization (includes partition) ..... 3.366470e-04
Phase 1 ................................. 4.637241e-04
Coordinate ascent ....................... 1.788139e-05
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 7.152557e-06
DASA .................................... 4.527569e-03
DASA line search ........................ 9.362698e-04
Check error ............................. 5.300045e-04
Proximal update ......................... 4.103184e-04
Invert permutation ...................... 3.790855e-05
Row modifications of Cholesky factor .... 7.843971e-05
Column modifications of Cholesky factor . 4.303455e-04
Cholesky factorization .................. 3.068447e-04
Partial Cholesky factorization .......... 2.193451e-05
Back solves ............................. 6.086826e-04
Forward solves .......................... 1.437664e-04


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

Final f             :  2.745916331279607e+04
sup-norm of gradient:  5.466225164738395e-07
Number of iterations: 340       
Function evaluations: 852       
Gradient evaluations: 564       
Subspace iterations: 80        
Number of subspaces: 6         


!!  STEENBRE    540       3       9       3     340     852     564      36      11     0    5.4662252e-07    2.7459163e+04    0.019552
 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 9.504714e-07 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 9.504714135587927e-07    
Final f                               : 8.991848222038698e+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.139641e-04
Initialization (includes partition) ..... 2.579689e-04
Phase 1 ................................. 3.499985e-04
Coordinate ascent ....................... 2.098083e-05
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 5.006790e-06
DASA .................................... 2.810240e-03
DASA line search ........................ 5.240440e-04
Check error ............................. 2.796650e-04
Proximal update ......................... 2.734661e-04
Invert permutation ...................... 2.264977e-05
Row modifications of Cholesky factor .... 5.674362e-05
Column modifications of Cholesky factor . 2.868176e-04
Cholesky factorization .................. 2.436638e-04
Partial Cholesky factorization .......... 1.811981e-05
Back solves ............................. 3.468990e-04
Forward solves .......................... 8.273125e-05


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

Final f             :  8.991848222124327e+03
sup-norm of gradient:  9.504714135587927e-07
Number of iterations: 104       
Function evaluations: 257       
Gradient evaluations: 169       
Subspace iterations: 26        
Number of subspaces: 1         


!!  STEENBRF    468       1       1       1     104     257     169      25       9     0    9.5047141e-07    8.9918482e+03    0.007155
 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.000001

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

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


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

Iterations of gradient projection (GP): 17        
Iterations of active set GP           : 51        
Function evaluation in main code      : 1         
Function evaluations in GP            : 30        
Function evaluations in active set GP : 71        
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 18        
Gradient evaluations in active set GP : 64        


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 ....................... 59
    change in column activity ........... 431
    change in row activity .............. 0
    failures of Armijo step ............. 11
Proximal updates ........................ 60
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 ............... 506
    rank 1 updates to L ................. 707
    Size breakdown of the updates ([size]: number of this size):
        updowns [  1]: 99
        updowns [  2]: 33
        updowns [  3]: 28
        updowns [  4]: 11
        updowns [  5]: 12
        updowns [  6]: 13
        updowns [  7]: 7
        updowns [  8]: 6
        updowns [  9]: 10
        updowns [ 10]: 6
        updowns [ 11]: 5
        updowns [ 12]: 3
        updowns [ 13]: 2
        updowns [ 14]: 2
        updowns [ 15]: 2
        updowns [ 16]: 1
        updowns [ 19]: 3
        updowns [ 21]: 2
        updowns [ 22]: 2
        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]: 107
        depth [ 1]: 1255

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 1.301765e-04
Initialization (includes partition) ..... 5.383492e-04
Phase 1 ................................. 6.709099e-04
Coordinate ascent ....................... 1.883507e-05
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 5.006790e-06
DASA .................................... 7.316351e-03
DASA line search ........................ 1.545429e-03
Check error ............................. 8.184910e-04
Proximal update ......................... 7.987022e-04
Invert permutation ...................... 7.128716e-05
Row modifications of Cholesky factor .... 1.451969e-04
Column modifications of Cholesky factor . 8.366108e-04
Cholesky factorization .................. 3.013611e-04
Partial Cholesky factorization .......... 2.312660e-05
Back solves ............................. 1.035213e-03
Forward solves .......................... 2.286434e-04


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

Final f             :  2.742092967221679e+04
sup-norm of gradient:  7.915098363805648e-07
Number of iterations: 376       
Function evaluations: 916       
Gradient evaluations: 602       
Subspace iterations: 88        
Number of subspaces: 21        


!!  STEENBRG    540      17      30      18     376     916     602      71      10     0    7.9150984e-07    2.7420930e+04    0.025100
 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.000001

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 ...... 3.790855e-05
Initialization (includes partition) ..... 8.583069e-05
Phase 1 ................................. 8.702278e-05
Coordinate ascent ....................... 1.668930e-05
SSOR0 ................................... 1.063347e-04
SSOR1 ................................... 8.440018e-05
SpaRSA .................................. 4.053116e-06
DASA .................................... 2.121449e-03
DASA line search ........................ 1.292229e-04
Check error ............................. 6.961823e-05
Proximal update ......................... 2.908707e-05
Invert permutation ...................... 9.059906e-06
Row modifications of Cholesky factor .... 9.291172e-04
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 4.053116e-04
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 1.437664e-04
Forward solves .......................... 1.192093e-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.002513
 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.000001

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 ...... 5.912781e-05
Initialization (includes partition) ..... 1.006126e-04
Phase 1 ................................. 6.484985e-05
Coordinate ascent ....................... 1.287460e-05
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 1.907349e-06
DASA .................................... 1.826286e-04
DASA line search ........................ 1.025200e-05
Check error ............................. 4.363060e-05
Proximal update ......................... 2.908707e-05
Invert permutation ...................... 8.106232e-06
Row modifications of Cholesky factor .... 0.000000e+00
Column modifications of Cholesky factor . 3.910065e-05
Cholesky factorization .................. 2.813339e-05
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 3.814697e-06
Forward solves .......................... 9.059906e-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.000746
 Final f                         = 1.0549379e+04   
 Function value at final x       = 1.0549379e+04   
 ====================================================

