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

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

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

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


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

Iterations of gradient projection (GP): 54        
Iterations of active set GP           : 924       
Function evaluation in main code      : 1         
Function evaluations in GP            : 122       
Function evaluations in active set GP : 1661      
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 82        
Gradient evaluations in active set GP : 1308      


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 ....................... 762
    change in column activity ........... 23948
    change in row activity .............. 0
    failures of Armijo step ............. 160
Proximal updates ........................ 775
Cholesky factorizations ................. 644
    nonzeros in final factor ............ 6170 99.0% sparse
    rows dropped from L ................. 0
    rows added to L ..................... 0
    rank 1 downdates to L ............... 5648
    rank 1 updates to L ................. 75518
    Size breakdown of the updates ([size]: number of this size):
        updowns [  1]: 2132
        updowns [  2]: 801
        updowns [  3]: 613
        updowns [  4]: 484
        updowns [  5]: 328
        updowns [  6]: 243
        updowns [  7]: 167
        updowns [  8]: 128
        updowns [  9]: 128
        updowns [ 10]: 104
        updowns [ 11]: 56
        updowns [ 12]: 78
        updowns [ 13]: 73
        updowns [ 14]: 55
        updowns [ 15]: 43
        updowns [ 16]: 51
        updowns [ 17]: 46
        updowns [ 18]: 44
        updowns [ 19]: 30
        updowns [ 20]: 28
        updowns [ 21]: 28
        updowns [ 22]: 31
        updowns [ 23]: 27
        updowns [ 24]: 17
        updowns [ 25]: 16
        updowns [ 26]: 18
        updowns [ 27]: 20
        updowns [ 28]: 15
        updowns [ 29]: 16
        updowns [ 30]: 17
        updowns [ 31]: 11
        updowns [ 32]: 10
        updowns [ 33]: 10
        updowns [ 34]: 8
        updowns [ 35]: 9
        updowns [ 36]: 15
        updowns [ 37]: 13
        updowns [ 38]: 9
        updowns [ 39]: 9
        updowns [ 40]: 5
        updowns [ 41]: 5
        updowns [ 42]: 6
        updowns [ 43]: 8
        updowns [ 44]: 2
        updowns [ 45]: 1
        updowns [ 46]: 6
        updowns [ 47]: 9
        updowns [ 48]: 7
        updowns [ 49]: 3
        updowns [ 50]: 4
        updowns [ 51]: 2
        updowns [ 52]: 2
        updowns [ 53]: 4
        updowns [ 54]: 4
        updowns [ 56]: 5
        updowns [ 57]: 3
        updowns [ 58]: 4
        updowns [ 59]: 2
        updowns [ 60]: 2
        updowns [ 61]: 3
        updowns [ 62]: 3
        updowns [ 63]: 4
        updowns [ 64]: 1
        updowns [ 65]: 3
        updowns [ 66]: 4
        updowns [ 67]: 3
        updowns [ 68]: 5
        updowns [ 69]: 1
        updowns [ 70]: 2
        updowns [ 71]: 1
        updowns [ 72]: 1
        updowns [ 73]: 3
        updowns [ 74]: 3
        updowns [ 75]: 5
        updowns [ 76]: 4
        updowns [ 78]: 2
        updowns [ 79]: 2
        updowns [ 80]: 2
        updowns [ 82]: 2
        updowns [ 83]: 3
        updowns [ 84]: 1
        updowns [ 85]: 4
        updowns [ 86]: 5
        updowns [ 87]: 4
        updowns [ 88]: 2
        updowns [ 89]: 1
        updowns [ 90]: 1
        updowns [ 91]: 3
        updowns [ 92]: 1
        updowns [ 93]: 1
        updowns [ 95]: 3
        updowns [ 97]: 1
        updowns [ 98]: 1
        updowns [ 99]: 3
        updowns [100]: 1
        updowns [101]: 3
        updowns [102]: 3
        updowns [103]: 1
        updowns [105]: 1
        updowns [108]: 3
        updowns [109]: 2
        updowns [110]: 1
        updowns [111]: 1
        updowns [112]: 2
        updowns [113]: 2
        updowns [114]: 1
        updowns [117]: 3
        updowns [118]: 2
        updowns [119]: 2
        updowns [120]: 1
        updowns [121]: 1
        updowns [122]: 3
        updowns [125]: 2
        updowns [126]: 1
        updowns [127]: 1
        updowns [128]: 2
        updowns [>=131]: 103
    No. of solves by depth in the multilevel partition tree:
        (deeper <=> further from root of tree <=> fewer flops)
        depth [ 0]: 2375
        depth [ 1]: 267133

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 2.329826e-03
Initialization (includes partition) ..... 3.615236e-02
Phase 1 ................................. 4.566693e-02
Coordinate ascent ....................... 4.601479e-05
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 4.291534e-05
DASA .................................... 1.254960e+00
DASA line search ........................ 2.595041e-01
Check error ............................. 9.392810e-02
Proximal update ......................... 5.681443e-02
Invert permutation ...................... 3.077745e-03
Row modifications of Cholesky factor .... 4.573584e-03
Column modifications of Cholesky factor . 1.671126e-01
Cholesky factorization .................. 1.332219e-01
Partial Cholesky factorization .......... 7.589269e-02
Back solves ............................. 2.133086e-01
Forward solves .......................... 3.791499e-02


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

Final f             : -4.205693299537735e+06
sup-norm of gradient:  4.980540224666929e-07
Number of iterations: 7198      
Function evaluations: 11498     
Gradient evaluations: 10315     

!!   BIGBANK   2230   54  122   82  924 1661 1308   7198  11498  10315     981     644     0    3.9470793e-07   -4.2056933e+06    3.992542
 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

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

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.389980e-04
Initialization (includes partition) ..... 2.920628e-04
Phase 1 ................................. 3.776550e-04
Coordinate ascent ....................... 1.001358e-05
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 7.152557e-06
DASA .................................... 1.240492e-03
DASA line search ........................ 1.904964e-04
Check error ............................. 2.532005e-04
Proximal update ......................... 2.014637e-04
Invert permutation ...................... 2.193451e-05
Row modifications of Cholesky factor .... 2.551079e-05
Column modifications of Cholesky factor . 2.751350e-04
Cholesky factorization .................. 8.082390e-05
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 1.163483e-04
Forward solves .......................... 4.935265e-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   15   15   15    525    951    680      22       2     0    9.4514311e-07   -4.8198188e+04    0.084894
 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

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

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

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


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

Iterations of gradient projection (GP): 4         
Iterations of active set GP           : 15        
Function evaluation in main code      : 1         
Function evaluations in GP            : 10        
Function evaluations in active set GP : 16        
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 ............ 16
    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 ....................... 13
    change in column activity ........... 9
    change in row activity .............. 0
    failures of Armijo step ............. 4
Proximal updates ........................ 13
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 ............... 13
    rank 1 updates to L ................. 22
    Size breakdown of the updates ([size]: number of this size):
        updowns [  1]: 20
        updowns [  2]: 3
        updowns [  3]: 3
    No. of solves:   26

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 6.103516e-05
Initialization (includes partition) ..... 1.227856e-04
Phase 1 ................................. 1.165867e-04
Coordinate ascent ....................... 4.100800e-05
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 2.145767e-06
DASA .................................... 4.415512e-04
DASA line search ........................ 3.600121e-05
Check error ............................. 9.846687e-05
Proximal update ......................... 6.937981e-05
Invert permutation ...................... 1.668930e-05
Row modifications of Cholesky factor .... 5.960464e-06
Column modifications of Cholesky factor . 7.057190e-05
Cholesky factorization .................. 4.005432e-05
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 2.408028e-05
Forward solves .......................... 2.121925e-05


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

Final f             : -3.239322429887680e+04
sup-norm of gradient:  9.057207896352726e-07
Number of iterations: 283       
Function evaluations: 511       
Gradient evaluations: 441       
Subspace iterations: 105       
Number of subspaces: 14        


!!   DALLASS     46    4   10    4   15   16   15    283    511    441      23       3     0    9.0572079e-07   -3.2393224e+04    0.012635
 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

 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.303072e-03
Initialization (includes partition) ..... 7.005215e-03
Phase 1 ................................. 1.071596e-02
Coordinate ascent ....................... 1.218319e-04
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 2.269745e-04
DASA .................................... 2.878904e-03
DASA line search ........................ 2.439022e-04
Check error ............................. 1.909733e-04
Proximal update ......................... 2.560616e-04
Invert permutation ...................... 2.408028e-05
Row modifications of Cholesky factor .... 3.814697e-06
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 1.590014e-03
Partial Cholesky factorization .......... 1.020432e-04
Back solves ............................. 1.826286e-04
Forward solves .......................... 9.799004e-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    1    1    1     12     24     12       3       1     0    2.7617256e-07    3.9430435e+00    0.033138
 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

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


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

Iterations of gradient projection (GP): 3         
Iterations of active set GP           : 37        
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            : 3         
Gradient evaluations in active set GP : 37        


NAPHEAP statistics (Version 3.1, March 30, 2018):
Stat.nkf (number of known free variables):           48
Stat.nfree (free variables in initial heap):         15
Stat.nbound (bound variables in initial heap):       0
Stat.nbrks (break points to reach initial solution): 0
Stat.nrefine (break points during refinement):       0
Stat.nvarfix (variable fixing iterations):           0
Stat.nnewton (number of Newton iterations):          1
Stat.nsecant (number of secant iterations):          0


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

Final f             :  3.501296781581780e-02
sup-norm of gradient:  9.740877270052607e-07
Number of iterations: 166       
Function evaluations: 0         
Gradient evaluations: 166       

!!     DUAL1     85    3    0    3   37    0   37    166      0    166      42       0     0    9.7408773e-07    3.5012968e-02    0.002196
 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

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


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

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         


NAPHEAP statistics (Version 3.1, March 30, 2018):
Stat.nkf (number of known free variables):           73
Stat.nfree (free variables in initial heap):         19
Stat.nbound (bound variables in initial heap):       0
Stat.nbrks (break points to reach initial solution): 0
Stat.nrefine (break points during refinement):       0
Stat.nvarfix (variable fixing iterations):           0
Stat.nnewton (number of Newton iterations):          1
Stat.nsecant (number of secant iterations):          0


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

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

!!     DUAL2     96    0    0    0    5    0    5     59      0     59       7       0     0    6.6407844e-07    3.3733671e-02    0.001114
 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

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


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 6.782833157084697e-07    
Final f                               : 1.357558327515719e-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        


NAPHEAP statistics (Version 3.1, March 30, 2018):
Stat.nkf (number of known free variables):           24
Stat.nfree (free variables in initial heap):         73
Stat.nbound (bound variables in initial heap):       0
Stat.nbrks (break points to reach initial solution): 0
Stat.nrefine (break points during refinement):       0
Stat.nvarfix (variable fixing iterations):           0
Stat.nnewton (number of Newton iterations):          1
Stat.nsecant (number of secant iterations):          0


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

Final f             :  1.357558327515719e-01
sup-norm of gradient:  6.782833157084697e-07
Number of iterations: 69        
Function evaluations: 0         
Gradient evaluations: 69        

!!     DUAL3    111    2    0    2   19    0   19     69      0     69      23       0     0    6.7828332e-07    1.3575583e-01    0.001627
 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

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

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

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


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

Iterations of gradient projection (GP): 1         
Iterations of active set GP           : 10        
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 : 10        


NAPHEAP statistics (Version 3.1, March 30, 2018):
Stat.nkf (number of known free variables):           62
Stat.nfree (free variables in initial heap):         0
Stat.nbound (bound variables in initial heap):       62
Stat.nbrks (break points to reach initial solution): 62
Stat.nrefine (break points during refinement):       0
Stat.nvarfix (variable fixing iterations):           0
Stat.nnewton (number of Newton iterations):          0
Stat.nsecant (number of secant iterations):          1


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

Final f             :  7.460906493590196e-01
sup-norm of gradient:  7.053995500387021e-07
Number of iterations: 30        
Function evaluations: 0         
Gradient evaluations: 30        

!!     DUAL4     75    1    0    1   10    0   10     30      0     30      13       0     0    7.0539955e-07    7.4609065e-01    0.000507
 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

 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.818771e-05
Initialization (includes partition) ..... 1.556873e-04
Phase 1 ................................. 1.590252e-04
Coordinate ascent ....................... 6.437302e-06
SSOR0 ................................... 3.814697e-06
SSOR1 ................................... 1.692772e-05
SpaRSA .................................. 8.106232e-06
DASA .................................... 3.049374e-04
DASA line search ........................ 1.239777e-05
Check error ............................. 7.176399e-05
Proximal update ......................... 7.557869e-05
Invert permutation ...................... 7.390976e-06
Row modifications of Cholesky factor .... 0.000000e+00
Column modifications of Cholesky factor . 9.059906e-06
Cholesky factorization .................. 9.751320e-05
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 5.960464e-06
Forward solves .......................... 7.152557e-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      6      0      6       9      10     0    5.4917138e-10    6.1552517e+03    0.001013
 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

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

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 ...... 5.793571e-05
Initialization (includes partition) ..... 1.399517e-04
Phase 1 ................................. 1.578331e-04
Coordinate ascent ....................... 7.152557e-06
SSOR0 ................................... 3.099442e-06
SSOR1 ................................... 1.597404e-05
SpaRSA .................................. 7.152557e-06
DASA .................................... 2.949238e-04
DASA line search ........................ 1.001358e-05
Check error ............................. 6.222725e-05
Proximal update ......................... 7.295609e-05
Invert permutation ...................... 7.629395e-06
Row modifications of Cholesky factor .... 1.692772e-05
Column modifications of Cholesky factor . 4.291534e-06
Cholesky factorization .................. 8.821487e-05
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 5.245209e-06
Forward solves .......................... 5.722046e-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      6      0      6       9       8     0    3.2702019e-10    3.5513064e+03    0.000978
 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

 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.390976e-05
Initialization (includes partition) ..... 1.795292e-04
Phase 1 ................................. 1.494884e-04
Coordinate ascent ....................... 4.053116e-06
SSOR0 ................................... 2.145767e-06
SSOR1 ................................... 5.006790e-06
SpaRSA .................................. 1.287460e-05
DASA .................................... 1.399517e-04
DASA line search ........................ 2.861023e-06
Check error ............................. 3.314018e-05
Proximal update ......................... 4.720688e-05
Invert permutation ...................... 7.152557e-06
Row modifications of Cholesky factor .... 0.000000e+00
Column modifications of Cholesky factor . 9.059906e-06
Cholesky factorization .................. 5.602837e-05
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 1.192093e-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    3    0    3      5      0      5       6       3     0    2.9673686e-10    4.2723257e+02    0.000800
 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

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

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

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


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

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


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

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

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 1.080036e-04
Initialization (includes partition) ..... 2.655983e-04
Phase 1 ................................. 3.440380e-04
Coordinate ascent ....................... 5.006790e-06
SSOR0 ................................... 2.861023e-06
SSOR1 ................................... 2.193451e-05
SpaRSA .................................. 1.597404e-05
DASA .................................... 4.234314e-04
DASA line search ........................ 8.583069e-06
Check error ............................. 9.250641e-05
Proximal update ......................... 1.246929e-04
Invert permutation ...................... 9.536743e-06
Row modifications of Cholesky factor .... 1.692772e-05
Column modifications of Cholesky factor . 2.861023e-06
Cholesky factorization .................. 1.447201e-04
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 6.198883e-06
Forward solves .......................... 6.198883e-06


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

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

!!    DUALC8      8    2    0    2    5    0    5      7      0      7      10       7     0    2.3093889e-07    1.8309361e+04    0.001663
 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

 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 ...... 4.506111e-05
Initialization (includes partition) ..... 7.939339e-05
Phase 1 ................................. 3.600121e-05
Coordinate ascent ....................... 0.000000e+00
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 0.000000e+00
DASA .................................... 0.000000e+00
DASA line search ........................ 0.000000e+00
Check error ............................. 0.000000e+00
Proximal update ......................... 0.000000e+00
Invert permutation ...................... 5.006790e-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      0      0      0       4       0     0    0.0000000e+00   -8.2954771e+02    0.000216
 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

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

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

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


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 4.027464644337092e-09    
Final f                               : 6.130501290810409e-03    

Iterations of gradient projection (GP): 1         
Iterations of active set GP           : 9         
Function evaluation in main code      : 1         
Function evaluations in GP            : 2         
Function evaluations in active set GP : 9         
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 1         
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 ...................... 5
Coordinate ascent iterations ............ 7
    variables freed in coordinate ascent  0
    rows dropped in coordinate ascent ... 5
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 ............. 1
Proximal updates ........................ 5
Cholesky factorizations ................. 12
    nonzeros in final factor ............ 3 98.8% sparse
    rows dropped from L ................. 33
    rows added to L ..................... 26
    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:   40

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 2.884865e-05
Initialization (includes partition) ..... 7.104874e-05
Phase 1 ................................. 5.388260e-05
Coordinate ascent ....................... 7.152557e-06
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 1.907349e-06
DASA .................................... 3.802776e-04
DASA line search ........................ 4.172325e-05
Check error ............................. 5.006790e-05
Proximal update ......................... 2.288818e-05
Invert permutation ...................... 1.287460e-05
Row modifications of Cholesky factor .... 9.655952e-05
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 5.221367e-05
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 2.479553e-05
Forward solves .......................... 1.430511e-05


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

Final f             :  6.130501290980837e-03
sup-norm of gradient:  4.027464644337092e-09
Number of iterations: 8         
Function evaluations: 12        
Gradient evaluations: 8         

!!   EXPFITA      5    1    2    1    9    9    9      8     12      8      12      12     0    4.0274646e-09    6.1305013e-03    0.000803
 Final f                         = 6.1305013e-03   
 Function value at final x       = 6.1305013e-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

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

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

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


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

Iterations of gradient projection (GP): 5         
Iterations of active set GP           : 10        
Function evaluation in main code      : 1         
Function evaluations in GP            : 5         
Function evaluations in active set GP : 10        
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 5         
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 ............ 38
    variables freed in coordinate ascent  0
    rows dropped in coordinate ascent ... 286
Gradient ascent iterations .............. 135
    variables freed in gradient ascent .. 0
    rows dropped in gradient ascent ..... 119
Preconditioned CG iterations ............ 109
    variables freed in CG ............... 0
    rows dropped in CG .................. 22
SpaRSA iterations ....................... 17
    change in column activity ........... 0
    change in row activity .............. 3
    failures of Armijo step ............. 6
Proximal updates ........................ 14
Cholesky factorizations ................. 20
    nonzeros in final factor ............ 10 99.8% sparse
    rows dropped from L ................. 423
    rows added to L ..................... 145
    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:   416

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 3.886223e-05
Initialization (includes partition) ..... 1.018047e-04
Phase 1 ................................. 1.304150e-04
Coordinate ascent ....................... 5.531311e-05
SSOR0 ................................... 1.461506e-04
SSOR1 ................................... 9.560585e-05
SpaRSA .................................. 4.053116e-06
DASA .................................... 4.575491e-03
DASA line search ........................ 4.513264e-04
Check error ............................. 2.381802e-04
Proximal update ......................... 8.201599e-05
Invert permutation ...................... 1.859665e-05
Row modifications of Cholesky factor .... 1.835823e-03
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 4.436970e-04
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 3.752708e-04
Forward solves .......................... 3.480911e-05


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

Final f             :  5.019365523712176e-03
sup-norm of gradient:  1.192062079546593e-07
Number of iterations: 3         
Function evaluations: 4         
Gradient evaluations: 3         

!!   EXPFITB      5    5    5    5   10   10   10      3      4      3      19      20     0    1.1920621e-07    5.0193655e-03    0.005484
 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

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

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

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


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

Iterations of gradient projection (GP): 7         
Iterations of active set GP           : 15        
Function evaluation in main code      : 1         
Function evaluations in GP            : 8         
Function evaluations in active set GP : 15        
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 7         
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 ...................... 7
Coordinate ascent iterations ............ 114
    variables freed in coordinate ascent  0
    rows dropped in coordinate ascent ... 2800
Gradient ascent iterations .............. 1360
    variables freed in gradient ascent .. 0
    rows dropped in gradient ascent ..... 2012
Preconditioned CG iterations ............ 492
    variables freed in CG ............... 0
    rows dropped in CG .................. 149
SpaRSA iterations ....................... 31
    change in column activity ........... 0
    change in row activity .............. 8
    failures of Armijo step ............. 11
Proximal updates ........................ 23
Cholesky factorizations ................. 39
    nonzeros in final factor ............ 6 100.0% sparse
    rows dropped from L ................. 2783
    rows added to L ..................... 766
    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:   2478

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 9.393692e-05
Initialization (includes partition) ..... 2.455711e-04
Phase 1 ................................. 6.089211e-04
Coordinate ascent ....................... 3.128052e-04
SSOR0 ................................... 5.005360e-03
SSOR1 ................................... 8.349419e-04
SpaRSA .................................. 1.311302e-05
DASA .................................... 1.265440e-01
DASA line search ........................ 4.754305e-03
Check error ............................. 1.762629e-03
Proximal update ......................... 3.621578e-04
Invert permutation ...................... 2.956390e-05
Row modifications of Cholesky factor .... 8.827734e-02
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 9.400129e-03
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 1.080203e-02
Forward solves .......................... 2.305508e-04


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

Final f             :  2.330257499921240e-02
sup-norm of gradient:  5.950431879530953e-08
Number of iterations: 3         
Function evaluations: 5         
Gradient evaluations: 3         

!!   EXPFITC      5    7    8    7   15   15   15      3      5      3      27      39     0    5.9504319e-08    2.3302575e-02    0.130303
 Final f                         = 2.3302575e-02   
 Function value at final x       = 2.3302575e-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

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

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

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


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

Iterations of gradient projection (GP): 0         
Iterations of active set GP           : 7         
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 : 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 ...................... 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 ............. 1
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.286602e-02
Initialization (includes partition) ..... 1.350546e-02
Phase 1 ................................. 2.674103e-03
Coordinate ascent ....................... 8.010864e-05
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 1.418591e-04
DASA .................................... 6.456137e-03
DASA line search ........................ 4.792213e-05
Check error ............................. 5.559921e-04
Proximal update ......................... 7.677078e-04
Invert permutation ...................... 1.215935e-05
Row modifications of Cholesky factor .... 4.703999e-04
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 4.887104e-03
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 1.931190e-05
Forward solves .......................... 1.907349e-05


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

Final f             : -9.944449513727643e-01
sup-norm of gradient:  6.766715728834431e-07
Number of iterations: 34        
Function evaluations: 0         
Gradient evaluations: 34        

!!  GMNCASE2    175    0    0    0    7    0    7     34      0     34       9       2     0    6.7667157e-07   -9.9444495e-01    0.028603
 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

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


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

Iterations of gradient projection (GP): 0         
Iterations of active set GP           : 7         
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 : 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 ...................... 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 ............. 1
Proximal updates ........................ 4
Cholesky factorizations ................. 2
    nonzeros in final factor ............ 3321 99.4% sparse
    rows dropped from L ................. 21
    rows added to L ..................... 8
    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.297688e-02
Initialization (includes partition) ..... 1.363134e-02
Phase 1 ................................. 2.784014e-03
Coordinate ascent ....................... 5.865097e-05
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 1.029968e-04
DASA .................................... 6.226063e-03
DASA line search ........................ 3.409386e-05
Check error ............................. 3.986359e-04
Proximal update ......................... 6.256104e-04
Invert permutation ...................... 1.001358e-05
Row modifications of Cholesky factor .... 3.962517e-04
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 5.042076e-03
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 1.692772e-05
Forward solves .......................... 1.716614e-05


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

Final f             :  1.525146674530267e+00
sup-norm of gradient:  5.111130883941279e-07
Number of iterations: 32        
Function evaluations: 0         
Gradient evaluations: 32        

!!  GMNCASE3    175    0    0    0    7    0    7     32      0     32       9       2     0    5.1111309e-07    1.5251467e+00    0.028728
 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

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

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.578995e-04
Initialization (includes partition) ..... 1.108885e-03
Phase 1 ................................. 3.390074e-03
Coordinate ascent ....................... 1.521111e-04
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 9.489059e-05
DASA .................................... 5.682588e-02
DASA line search ........................ 1.896381e-03
Check error ............................. 1.451969e-04
Proximal update ......................... 3.271103e-04
Invert permutation ...................... 1.301765e-04
Row modifications of Cholesky factor .... 2.443910e-02
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 2.814317e-02
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 1.559496e-03
Forward solves .......................... 5.578995e-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      0      0      0       2       2     0    7.2881616e-11    5.9468849e+03    0.062422
 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

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

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.947113e-03
Initialization (includes partition) ..... 7.784128e-03
Phase 1 ................................. 9.550810e-03
Coordinate ascent ....................... 8.296967e-05
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 1.890659e-04
DASA .................................... 8.486986e-03
DASA line search ........................ 1.934528e-03
Check error ............................. 1.239061e-03
Proximal update ......................... 1.324415e-03
Invert permutation ...................... 1.051426e-04
Row modifications of Cholesky factor .... 2.264977e-05
Column modifications of Cholesky factor . 5.023479e-04
Cholesky factorization .................. 1.397848e-03
Partial Cholesky factorization .......... 1.332760e-04
Back solves ............................. 1.214981e-03
Forward solves .......................... 6.616116e-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   11   11   11     46     83     52      14       2     0    8.7178768e-07    5.7071190e+02    0.080578
 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

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

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.097679e-02
Initialization (includes partition) ..... 1.159620e-02
Phase 1 ................................. 1.032591e-02
Coordinate ascent ....................... 2.009869e-04
SSOR0 ................................... 3.578663e-04
SSOR1 ................................... 1.230955e-03
SpaRSA .................................. 1.511574e-04
DASA .................................... 1.384616e-02
DASA line search ........................ 4.851818e-04
Check error ............................. 3.392696e-04
Proximal update ......................... 4.861355e-04
Invert permutation ...................... 1.907349e-05
Row modifications of Cholesky factor .... 2.861023e-06
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 3.365040e-03
Partial Cholesky factorization .......... 6.429434e-03
Back solves ............................. 5.116463e-04
Forward solves .......................... 3.216267e-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    1    1    1     48     96     48       3       2     0    8.7831395e-07    2.0648051e+02    0.093332
 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

 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.095009e-02
Initialization (includes partition) ..... 1.671910e-02
Phase 1 ................................. 1.613760e-02
Coordinate ascent ....................... 1.339912e-04
SSOR0 ................................... 9.074926e-03
SSOR1 ................................... 7.679462e-04
SpaRSA .................................. 2.579689e-04
DASA .................................... 1.025221e-01
DASA line search ........................ 1.176214e-02
Check error ............................. 6.488323e-03
Proximal update ......................... 5.680561e-03
Invert permutation ...................... 2.298355e-04
Row modifications of Cholesky factor .... 1.254082e-04
Column modifications of Cholesky factor . 1.905823e-02
Cholesky factorization .................. 7.720470e-03
Partial Cholesky factorization .......... 1.471114e-02
Back solves ............................. 1.211214e-02
Forward solves .......................... 1.064515e-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   22   25   22     40     76     43      28       6     0    8.0258920e-07    2.4354233e+02    0.214813
 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

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

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.953074e-03
Initialization (includes partition) ..... 7.791519e-03
Phase 1 ................................. 9.543896e-03
Coordinate ascent ....................... 8.487701e-05
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 1.878738e-04
DASA .................................... 1.176357e-02
DASA line search ........................ 2.763271e-03
Check error ............................. 2.056599e-03
Proximal update ......................... 1.773357e-03
Invert permutation ...................... 1.153946e-04
Row modifications of Cholesky factor .... 4.076958e-05
Column modifications of Cholesky factor . 6.098747e-04
Cholesky factorization .................. 1.389027e-03
Partial Cholesky factorization .......... 1.473427e-04
Back solves ............................. 1.754284e-03
Forward solves .......................... 1.077414e-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   11   13   11     56    100     64      14       2     0    4.7023628e-07    6.1578420e+02    0.095919
 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

 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.099014e-02
Initialization (includes partition) ..... 1.158905e-02
Phase 1 ................................. 1.030397e-02
Coordinate ascent ....................... 2.110004e-04
SSOR0 ................................... 3.659725e-04
SSOR1 ................................... 1.234293e-03
SpaRSA .................................. 1.888275e-04
DASA .................................... 1.391006e-02
DASA line search ........................ 4.897118e-04
Check error ............................. 3.330708e-04
Proximal update ......................... 4.892349e-04
Invert permutation ...................... 1.907349e-05
Row modifications of Cholesky factor .... 4.768372e-06
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 3.372908e-03
Partial Cholesky factorization .......... 6.433249e-03
Back solves ............................. 5.166531e-04
Forward solves .......................... 3.232956e-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    1    1    1     48     96     48       3       2     0    8.6051620e-07    2.0648051e+02    0.094581
 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

 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.096797e-02
Initialization (includes partition) ..... 1.683068e-02
Phase 1 ................................. 1.611638e-02
Coordinate ascent ....................... 1.399517e-04
SSOR0 ................................... 9.134054e-03
SSOR1 ................................... 7.719994e-04
SpaRSA .................................. 1.900196e-04
DASA .................................... 1.029260e-01
DASA line search ........................ 1.174378e-02
Check error ............................. 6.523132e-03
Proximal update ......................... 5.741596e-03
Invert permutation ...................... 2.305508e-04
Row modifications of Cholesky factor .... 1.175404e-04
Column modifications of Cholesky factor . 1.921463e-02
Cholesky factorization .................. 7.756233e-03
Partial Cholesky factorization .......... 1.470566e-02
Back solves ............................. 1.214433e-02
Forward solves .......................... 1.065302e-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   22   25   22     40     77     42      28       6     0    7.5154245e-07    2.4354233e+02    0.216404
 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

 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.485991e-03
Initialization (includes partition) ..... 2.855301e-03
Phase 1 ................................. 1.010203e-02
Coordinate ascent ....................... 2.212524e-04
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 8.893013e-05
DASA .................................... 2.991915e-03
DASA line search ........................ 4.146099e-04
Check error ............................. 3.437996e-04
Proximal update ......................... 2.796650e-04
Invert permutation ...................... 1.287460e-05
Row modifications of Cholesky factor .... 3.814697e-06
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 8.440018e-04
Partial Cholesky factorization .......... 4.553795e-05
Back solves ............................. 3.981590e-04
Forward solves .......................... 1.857281e-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    1    1    1      3      6      3       3       2     0    2.3699463e-08    8.8079708e-01    0.018693
 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

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

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.442837e-03
Initialization (includes partition) ..... 2.811193e-03
Phase 1 ................................. 1.021123e-02
Coordinate ascent ....................... 2.591610e-04
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 8.797646e-05
DASA .................................... 2.959967e-03
DASA line search ........................ 4.496574e-04
Check error ............................. 3.411770e-04
Proximal update ......................... 2.789497e-04
Invert permutation ...................... 1.192093e-05
Row modifications of Cholesky factor .... 3.099442e-06
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 8.459091e-04
Partial Cholesky factorization .......... 4.529953e-05
Back solves ............................. 3.888607e-04
Forward solves .......................... 1.857281e-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    1    1    1      2      4      2       3       2     0    5.7262076e-08    4.3208226e-01    0.019383
 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

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

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.432823e-03
Initialization (includes partition) ..... 2.825975e-03
Phase 1 ................................. 1.021814e-02
Coordinate ascent ....................... 2.620220e-04
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 8.893013e-05
DASA .................................... 2.963066e-03
DASA line search ........................ 4.436970e-04
Check error ............................. 3.483295e-04
Proximal update ......................... 2.772808e-04
Invert permutation ...................... 1.406670e-05
Row modifications of Cholesky factor .... 4.053116e-06
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 8.449554e-04
Partial Cholesky factorization .......... 4.816055e-05
Back solves ............................. 3.981590e-04
Forward solves .......................... 1.854897e-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    1    1    1      2      4      2       3       2     0    5.9164656e-08    1.4096126e-01    0.019816
 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

 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.439976e-03
Initialization (includes partition) ..... 3.039122e-03
Phase 1 ................................. 5.951643e-03
Coordinate ascent ....................... 2.963543e-04
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 1.380444e-04
DASA .................................... 7.339954e-03
DASA line search ........................ 1.358747e-03
Check error ............................. 1.264811e-03
Proximal update ......................... 4.312992e-04
Invert permutation ...................... 3.337860e-05
Row modifications of Cholesky factor .... 1.788139e-05
Column modifications of Cholesky factor . 1.008511e-04
Cholesky factorization .................. 2.943993e-03
Partial Cholesky factorization .......... 2.107620e-04
Back solves ............................. 5.862713e-04
Forward solves .......................... 4.060268e-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    3    3    3      1      2      1       6       9     0    9.8458605e-07    2.7940841e+00    0.020178
 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

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

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

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


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 8.571381902089999e-07    
Final f                               : -1.735569579855734e+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 : 34        


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 ... 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 ....................... 21
    change in column activity ........... 29
    change in row activity .............. 0
    failures of Armijo step ............. 5
Proximal updates ........................ 21
Cholesky factorizations ................. 4
    nonzeros in final factor ............ 11 85.9% sparse
    rows dropped from L ................. 3
    rows added to L ..................... 5
    rank 1 downdates to L ............... 56
    rank 1 updates to L ................. 12
    Size breakdown of the updates ([size]: number of this size):
        updowns [  1]: 25
        updowns [  2]: 6
        updowns [  3]: 1
        updowns [  4]: 1
        updowns [  5]: 1
        updowns [  7]: 1
        updowns [ 12]: 1
    No. of solves:   24

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 6.008148e-05
Initialization (includes partition) ..... 1.499653e-04
Phase 1 ................................. 1.225471e-04
Coordinate ascent ....................... 1.168251e-05
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 3.814697e-06
DASA .................................... 4.200935e-04
DASA line search ........................ 2.956390e-05
Check error ............................. 1.323223e-04
Proximal update ......................... 1.211166e-04
Invert permutation ...................... 2.956390e-05
Row modifications of Cholesky factor .... 2.408028e-05
Column modifications of Cholesky factor . 1.111031e-04
Cholesky factorization .................. 3.623962e-05
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 1.621246e-05
Forward solves .......................... 1.740456e-05


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

Final f             : -1.735569579855733e+03
sup-norm of gradient:  8.571381902089999e-07
Number of iterations: 54        
Function evaluations: 95        
Gradient evaluations: 55        

!!  HIMMELBI    100    2    3    2   32   39   34     54     95     55      36       4     0    8.5713819e-07   -1.7355696e+03    0.003858
 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

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

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

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


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 1.355143552927984e-09    
Final f                               : 2.257108736348906e+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         


NAPHEAP statistics (Version 3.1, March 30, 2018):
Stat.nkf (number of known free variables):           0
Stat.nfree (free variables in initial heap):         0
Stat.nbound (bound variables in initial heap):       0
Stat.nbrks (break points to reach initial solution): 0
Stat.nrefine (break points during refinement):       0
Stat.nvarfix (variable fixing iterations):           0
Stat.nnewton (number of Newton iterations):          0
Stat.nsecant (number of secant iterations):          0


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

Final f             :  2.257108736348906e+01
sup-norm of gradient:  1.355143552927984e-09
Number of iterations: 8         
Function evaluations: 16        
Gradient evaluations: 8         

!!      HONG      4    0    0    0    1    1    1      8     16      8       3       0     0    1.3551436e-09    2.2571087e+01    0.000144
 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

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

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

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


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 1.001825482115572e-09    
Final f                               : 1.044725129680990e+03    

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


NAPHEAP statistics (Version 3.1, March 30, 2018):
Stat.nkf (number of known free variables):           0
Stat.nfree (free variables in initial heap):         0
Stat.nbound (bound variables in initial heap):       0
Stat.nbrks (break points to reach initial solution): 0
Stat.nrefine (break points during refinement):       0
Stat.nvarfix (variable fixing iterations):           0
Stat.nnewton (number of Newton iterations):          0
Stat.nsecant (number of secant iterations):          0


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

Final f             :  1.044725129680990e+03
sup-norm of gradient:  1.001825482115572e-09
Number of iterations: 60        
Function evaluations: 125       
Gradient evaluations: 66        

!!     HS105      8    1    4    1    6    6    6     60    125     66       9       0     0    1.0018255e-09    1.0447251e+03    0.011011
 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

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

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

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


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 8.537884084169889e-07    
Final f                               : -4.776109085936812e+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.218651e-05
Initialization (includes partition) ..... 6.794930e-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.468658e-04
DASA line search ........................ 1.120567e-05
Check error ............................. 3.981590e-05
Proximal update ......................... 1.883507e-05
Invert permutation ...................... 7.390976e-06
Row modifications of Cholesky factor .... 0.000000e+00
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 3.886223e-05
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 8.821487e-06
Forward solves .......................... 7.152557e-06


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

Final f             : -4.776109085936589e+01
sup-norm of gradient:  8.537884084169889e-07
Number of iterations: 22        
Function evaluations: 46        
Gradient evaluations: 25        

!!     HS112     10    2    6    2    3    6    3     22     46     25       8      10     0    8.5378841e-07   -4.7761091e+01    0.000654
 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

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

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

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


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

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


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

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

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 2.694130e-05
Initialization (includes partition) ..... 5.888939e-05
Phase 1 ................................. 6.294250e-05
Coordinate ascent ....................... 8.821487e-06
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 9.536743e-07
DASA .................................... 2.050400e-04
DASA line search ........................ 1.549721e-05
Check error ............................. 3.361702e-05
Proximal update ......................... 2.145767e-05
Invert permutation ...................... 6.198883e-06
Row modifications of Cholesky factor .... 2.074242e-05
Column modifications of Cholesky factor . 4.291534e-05
Cholesky factorization .................. 2.098083e-05
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 1.001358e-05
Forward solves .......................... 5.483627e-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    4    4      4      8      4       6       2     0    1.1155422e-08    2.4489970e+02    0.000592
 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

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

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

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


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 5.684341886080801e-14    
Final f                               : -1.000000082692193e+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 ............ 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 ............ 3 50.0% sparse
    rows dropped from L ................. 0
    rows added to L ..................... 0
    rank 1 downdates to L ............... 0
    rank 1 updates to L ................. 0
    Size breakdown of the updates ([size]: number of this size):
    No. of solves:   2

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 2.408028e-05
Initialization (includes partition) ..... 4.911423e-05
Phase 1 ................................. 3.886223e-05
Coordinate ascent ....................... 3.099442e-06
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 2.145767e-06
DASA .................................... 4.887581e-05
DASA line search ........................ 3.099442e-06
Check error ............................. 1.382828e-05
Proximal update ......................... 6.675720e-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.478195e-05
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 1.907349e-06
Forward solves .......................... 1.907349e-06


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

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

!!      HS24      2    0    0    0    2    2    2      0      0      0       4       2     0    5.6843419e-14   -1.0000001e+00    0.000233
 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

 Problem: HS36 (n = 3)
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                               : -3.300000000000000e+03   

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         


NAPHEAP statistics (Version 3.1, March 30, 2018):
Stat.nkf (number of known free variables):           1
Stat.nfree (free variables in initial heap):         0
Stat.nbound (bound variables in initial heap):       0
Stat.nbrks (break points to reach initial solution): 0
Stat.nrefine (break points during refinement):       0
Stat.nvarfix (variable fixing iterations):           0
Stat.nnewton (number of Newton iterations):          2
Stat.nsecant (number of secant iterations):          0


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

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

!!      HS36      3    0    0    0    2    2    2      0      0      0       4       0     0    0.0000000e+00   -3.3000000e+03    0.000105
 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

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

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

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


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

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


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

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

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 2.193451e-05
Initialization (includes partition) ..... 4.792213e-05
Phase 1 ................................. 3.719330e-05
Coordinate ascent ....................... 1.907349e-06
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 9.536743e-07
DASA .................................... 4.792213e-05
DASA line search ........................ 1.907349e-06
Check error ............................. 1.192093e-05
Proximal update ......................... 9.298325e-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.406670e-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:

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    1    1    1      3      6      3       4       2     0    3.3799612e-08   -3.4560000e+03    0.000265
 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

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

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

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


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

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         


NAPHEAP statistics (Version 3.1, March 30, 2018):
Stat.nkf (number of known free variables):           3
Stat.nfree (free variables in initial heap):         0
Stat.nbound (bound variables in initial heap):       0
Stat.nbrks (break points to reach initial solution): 0
Stat.nrefine (break points during refinement):       0
Stat.nvarfix (variable fixing iterations):           0
Stat.nnewton (number of Newton iterations):          1
Stat.nsecant (number of secant iterations):          0


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

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

!!      HS41      4    1    1    1    1    1    1      3      6      3       4       0     0    2.5187103e-07    1.9259259e+00    0.000109
 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

 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 ...... 2.479553e-05
Initialization (includes partition) ..... 5.125999e-05
Phase 1 ................................. 3.600121e-05
Coordinate ascent ....................... 0.000000e+00
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 5.960464e-06
DASA .................................... 3.600121e-05
DASA line search ........................ 3.099442e-06
Check error ............................. 1.096725e-05
Proximal update ......................... 5.006790e-06
Invert permutation ...................... 3.814697e-06
Row modifications of Cholesky factor .... 0.000000e+00
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 1.287460e-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             :  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    1    1    1     14     28     14       3       1     0    3.1137308e-07    2.3082780e-11    0.000278
 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

 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 ...... 3.004074e-05
Initialization (includes partition) ..... 6.318092e-05
Phase 1 ................................. 4.100800e-05
Coordinate ascent ....................... 2.861023e-06
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 6.914139e-06
DASA .................................... 4.982948e-05
DASA line search ........................ 1.907349e-06
Check error ............................. 1.215935e-05
Proximal update ......................... 2.861023e-06
Invert permutation ...................... 3.814697e-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 ............................. 0.000000e+00
Forward solves .......................... 1.907349e-06


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

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

!!      HS50      5    0    0    0    1    2    1     10     20     10       3       1     0    1.7550406e-12    4.6560802e-26    0.000312
 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

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

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

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


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 1.331892329522469e-07    
Final f                               : -8.674088253886085e-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         


NAPHEAP statistics (Version 3.1, March 30, 2018):
Stat.nkf (number of known free variables):           1
Stat.nfree (free variables in initial heap):         0
Stat.nbound (bound variables in initial heap):       2
Stat.nbrks (break points to reach initial solution): 2
Stat.nrefine (break points during refinement):       0
Stat.nvarfix (variable fixing iterations):           0
Stat.nnewton (number of Newton iterations):          0
Stat.nsecant (number of secant iterations):          1


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

Final f             : -8.674087672723502e-01
sup-norm of gradient:  1.331892329522469e-07
Number of iterations: 12        
Function evaluations: 30        
Gradient evaluations: 18        

!!      HS54      6    0    0    0    1    5    1     12     30     18       3       0     0    1.3318923e-07   -8.6740883e-01    0.000166
 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

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

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.100800e-05
Initialization (includes partition) ..... 6.318092e-05
Phase 1 ................................. 3.695488e-05
Coordinate ascent ....................... 3.814697e-06
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 2.145767e-06
DASA .................................... 5.698204e-05
DASA line search ........................ 2.861023e-06
Check error ............................. 1.430511e-05
Proximal update ......................... 7.629395e-06
Invert permutation ...................... 2.145767e-06
Row modifications of Cholesky factor .... 0.000000e+00
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 1.811981e-05
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 9.536743e-07
Forward solves .......................... 2.861023e-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      0      0      0       2       2     0    7.6516571e-13    6.6666667e+00    0.000236
 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

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

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

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


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 3.608420229284093e-10    
Final f                               : -2.627251464797159e+04   

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         


NAPHEAP statistics (Version 3.1, March 30, 2018):
Stat.nkf (number of known free variables):           2
Stat.nfree (free variables in initial heap):         0
Stat.nbound (bound variables in initial heap):       0
Stat.nbrks (break points to reach initial solution): 0
Stat.nrefine (break points during refinement):       0
Stat.nvarfix (variable fixing iterations):           0
Stat.nnewton (number of Newton iterations):          1
Stat.nsecant (number of secant iterations):          0


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

Final f             : -2.627251464797159e+04
sup-norm of gradient:  3.608420229284093e-10
Number of iterations: 11        
Function evaluations: 25        
Gradient evaluations: 14        

!!      HS62      3    0    0    0    1    2    1     11     25     14       3       0     0    3.6084202e-10   -2.6272515e+04    0.000167
 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

 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.503395e-05
Initialization (includes partition) ..... 5.745888e-05
Phase 1 ................................. 5.197525e-05
Coordinate ascent ....................... 5.245209e-06
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 9.536743e-07
DASA .................................... 8.392334e-05
DASA line search ........................ 5.006790e-06
Check error ............................. 1.549721e-05
Proximal update ......................... 1.287460e-05
Invert permutation ...................... 5.960464e-06
Row modifications of Cholesky factor .... 1.311302e-05
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 2.717972e-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             : -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    3    4    3      5      9      6       7       4     0    1.4451009e-09   -3.2348679e+01    0.000398
 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

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

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

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


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 1.659943016374399e-12    
Final f                               : -5.000000000000001e-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         


NAPHEAP statistics (Version 3.1, March 30, 2018):
Stat.nkf (number of known free variables):           2
Stat.nfree (free variables in initial heap):         0
Stat.nbound (bound variables in initial heap):       0
Stat.nbrks (break points to reach initial solution): 0
Stat.nrefine (break points during refinement):       0
Stat.nvarfix (variable fixing iterations):           0
Stat.nnewton (number of Newton iterations):          1
Stat.nsecant (number of secant iterations):          0


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

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

!!       HS9      2    0    0    0    1    1    1      4      9      5       3       0     0    1.6599430e-12   -5.0000000e-01    0.000120
 Final f                         = -5.0000000e-01  
 Function value at final x       = 0.0000000e+00   
 ====================================================

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

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

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

PASA success: Error 5.551115e-17 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 5.551115123125783e-17    
Final f                               : 1.689349393939395e-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         


NAPHEAP statistics (Version 3.1, March 30, 2018):
Stat.nkf (number of known free variables):           2
Stat.nfree (free variables in initial heap):         0
Stat.nbound (bound variables in initial heap):       0
Stat.nbrks (break points to reach initial solution): 0
Stat.nrefine (break points during refinement):       0
Stat.nvarfix (variable fixing iterations):           0
Stat.nnewton (number of Newton iterations):          1
Stat.nsecant (number of secant iterations):          0


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

Final f             :  1.689349393939395e-02
sup-norm of gradient:  0.000000000000000e+00
Number of iterations: 1         
Function evaluations: 2         
Gradient evaluations: 1         

!!    HUBFIT      2    1    1    1    2    2    2      1      2      1       6       0     0    5.5511151e-17    1.6893494e-02    0.000110
 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

 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.609295e-04
Initialization (includes partition) ..... 1.077890e-03
Phase 1 ................................. 4.127026e-04
Coordinate ascent ....................... 1.311302e-05
SSOR0 ................................... 1.478195e-05
SSOR1 ................................... 2.238750e-04
SpaRSA .................................. 3.099442e-05
DASA .................................... 1.586127e-02
DASA line search ........................ 4.158020e-03
Check error ............................. 4.586935e-03
Proximal update ......................... 1.869202e-04
Invert permutation ...................... 2.074242e-05
Row modifications of Cholesky factor .... 1.007557e-03
Column modifications of Cholesky factor . 9.834766e-04
Cholesky factorization .................. 1.808167e-03
Partial Cholesky factorization .......... 9.059906e-06
Back solves ............................. 1.479864e-03
Forward solves .......................... 7.290840e-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    2    2    2      0      0      0       6      44     0    6.4034251e-08   -3.5855468e+06    0.020714
 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

 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.520416e-04
Initialization (includes partition) ..... 6.010532e-04
Phase 1 ................................. 1.997948e-04
Coordinate ascent ....................... 1.096725e-05
SSOR0 ................................... 1.192093e-05
SSOR1 ................................... 1.442432e-04
SpaRSA .................................. 2.408028e-05
DASA .................................... 4.157543e-03
DASA line search ........................ 8.695126e-04
Check error ............................. 1.306772e-03
Proximal update ......................... 1.327991e-04
Invert permutation ...................... 1.335144e-05
Row modifications of Cholesky factor .... 4.549026e-04
Column modifications of Cholesky factor . 3.771782e-04
Cholesky factorization .................. 2.548695e-04
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 3.619194e-04
Forward solves .......................... 1.416206e-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    2    2    2      0      0      0       6       8     0    2.5022777e-08   -3.5820155e+06    0.006238
 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

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

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 ...... 9.799004e-05
Initialization (includes partition) ..... 1.666546e-04
Phase 1 ................................. 1.008511e-04
Coordinate ascent ....................... 1.001358e-05
SSOR0 ................................... 7.152557e-06
SSOR1 ................................... 1.749992e-04
SpaRSA .................................. 1.001358e-05
DASA .................................... 1.261711e-03
DASA line search ........................ 1.528263e-04
Check error ............................. 2.903938e-04
Proximal update ......................... 8.440018e-05
Invert permutation ...................... 8.344650e-06
Row modifications of Cholesky factor .... 1.301765e-04
Column modifications of Cholesky factor . 9.131432e-05
Cholesky factorization .................. 1.175404e-04
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 7.224083e-05
Forward solves .......................... 3.957748e-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    2    2    2      0      0      0       6       8     0    1.2470025e-08   -3.5822683e+06    0.002009
 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

 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.409386e-05
Initialization (includes partition) ..... 7.629395e-05
Phase 1 ................................. 3.170967e-05
Coordinate ascent ....................... 3.099442e-06
SSOR0 ................................... 2.861023e-06
SSOR1 ................................... 6.198883e-06
SpaRSA .................................. 3.099442e-06
DASA .................................... 8.082390e-05
DASA line search ........................ 4.053116e-06
Check error ............................. 1.215935e-05
Proximal update ......................... 1.001358e-05
Invert permutation ...................... 5.006790e-06
Row modifications of Cholesky factor .... 1.907349e-06
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 1.597404e-05
Partial Cholesky factorization .......... 1.907349e-06
Back solves ............................. 1.192093e-06
Forward solves .......................... 5.006790e-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      1      2      1       5       2     0    3.7835834e-10   -1.7577543e-02    0.000330
 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

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

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

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


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

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


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

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

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 5.483627e-05
Initialization (includes partition) ..... 1.077652e-04
Phase 1 ................................. 7.939339e-05
Coordinate ascent ....................... 2.026558e-05
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 3.099442e-06
DASA .................................... 2.770424e-04
DASA line search ........................ 1.931190e-05
Check error ............................. 6.866455e-05
Proximal update ......................... 4.506111e-05
Invert permutation ...................... 1.406670e-05
Row modifications of Cholesky factor .... 3.314018e-05
Column modifications of Cholesky factor . 3.004074e-05
Cholesky factorization .................. 4.005432e-05
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 9.536743e-06
Forward solves .......................... 8.106232e-06


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

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

!!   LOADBAL     31    1    2    1    8   11    8     10     18     10      12       5     0    4.5614743e-07    4.5285104e-01    0.000963
 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

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

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

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


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

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


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

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

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 3.910065e-05
Initialization (includes partition) ..... 6.961823e-05
Phase 1 ................................. 3.695488e-05
Coordinate ascent ....................... 5.006790e-06
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 9.536743e-07
DASA .................................... 6.294250e-05
DASA line search ........................ 3.099442e-06
Check error ............................. 1.454353e-05
Proximal update ......................... 1.025200e-05
Invert permutation ...................... 5.006790e-06
Row modifications of Cholesky factor .... 0.000000e+00
Column modifications of Cholesky factor . 6.914139e-06
Cholesky factorization .................. 1.692772e-05
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 1.907349e-06
Forward solves .......................... 3.099442e-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    2    2    2      1      1      1       5       3     0    1.1191048e-12    1.2311245e+02    0.000322
 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

 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 ...... 3.910065e-05
Initialization (includes partition) ..... 6.508827e-05
Phase 1 ................................. 3.504753e-05
Coordinate ascent ....................... 2.861023e-06
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 2.145767e-06
DASA .................................... 7.200241e-05
DASA line search ........................ 5.006790e-06
Check error ............................. 1.335144e-05
Proximal update ......................... 6.675720e-06
Invert permutation ...................... 2.384186e-06
Row modifications of Cholesky factor .... 9.536743e-07
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 1.597404e-05
Partial Cholesky factorization .......... 2.861023e-06
Back solves ............................. 3.099442e-06
Forward solves .......................... 5.245209e-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    1    1    1      8     16      8       3       2     0    2.8719872e-08   -2.3800268e+03    0.000355
 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

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

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

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


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

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


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.076958e-05
Initialization (includes partition) ..... 7.295609e-05
Phase 1 ................................. 4.410744e-05
Coordinate ascent ....................... 0.000000e+00
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 1.907349e-06
DASA .................................... 8.130074e-05
DASA line search ........................ 7.152557e-06
Check error ............................. 1.287460e-05
Proximal update ......................... 9.536743e-06
Invert permutation ...................... 6.914139e-06
Row modifications of Cholesky factor .... 1.788139e-05
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 1.811981e-05
Partial Cholesky factorization .......... 9.536743e-07
Back solves ............................. 2.861023e-06
Forward solves .......................... 2.861023e-06


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

Final f             :  1.365217816769921e-04
sup-norm of gradient:  4.637055082171669e-07
Number of iterations: 7         
Function evaluations: 15        
Gradient evaluations: 9         

!!  PENTAGON      6    0    0    0    3    3    3      7     15      9       5       2     0    4.6370551e-07    1.3652178e-04    0.000380
 Final f                         = 1.3652178e-04   
 Function value at final x       = 1.3652178e-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

 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 ...... 4.291534e-05
Initialization (includes partition) ..... 7.772446e-05
Phase 1 ................................. 4.196167e-05
Coordinate ascent ....................... 9.536743e-07
SSOR0 ................................... 1.907349e-06
SSOR1 ................................... 2.145767e-06
SpaRSA .................................. 3.814697e-06
DASA .................................... 2.002716e-05
DASA line search ........................ 0.000000e+00
Check error ............................. 1.096725e-05
Proximal update ......................... 5.722046e-06
Invert permutation ...................... 9.298325e-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    5    5      5      8      8       8       0     0    0.0000000e+00   -9.5653773e+02    0.000376
 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

 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.100800e-05
Initialization (includes partition) ..... 6.914139e-05
Phase 1 ................................. 3.027916e-05
Coordinate ascent ....................... 0.000000e+00
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 0.000000e+00
DASA .................................... 0.000000e+00
DASA line search ........................ 0.000000e+00
Check error ............................. 0.000000e+00
Proximal update ......................... 0.000000e+00
Invert permutation ...................... 5.722046e-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      0      0      0       4       0     0    0.0000000e+00   -8.0652185e+02    0.000189
 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

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

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

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


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

Iterations of gradient projection (GP): 23        
Iterations of active set GP           : 47        
Function evaluation in main code      : 1         
Function evaluations in GP            : 101       
Function evaluations in active set GP : 110       
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 26        
Gradient evaluations in active set GP : 80        


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 ............ 116
    variables freed in coordinate ascent  234
    rows dropped in coordinate ascent ... 0
Gradient ascent iterations .............. 0
    variables freed in gradient ascent .. 0
    rows dropped in gradient ascent ..... 0
Preconditioned CG iterations ............ 0
    variables freed in CG ............... 0
    rows dropped in CG .................. 0
SpaRSA iterations ....................... 86
    change in column activity ........... 418
    change in row activity .............. 0
    failures of Armijo step ............. 17
Proximal updates ........................ 86
Cholesky factorizations ................. 57
    nonzeros in final factor ............ 297 85.7% sparse
    rows dropped from L ................. 0
    rows added to L ..................... 0
    rank 1 downdates to L ............... 179
    rank 1 updates to L ................. 321
    Size breakdown of the updates ([size]: number of this size):
        updowns [  1]: 101
        updowns [  2]: 23
        updowns [  3]: 29
        updowns [  4]: 18
        updowns [  5]: 12
        updowns [  6]: 7
        updowns [  7]: 3
        updowns [  8]: 1
        updowns [ 14]: 1
        updowns [ 15]: 1
        updowns [ 16]: 1
        updowns [ 18]: 1
    No. of solves:   215

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 8.392334e-05
Initialization (includes partition) ..... 3.938675e-04
Phase 1 ................................. 4.925728e-04
Coordinate ascent ....................... 4.217625e-04
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 5.006790e-06
DASA .................................... 4.575729e-03
DASA line search ........................ 3.907681e-04
Check error ............................. 9.119511e-04
Proximal update ......................... 6.649494e-04
Invert permutation ...................... 7.891655e-05
Row modifications of Cholesky factor .... 4.863739e-05
Column modifications of Cholesky factor . 6.668568e-04
Cholesky factorization .................. 1.070023e-03
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 2.524853e-04
Forward solves .......................... 1.776218e-04


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

Final f             : -7.129291999999844e+06
sup-norm of gradient:  7.216248268391082e-07
Number of iterations: 1262      
Function evaluations: 2416      
Gradient evaluations: 1769      
Subspace iterations: 550       
Number of subspaces: 65        


!!    SMBANK    117   23  101   26   47  110   80   1262   2416   1769      96      57     0    7.2162483e-07   -7.1292920e+06    0.059545
 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

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

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 ...... 7.700920e-05
Initialization (includes partition) ..... 1.440048e-04
Phase 1 ................................. 1.583099e-04
Coordinate ascent ....................... 1.368523e-04
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 4.053116e-06
DASA .................................... 1.711845e-03
DASA line search ........................ 1.657009e-04
Check error ............................. 4.198551e-04
Proximal update ......................... 1.747608e-04
Invert permutation ...................... 1.955032e-05
Row modifications of Cholesky factor .... 1.668930e-05
Column modifications of Cholesky factor . 1.502037e-04
Cholesky factorization .................. 4.589558e-04
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 1.051426e-04
Forward solves .......................... 8.368492e-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   10   10   10     12     24     12      18      53     0    4.1636081e-09    2.3973800e+02    0.002924
 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

 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 ...... 2.408028e-05
Initialization (includes partition) ..... 4.720688e-05
Phase 1 ................................. 3.290176e-05
Coordinate ascent ....................... 3.814697e-06
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 9.536743e-07
DASA .................................... 7.820129e-05
DASA line search ........................ 6.914139e-06
Check error ............................. 1.907349e-05
Proximal update ......................... 7.152557e-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.121925e-05
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 3.099442e-06
Forward solves .......................... 2.861023e-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      0      0      0       2       5     0    1.5923707e-11    4.2500000e+00    0.000237
 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

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

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

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


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

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


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 ....................... 25
    change in column activity ........... 181
    change in row activity .............. 0
    failures of Armijo step ............. 5
Proximal updates ........................ 26
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 ............... 131
    rank 1 updates to L ................. 244
    Size breakdown of the updates ([size]: number of this size):
        updowns [  1]: 28
        updowns [  2]: 10
        updowns [  3]: 4
        updowns [  4]: 8
        updowns [  5]: 1
        updowns [  6]: 4
        updowns [  7]: 1
        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]: 41
        depth [ 1]: 446

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 1.051426e-04
Initialization (includes partition) ..... 2.582073e-04
Phase 1 ................................. 3.643036e-04
Coordinate ascent ....................... 2.193451e-05
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 1.096725e-05
DASA .................................... 2.779007e-03
DASA line search ........................ 5.385876e-04
Check error ............................. 2.789497e-04
Proximal update ......................... 2.889633e-04
Invert permutation ...................... 2.789497e-05
Row modifications of Cholesky factor .... 6.031990e-05
Column modifications of Cholesky factor . 2.684593e-04
Cholesky factorization .................. 2.341270e-04
Partial Cholesky factorization .......... 1.645088e-05
Back solves ............................. 3.468990e-04
Forward solves .......................... 7.843971e-05


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

Final f             :  9.075855376099675e+03
sup-norm of gradient:  8.691872559370151e-07
Number of iterations: 81        
Function evaluations: 193       
Gradient evaluations: 115       
Subspace iterations: 13        
Number of subspaces: 1         


!!  STEENBRB    468    2    3    2   23   26   23     81    193    115      28       9     0    8.6918726e-07    9.0758554e+03    0.006323
 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

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

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

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


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

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


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 ....................... 26
    change in column activity ........... 324
    change in row activity .............. 0
    failures of Armijo step ............. 7
Proximal updates ........................ 27
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 ............... 202
    rank 1 updates to L ................. 403
    Size breakdown of the updates ([size]: number of this size):
        updowns [  1]: 50
        updowns [  2]: 14
        updowns [  3]: 8
        updowns [  4]: 3
        updowns [  5]: 7
        updowns [  6]: 4
        updowns [  7]: 1
        updowns [  8]: 1
        updowns [  9]: 4
        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]: 52
        depth [ 1]: 644

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 1.230240e-04
Initialization (includes partition) ..... 3.340244e-04
Phase 1 ................................. 4.389286e-04
Coordinate ascent ....................... 2.121925e-05
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 1.096725e-05
DASA .................................... 3.870249e-03
DASA line search ........................ 7.867813e-04
Check error ............................. 3.983974e-04
Proximal update ......................... 3.647804e-04
Invert permutation ...................... 3.361702e-05
Row modifications of Cholesky factor .... 6.818771e-05
Column modifications of Cholesky factor . 4.010201e-04
Cholesky factorization .................. 2.954006e-04
Partial Cholesky factorization .......... 1.788139e-05
Back solves ............................. 5.345345e-04
Forward solves .......................... 1.096725e-04


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

Final f             :  2.750493682379303e+04
sup-norm of gradient:  9.552149527105452e-07
Number of iterations: 384       
Function evaluations: 904       
Gradient evaluations: 531       
Subspace iterations: 58        
Number of subspaces: 6         


!!  STEENBRC    540    3    3    3   32   43   32    384    904    531      38      10     0    9.5521495e-07    2.7504937e+04    0.016902
 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

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

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

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


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 9.135312002443371e-07    
Final f                               : 9.144724933633992e+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.849102e-04
Phase 1 ................................. 3.972054e-04
Coordinate ascent ....................... 2.789497e-05
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 5.006790e-06
DASA .................................... 3.453016e-03
DASA line search ........................ 6.730556e-04
Check error ............................. 3.674030e-04
Proximal update ......................... 2.768040e-04
Invert permutation ...................... 3.290176e-05
Row modifications of Cholesky factor .... 6.914139e-05
Column modifications of Cholesky factor . 3.502369e-04
Cholesky factorization .................. 2.734661e-04
Partial Cholesky factorization .......... 1.907349e-05
Back solves ............................. 4.444122e-04
Forward solves .......................... 1.003742e-04


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

Final f             :  9.144724933640833e+03
sup-norm of gradient:  9.135312002443371e-07
Number of iterations: 120       
Function evaluations: 271       
Gradient evaluations: 166       
Subspace iterations: 39        
Number of subspaces: 5         


!!  STEENBRD    468    2    3    2   32   39   32    120    271    166      37      11     0    9.1353120e-07    9.1447249e+03    0.008052
 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

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

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

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


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

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


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 ....................... 26
    change in column activity ........... 156
    change in row activity .............. 0
    failures of Armijo step ............. 7
Proximal updates ........................ 27
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 ............... 226
    rank 1 updates to L ................. 368
    Size breakdown of the updates ([size]: number of this size):
        updowns [  1]: 32
        updowns [  2]: 14
        updowns [  3]: 10
        updowns [  4]: 5
        updowns [  5]: 4
        updowns [  6]: 7
        updowns [  7]: 9
        updowns [  8]: 2
        updowns [  9]: 2
        updowns [ 10]: 1
        updowns [ 11]: 1
        updowns [ 12]: 2
        updowns [ 13]: 1
        updowns [ 14]: 1
        updowns [ 15]: 1
        updowns [ 16]: 2
        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]: 60
        depth [ 1]: 727

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 1.411438e-04
Initialization (includes partition) ..... 3.359318e-04
Phase 1 ................................. 4.620552e-04
Coordinate ascent ....................... 1.931190e-05
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 5.006790e-06
DASA .................................... 4.262209e-03
DASA line search ........................ 8.990765e-04
Check error ............................. 4.961491e-04
Proximal update ......................... 3.688335e-04
Invert permutation ...................... 2.980232e-05
Row modifications of Cholesky factor .... 6.532669e-05
Column modifications of Cholesky factor . 4.005432e-04
Cholesky factorization .................. 2.996922e-04
Partial Cholesky factorization .......... 1.883507e-05
Back solves ............................. 5.741119e-04
Forward solves .......................... 1.356602e-04


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

Final f             :  2.745916331806638e+04
sup-norm of gradient:  8.147610381006171e-07
Number of iterations: 299       
Function evaluations: 800       
Gradient evaluations: 517       
Subspace iterations: 102       
Number of subspaces: 10        


!!  STEENBRE    540    3    5    3   27   45   27    299    800    517      34      11     0    8.1476104e-07    2.7459163e+04    0.018129
 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

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

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

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


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 6.881824905504395e-07    
Final f                               : 8.991848220341015e+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.158714e-04
Initialization (includes partition) ..... 2.596378e-04
Phase 1 ................................. 3.588200e-04
Coordinate ascent ....................... 2.169609e-05
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 5.006790e-06
DASA .................................... 2.752304e-03
DASA line search ........................ 5.273819e-04
Check error ............................. 2.794266e-04
Proximal update ......................... 2.758503e-04
Invert permutation ...................... 1.668930e-05
Row modifications of Cholesky factor .... 4.935265e-05
Column modifications of Cholesky factor . 2.884865e-04
Cholesky factorization .................. 2.372265e-04
Partial Cholesky factorization .......... 2.026558e-05
Back solves ............................. 3.430843e-04
Forward solves .......................... 8.225441e-05


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

Final f             :  8.991848220426644e+03
sup-norm of gradient:  6.881824905504395e-07
Number of iterations: 124       
Function evaluations: 304       
Gradient evaluations: 182       
Subspace iterations: 41        
Number of subspaces: 3         


!!  STEENBRF    468    1    1    1   21   26   21    124    304    182      25       9     0    6.8818249e-07    8.9918482e+03    0.007148
 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

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

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

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


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

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


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 ....................... 33
    change in column activity ........... 344
    change in row activity .............. 0
    failures of Armijo step ............. 8
Proximal updates ........................ 34
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 ............... 244
    rank 1 updates to L ................. 445
    Size breakdown of the updates ([size]: number of this size):
        updowns [  1]: 56
        updowns [  2]: 15
        updowns [  3]: 15
        updowns [  4]: 5
        updowns [  5]: 7
        updowns [  6]: 5
        updowns [  7]: 1
        updowns [  8]: 1
        updowns [  9]: 7
        updowns [ 10]: 4
        updowns [ 11]: 2
        updowns [ 12]: 1
        updowns [ 13]: 1
        updowns [ 14]: 1
        updowns [ 15]: 1
        updowns [ 16]: 1
        updowns [ 19]: 1
        updowns [ 21]: 1
        updowns [ 22]: 1
        updowns [ 23]: 2
        updowns [ 35]: 1
        updowns [ 40]: 1
        updowns [>= 69]: 1
    No. of solves by depth in the multilevel partition tree:
        (deeper <=> further from root of tree <=> fewer flops)
        depth [ 0]: 67
        depth [ 1]: 775

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 1.258850e-04
Initialization (includes partition) ..... 3.817081e-04
Phase 1 ................................. 4.570484e-04
Coordinate ascent ....................... 1.978874e-05
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 5.006790e-06
DASA .................................... 4.521370e-03
DASA line search ........................ 9.338856e-04
Check error ............................. 4.835129e-04
Proximal update ......................... 4.153252e-04
Invert permutation ...................... 3.528595e-05
Row modifications of Cholesky factor .... 8.249283e-05
Column modifications of Cholesky factor . 4.632473e-04
Cholesky factorization .................. 2.942085e-04
Partial Cholesky factorization .......... 2.002716e-05
Back solves ............................. 6.177425e-04
Forward solves .......................... 1.325607e-04


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

Final f             :  2.742092967324001e+04
sup-norm of gradient:  4.250575318040517e-07
Number of iterations: 300       
Function evaluations: 735       
Gradient evaluations: 446       
Subspace iterations: 81        
Number of subspaces: 8         


!!  STEENBRG    540    3    3    3   34   46   34    300    735    446      40      10     0    4.2505753e-07    2.7420930e+04    0.017157
 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

 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.910065e-05
Initialization (includes partition) ..... 8.821487e-05
Phase 1 ................................. 8.606911e-05
Coordinate ascent ....................... 1.645088e-05
SSOR0 ................................... 1.060963e-04
SSOR1 ................................... 8.177757e-05
SpaRSA .................................. 2.861023e-06
DASA .................................... 2.107143e-03
DASA line search ........................ 1.311302e-04
Check error ............................. 6.890297e-05
Proximal update ......................... 2.670288e-05
Invert permutation ...................... 9.298325e-06
Row modifications of Cholesky factor .... 9.255409e-04
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 3.728867e-04
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 1.316071e-04
Forward solves .......................... 1.740456e-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    2    2    2      0      0      0       7       6     0    6.9008133e-12    4.3011579e+00    0.002496
 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

 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 ...... 4.601479e-05
Initialization (includes partition) ..... 8.678436e-05
Phase 1 ................................. 6.222725e-05
Coordinate ascent ....................... 1.454353e-05
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 1.907349e-06
DASA .................................... 1.654625e-04
DASA line search ........................ 1.001358e-05
Check error ............................. 4.053116e-05
Proximal update ......................... 2.646446e-05
Invert permutation ...................... 6.914139e-06
Row modifications of Cholesky factor .... 0.000000e+00
Column modifications of Cholesky factor . 3.051758e-05
Cholesky factorization .................. 2.527237e-05
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 5.722046e-06
Forward solves .......................... 8.106232e-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    7    8    7     11     21     11      10       3     0    7.2379438e-07    1.0549379e+04    0.000700
 Final f                         = 1.0549379e+04   
 Function value at final x       = 1.0549379e+04   
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   AKIVA

 Problem name: AKIVA

 Double precision version will be formed

 The objective function uses 1 nonlinear group
 
 There are 2 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: AKIVA (n = 2)
walltime at start:     0.000001
!!     AKIVA      2      10      21      11     0    6.6670154e-09    6.1660422e+00    0.000191

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 6.667015e-09 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : AKIVA
# variables               = 2         

# cg iterations           = 10        

# cg function evals       = 21        

# cg gradient evals       = 11        

|| g ||                   = 6.6670154e-09   
Final f                   = 6.1660422e+00   
Function value at final x = 6.1660422e+00   
Solve time                = 0.000191    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   ALLINITU

 Problem name: ALLINITU

 Double precision version will be formed

 The objective function uses 2 linear groups
 The objective function uses 10 nonlinear groups
 
 There are 4 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: ALLINITU (n = 4)
walltime at start:     0.000001
!!  ALLINITU      4      12      30      18     0    1.5419435e-09    5.7443849e+00    0.000065

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 1.541943e-09 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : ALLINITU
# variables               = 4         

# cg iterations           = 12        

# cg function evals       = 30        

# cg gradient evals       = 18        

|| g ||                   = 1.5419435e-09   
Final f                   = 5.7443849e+00   
Function value at final x = 5.7443849e+00   
Solve time                = 0.000065    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   ARGLINA

 Problem name: ARGLINA

 Double precision version will be formed

 The objective function uses 400 linear groups
 
 There are 200 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: ARGLINA (n = 200)
the problem has a quadratic objective
walltime at start:     0.000001
!!   ARGLINA    200       1       0       2     0    4.2188475e-14    2.0000000e+02    0.000121

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 4.218847e-14 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : ARGLINA
# variables               = 200       

# cg iterations           = 1         

# cg function evals       = 0         

# cg gradient evals       = 2         

|| g ||                   = 4.2188475e-14   
Final f                   = 2.0000000e+02   
Function value at final x = 2.0000000e+02   
Solve time                = 0.000121    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   ARGLINB

 Problem name: ARGLINB

 Double precision version will be formed

 The objective function uses 400 linear groups
 
 There are 200 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: ARGLINB (n = 200)
walltime at start:     0.000000
!!   ARGLINB    200       5      15      13     0    8.3382474e-09    9.9625468e+01    0.004453

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 8.338247e-09 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : ARGLINB
# variables               = 200       

# cg iterations           = 5         

# cg function evals       = 15        

# cg gradient evals       = 13        

|| g ||                   = 8.3382474e-09   
Final f                   = 9.9625468e+01   
Function value at final x = 9.9625468e+01   
Solve time                = 0.004453    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   ARWHEAD

 Problem name: ARWHEAD

 Double precision version will be formed

 The objective function uses 4999 linear groups
 The objective function uses 4999 nonlinear groups
 
 There are 5000 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: ARWHEAD (n = 5000)
walltime at start:     0.000000
!!   ARWHEAD   5000       7      15       8     0    9.9119508e-07    0.0000000e+00    0.006080

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 9.911951e-07 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : ARWHEAD
# variables               = 5000      

# cg iterations           = 7         

# cg function evals       = 15        

# cg gradient evals       = 8         

|| g ||                   = 9.9119508e-07   
Final f                   = 0.0000000e+00   
Function value at final x = 0.0000000e+00   
Solve time                = 0.006080    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   BARD

 Problem name: BARD

 Double precision version will be formed

 The objective function uses 15 nonlinear groups
 
 There are 3 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: BARD (n = 3)
walltime at start:     0.000001
!!      BARD      3      16      33      17     0    3.4949567e-09    8.2148773e-03    0.000068

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 3.494957e-09 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : BARD
# variables               = 3         

# cg iterations           = 16        

# cg function evals       = 33        

# cg gradient evals       = 17        

|| g ||                   = 3.4949567e-09   
Final f                   = 8.2148773e-03   
Function value at final x = 8.2148773e-03   
Solve time                = 0.000068    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   BDQRTIC

 Problem name: BDQRTIC

 Double precision version will be formed

 The objective function uses 4996 linear groups
 The objective function uses 4996 nonlinear groups
 
 There are 5000 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: BDQRTIC (n = 5000)
walltime at start:     0.000001
!!   BDQRTIC   5000     124     260     214     0    9.9811741e-07    2.0006257e+04    0.171326

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 9.981174e-07 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : BDQRTIC
# variables               = 5000      

# cg iterations           = 124       

# cg function evals       = 260       

# cg gradient evals       = 214       

|| g ||                   = 9.9811741e-07   
Final f                   = 2.0006257e+04   
Function value at final x = 2.0006257e+04   
Solve time                = 0.171326    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   BEALE

 Problem name: BEALE

 Double precision version will be formed

 The objective function uses 3 nonlinear groups
 
 There are 2 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: BEALE (n = 2)
walltime at start:     0.000000
!!     BEALE      2      15      31      16     0    4.4989214e-08    2.7264213e-15    0.000073

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 4.498921e-08 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : BEALE
# variables               = 2         

# cg iterations           = 15        

# cg function evals       = 31        

# cg gradient evals       = 16        

|| g ||                   = 4.4989214e-08   
Final f                   = 2.7264213e-15   
Function value at final x = 2.7264213e-15   
Solve time                = 0.000073    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   BIGGS6

 Problem name: BIGGS6

 Double precision version will be formed

 The objective function uses 13 nonlinear groups
 
 There are 6 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: BIGGS6 (n = 6)
walltime at start:     0.000000
!!    BIGGS6      6      26      55      29     0    1.2469933e-07    5.6556498e-03    0.000213

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 1.246993e-07 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : BIGGS6
# variables               = 6         

# cg iterations           = 26        

# cg function evals       = 55        

# cg gradient evals       = 29        

|| g ||                   = 1.2469933e-07   
Final f                   = 5.6556498e-03   
Function value at final x = 5.6556498e-03   
Solve time                = 0.000213    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   BOX

 Problem name: BOX

 Double precision version will be formed

 The objective function uses 1 linear group
 The objective function uses 40000 nonlinear groups
 
 There are 10000 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: BOX (n = 10000)
walltime at start:     0.000001
!!       BOX  10000       8      25      18     0    9.7876273e-09   -1.8645379e+03    0.025116

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 9.787627e-09 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : BOX
# variables               = 10000     

# cg iterations           = 8         

# cg function evals       = 25        

# cg gradient evals       = 18        

|| g ||                   = 9.7876273e-09   
Final f                   = -1.8645379e+03  
Function value at final x = -1.8645379e+03  
Solve time                = 0.025116    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   BOX3

 Problem name: BOX3

 Double precision version will be formed

 The objective function uses 10 nonlinear groups
 
 There are 3 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: BOX3 (n = 3)
walltime at start:     0.000000
!!      BOX3      3      11      24      13     0    7.5844458e-07    3.8194901e-13    0.000083

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 7.584446e-07 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : BOX3
# variables               = 3         

# cg iterations           = 11        

# cg function evals       = 24        

# cg gradient evals       = 13        

|| g ||                   = 7.5844458e-07   
Final f                   = 3.8194901e-13   
Function value at final x = 3.8194901e-13   
Solve time                = 0.000083    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   BOXPOWER

 Problem name: BOXPOWER

 Double precision version will be formed

 The objective function uses 20000 nonlinear groups
 
 There are 20000 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: BOXPOWER (n = 20000)
walltime at start:     0.000001
!!  BOXPOWER  20000      22      55      33     0    3.1536154e-07    1.6182394e-10    0.034406

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 3.153615e-07 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : BOXPOWER
# variables               = 20000     

# cg iterations           = 22        

# cg function evals       = 55        

# cg gradient evals       = 33        

|| g ||                   = 3.1536154e-07   
Final f                   = 1.6182394e-10   
Function value at final x = 1.6182394e-10   
Solve time                = 0.034406    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   BRKMCC

 Problem name: BRKMCC

 Double precision version will be formed

 The objective function uses 3 linear groups
 The objective function uses 1 nonlinear group
 
 There are 2 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: BRKMCC (n = 2)
walltime at start:     0.000000
!!    BRKMCC      2       5      11       6     0    6.2205812e-08    1.6904268e-01    0.000035

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 6.220581e-08 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : BRKMCC
# variables               = 2         

# cg iterations           = 5         

# cg function evals       = 11        

# cg gradient evals       = 6         

|| g ||                   = 6.2205812e-08   
Final f                   = 1.6904268e-01   
Function value at final x = 1.6904268e-01   
Solve time                = 0.000035    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   BROWNAL

 Problem name: BROWNAL

 Double precision version will be formed

 The objective function uses 199 linear groups
 The objective function uses 1 nonlinear group
 
 There are 200 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: BROWNAL (n = 200)
walltime at start:     0.000001
!!   BROWNAL    200       9      27      18     0    9.5220187e-10    9.0719515e-19    0.003477

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 9.522019e-10 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : BROWNAL
# variables               = 200       

# cg iterations           = 9         

# cg function evals       = 27        

# cg gradient evals       = 18        

|| g ||                   = 9.5220187e-10   
Final f                   = 9.0719515e-19   
Function value at final x = 9.0719515e-19   
Solve time                = 0.003477    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   BROWNBS

 Problem name: BROWNBS

 Double precision version will be formed

 The objective function uses 2 linear groups
 The objective function uses 1 nonlinear group
 
 There are 2 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: BROWNBS (n = 2)
walltime at start:     0.000001
!!   BROWNBS      2      13      27      15     0    0.0000000e+00    0.0000000e+00    0.000047

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

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



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : BROWNBS
# variables               = 2         

# cg iterations           = 13        

# cg function evals       = 27        

# cg gradient evals       = 15        

|| g ||                   = 0.0000000e+00   
Final f                   = 0.0000000e+00   
Function value at final x = 0.0000000e+00   
Solve time                = 0.000047    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   BROWNDEN

 Problem name: BROWNDEN

 Double precision version will be formed

 The objective function uses 20 nonlinear groups
 
 There are 4 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: BROWNDEN (n = 4)
walltime at start:     0.000000
!!  BROWNDEN      4      16      31      19     0    6.2987965e-08    8.5822201e+04    0.000094

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 6.298797e-08 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : BROWNDEN
# variables               = 4         

# cg iterations           = 16        

# cg function evals       = 31        

# cg gradient evals       = 19        

|| g ||                   = 6.2987965e-08   
Final f                   = 8.5822201e+04   
Function value at final x = 8.5822201e+04   
Solve time                = 0.000094    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   BROYDN7D

 Problem name: BROYDN7D

 Double precision version will be formed

 The objective function uses 2500 linear groups
 The objective function uses 5000 nonlinear groups
 
 There are 5000 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: BROYDN7D (n = 5000)
walltime at start:     0.000001
!!  BROYDN7D   5000    1371    2730    1389     0    8.4634809e-07    1.9691757e+03    3.199110

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 8.463481e-07 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : BROYDN7D
# variables               = 5000      

# cg iterations           = 1371      

# cg function evals       = 2730      

# cg gradient evals       = 1389      

|| g ||                   = 8.4634809e-07   
Final f                   = 1.9691757e+03   
Function value at final x = 1.9691757e+03   
Solve time                = 3.199110    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   BRYBND

 Problem name: BRYBND

 Double precision version will be formed

 The objective function uses 5000 nonlinear groups
 
 There are 5000 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: BRYBND (n = 5000)
walltime at start:     0.000001
!!    BRYBND   5000      34      73      39     0    3.1155129e-07    8.8450790e-14    0.041046

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 3.115513e-07 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : BRYBND
# variables               = 5000      

# cg iterations           = 34        

# cg function evals       = 73        

# cg gradient evals       = 39        

|| g ||                   = 3.1155129e-07   
Final f                   = 8.8450790e-14   
Function value at final x = 8.8450790e-14   
Solve time                = 0.041046    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   CHAINWOO

 Problem name: CHAINWOO

 Double precision version will be formed

 The objective function uses 7997 linear groups
 The objective function uses 3998 nonlinear groups
 
 There are 4000 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: CHAINWOO (n = 4000)
walltime at start:     0.000000
!!  CHAINWOO   4000     250     474     312     0    8.6481796e-07    4.5727672e+00    0.203332

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 8.648180e-07 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : CHAINWOO
# variables               = 4000      

# cg iterations           = 250       

# cg function evals       = 474       

# cg gradient evals       = 312       

|| g ||                   = 8.6481796e-07   
Final f                   = 4.5727672e+00   
Function value at final x = 4.5727672e+00   
Solve time                = 0.203332    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   CHNROSNB

 Problem name: CHNROSNB

 Double precision version will be formed

 The objective function uses 49 linear groups
 The objective function uses 49 nonlinear groups
 
 There are 50 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: CHNROSNB (n = 50)
walltime at start:     0.000001
!!  CHNROSNB     50     287     566     297     0    7.4547674e-07    9.0756918e-14    0.003348

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 7.454767e-07 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : CHNROSNB
# variables               = 50        

# cg iterations           = 287       

# cg function evals       = 566       

# cg gradient evals       = 297       

|| g ||                   = 7.4547674e-07   
Final f                   = 9.0756918e-14   
Function value at final x = 9.0756918e-14   
Solve time                = 0.003348    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   CHNRSNBM

 Problem name: CHNRSNBM

 Double precision version will be formed

 The objective function uses 49 linear groups
 The objective function uses 49 nonlinear groups
 
 There are 50 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: CHNRSNBM (n = 50)
walltime at start:     0.000001
!!  CHNRSNBM     50     263     527     264     0    7.0616784e-07    6.8357034e-14    0.003232

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 7.061678e-07 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : CHNRSNBM
# variables               = 50        

# cg iterations           = 263       

# cg function evals       = 527       

# cg gradient evals       = 264       

|| g ||                   = 7.0616784e-07   
Final f                   = 6.8357034e-14   
Function value at final x = 6.8357034e-14   
Solve time                = 0.003232    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   CLIFF

 Problem name: CLIFF

 Double precision version will be formed

 The objective function uses 1 linear group
 The objective function uses 2 nonlinear groups
 
 There are 2 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: CLIFF (n = 2)
walltime at start:     0.000001
!!     CLIFF      2      13      46      33     0    2.3391621e-07    1.9978661e-01    0.000069

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 2.339162e-07 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : CLIFF
# variables               = 2         

# cg iterations           = 13        

# cg function evals       = 46        

# cg gradient evals       = 33        

|| g ||                   = 2.3391621e-07   
Final f                   = 1.9978661e-01   
Function value at final x = 1.9978661e-01   
Solve time                = 0.000069    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   COSINE

 Problem name: COSINE

 Double precision version will be formed

 The objective function uses 9999 nonlinear groups
 
 There are 10000 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: COSINE (n = 10000)
walltime at start:     0.000000
!!    COSINE  10000      11      37      31     0    1.5872900e-07   -9.9990000e+03    0.057231

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 1.587290e-07 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : COSINE
# variables               = 10000     

# cg iterations           = 11        

# cg function evals       = 37        

# cg gradient evals       = 31        

|| g ||                   = 1.5872900e-07   
Final f                   = -9.9990000e+03  
Function value at final x = -9.9990000e+03  
Solve time                = 0.057231    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   CRAGGLVY

 Problem name: CRAGGLVY

 Double precision version will be formed

 The objective function uses 12495 nonlinear groups
 
 There are 5000 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: CRAGGLVY (n = 5000)
walltime at start:     0.000001
!!  CRAGGLVY   5000     107     203     146     0    9.8082985e-07    1.6882153e+03    0.176897

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 9.808299e-07 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : CRAGGLVY
# variables               = 5000      

# cg iterations           = 107       

# cg function evals       = 203       

# cg gradient evals       = 146       

|| g ||                   = 9.8082985e-07   
Final f                   = 1.6882153e+03   
Function value at final x = 1.6882153e+03   
Solve time                = 0.176897    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   CUBE

 Problem name: CUBE

 Double precision version will be formed

 The objective function uses 1 linear group
 The objective function uses 1 nonlinear group
 
 There are 2 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: CUBE (n = 2)
walltime at start:     0.000001
!!      CUBE      2      35      85      50     0    3.2723735e-10    3.2828157e-23    0.000078

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 3.272373e-10 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : CUBE
# variables               = 2         

# cg iterations           = 35        

# cg function evals       = 85        

# cg gradient evals       = 50        

|| g ||                   = 3.2723735e-10   
Final f                   = 3.2828157e-23   
Function value at final x = 3.2828157e-23   
Solve time                = 0.000078    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   CURLY10

 Problem name: CURLY10

 Double precision version will be formed

 The objective function uses 10000 linear groups
 
 There are 10000 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: CURLY10 (n = 10000)
walltime at start:     0.000000
!!   CURLY10  10000   47942   67417   76428     0    9.8549240e-07   -1.0031629e+06   47.997475

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 9.854924e-07 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : CURLY10
# variables               = 10000     

# cg iterations           = 47942     

# cg function evals       = 67417     

# cg gradient evals       = 76428     

|| g ||                   = 9.8549240e-07   
Final f                   = -1.0031629e+06  
Function value at final x = -1.0031629e+06  
Solve time                = 47.997475   seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   CURLY20

 Problem name: CURLY20

 Double precision version will be formed

 The objective function uses 10000 linear groups
 
 There are 10000 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: CURLY20 (n = 10000)
walltime at start:     0.000001
!!   CURLY20  10000   68080   90992  113275     0    9.9759414e-07   -1.0031629e+06  107.796480

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 9.975941e-07 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : CURLY20
# variables               = 10000     

# cg iterations           = 68080     

# cg function evals       = 90992     

# cg gradient evals       = 113275    

|| g ||                   = 9.9759414e-07   
Final f                   = -1.0031629e+06  
Function value at final x = -1.0031629e+06  
Solve time                = 107.796480  seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   CURLY30

 Problem name: CURLY30

 Double precision version will be formed

 The objective function uses 10000 linear groups
 
 There are 10000 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: CURLY30 (n = 10000)
walltime at start:     0.000000
!!   CURLY30  10000   74098   97528  124891     0    9.9437615e-07   -1.0031629e+06  159.547143

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 9.943761e-07 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : CURLY30
# variables               = 10000     

# cg iterations           = 74098     

# cg function evals       = 97528     

# cg gradient evals       = 124891    

|| g ||                   = 9.9437615e-07   
Final f                   = -1.0031629e+06  
Function value at final x = -1.0031629e+06  
Solve time                = 159.547143  seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   DECONVU

 Problem name: DECONVU

 Double precision version will be formed

 The objective function uses 40 nonlinear groups
 
 There are 51 free variables
 There are 12 fixed variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: DECONVU (n = 63)
walltime at start:     0.000001
!!   DECONVU     63     400     801     401     0    8.5007783e-07    4.4591100e-08    0.008884

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 8.500778e-07 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : DECONVU
# variables               = 63        

# cg iterations           = 400       

# cg function evals       = 801       

# cg gradient evals       = 401       

|| g ||                   = 8.5007783e-07   
Final f                   = 4.4591100e-08   
Function value at final x = 4.4591100e-08   
Solve time                = 0.008884    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   DENSCHNA

 Problem name: DENSCHNA

 Double precision version will be formed

 The objective function uses 1 linear group
 The objective function uses 2 nonlinear groups
 
 There are 2 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: DENSCHNA (n = 2)
walltime at start:     0.000000
!!  DENSCHNA      2       9      19      10     0    3.5273288e-08    3.1668570e-16    0.000040

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 3.527329e-08 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : DENSCHNA
# variables               = 2         

# cg iterations           = 9         

# cg function evals       = 19        

# cg gradient evals       = 10        

|| g ||                   = 3.5273288e-08   
Final f                   = 3.1668570e-16   
Function value at final x = 3.1668570e-16   
Solve time                = 0.000040    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   DENSCHNB

 Problem name: DENSCHNB

 Double precision version will be formed

 The objective function uses 2 linear groups
 The objective function uses 1 nonlinear group
 
 There are 2 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: DENSCHNB (n = 2)
walltime at start:     0.000001
!!  DENSCHNB      2       7      15       8     0    1.0342574e-08    3.6407413e-17    0.000033

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 1.034257e-08 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : DENSCHNB
# variables               = 2         

# cg iterations           = 7         

# cg function evals       = 15        

# cg gradient evals       = 8         

|| g ||                   = 1.0342574e-08   
Final f                   = 3.6407413e-17   
Function value at final x = 3.6407413e-17   
Solve time                = 0.000033    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   DENSCHNC

 Problem name: DENSCHNC

 Double precision version will be formed

 The objective function uses 2 nonlinear groups
 
 There are 2 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: DENSCHNC (n = 2)
walltime at start:     0.000000
!!  DENSCHNC      2      12      26      14     0    3.2760930e-09    3.2531884e-19    0.000050

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 3.276093e-09 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : DENSCHNC
# variables               = 2         

# cg iterations           = 12        

# cg function evals       = 26        

# cg gradient evals       = 14        

|| g ||                   = 3.2760930e-09   
Final f                   = 3.2531884e-19   
Function value at final x = 3.2531884e-19   
Solve time                = 0.000050    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   DENSCHND

 Problem name: DENSCHND

 Double precision version will be formed

 The objective function uses 3 nonlinear groups
 
 There are 3 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: DENSCHND (n = 3)
walltime at start:     0.000001
!!  DENSCHND      3      43      89      46     0    1.9002489e-07    6.1976908e-10    0.000098

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 1.900249e-07 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : DENSCHND
# variables               = 3         

# cg iterations           = 43        

# cg function evals       = 89        

# cg gradient evals       = 46        

|| g ||                   = 1.9002489e-07   
Final f                   = 6.1976908e-10   
Function value at final x = 6.1976908e-10   
Solve time                = 0.000098    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   DENSCHNE

 Problem name: DENSCHNE

 Double precision version will be formed

 The objective function uses 1 linear group
 The objective function uses 2 nonlinear groups
 
 There are 3 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: DENSCHNE (n = 3)
walltime at start:     0.000001
!!  DENSCHNE      3      17      47      30     0    5.6950746e-08    1.0066394e-15    0.000068

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 5.695075e-08 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : DENSCHNE
# variables               = 3         

# cg iterations           = 17        

# cg function evals       = 47        

# cg gradient evals       = 30        

|| g ||                   = 5.6950746e-08   
Final f                   = 1.0066394e-15   
Function value at final x = 1.0066394e-15   
Solve time                = 0.000068    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   DENSCHNF

 Problem name: DENSCHNF

 Double precision version will be formed

 The objective function uses 2 nonlinear groups
 
 There are 2 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: DENSCHNF (n = 2)
walltime at start:     0.000001
!!  DENSCHNF      2       8      17       9     0    6.4551431e-07    2.1261987e-15    0.000038

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 6.455143e-07 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : DENSCHNF
# variables               = 2         

# cg iterations           = 8         

# cg function evals       = 17        

# cg gradient evals       = 9         

|| g ||                   = 6.4551431e-07   
Final f                   = 2.1261987e-15   
Function value at final x = 2.1261987e-15   
Solve time                = 0.000038    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   DIXMAANA

 Problem name: DIXMAANA

 Double precision version will be formed

 The objective function uses 4 nonlinear groups
 
 There are 3000 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: DIXMAANA (n = 3000)
walltime at start:     0.000000
!!  DIXMAANA   3000       7      15       8     0    4.8306833e-12    1.0000000e+00    0.002136

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 4.830683e-12 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : DIXMAANA
# variables               = 3000      

# cg iterations           = 7         

# cg function evals       = 15        

# cg gradient evals       = 8         

|| g ||                   = 4.8306833e-12   
Final f                   = 1.0000000e+00   
Function value at final x = 1.0000000e+00   
Solve time                = 0.002136    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   DIXMAANB

 Problem name: DIXMAANB

 Double precision version will be formed

 The objective function uses 4 nonlinear groups
 
 There are 3000 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: DIXMAANB (n = 3000)
walltime at start:     0.000001
!!  DIXMAANB   3000       6      13       7     0    8.9774746e-08    1.0000000e+00    0.001872

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 8.977475e-08 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : DIXMAANB
# variables               = 3000      

# cg iterations           = 6         

# cg function evals       = 13        

# cg gradient evals       = 7         

|| g ||                   = 8.9774746e-08   
Final f                   = 1.0000000e+00   
Function value at final x = 1.0000000e+00   
Solve time                = 0.001872    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   DIXMAANC

 Problem name: DIXMAANC

 Double precision version will be formed

 The objective function uses 4 nonlinear groups
 
 There are 3000 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: DIXMAANC (n = 3000)
walltime at start:     0.000001
!!  DIXMAANC   3000       6      13       7     0    7.0332716e-07    1.0000000e+00    0.001871

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 7.033272e-07 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : DIXMAANC
# variables               = 3000      

# cg iterations           = 6         

# cg function evals       = 13        

# cg gradient evals       = 7         

|| g ||                   = 7.0332716e-07   
Final f                   = 1.0000000e+00   
Function value at final x = 1.0000000e+00   
Solve time                = 0.001871    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   DIXMAAND

 Problem name: DIXMAAND

 Double precision version will be formed

 The objective function uses 4 nonlinear groups
 
 There are 3000 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: DIXMAAND (n = 3000)
walltime at start:     0.000001
!!  DIXMAAND   3000       7      15       8     0    7.3560463e-07    1.0000000e+00    0.002148

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 7.356046e-07 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : DIXMAAND
# variables               = 3000      

# cg iterations           = 7         

# cg function evals       = 15        

# cg gradient evals       = 8         

|| g ||                   = 7.3560463e-07   
Final f                   = 1.0000000e+00   
Function value at final x = 1.0000000e+00   
Solve time                = 0.002148    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   DIXMAANE

 Problem name: DIXMAANE

 Double precision version will be formed

 The objective function uses 4 nonlinear groups
 
 There are 3000 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: DIXMAANE (n = 3000)
walltime at start:     0.000001
!!  DIXMAANE   3000     222     239     429     0    9.8403702e-07    1.0000000e+00    0.089689

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 9.840370e-07 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : DIXMAANE
# variables               = 3000      

# cg iterations           = 222       

# cg function evals       = 239       

# cg gradient evals       = 429       

|| g ||                   = 9.8403702e-07   
Final f                   = 1.0000000e+00   
Function value at final x = 1.0000000e+00   
Solve time                = 0.089689    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   DIXMAANF

 Problem name: DIXMAANF

 Double precision version will be formed

 The objective function uses 4 nonlinear groups
 
 There are 3000 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: DIXMAANF (n = 3000)
walltime at start:     0.000000
!!  DIXMAANF   3000     161     323     162     0    8.8563506e-07    1.0000000e+00    0.042408

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 8.856351e-07 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : DIXMAANF
# variables               = 3000      

# cg iterations           = 161       

# cg function evals       = 323       

# cg gradient evals       = 162       

|| g ||                   = 8.8563506e-07   
Final f                   = 1.0000000e+00   
Function value at final x = 1.0000000e+00   
Solve time                = 0.042408    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   DIXMAANG

 Problem name: DIXMAANG

 Double precision version will be formed

 The objective function uses 4 nonlinear groups
 
 There are 3000 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: DIXMAANG (n = 3000)
walltime at start:     0.000000
!!  DIXMAANG   3000     157     315     158     0    9.4422251e-07    1.0000000e+00    0.041233

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 9.442225e-07 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : DIXMAANG
# variables               = 3000      

# cg iterations           = 157       

# cg function evals       = 315       

# cg gradient evals       = 158       

|| g ||                   = 9.4422251e-07   
Final f                   = 1.0000000e+00   
Function value at final x = 1.0000000e+00   
Solve time                = 0.041233    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   DIXMAANH

 Problem name: DIXMAANH

 Double precision version will be formed

 The objective function uses 4 nonlinear groups
 
 There are 3000 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: DIXMAANH (n = 3000)
walltime at start:     0.000001
!!  DIXMAANH   3000     173     347     174     0    9.9204488e-07    1.0000000e+00    0.045571

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 9.920449e-07 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : DIXMAANH
# variables               = 3000      

# cg iterations           = 173       

# cg function evals       = 347       

# cg gradient evals       = 174       

|| g ||                   = 9.9204488e-07   
Final f                   = 1.0000000e+00   
Function value at final x = 1.0000000e+00   
Solve time                = 0.045571    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   DIXMAANI

 Problem name: DIXMAANI

 Double precision version will be formed

 The objective function uses 4 nonlinear groups
 
 There are 3000 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: DIXMAANI (n = 3000)
walltime at start:     0.000000
!!  DIXMAANI   3000    3754    3824    7440     0    9.7067715e-07    1.0000001e+00    1.455258

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 9.706771e-07 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : DIXMAANI
# variables               = 3000      

# cg iterations           = 3754      

# cg function evals       = 3824      

# cg gradient evals       = 7440      

|| g ||                   = 9.7067715e-07   
Final f                   = 1.0000001e+00   
Function value at final x = 1.0000001e+00   
Solve time                = 1.455258    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   DIXMAANJ

 Problem name: DIXMAANJ

 Double precision version will be formed

 The objective function uses 4 nonlinear groups
 
 There are 3000 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: DIXMAANJ (n = 3000)
walltime at start:     0.000001
!!  DIXMAANJ   3000     327     655     328     0    9.8677323e-07    1.0000002e+00    0.085426

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 9.867732e-07 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : DIXMAANJ
# variables               = 3000      

# cg iterations           = 327       

# cg function evals       = 655       

# cg gradient evals       = 328       

|| g ||                   = 9.8677323e-07   
Final f                   = 1.0000002e+00   
Function value at final x = 1.0000002e+00   
Solve time                = 0.085426    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   DIXMAANK

 Problem name: DIXMAANK

 Double precision version will be formed

 The objective function uses 4 nonlinear groups
 
 There are 3000 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: DIXMAANK (n = 3000)
walltime at start:     0.000000
!!  DIXMAANK   3000     283     567     284     0    9.4621288e-07    1.0000002e+00    0.073691

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 9.462129e-07 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : DIXMAANK
# variables               = 3000      

# cg iterations           = 283       

# cg function evals       = 567       

# cg gradient evals       = 284       

|| g ||                   = 9.4621288e-07   
Final f                   = 1.0000002e+00   
Function value at final x = 1.0000002e+00   
Solve time                = 0.073691    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   DIXMAANL

 Problem name: DIXMAANL

 Double precision version will be formed

 The objective function uses 4 nonlinear groups
 
 There are 3000 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: DIXMAANL (n = 3000)
walltime at start:     0.000000
!!  DIXMAANL   3000     237     475     238     0    9.6696144e-07    1.0000002e+00    0.062599

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 9.669614e-07 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : DIXMAANL
# variables               = 3000      

# cg iterations           = 237       

# cg function evals       = 475       

# cg gradient evals       = 238       

|| g ||                   = 9.6696144e-07   
Final f                   = 1.0000002e+00   
Function value at final x = 1.0000002e+00   
Solve time                = 0.062599    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   DIXMAANM

 Problem name: DIXMAANM

 Double precision version will be formed

 The objective function uses 4 nonlinear groups
 
 There are 3000 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: DIXMAANM (n = 3000)
walltime at start:     0.000001
!!  DIXMAANM   3000    4478    4533    8903     0    9.9536141e-07    1.0000001e+00    2.087280

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 9.953614e-07 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : DIXMAANM
# variables               = 3000      

# cg iterations           = 4478      

# cg function evals       = 4533      

# cg gradient evals       = 8903      

|| g ||                   = 9.9536141e-07   
Final f                   = 1.0000001e+00   
Function value at final x = 1.0000001e+00   
Solve time                = 2.087280    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   DIXMAANN

 Problem name: DIXMAANN

 Double precision version will be formed

 The objective function uses 4 nonlinear groups
 
 There are 3000 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: DIXMAANN (n = 3000)
walltime at start:     0.000001
!!  DIXMAANN   3000     698    1397     699     0    9.9855824e-07    1.0000003e+00    0.166126

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 9.985582e-07 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : DIXMAANN
# variables               = 3000      

# cg iterations           = 698       

# cg function evals       = 1397      

# cg gradient evals       = 699       

|| g ||                   = 9.9855824e-07   
Final f                   = 1.0000003e+00   
Function value at final x = 1.0000003e+00   
Solve time                = 0.166126    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   DIXMAANO

 Problem name: DIXMAANO

 Double precision version will be formed

 The objective function uses 4 nonlinear groups
 
 There are 3000 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: DIXMAANO (n = 3000)
walltime at start:     0.000001
!!  DIXMAANO   3000     623    1250     627     0    9.9991018e-07    1.0000003e+00    0.162374

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 9.999102e-07 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : DIXMAANO
# variables               = 3000      

# cg iterations           = 623       

# cg function evals       = 1250      

# cg gradient evals       = 627       

|| g ||                   = 9.9991018e-07   
Final f                   = 1.0000003e+00   
Function value at final x = 1.0000003e+00   
Solve time                = 0.162374    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   DIXMAANP

 Problem name: DIXMAANP

 Double precision version will be formed

 The objective function uses 4 nonlinear groups
 
 There are 3000 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: DIXMAANP (n = 3000)
walltime at start:     0.000000
!!  DIXMAANP   3000     686    1373     687     0    9.9695480e-07    1.0000003e+00    0.177571

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 9.969548e-07 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : DIXMAANP
# variables               = 3000      

# cg iterations           = 686       

# cg function evals       = 1373      

# cg gradient evals       = 687       

|| g ||                   = 9.9695480e-07   
Final f                   = 1.0000003e+00   
Function value at final x = 1.0000003e+00   
Solve time                = 0.177571    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   DIXON3DQ

 Problem name: DIXON3DQ

 Double precision version will be formed

 The objective function uses 10000 linear groups
 
 There are 10000 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: DIXON3DQ (n = 10000)
the problem has a quadratic objective
walltime at start:     0.000001
!!  DIXON3DQ  10000   10000       0   10001     0    4.4365070e-11    7.4953607e-16    0.915449

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 4.436507e-11 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : DIXON3DQ
# variables               = 10000     

# cg iterations           = 10000     

# cg function evals       = 0         

# cg gradient evals       = 10001     

|| g ||                   = 4.4365070e-11   
Final f                   = 7.4953607e-16   
Function value at final x = 2.0753733e-19   
Solve time                = 0.915449    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   DJTL

 Problem name: DJTL

 Double precision version will be formed

 The objective function uses 9 nonlinear groups
 
 There are 2 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: DJTL (n = 2)
walltime at start:     0.000001
!!      DJTL      2      76     882     809     0    3.8264909e-07   -8.9515447e+03    0.001602

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 3.826491e-07 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : DJTL
# variables               = 2         

# cg iterations           = 76        

# cg function evals       = 882       

# cg gradient evals       = 809       

|| g ||                   = 3.8264909e-07   
Final f                   = -8.9515447e+03  
Function value at final x = -8.9515447e+03  
Solve time                = 0.001602    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   DQDRTIC

 Problem name: DQDRTIC

 Double precision version will be formed

 The objective function uses 14994 linear groups
 
 There are 5000 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: DQDRTIC (n = 5000)
the problem has a quadratic objective
walltime at start:     0.000000
!!   DQDRTIC   5000       5       0       6     0    2.2053470e-11   -5.0515592e-10    0.000474

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 2.205347e-11 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : DQDRTIC
# variables               = 5000      

# cg iterations           = 5         

# cg function evals       = 0         

# cg gradient evals       = 6         

|| g ||                   = 2.2053470e-11   
Final f                   = -5.0515592e-10  
Function value at final x = 2.5896904e-24   
Solve time                = 0.000474    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   DQRTIC

 Problem name: DQRTIC

 Double precision version will be formed

 The objective function uses 5000 linear groups
 
 There are 5000 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: DQRTIC (n = 5000)
walltime at start:     0.000000
!!    DQRTIC   5000      21      51      30     0    4.9243335e-07    7.3281603e-08    0.006726

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 4.924334e-07 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : DQRTIC
# variables               = 5000      

# cg iterations           = 21        

# cg function evals       = 51        

# cg gradient evals       = 30        

|| g ||                   = 4.9243335e-07   
Final f                   = 7.3281603e-08   
Function value at final x = 7.3281603e-08   
Solve time                = 0.006726    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   EDENSCH

 Problem name: EDENSCH

 Double precision version will be formed

 The objective function uses 1999 linear groups
 The objective function uses 3999 nonlinear groups
 
 There are 2000 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: EDENSCH (n = 2000)
walltime at start:     0.000001
!!   EDENSCH   2000      28      56      40     0    9.5154869e-07    1.2003285e+04    0.013086

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 9.515487e-07 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : EDENSCH
# variables               = 2000      

# cg iterations           = 28        

# cg function evals       = 56        

# cg gradient evals       = 40        

|| g ||                   = 9.5154869e-07   
Final f                   = 1.2003285e+04   
Function value at final x = 1.2003285e+04   
Solve time                = 0.013086    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   EG2

 Problem name: EG2

 Double precision version will be formed

 The objective function uses 1000 nonlinear groups
 
 There are 1000 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: EG2 (n = 1000)
walltime at start:     0.000000
!!       EG2   1000       5      11       6     0    1.2434529e-08   -9.9894739e+02    0.001468

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 1.243453e-08 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : EG2
# variables               = 1000      

# cg iterations           = 5         

# cg function evals       = 11        

# cg gradient evals       = 6         

|| g ||                   = 1.2434529e-08   
Final f                   = -9.9894739e+02  
Function value at final x = -9.9894739e+02  
Solve time                = 0.001468    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   EIGENALS

 Problem name: EIGENALS

 Double precision version will be formed

 The objective function uses 2550 nonlinear groups
 
 There are 2550 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: EIGENALS (n = 2550)
walltime at start:     0.000001
!!  EIGENALS   2550   10772   19531   12798     0    9.7568473e-07    2.9513288e-11   59.467563

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 9.756847e-07 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : EIGENALS
# variables               = 2550      

# cg iterations           = 10772     

# cg function evals       = 19531     

# cg gradient evals       = 12798     

|| g ||                   = 9.7568473e-07   
Final f                   = 2.9513288e-11   
Function value at final x = 2.9513288e-11   
Solve time                = 59.467563   seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   EIGENBLS

 Problem name: EIGENBLS

 Double precision version will be formed

 The objective function uses 2550 nonlinear groups
 
 There are 2550 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: EIGENBLS (n = 2550)
walltime at start:     0.000001
!!  EIGENBLS   2550   26938   53877   26939     0    9.0552654e-07    6.3927358e-09  129.716283

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 9.055265e-07 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : EIGENBLS
# variables               = 2550      

# cg iterations           = 26938     

# cg function evals       = 53877     

# cg gradient evals       = 26939     

|| g ||                   = 9.0552654e-07   
Final f                   = 6.3927358e-09   
Function value at final x = 6.3927358e-09   
Solve time                = 129.716283  seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   EIGENCLS

 Problem name: EIGENCLS

 Double precision version will be formed

 The objective function uses 2652 nonlinear groups
 
 There are 2652 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: EIGENCLS (n = 2652)
walltime at start:     0.000000
!!  EIGENCLS   2652   10377   19792   11341     0    7.0462417e-07    1.3820286e-11   58.082955

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 7.046242e-07 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : EIGENCLS
# variables               = 2652      

# cg iterations           = 10377     

# cg function evals       = 19792     

# cg gradient evals       = 11341     

|| g ||                   = 7.0462417e-07   
Final f                   = 1.3820286e-11   
Function value at final x = 1.3820286e-11   
Solve time                = 58.082955   seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   ENGVAL1

 Problem name: ENGVAL1

 Double precision version will be formed

 The objective function uses 4999 linear groups
 The objective function uses 4999 nonlinear groups
 
 There are 5000 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: ENGVAL1 (n = 5000)
walltime at start:     0.000001
!!   ENGVAL1   5000      23      43      32     0    7.4150428e-07    5.5486684e+03    0.021183

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 7.415043e-07 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : ENGVAL1
# variables               = 5000      

# cg iterations           = 23        

# cg function evals       = 43        

# cg gradient evals       = 32        

|| g ||                   = 7.4150428e-07   
Final f                   = 5.5486684e+03   
Function value at final x = 5.5486684e+03   
Solve time                = 0.021183    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   ENGVAL2

 Problem name: ENGVAL2

 Double precision version will be formed

 The objective function uses 2 linear groups
 The objective function uses 3 nonlinear groups
 
 There are 3 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: ENGVAL2 (n = 3)
walltime at start:     0.000000
!!   ENGVAL2      3      29      62      34     0    6.7090689e-09    8.8025619e-21    0.000076

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 6.709069e-09 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : ENGVAL2
# variables               = 3         

# cg iterations           = 29        

# cg function evals       = 62        

# cg gradient evals       = 34        

|| g ||                   = 6.7090689e-09   
Final f                   = 8.8025619e-21   
Function value at final x = 8.8025619e-21   
Solve time                = 0.000076    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   ERRINROS

 Problem name: ERRINROS

 Double precision version will be formed

 The objective function uses 49 linear groups
 The objective function uses 49 nonlinear groups
 
 There are 50 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: ERRINROS (n = 50)
walltime at start:     0.000001
!!  ERRINROS     50    1338    2606    1598     0    8.1234305e-07    3.9904154e+01    0.017047

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 8.123430e-07 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : ERRINROS
# variables               = 50        

# cg iterations           = 1338      

# cg function evals       = 2606      

# cg gradient evals       = 1598      

|| g ||                   = 8.1234305e-07   
Final f                   = 3.9904154e+01   
Function value at final x = 3.9904154e+01   
Solve time                = 0.017047    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   ERRINRSM

 Problem name: ERRINRSM

 Double precision version will be formed

 The objective function uses 49 linear groups
 The objective function uses 49 nonlinear groups
 
 There are 50 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: ERRINRSM (n = 50)
walltime at start:     0.000001
!!  ERRINRSM     50   11807   23711   11960     0    8.9906864e-07    3.7729903e+01    0.139171

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 8.990686e-07 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : ERRINRSM
# variables               = 50        

# cg iterations           = 11807     

# cg function evals       = 23711     

# cg gradient evals       = 11960     

|| g ||                   = 8.9906864e-07   
Final f                   = 3.7729903e+01   
Function value at final x = 3.7729903e+01   
Solve time                = 0.139171    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   EXPFIT

 Problem name: EXPFIT

 Double precision version will be formed

 The objective function uses 10 nonlinear groups
 
 There are 2 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: EXPFIT (n = 2)
walltime at start:     0.000001
!!    EXPFIT      2      13      29      16     0    4.2083119e-07    2.4051059e-01    0.000075

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 4.208312e-07 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : EXPFIT
# variables               = 2         

# cg iterations           = 13        

# cg function evals       = 29        

# cg gradient evals       = 16        

|| g ||                   = 4.2083119e-07   
Final f                   = 2.4051059e-01   
Function value at final x = 2.4051059e-01   
Solve time                = 0.000075    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   EXTROSNB

 Problem name: EXTROSNB

 Double precision version will be formed

 The objective function uses 1 linear group
 The objective function uses 999 nonlinear groups
 
 There are 1000 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: EXTROSNB (n = 1000)
walltime at start:     0.000001
!!  EXTROSNB   1000    5076   10322    5246     0    7.2031115e-07    2.8074129e-07    0.570312

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 7.203111e-07 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : EXTROSNB
# variables               = 1000      

# cg iterations           = 5076      

# cg function evals       = 10322     

# cg gradient evals       = 5246      

|| g ||                   = 7.2031115e-07   
Final f                   = 2.8074129e-07   
Function value at final x = 2.8074129e-07   
Solve time                = 0.570312    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   FLETBV3M

 Problem name: FLETBV3M

 Double precision version will be formed

 The objective function uses 10002 nonlinear groups
 
 There are 5000 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: FLETBV3M (n = 5000)
walltime at start:     0.000000
!!  FLETBV3M   5000      29      63      37     0    6.7729467e-07   -2.4858979e+05    0.061524

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 6.772947e-07 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : FLETBV3M
# variables               = 5000      

# cg iterations           = 29        

# cg function evals       = 63        

# cg gradient evals       = 37        

|| g ||                   = 6.7729467e-07   
Final f                   = -2.4858979e+05  
Function value at final x = -2.4858979e+05  
Solve time                = 0.061524    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   FLETCBV2

 Problem name: FLETCBV2

 Double precision version will be formed

 The objective function uses 5000 linear groups
 The objective function uses 10001 nonlinear groups
 
 There are 5000 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: FLETCBV2 (n = 5000)
walltime at start:     0.000001
!!  FLETCBV2   5000       0       1       1     0    7.9960014e-08   -5.0026817e-01    0.000946

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 7.996001e-08 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : FLETCBV2
# variables               = 5000      

# cg iterations           = 0         

# cg function evals       = 1         

# cg gradient evals       = 1         

|| g ||                   = 7.9960014e-08   
Final f                   = -5.0026817e-01  
Function value at final x = -5.0026817e-01  
Solve time                = 0.000946    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   FLETCHCR

 Problem name: FLETCHCR

 Double precision version will be formed

 The objective function uses 999 linear groups
 The objective function uses 999 nonlinear groups
 
 There are 1000 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: FLETCHCR (n = 1000)
walltime at start:     0.000001
!!  FLETCHCR   1000     284     558     308     0    8.3257971e-07    1.1414150e-14    0.042834

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 8.325797e-07 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : FLETCHCR
# variables               = 1000      

# cg iterations           = 284       

# cg function evals       = 558       

# cg gradient evals       = 308       

|| g ||                   = 8.3257971e-07   
Final f                   = 1.1414150e-14   
Function value at final x = 1.1414150e-14   
Solve time                = 0.042834    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   FMINSRF2

 Problem name: FMINSRF2

 Double precision version will be formed

 The objective function uses 5477 nonlinear groups
 
 There are 5625 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: FMINSRF2 (n = 5625)
walltime at start:     0.000001
!!  FMINSRF2   5625     346     693     347     0    9.4411255e-07    1.0000241e+00    0.385492

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 9.441125e-07 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : FMINSRF2
# variables               = 5625      

# cg iterations           = 346       

# cg function evals       = 693       

# cg gradient evals       = 347       

|| g ||                   = 9.4411255e-07   
Final f                   = 1.0000241e+00   
Function value at final x = 1.0000241e+00   
Solve time                = 0.385492    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   FMINSURF

 Problem name: FMINSURF

 Double precision version will be formed

 The objective function uses 5477 nonlinear groups
 
 There are 5625 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: FMINSURF (n = 5625)
walltime at start:     0.000000
!!  FMINSURF   5625     473     947     474     0    9.7701254e-07    1.0000000e+00    0.494831

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 9.770125e-07 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : FMINSURF
# variables               = 5625      

# cg iterations           = 473       

# cg function evals       = 947       

# cg gradient evals       = 474       

|| g ||                   = 9.7701254e-07   
Final f                   = 1.0000000e+00   
Function value at final x = 1.0000000e+00   
Solve time                = 0.494831    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   FREUROTH

 Problem name: FREUROTH

 Double precision version will be formed

 The objective function uses 9998 nonlinear groups
 
 There are 5000 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: FREUROTH (n = 5000)
walltime at start:     0.000001
!!  FREUROTH   5000      23      53      39     0    8.8181917e-07    6.0815919e+05    0.037825

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 8.818192e-07 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : FREUROTH
# variables               = 5000      

# cg iterations           = 23        

# cg function evals       = 53        

# cg gradient evals       = 39        

|| g ||                   = 8.8181917e-07   
Final f                   = 6.0815919e+05   
Function value at final x = 6.0815919e+05   
Solve time                = 0.037825    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   GENHUMPS

 Problem name: GENHUMPS

 Double precision version will be formed

 The objective function uses 1 nonlinear group
 
 There are 5000 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: GENHUMPS (n = 5000)
walltime at start:     0.000000
!!  GENHUMPS   5000   16870   33799   16930     0    1.5424709e-09    1.0339232e-17   22.358590

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 1.542471e-09 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : GENHUMPS
# variables               = 5000      

# cg iterations           = 16870     

# cg function evals       = 33799     

# cg gradient evals       = 16930     

|| g ||                   = 1.5424709e-09   
Final f                   = 1.0339232e-17   
Function value at final x = 1.0339232e-17   
Solve time                = 22.358590   seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   GENROSE

 Problem name: GENROSE

 Double precision version will be formed

 The objective function uses 500 linear groups
 The objective function uses 499 nonlinear groups
 
 There are 500 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: GENROSE (n = 500)
walltime at start:     0.000000
!!   GENROSE    500    1073    2161    1096     0    5.5912374e-07    1.0000000e+00    0.076792

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 5.591237e-07 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : GENROSE
# variables               = 500       

# cg iterations           = 1073      

# cg function evals       = 2161      

# cg gradient evals       = 1096      

|| g ||                   = 5.5912374e-07   
Final f                   = 1.0000000e+00   
Function value at final x = 1.0000000e+00   
Solve time                = 0.076792    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   GROWTHLS

 Problem name: GROWTHLS

 Double precision version will be formed

 The objective function uses 12 nonlinear groups
 
 There are 3 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: GROWTHLS (n = 3)
walltime at start:     0.000000
!!  GROWTHLS      3     133     430     289     0    2.8618672e-09    1.0040406e+00    0.001554

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 2.861867e-09 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : GROWTHLS
# variables               = 3         

# cg iterations           = 133       

# cg function evals       = 430       

# cg gradient evals       = 289       

|| g ||                   = 2.8618672e-09   
Final f                   = 1.0040406e+00   
Function value at final x = 1.0040406e+00   
Solve time                = 0.001554    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   GULF

 Problem name: GULF

 Double precision version will be formed

 The objective function uses 99 nonlinear groups
 
 There are 3 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: GULF (n = 3)
walltime at start:     0.000000
!!      GULF      3      37      92      55     0    3.8480274e-08    7.6878307e-15    0.004480

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 3.848027e-08 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : GULF
# variables               = 3         

# cg iterations           = 37        

# cg function evals       = 92        

# cg gradient evals       = 55        

|| g ||                   = 3.8480274e-08   
Final f                   = 7.6878307e-15   
Function value at final x = 7.6878307e-15   
Solve time                = 0.004480    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   HAIRY

 Problem name: HAIRY

 Double precision version will be formed

 The objective function uses 1 nonlinear group
 
 There are 2 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: HAIRY (n = 2)
walltime at start:     0.000001
!!     HAIRY      2      24      74      52     0    4.5217323e-10    2.0000000e+01    0.000117

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 4.521732e-10 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : HAIRY
# variables               = 2         

# cg iterations           = 24        

# cg function evals       = 74        

# cg gradient evals       = 52        

|| g ||                   = 4.5217323e-10   
Final f                   = 2.0000000e+01   
Function value at final x = 2.0000000e+01   
Solve time                = 0.000117    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   HATFLDD

 Problem name: HATFLDD

 Double precision version will be formed

 The objective function uses 10 nonlinear groups
 
 There are 3 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: HATFLDD (n = 3)
walltime at start:     0.000001
!!   HATFLDD      3      19      42      23     0    3.1155866e-07    2.5469009e-07    0.000126

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 3.115587e-07 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : HATFLDD
# variables               = 3         

# cg iterations           = 19        

# cg function evals       = 42        

# cg gradient evals       = 23        

|| g ||                   = 3.1155866e-07   
Final f                   = 2.5469009e-07   
Function value at final x = 2.5469009e-07   
Solve time                = 0.000126    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   HATFLDE

 Problem name: HATFLDE

 Double precision version will be formed

 The objective function uses 21 nonlinear groups
 
 There are 3 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: HATFLDE (n = 3)
walltime at start:     0.000000
!!   HATFLDE      3      29      79      50     0    1.6745412e-07    5.1203769e-07    0.000339

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 1.674541e-07 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : HATFLDE
# variables               = 3         

# cg iterations           = 29        

# cg function evals       = 79        

# cg gradient evals       = 50        

|| g ||                   = 1.6745412e-07   
Final f                   = 5.1203769e-07   
Function value at final x = 5.1203769e-07   
Solve time                = 0.000339    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   HATFLDFL

 Problem name: HATFLDFL

 Double precision version will be formed

 The objective function uses 3 nonlinear groups
 
 There are 3 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: HATFLDFL (n = 3)
walltime at start:     0.000001
!!  HATFLDFL      3      39      93      54     0    7.1641030e-07    6.3266268e-05    0.000096

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 7.164103e-07 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : HATFLDFL
# variables               = 3         

# cg iterations           = 39        

# cg function evals       = 93        

# cg gradient evals       = 54        

|| g ||                   = 7.1641030e-07   
Final f                   = 6.3266268e-05   
Function value at final x = 6.3266268e-05   
Solve time                = 0.000096    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   HEART6LS

 Problem name: HEART6LS

 Double precision version will be formed

 The objective function uses 6 nonlinear groups
 
 There are 6 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: HEART6LS (n = 6)
walltime at start:     0.000001
!!  HEART6LS      6     661    1603     942     0    8.2442952e-08    2.0434367e-16    0.002444

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 8.244295e-08 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : HEART6LS
# variables               = 6         

# cg iterations           = 661       

# cg function evals       = 1603      

# cg gradient evals       = 942       

|| g ||                   = 8.2442952e-08   
Final f                   = 2.0434367e-16   
Function value at final x = 2.0434367e-16   
Solve time                = 0.002444    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   HEART8LS

 Problem name: HEART8LS

 Double precision version will be formed

 The objective function uses 2 linear groups
 The objective function uses 6 nonlinear groups
 
 There are 8 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: HEART8LS (n = 8)
walltime at start:     0.000000
!!  HEART8LS      8     279     581     302     0    8.2390325e-08    1.2350888e-17    0.000894

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 8.239033e-08 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : HEART8LS
# variables               = 8         

# cg iterations           = 279       

# cg function evals       = 581       

# cg gradient evals       = 302       

|| g ||                   = 8.2390325e-08   
Final f                   = 1.2350888e-17   
Function value at final x = 1.2350888e-17   
Solve time                = 0.000894    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   HELIX

 Problem name: HELIX

 Double precision version will be formed

 The objective function uses 1 linear group
 The objective function uses 2 nonlinear groups
 
 There are 3 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: HELIX (n = 3)
walltime at start:     0.000000
!!     HELIX      3      23      50      27     0    5.6033548e-07    1.0462137e-15    0.000074

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 5.603355e-07 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : HELIX
# variables               = 3         

# cg iterations           = 23        

# cg function evals       = 50        

# cg gradient evals       = 27        

|| g ||                   = 5.6033548e-07   
Final f                   = 1.0462137e-15   
Function value at final x = 1.0462137e-15   
Solve time                = 0.000074    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   HIELOW

 Problem name: HIELOW

 Double precision version will be formed

 The objective function uses 1 nonlinear group
 
 There are 3 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: HIELOW (n = 3)
walltime at start:     0.000001
!!    HIELOW      3      14      30      16     0    4.4008730e-07    8.7416543e+02    0.021525

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 4.400873e-07 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : HIELOW
# variables               = 3         

# cg iterations           = 14        

# cg function evals       = 30        

# cg gradient evals       = 16        

|| g ||                   = 4.4008730e-07   
Final f                   = 8.7416543e+02   
Function value at final x = 8.7416543e+02   
Solve time                = 0.021525    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   HILBERTA

 Problem name: HILBERTA

 Double precision version will be formed

 The objective function uses 3 nonlinear groups
 
 There are 2 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: HILBERTA (n = 2)
the problem has a quadratic objective
walltime at start:     0.000001
!!  HILBERTA      2       2       0       3     0    2.2065683e-14    1.3183898e-16    0.000014

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 2.206568e-14 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : HILBERTA
# variables               = 2         

# cg iterations           = 2         

# cg function evals       = 0         

# cg gradient evals       = 3         

|| g ||                   = 2.2065683e-14   
Final f                   = 1.3183898e-16   
Function value at final x = 2.6045558e-28   
Solve time                = 0.000014    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   HILBERTB

 Problem name: HILBERTB

 Double precision version will be formed

 The objective function uses 55 nonlinear groups
 
 There are 10 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: HILBERTB (n = 10)
the problem has a quadratic objective
walltime at start:     0.000000
!!  HILBERTB     10       4       0       5     0    2.2720367e-09    1.9755976e-14    0.000017

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 2.272037e-09 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : HILBERTB
# variables               = 10        

# cg iterations           = 4         

# cg function evals       = 0         

# cg gradient evals       = 5         

|| g ||                   = 2.2720367e-09   
Final f                   = 1.9755976e-14   
Function value at final x = 9.9477316e-19   
Solve time                = 0.000017    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   HIMMELBB

 Problem name: HIMMELBB

 Double precision version will be formed

 The objective function uses 1 nonlinear group
 
 There are 2 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: HIMMELBB (n = 2)
walltime at start:     0.000002
!!  HIMMELBB      2       8      28      20     0    6.2805676e-08    6.4619801e-14    0.000039

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 6.280568e-08 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : HIMMELBB
# variables               = 2         

# cg iterations           = 8         

# cg function evals       = 28        

# cg gradient evals       = 20        

|| g ||                   = 6.2805676e-08   
Final f                   = 6.4619801e-14   
Function value at final x = 6.4619801e-14   
Solve time                = 0.000039    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   HIMMELBF

 Problem name: HIMMELBF

 Double precision version will be formed

 The objective function uses 7 nonlinear groups
 
 There are 4 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: HIMMELBF (n = 4)
walltime at start:     0.000001
!!  HIMMELBF      4      26      60      36     0    3.7446603e-07    3.1857175e+02    0.000095

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 3.744660e-07 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : HIMMELBF
# variables               = 4         

# cg iterations           = 26        

# cg function evals       = 60        

# cg gradient evals       = 36        

|| g ||                   = 3.7446603e-07   
Final f                   = 3.1857175e+02   
Function value at final x = 3.1857175e+02   
Solve time                = 0.000095    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   HIMMELBG

 Problem name: HIMMELBG

 Double precision version will be formed

 The objective function uses 1 nonlinear group
 
 There are 2 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: HIMMELBG (n = 2)
walltime at start:     0.000001
!!  HIMMELBG      2       9      24      16     0    6.6437473e-09    4.8623496e-18    0.000045

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 6.643747e-09 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : HIMMELBG
# variables               = 2         

# cg iterations           = 9         

# cg function evals       = 24        

# cg gradient evals       = 16        

|| g ||                   = 6.6437473e-09   
Final f                   = 4.8623496e-18   
Function value at final x = 4.8623496e-18   
Solve time                = 0.000045    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   HIMMELBH

 Problem name: HIMMELBH

 Double precision version will be formed

 The objective function uses 1 nonlinear group
 
 There are 2 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: HIMMELBH (n = 2)
walltime at start:     0.000001
!!  HIMMELBH      2       7      16       9     0    2.9620306e-11   -1.0000000e+00    0.000051

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 2.962031e-11 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : HIMMELBH
# variables               = 2         

# cg iterations           = 7         

# cg function evals       = 16        

# cg gradient evals       = 9         

|| g ||                   = 2.9620306e-11   
Final f                   = -1.0000000e+00  
Function value at final x = -1.0000000e+00  
Solve time                = 0.000051    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   HUMPS

 Problem name: HUMPS

 Double precision version will be formed

 The objective function uses 1 nonlinear group
 
 There are 2 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: HUMPS (n = 2)
walltime at start:     0.000000
!!     HUMPS      2      37     119      82     0    4.3590465e-08    1.1395503e-14    0.000104

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 4.359047e-08 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : HUMPS
# variables               = 2         

# cg iterations           = 37        

# cg function evals       = 119       

# cg gradient evals       = 82        

|| g ||                   = 4.3590465e-08   
Final f                   = 1.1395503e-14   
Function value at final x = 1.1395503e-14   
Solve time                = 0.000104    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   INDEFM

 Problem name: INDEFM

 Double precision version will be formed

 The objective function uses 199998 nonlinear groups
 
 There are 100000 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: INDEFM (n = 100000)
walltime at start:     0.000000
!!    INDEFM 100000     246     625     430     0    8.9934578e-07   -1.0044328e+07    9.980599

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 8.993458e-07 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : INDEFM
# variables               = 100000    

# cg iterations           = 246       

# cg function evals       = 625       

# cg gradient evals       = 430       

|| g ||                   = 8.9934578e-07   
Final f                   = -1.0044328e+07  
Function value at final x = -1.0044328e+07  
Solve time                = 9.980599    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   JENSMP

 Problem name: JENSMP

 Double precision version will be formed

 The objective function uses 10 nonlinear groups
 
 There are 2 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: JENSMP (n = 2)
walltime at start:     0.000001
!!    JENSMP      2      15      33      22     0    5.3069016e-10    1.2436218e+02    0.000112

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 5.306902e-10 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : JENSMP
# variables               = 2         

# cg iterations           = 15        

# cg function evals       = 33        

# cg gradient evals       = 22        

|| g ||                   = 5.3069016e-10   
Final f                   = 1.2436218e+02   
Function value at final x = 1.2436218e+02   
Solve time                = 0.000112    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   JIMACK

 Problem name: JIMACK

 Double precision version will be formed

 The objective function uses 1 nonlinear group
 
 There are 3549 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: JIMACK (n = 3549)
walltime at start:     0.000001
!!    JIMACK   3549    8317   16635    8318     0    9.3995640e-07    8.6679330e-01  392.788586

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 9.399564e-07 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : JIMACK
# variables               = 3549      

# cg iterations           = 8317      

# cg function evals       = 16635     

# cg gradient evals       = 8318      

|| g ||                   = 9.3995640e-07   
Final f                   = 8.6679330e-01   
Function value at final x = 8.6679330e-01   
Solve time                = 392.788586  seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   KOWOSB

 Problem name: KOWOSB

 Double precision version will be formed

 The objective function uses 11 nonlinear groups
 
 There are 4 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: KOWOSB (n = 4)
walltime at start:     0.000001
!!    KOWOSB      4      17      42      25     0    9.6133707e-07    3.0780095e-04    0.000086

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 9.613371e-07 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : KOWOSB
# variables               = 4         

# cg iterations           = 17        

# cg function evals       = 42        

# cg gradient evals       = 25        

|| g ||                   = 9.6133707e-07   
Final f                   = 3.0780095e-04   
Function value at final x = 3.0780095e-04   
Solve time                = 0.000086    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   LIARWHD

 Problem name: LIARWHD

 Double precision version will be formed

 The objective function uses 5000 linear groups
 The objective function uses 5000 nonlinear groups
 
 There are 5000 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: LIARWHD (n = 5000)
walltime at start:     0.000001
!!   LIARWHD   5000      17      38      21     0    3.0028894e-07    2.5312134e-18    0.013603

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 3.002889e-07 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : LIARWHD
# variables               = 5000      

# cg iterations           = 17        

# cg function evals       = 38        

# cg gradient evals       = 21        

|| g ||                   = 3.0028894e-07   
Final f                   = 2.5312134e-18   
Function value at final x = 2.5312134e-18   
Solve time                = 0.013603    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   LOGHAIRY

 Problem name: LOGHAIRY

 Double precision version will be formed

 The objective function uses 1 nonlinear group
 
 There are 2 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: LOGHAIRY (n = 2)
walltime at start:     0.000001
!!  LOGHAIRY      2      22      67      46     0    4.1593002e-07    1.8232156e-01    0.000134

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 4.159300e-07 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : LOGHAIRY
# variables               = 2         

# cg iterations           = 22        

# cg function evals       = 67        

# cg gradient evals       = 46        

|| g ||                   = 4.1593002e-07   
Final f                   = 1.8232156e-01   
Function value at final x = 1.8232156e-01   
Solve time                = 0.000134    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   MANCINO

 Problem name: MANCINO

 Double precision version will be formed

 The objective function uses 100 nonlinear groups
 
 There are 100 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: MANCINO (n = 100)
walltime at start:     0.000001
!!   MANCINO    100      11      23      12     0    7.2392005e-08    9.2313203e-21    0.047100

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 7.239200e-08 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : MANCINO
# variables               = 100       

# cg iterations           = 11        

# cg function evals       = 23        

# cg gradient evals       = 12        

|| g ||                   = 7.2392005e-08   
Final f                   = 9.2313203e-21   
Function value at final x = 9.2313203e-21   
Solve time                = 0.047100    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   MARATOSB

 Problem name: MARATOSB

 Double precision version will be formed

 The objective function uses 1 linear group
 The objective function uses 1 nonlinear group
 
 There are 2 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: MARATOSB (n = 2)
walltime at start:     0.000001
!!  MARATOSB      2    1067    3774    2711     0    9.3418273e-11   -1.0000001e+00    0.002576

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 9.341827e-11 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : MARATOSB
# variables               = 2         

# cg iterations           = 1067      

# cg function evals       = 3774      

# cg gradient evals       = 2711      

|| g ||                   = 9.3418273e-11   
Final f                   = -1.0000001e+00  
Function value at final x = -1.0000001e+00  
Solve time                = 0.002576    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   MEXHAT

 Problem name: MEXHAT

 Double precision version will be formed

 The objective function uses 2 nonlinear groups
 
 There are 2 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: MEXHAT (n = 2)
walltime at start:     0.000001
!!    MEXHAT      2      15      50      39     0    5.3989702e-11   -4.0010000e-02    0.000088

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 5.398970e-11 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : MEXHAT
# variables               = 2         

# cg iterations           = 15        

# cg function evals       = 50        

# cg gradient evals       = 39        

|| g ||                   = 5.3989702e-11   
Final f                   = -4.0010000e-02  
Function value at final x = -4.0010000e-02  
Solve time                = 0.000088    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   MOREBV

 Problem name: MOREBV

 Double precision version will be formed

 The objective function uses 5000 nonlinear groups
 
 There are 5000 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: MOREBV (n = 5000)
walltime at start:     0.000000
!!    MOREBV   5000     161     168     317     0    9.9408232e-07    1.0864330e-10    0.153830

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 9.940823e-07 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : MOREBV
# variables               = 5000      

# cg iterations           = 161       

# cg function evals       = 168       

# cg gradient evals       = 317       

|| g ||                   = 9.9408232e-07   
Final f                   = 1.0864330e-10   
Function value at final x = 1.0864330e-10   
Solve time                = 0.153830    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   MSQRTALS

 Problem name: MSQRTALS

 Double precision version will be formed

 The objective function uses 1024 nonlinear groups
 
 There are 1024 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: MSQRTALS (n = 1024)
walltime at start:     0.000000
!!  MSQRTALS   1024    2927    5857    2931     0    9.8080911e-07    6.6252836e-10    2.959286

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 9.808091e-07 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : MSQRTALS
# variables               = 1024      

# cg iterations           = 2927      

# cg function evals       = 5857      

# cg gradient evals       = 2931      

|| g ||                   = 9.8080911e-07   
Final f                   = 6.6252836e-10   
Function value at final x = 6.6252836e-10   
Solve time                = 2.959286    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   MSQRTBLS

 Problem name: MSQRTBLS

 Double precision version will be formed

 The objective function uses 1024 nonlinear groups
 
 There are 1024 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: MSQRTBLS (n = 1024)
walltime at start:     0.000001
!!  MSQRTBLS   1024    2281    4565    2285     0    9.9919027e-07    9.5261987e-11    2.264016

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 9.991903e-07 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : MSQRTBLS
# variables               = 1024      

# cg iterations           = 2281      

# cg function evals       = 4565      

# cg gradient evals       = 2285      

|| g ||                   = 9.9919027e-07   
Final f                   = 9.5261987e-11   
Function value at final x = 9.5261987e-11   
Solve time                = 2.264016    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   NCB20

 Problem name: NCB20

 Double precision version will be formed

 The objective function uses 5001 nonlinear groups
 
 There are 5010 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: NCB20 (n = 5010)
walltime at start:     0.000000
!!     NCB20   5010    2596    4223    4733     0    6.2318023e-07   -1.1174683e+03   14.151619

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 6.231802e-07 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : NCB20
# variables               = 5010      

# cg iterations           = 2596      

# cg function evals       = 4223      

# cg gradient evals       = 4733      

|| g ||                   = 6.2318023e-07   
Final f                   = -1.1174683e+03  
Function value at final x = -1.1174683e+03  
Solve time                = 14.151619   seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   NCB20B

 Problem name: NCB20B

 Double precision version will be formed

 The objective function uses 5000 nonlinear groups
 
 There are 5000 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: NCB20B (n = 5000)
walltime at start:     0.000001
!!    NCB20B   5000    3192    5010    6669     0    9.4876644e-07    7.3513006e+03   19.379067

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 9.487664e-07 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : NCB20B
# variables               = 5000      

# cg iterations           = 3192      

# cg function evals       = 5010      

# cg gradient evals       = 6669      

|| g ||                   = 9.4876644e-07   
Final f                   = 7.3513006e+03   
Function value at final x = 7.3513006e+03   
Solve time                = 19.379067   seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   NONCVXU2

 Problem name: NONCVXU2

 Double precision version will be formed

 The objective function uses 1 nonlinear group
 
 There are 5000 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: NONCVXU2 (n = 5000)
walltime at start:     0.000001
!!  NONCVXU2   5000    6740   12777    7445     0    9.6555603e-07    1.1584984e+04    7.294544

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 9.655560e-07 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : NONCVXU2
# variables               = 5000      

# cg iterations           = 6740      

# cg function evals       = 12777     

# cg gradient evals       = 7445      

|| g ||                   = 9.6555603e-07   
Final f                   = 1.1584984e+04   
Function value at final x = 1.1584984e+04   
Solve time                = 7.294544    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   NONDIA

 Problem name: NONDIA

 Double precision version will be formed

 The objective function uses 5000 nonlinear groups
 
 There are 5000 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: NONDIA (n = 5000)
walltime at start:     0.000001
!!    NONDIA   5000       6      25      19     0    1.0101924e-07    1.1011133e-20    0.009578

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 1.010192e-07 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : NONDIA
# variables               = 5000      

# cg iterations           = 6         

# cg function evals       = 25        

# cg gradient evals       = 19        

|| g ||                   = 1.0101924e-07   
Final f                   = 1.1011133e-20   
Function value at final x = 1.1011133e-20   
Solve time                = 0.009578    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   NONDQUAR

 Problem name: NONDQUAR

 Double precision version will be formed

 The objective function uses 5000 nonlinear groups
 
 There are 5000 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: NONDQUAR (n = 5000)
walltime at start:     0.000002
!!  NONDQUAR   5000    2066    4139    2073     0    8.5389045e-07    3.0061041e-06    0.620749

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 8.538904e-07 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : NONDQUAR
# variables               = 5000      

# cg iterations           = 2066      

# cg function evals       = 4139      

# cg gradient evals       = 2073      

|| g ||                   = 8.5389045e-07   
Final f                   = 3.0061041e-06   
Function value at final x = 3.0061041e-06   
Solve time                = 0.620749    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   OSBORNEA

 Problem name: OSBORNEA

 Double precision version will be formed

 The objective function uses 33 nonlinear groups
 
 There are 5 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: OSBORNEA (n = 5)
walltime at start:     0.000000
!!  OSBORNEA      5      67     157      90     0    4.0533134e-07    5.4652996e-05    0.000906

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 4.053313e-07 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : OSBORNEA
# variables               = 5         

# cg iterations           = 67        

# cg function evals       = 157       

# cg gradient evals       = 90        

|| g ||                   = 4.0533134e-07   
Final f                   = 5.4652996e-05   
Function value at final x = 5.4652996e-05   
Solve time                = 0.000906    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   OSBORNEB

 Problem name: OSBORNEB

 Double precision version will be formed

 The objective function uses 65 nonlinear groups
 
 There are 11 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: OSBORNEB (n = 11)
walltime at start:     0.000001
!!  OSBORNEB     11      62     127      65     0    4.3772597e-07    4.0137736e-02    0.002437

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 4.377260e-07 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : OSBORNEB
# variables               = 11        

# cg iterations           = 62        

# cg function evals       = 127       

# cg gradient evals       = 65        

|| g ||                   = 4.3772597e-07   
Final f                   = 4.0137736e-02   
Function value at final x = 4.0137736e-02   
Solve time                = 0.002437    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   OSCIGRAD

 Problem name: OSCIGRAD

 Double precision version will be formed

 The objective function uses 100000 nonlinear groups
 
 There are 100000 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: OSCIGRAD (n = 100000)
walltime at start:     0.000001
!!  OSCIGRAD 100000      87     144     121     0    6.6369132e-07    3.6368841e-20    1.599515

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 6.636913e-07 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : OSCIGRAD
# variables               = 100000    

# cg iterations           = 87        

# cg function evals       = 144       

# cg gradient evals       = 121       

|| g ||                   = 6.6369132e-07   
Final f                   = 3.6368841e-20   
Function value at final x = 3.6368841e-20   
Solve time                = 1.599515    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   OSCIPATH

 Problem name: OSCIPATH

 Double precision version will be formed

 The objective function uses 10 nonlinear groups
 
 There are 10 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: OSCIPATH (n = 10)
walltime at start:     0.000001
!!  OSCIPATH     10  307869  667457  360238     0    9.9275643e-07    2.3127114e-05    0.821266

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 9.927564e-07 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : OSCIPATH
# variables               = 10        

# cg iterations           = 307869    

# cg function evals       = 667457    

# cg gradient evals       = 360238    

|| g ||                   = 9.9275643e-07   
Final f                   = 2.3127114e-05   
Function value at final x = 2.3127114e-05   
Solve time                = 0.821266    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   PALMER1C

 Problem name: PALMER1C

 Double precision version will be formed

 The objective function uses 35 nonlinear groups
 
 There are 8 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: PALMER1C (n = 8)
the problem has a quadratic objective
walltime at start:     0.000001
!!  PALMER1C      8      16       0      19     0    2.4244819e-09    9.7604956e-02    0.000028

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 2.424482e-09 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : PALMER1C
# variables               = 8         

# cg iterations           = 16        

# cg function evals       = 0         

# cg gradient evals       = 19        

|| g ||                   = 2.4244819e-09   
Final f                   = 9.7604956e-02   
Function value at final x = 9.7605048e-02   
Solve time                = 0.000028    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   PALMER1D

 Problem name: PALMER1D

 Double precision version will be formed

 The objective function uses 35 nonlinear groups
 
 There are 7 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: PALMER1D (n = 7)
the problem has a quadratic objective
walltime at start:     0.000001
!!  PALMER1D      7       8       0      10     0    1.9908839e-09    6.5267393e-01    0.000023

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 1.990884e-09 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : PALMER1D
# variables               = 7         

# cg iterations           = 8         

# cg function evals       = 0         

# cg gradient evals       = 10        

|| g ||                   = 1.9908839e-09   
Final f                   = 6.5267393e-01   
Function value at final x = 6.5267398e-01   
Solve time                = 0.000023    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   PALMER2C

 Problem name: PALMER2C

 Double precision version will be formed

 The objective function uses 23 nonlinear groups
 
 There are 8 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: PALMER2C (n = 8)
the problem has a quadratic objective
walltime at start:     0.000001
!!  PALMER2C      8      16       0      19     0    3.4370657e-09    1.4368901e-02    0.000023

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 3.437066e-09 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : PALMER2C
# variables               = 8         

# cg iterations           = 16        

# cg function evals       = 0         

# cg gradient evals       = 19        

|| g ||                   = 3.4370657e-09   
Final f                   = 1.4368901e-02   
Function value at final x = 1.4368886e-02   
Solve time                = 0.000023    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   PALMER3C

 Problem name: PALMER3C

 Double precision version will be formed

 The objective function uses 23 nonlinear groups
 
 There are 8 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: PALMER3C (n = 8)
the problem has a quadratic objective
walltime at start:     0.000001
!!  PALMER3C      8       9       0      11     0    2.6737155e-09    1.9537629e-02    0.000023

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 2.673715e-09 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : PALMER3C
# variables               = 8         

# cg iterations           = 9         

# cg function evals       = 0         

# cg gradient evals       = 11        

|| g ||                   = 2.6737155e-09   
Final f                   = 1.9537629e-02   
Function value at final x = 1.9537639e-02   
Solve time                = 0.000023    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   PALMER4C

 Problem name: PALMER4C

 Double precision version will be formed

 The objective function uses 23 nonlinear groups
 
 There are 8 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: PALMER4C (n = 8)
the problem has a quadratic objective
walltime at start:     0.000001
!!  PALMER4C      8      10       0      13     0    1.0183288e-14    5.0310635e-02    0.000023

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 1.018329e-14 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : PALMER4C
# variables               = 8         

# cg iterations           = 10        

# cg function evals       = 0         

# cg gradient evals       = 13        

|| g ||                   = 1.0183288e-14   
Final f                   = 5.0310635e-02   
Function value at final x = 5.0310687e-02   
Solve time                = 0.000023    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   PALMER5C

 Problem name: PALMER5C

 Double precision version will be formed

 The objective function uses 12 nonlinear groups
 
 There are 6 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: PALMER5C (n = 6)
walltime at start:     0.000001
!!  PALMER5C      6       6      13       7     0    3.7526926e-12    2.1280866e+00    0.000036

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 3.752693e-12 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : PALMER5C
# variables               = 6         

# cg iterations           = 6         

# cg function evals       = 13        

# cg gradient evals       = 7         

|| g ||                   = 3.7526926e-12   
Final f                   = 2.1280866e+00   
Function value at final x = 2.1280866e+00   
Solve time                = 0.000036    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   PALMER6C

 Problem name: PALMER6C

 Double precision version will be formed

 The objective function uses 13 nonlinear groups
 
 There are 8 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: PALMER6C (n = 8)
walltime at start:     0.000000
!!  PALMER6C      8      11      25      24     0    3.4076378e-07    1.6387438e-02    0.000074

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 3.407638e-07 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : PALMER6C
# variables               = 8         

# cg iterations           = 11        

# cg function evals       = 25        

# cg gradient evals       = 24        

|| g ||                   = 3.4076378e-07   
Final f                   = 1.6387438e-02   
Function value at final x = 1.6387438e-02   
Solve time                = 0.000074    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   PALMER7C

 Problem name: PALMER7C

 Double precision version will be formed

 The objective function uses 13 nonlinear groups
 
 There are 8 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: PALMER7C (n = 8)
walltime at start:     0.000001
!!  PALMER7C      8      11      22      21     0    2.9296047e-08    6.0198720e-01    0.000065

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 2.929605e-08 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : PALMER7C
# variables               = 8         

# cg iterations           = 11        

# cg function evals       = 22        

# cg gradient evals       = 21        

|| g ||                   = 2.9296047e-08   
Final f                   = 6.0198720e-01   
Function value at final x = 6.0198720e-01   
Solve time                = 0.000065    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   PALMER8C

 Problem name: PALMER8C

 Double precision version will be formed

 The objective function uses 12 nonlinear groups
 
 There are 8 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: PALMER8C (n = 8)
walltime at start:     0.000001
!!  PALMER8C      8      11      18      17     0    8.7351837e-10    1.5976783e-01    0.000055

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 8.735184e-10 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : PALMER8C
# variables               = 8         

# cg iterations           = 11        

# cg function evals       = 18        

# cg gradient evals       = 17        

|| g ||                   = 8.7351837e-10   
Final f                   = 1.5976783e-01   
Function value at final x = 1.5976783e-01   
Solve time                = 0.000055    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   PENALTY1

 Problem name: PENALTY1

 Double precision version will be formed

 The objective function uses 1000 linear groups
 The objective function uses 1 nonlinear group
 
 There are 1000 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: PENALTY1 (n = 1000)
walltime at start:     0.000000
!!  PENALTY1   1000      23      61      38     0    6.5035329e-07    9.6861805e-03    0.002412

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 6.503533e-07 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : PENALTY1
# variables               = 1000      

# cg iterations           = 23        

# cg function evals       = 61        

# cg gradient evals       = 38        

|| g ||                   = 6.5035329e-07   
Final f                   = 9.6861805e-03   
Function value at final x = 9.6861805e-03   
Solve time                = 0.002412    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   PENALTY2

 Problem name: PENALTY2

 Double precision version will be formed

 The objective function uses 400 nonlinear groups
 
 There are 200 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: PENALTY2 (n = 200)
walltime at start:     0.000001
!!  PENALTY2    200     191     221     354     0    9.3555135e-07    4.7116277e+13    0.025983

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 9.355514e-07 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : PENALTY2
# variables               = 200       

# cg iterations           = 191       

# cg function evals       = 221       

# cg gradient evals       = 354       

|| g ||                   = 9.3555135e-07   
Final f                   = 4.7116277e+13   
Function value at final x = 4.7116277e+13   
Solve time                = 0.025983    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   PENALTY3

 Problem name: PENALTY3

 Double precision version will be formed

 The objective function uses 1 linear group
 The objective function uses 5 nonlinear groups
 
 There are 200 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: PENALTY3 (n = 200)
walltime at start:     0.000001
!!  PENALTY3    200     111     433     318     0    1.9022518e-07    9.9976158e-04    0.900467

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 1.902252e-07 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : PENALTY3
# variables               = 200       

# cg iterations           = 111       

# cg function evals       = 433       

# cg gradient evals       = 318       

|| g ||                   = 1.9022518e-07   
Final f                   = 9.9976158e-04   
Function value at final x = 9.9976158e-04   
Solve time                = 0.900467    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   POWELLSG

 Problem name: POWELLSG

 Double precision version will be formed

 The objective function uses 5000 nonlinear groups
 
 There are 5000 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: POWELLSG (n = 5000)
walltime at start:     0.000001
!!  POWELLSG   5000      26      53      27     0    1.2018814e-07    8.6653896e-12    0.007099

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 1.201881e-07 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : POWELLSG
# variables               = 5000      

# cg iterations           = 26        

# cg function evals       = 53        

# cg gradient evals       = 27        

|| g ||                   = 1.2018814e-07   
Final f                   = 8.6653896e-12   
Function value at final x = 8.6653896e-12   
Solve time                = 0.007099    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   POWER

 Problem name: POWER

 Double precision version will be formed

 The objective function uses 1 nonlinear group
 
 There are 10000 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: POWER (n = 10000)
walltime at start:     0.000001
!!     POWER  10000     373     758     385     0    9.4109606e-07    1.7673028e-09    0.114205

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 9.410961e-07 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : POWER
# variables               = 10000     

# cg iterations           = 373       

# cg function evals       = 758       

# cg gradient evals       = 385       

|| g ||                   = 9.4109606e-07   
Final f                   = 1.7673028e-09   
Function value at final x = 1.7673028e-09   
Solve time                = 0.114205    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   QUARTC

 Problem name: QUARTC

 Double precision version will be formed

 The objective function uses 5000 linear groups
 
 There are 5000 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: QUARTC (n = 5000)
walltime at start:     0.000000
!!    QUARTC   5000      21      51      30     0    4.9243335e-07    7.3281603e-08    0.006770

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 4.924334e-07 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : QUARTC
# variables               = 5000      

# cg iterations           = 21        

# cg function evals       = 51        

# cg gradient evals       = 30        

|| g ||                   = 4.9243335e-07   
Final f                   = 7.3281603e-08   
Function value at final x = 7.3281603e-08   
Solve time                = 0.006770    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   ROSENBR

 Problem name: ROSENBR

 Double precision version will be formed

 The objective function uses 1 linear group
 The objective function uses 1 nonlinear group
 
 There are 2 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: ROSENBR (n = 2)
walltime at start:     0.000001
!!   ROSENBR      2      33      77      44     0    7.6359613e-07    1.1840457e-13    0.000072

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 7.635961e-07 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : ROSENBR
# variables               = 2         

# cg iterations           = 33        

# cg function evals       = 77        

# cg gradient evals       = 44        

|| g ||                   = 7.6359613e-07   
Final f                   = 1.1840457e-13   
Function value at final x = 1.1840457e-13   
Solve time                = 0.000072    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   S308

 Problem name: S308

 Double precision version will be formed

 The objective function uses 3 nonlinear groups
 
 There are 2 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: S308 (n = 2)
walltime at start:     0.000000
!!      S308      2       8      20      12     0    9.0151496e-07    7.7319906e-01    0.000046

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 9.015150e-07 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : S308
# variables               = 2         

# cg iterations           = 8         

# cg function evals       = 20        

# cg gradient evals       = 12        

|| g ||                   = 9.0151496e-07   
Final f                   = 7.7319906e-01   
Function value at final x = 7.7319906e-01   
Solve time                = 0.000046    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   SCHMVETT

 Problem name: SCHMVETT

 Double precision version will be formed

 The objective function uses 4998 nonlinear groups
 
 There are 5000 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: SCHMVETT (n = 5000)
walltime at start:     0.000000
!!  SCHMVETT   5000      43      73      60     0    6.4347041e-07   -1.4994000e+04    0.106375

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 6.434704e-07 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : SCHMVETT
# variables               = 5000      

# cg iterations           = 43        

# cg function evals       = 73        

# cg gradient evals       = 60        

|| g ||                   = 6.4347041e-07   
Final f                   = -1.4994000e+04  
Function value at final x = -1.4994000e+04  
Solve time                = 0.106375    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   SENSORS

 Problem name: SENSORS

 Double precision version will be formed

 The objective function uses 10000 nonlinear groups
 
 There are 100 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: SENSORS (n = 100)
walltime at start:     0.000001
!!   SENSORS    100      23      52      32     0    7.3606626e-07   -2.0958750e+03    0.142087

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 7.360663e-07 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : SENSORS
# variables               = 100       

# cg iterations           = 23        

# cg function evals       = 52        

# cg gradient evals       = 32        

|| g ||                   = 7.3606626e-07   
Final f                   = -2.0958750e+03  
Function value at final x = -2.0958750e+03  
Solve time                = 0.142087    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   SINEVAL

 Problem name: SINEVAL

 Double precision version will be formed

 The objective function uses 1 linear group
 The objective function uses 1 nonlinear group
 
 There are 2 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: SINEVAL (n = 2)
walltime at start:     0.000000
!!   SINEVAL      2      72     174     102     0    1.1805903e-12    9.2038786e-27    0.000168

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 1.180590e-12 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : SINEVAL
# variables               = 2         

# cg iterations           = 72        

# cg function evals       = 174       

# cg gradient evals       = 102       

|| g ||                   = 1.1805903e-12   
Final f                   = 9.2038786e-27   
Function value at final x = 9.2038786e-27   
Solve time                = 0.000168    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   SINQUAD

 Problem name: SINQUAD

 Double precision version will be formed

 The objective function uses 5000 nonlinear groups
 
 There are 5000 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: SINQUAD (n = 5000)
walltime at start:     0.000001
!!   SINQUAD   5000      15      42      29     0    3.3231800e-08   -6.7570138e+06    0.034297

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 3.323180e-08 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : SINQUAD
# variables               = 5000      

# cg iterations           = 15        

# cg function evals       = 42        

# cg gradient evals       = 29        

|| g ||                   = 3.3231800e-08   
Final f                   = -6.7570138e+06  
Function value at final x = -6.7570138e+06  
Solve time                = 0.034297    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   SISSER

 Problem name: SISSER

 Double precision version will be formed

 The objective function uses 3 nonlinear groups
 
 There are 2 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: SISSER (n = 2)
walltime at start:     0.000000
!!    SISSER      2       6      20      14     0    1.3844742e-08    3.6654462e-12    0.000045

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 1.384474e-08 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : SISSER
# variables               = 2         

# cg iterations           = 6         

# cg function evals       = 20        

# cg gradient evals       = 14        

|| g ||                   = 1.3844742e-08   
Final f                   = 3.6654462e-12   
Function value at final x = 3.6654462e-12   
Solve time                = 0.000045    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   SNAIL

 Problem name: SNAIL

 Double precision version will be formed

 The objective function uses 1 nonlinear group
 
 There are 2 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: SNAIL (n = 2)
walltime at start:     0.000001
!!     SNAIL      2      99     225     127     0    1.2111224e-07    4.4763864e-15    0.000214

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 1.211122e-07 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : SNAIL
# variables               = 2         

# cg iterations           = 99        

# cg function evals       = 225       

# cg gradient evals       = 127       

|| g ||                   = 1.2111224e-07   
Final f                   = 4.4763864e-15   
Function value at final x = 4.4763864e-15   
Solve time                = 0.000214    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   SPARSINE

 Problem name: SPARSINE

 Double precision version will be formed

 The objective function uses 5000 nonlinear groups
 
 There are 5000 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: SPARSINE (n = 5000)
walltime at start:     0.000001
!!  SPARSINE   5000   27272   27561   54259     0    9.9891100e-07    1.3590556e-10   60.414299

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 9.989110e-07 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : SPARSINE
# variables               = 5000      

# cg iterations           = 27272     

# cg function evals       = 27561     

# cg gradient evals       = 54259     

|| g ||                   = 9.9891100e-07   
Final f                   = 1.3590556e-10   
Function value at final x = 1.3590556e-10   
Solve time                = 60.414299   seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   SPARSQUR

 Problem name: SPARSQUR

 Double precision version will be formed

 The objective function uses 10000 nonlinear groups
 
 There are 10000 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: SPARSQUR (n = 10000)
walltime at start:     0.000001
!!  SPARSQUR  10000      28      64      36     0    7.0213734e-08    4.5105214e-10    0.089604

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 7.021373e-08 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : SPARSQUR
# variables               = 10000     

# cg iterations           = 28        

# cg function evals       = 64        

# cg gradient evals       = 36        

|| g ||                   = 7.0213734e-08   
Final f                   = 4.5105214e-10   
Function value at final x = 4.5105214e-10   
Solve time                = 0.089604    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   SPMSRTLS

 Problem name: SPMSRTLS

 Double precision version will be formed

 The objective function uses 8329 nonlinear groups
 
 There are 4999 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: SPMSRTLS (n = 4999)
walltime at start:     0.000001
!!  SPMSRTLS   4999     210     418     219     0    9.7769785e-07    3.2900794e-11    0.217674

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 9.776978e-07 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : SPMSRTLS
# variables               = 4999      

# cg iterations           = 210       

# cg function evals       = 418       

# cg gradient evals       = 219       

|| g ||                   = 9.7769785e-07   
Final f                   = 3.2900794e-11   
Function value at final x = 3.2900794e-11   
Solve time                = 0.217674    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   SROSENBR

 Problem name: SROSENBR

 Double precision version will be formed

 The objective function uses 5000 nonlinear groups
 
 There are 5000 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: SROSENBR (n = 5000)
walltime at start:     0.000000
!!  SROSENBR   5000      11      23      12     0    4.8292836e-10    4.2359717e-19    0.004435

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 4.829284e-10 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : SROSENBR
# variables               = 5000      

# cg iterations           = 11        

# cg function evals       = 23        

# cg gradient evals       = 12        

|| g ||                   = 4.8292836e-10   
Final f                   = 4.2359717e-19   
Function value at final x = 4.2359717e-19   
Solve time                = 0.004435    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   SSBRYBND

 Problem name: SSBRYBND

 Double precision version will be formed

 The objective function uses 5000 nonlinear groups
 
 There are 5000 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: SSBRYBND (n = 5000)
walltime at start:     0.000001
!!  SSBRYBND   5000    9295   15400   12531     0    9.2025706e-07    4.8862201e-15   10.646545

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 9.202571e-07 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : SSBRYBND
# variables               = 5000      

# cg iterations           = 9295      

# cg function evals       = 15400     

# cg gradient evals       = 12531     

|| g ||                   = 9.2025706e-07   
Final f                   = 4.8862201e-15   
Function value at final x = 4.8862201e-15   
Solve time                = 10.646545   seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   STRATEC

 Problem name: STRATEC

 Double precision version will be formed

 The objective function uses 1 nonlinear group
 
 There are 10 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: STRATEC (n = 10)
walltime at start:     0.000000
!!   STRATEC     10     248     615     373     0    3.2321960e-07    2.2122623e+03    4.082516

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 3.232196e-07 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : STRATEC
# variables               = 10        

# cg iterations           = 248       

# cg function evals       = 615       

# cg gradient evals       = 373       

|| g ||                   = 3.2321960e-07   
Final f                   = 2.2122623e+03   
Function value at final x = 2.2122623e+03   
Solve time                = 4.082516    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   TESTQUAD

 Problem name: TESTQUAD

 Double precision version will be formed

 The objective function uses 1 nonlinear group
 
 There are 5000 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: TESTQUAD (n = 5000)
the problem has a quadratic objective
walltime at start:     0.000000
!!  TESTQUAD   5000    1490       0    1491     0    8.4102097e-07   -1.8608709e-06    0.077507

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 8.410210e-07 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : TESTQUAD
# variables               = 5000      

# cg iterations           = 1490      

# cg function evals       = 0         

# cg gradient evals       = 1491      

|| g ||                   = 8.4102097e-07   
Final f                   = -1.8608709e-06  
Function value at final x = 4.9868548e-13   
Solve time                = 0.077507    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   TOINTGOR

 Problem name: TOINTGOR

 Double precision version will be formed

 The objective function uses 83 nonlinear groups
 
 There are 50 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: TOINTGOR (n = 50)
walltime at start:     0.000001
!!  TOINTGOR     50     135     234     175     0    9.9819687e-07    1.3739055e+03    0.002578

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 9.981969e-07 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : TOINTGOR
# variables               = 50        

# cg iterations           = 135       

# cg function evals       = 234       

# cg gradient evals       = 175       

|| g ||                   = 9.9819687e-07   
Final f                   = 1.3739055e+03   
Function value at final x = 1.3739055e+03   
Solve time                = 0.002578    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   TOINTGSS

 Problem name: TOINTGSS

 Double precision version will be formed

 The objective function uses 4998 nonlinear groups
 
 There are 5000 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: TOINTGSS (n = 5000)
walltime at start:     0.000001
!!  TOINTGSS   5000       4       9       5     0    2.2872519e-07    1.0002001e+01    0.004041

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 2.287252e-07 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : TOINTGSS
# variables               = 5000      

# cg iterations           = 4         

# cg function evals       = 9         

# cg gradient evals       = 5         

|| g ||                   = 2.2872519e-07   
Final f                   = 1.0002001e+01   
Function value at final x = 1.0002001e+01   
Solve time                = 0.004041    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   TOINTPSP

 Problem name: TOINTPSP

 Double precision version will be formed

 The objective function uses 83 nonlinear groups
 
 There are 50 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: TOINTPSP (n = 50)
walltime at start:     0.000001
!!  TOINTPSP     50     148     288     200     0    9.8830470e-07    2.2556041e+02    0.001596

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 9.883047e-07 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : TOINTPSP
# variables               = 50        

# cg iterations           = 148       

# cg function evals       = 288       

# cg gradient evals       = 200       

|| g ||                   = 9.8830470e-07   
Final f                   = 2.2556041e+02   
Function value at final x = 2.2556041e+02   
Solve time                = 0.001596    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   TOINTQOR

 Problem name: TOINTQOR

 Double precision version will be formed

 The objective function uses 83 linear groups
 
 There are 50 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: TOINTQOR (n = 50)
the problem has a quadratic objective
walltime at start:     0.000001
!!  TOINTQOR     50      29       0      30     0    4.4231462e-07    1.1754722e+03    0.000192

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 4.423146e-07 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : TOINTQOR
# variables               = 50        

# cg iterations           = 29        

# cg function evals       = 0         

# cg gradient evals       = 30        

|| g ||                   = 4.4231462e-07   
Final f                   = 1.1754722e+03   
Function value at final x = 1.1754722e+03   
Solve time                = 0.000192    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   TQUARTIC

 Problem name: TQUARTIC

 Double precision version will be formed

 The objective function uses 5000 nonlinear groups
 
 There are 5000 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: TQUARTIC (n = 5000)
walltime at start:     0.000001
!!  TQUARTIC   5000      13      36      23     0    7.0877017e-07    6.9008037e-18    0.013004

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 7.087702e-07 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : TQUARTIC
# variables               = 5000      

# cg iterations           = 13        

# cg function evals       = 36        

# cg gradient evals       = 23        

|| g ||                   = 7.0877017e-07   
Final f                   = 6.9008037e-18   
Function value at final x = 6.9008037e-18   
Solve time                = 0.013004    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   TRIDIA

 Problem name: TRIDIA

 Double precision version will be formed

 The objective function uses 5000 linear groups
 
 There are 5000 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: TRIDIA (n = 5000)
the problem has a quadratic objective
walltime at start:     0.000001
!!    TRIDIA   5000     780       0     781     0    9.7406364e-07    9.9879629e-10    0.058663

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 9.740636e-07 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : TRIDIA
# variables               = 5000      

# cg iterations           = 780       

# cg function evals       = 0         

# cg gradient evals       = 781       

|| g ||                   = 9.7406364e-07   
Final f                   = 9.9879629e-10   
Function value at final x = 4.9904374e-15   
Solve time                = 0.058663    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   VARDIM

 Problem name: VARDIM

 Double precision version will be formed

 The objective function uses 202 nonlinear groups
 
 There are 200 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: VARDIM (n = 200)
walltime at start:     0.000000
!!    VARDIM    200      10      21      11     0    2.5959262e-07    4.2117690e-19    0.000180

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 2.595926e-07 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : VARDIM
# variables               = 200       

# cg iterations           = 10        

# cg function evals       = 21        

# cg gradient evals       = 11        

|| g ||                   = 2.5959262e-07   
Final f                   = 4.2117690e-19   
Function value at final x = 4.2117690e-19   
Solve time                = 0.000180    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   VAREIGVL

 Problem name: VAREIGVL

 Double precision version will be formed

 The objective function uses 50 nonlinear groups
 
 There are 50 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: VAREIGVL (n = 50)
walltime at start:     0.000001
!!  VAREIGVL     50      23      47      24     0    8.4765966e-07    3.7975332e-13    0.000392

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 8.476597e-07 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : VAREIGVL
# variables               = 50        

# cg iterations           = 23        

# cg function evals       = 47        

# cg gradient evals       = 24        

|| g ||                   = 8.4765966e-07   
Final f                   = 3.7975332e-13   
Function value at final x = 3.7975332e-13   
Solve time                = 0.000392    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   VIBRBEAM

 Problem name: VIBRBEAM

 Double precision version will be formed

 The objective function uses 30 nonlinear groups
 
 There are 8 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: VIBRBEAM (n = 8)
walltime at start:     0.000001
!!  VIBRBEAM      8     182     429     281     0    1.0721851e-07    1.7488668e+00    0.006872

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 1.072185e-07 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : VIBRBEAM
# variables               = 8         

# cg iterations           = 182       

# cg function evals       = 429       

# cg gradient evals       = 281       

|| g ||                   = 1.0721851e-07   
Final f                   = 1.7488668e+00   
Function value at final x = 1.7488668e+00   
Solve time                = 0.006872    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   WATSON

 Problem name: WATSON

 Double precision version will be formed

 The objective function uses 1 linear group
 The objective function uses 30 nonlinear groups
 
 There are 12 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: WATSON (n = 12)
walltime at start:     0.000001
!!    WATSON     12      53     111      58     0    7.6060190e-07    1.5918570e-07    0.000530

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 7.606019e-07 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : WATSON
# variables               = 12        

# cg iterations           = 53        

# cg function evals       = 111       

# cg gradient evals       = 58        

|| g ||                   = 7.6060190e-07   
Final f                   = 1.5918570e-07   
Function value at final x = 1.5918570e-07   
Solve time                = 0.000530    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   WOODS

 Problem name: WOODS

 Double precision version will be formed

 The objective function uses 4001 linear groups
 The objective function uses 2000 nonlinear groups
 
 There are 4000 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: WOODS (n = 4000)
walltime at start:     0.000000
!!     WOODS   4000      24      54      30     0    5.3658147e-07    3.3449015e-13    0.011087

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 5.365815e-07 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : WOODS
# variables               = 4000      

# cg iterations           = 24        

# cg function evals       = 54        

# cg gradient evals       = 30        

|| g ||                   = 5.3658147e-07   
Final f                   = 3.3449015e-13   
Function value at final x = 3.3449015e-13   
Solve time                = 0.011087    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   YFITU

 Problem name: YFITU

 Double precision version will be formed

 The objective function uses 17 nonlinear groups
 
 There are 3 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: YFITU (n = 3)
walltime at start:     0.000001
!!     YFITU      3      74     177     103     0    4.6280343e-10    6.6810304e-13    0.000592

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 4.628034e-10 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : YFITU
# variables               = 3         

# cg iterations           = 74        

# cg function evals       = 177       

# cg gradient evals       = 103       

|| g ||                   = 4.6280343e-10   
Final f                   = 6.6810304e-13   
Function value at final x = 6.6810304e-13   
Solve time                = 0.000592    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   ZANGWIL2

 Problem name: ZANGWIL2

 Double precision version will be formed

 The objective function uses 1 nonlinear group
 
 There are 2 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: cg_descent (double precision version) compiled successfully

 Problem: ZANGWIL2 (n = 2)
the problem has a quadratic objective
walltime at start:     0.000000
!!  ZANGWIL2      2       1       0       2     0    2.2204460e-16   -1.8200000e+01    0.000011

CG_DESCENT (Version 7.0, May 1, 2018) run status: 0

Success: Error 2.220446e-16 satisfies error tolerance 1.000000e-06.



 *********************** CG statistics ************************

Code used                 : cg_descent
Problem                   : ZANGWIL2
# variables               = 2         

# cg iterations           = 1         

# cg function evals       = 0         

# cg gradient evals       = 2         

|| g ||                   = 2.2204460e-16   
Final f                   = -1.8200000e+01  
Function value at final x = -1.8200000e+01  
Solve time                = 0.000011    seconds

 ******************************************************************

 ====================================================

sifdecoder -A pc64.lnx.gfo -st   ALLINIT

 Problem name: ALLINIT

 Double precision version will be formed

 The objective function uses 2 linear groups
 The objective function uses 10 nonlinear groups
 
 There is 1 free variable 
 There is 1 variable bounded only from below 
 There is 1 variable bounded from below and above 
 There is 1 fixed variable
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully

 ** SUBROUTINE CUTEST_csetup: Warning. The problem has no general constraints. 
 ** Other tools may be preferable ** 

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

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

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


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

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            : 1         
Gradient evaluations in active set GP : 2         


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

Final f             :  1.670596843287990e+01
sup-norm of gradient:  3.745344834271691e-08
Number of iterations: 11        
Function evaluations: 23        
Gradient evaluations: 12        

!!   ALLINIT      4    2    2    1    2    2    2     11     23     12       1       0     0    3.7453448e-08    1.6705968e+01    0.000113
 Final f                         = 1.6705968e+01   
 Function value at final x       = 1.6705968e+01   
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   BDEXP

 Problem name: BDEXP

 Double precision version will be formed

 The objective function uses 4998 nonlinear groups
 
 There are 5000 variables bounded only from below 
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully

 ** SUBROUTINE CUTEST_csetup: Warning. The problem has no general constraints. 
 ** Other tools may be preferable ** 

 Problem: BDEXP (n = 5000)
walltime at start:     0.000001

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

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


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 4.725600693112168e-07    
Final f                               : 2.859346747312323e-05    

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         


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

Final f             :  2.859346747312323e-05
sup-norm of gradient:  4.725600693112168e-07
Number of iterations: 4         
Function evaluations: 8         
Gradient evaluations: 4         

!!     BDEXP   5000    0    0    0    1    1    1      4      8      4       1       0     0    4.7256007e-07    2.8593467e-05    0.006202
 Final f                         = 2.8593467e-05   
 Function value at final x       = 2.8593467e-05   
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   BRATU1D

 Problem name: BRATU1D

 Double precision version will be formed

 The objective function uses 3004 nonlinear groups
 
 There are 1001 free variables
 There are 2 fixed variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully

 ** SUBROUTINE CUTEST_csetup: Warning. The problem has no general constraints. 
 ** Other tools may be preferable ** 

 Problem: BRATU1D (n = 1003)
walltime at start:     0.000001

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

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


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 9.785187558009056e-07    
Final f                               : -8.518927279087505e+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         


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

Final f             : -8.518927279087505e+00
sup-norm of gradient:  9.785187558009056e-07
Number of iterations: 5551      
Function evaluations: 5875      
Gradient evaluations: 11414     

!!   BRATU1D   1003    0    0    0    0    0    0   5551   5875  11414       1       0     0    9.7851876e-07   -8.5189273e+00    3.531098
 Final f                         = -8.5189273e+00  
 Function value at final x       = -8.5189273e+00  
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   CAMEL6

 Problem name: CAMEL6

 Double precision version will be formed

 The objective function uses 1 nonlinear group
 
 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

 ** SUBROUTINE CUTEST_csetup: Warning. The problem has no general constraints. 
 ** Other tools may be preferable ** 

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

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

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


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 1.593639886721121e-09    
Final f                               : -1.031628453489878e+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         


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

Final f             : -1.031628453489878e+00
sup-norm of gradient:  1.593639886721121e-09
Number of iterations: 8         
Function evaluations: 16        
Gradient evaluations: 8         

!!    CAMEL6      2    0    0    0    1    1    1      8     16      8       1       0     0    1.5936399e-09   -1.0316285e+00    0.000131
 Final f                         = -1.0316285e+00  
 Function value at final x       = -1.0316285e+00  
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   CLPLATEA

 Problem name: CLPLATEA

 Double precision version will be formed

 The objective function uses 1 linear group
 The objective function uses 19600 nonlinear groups
 
 There are 4970 free variables
 There are 71 fixed variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully

 ** SUBROUTINE CUTEST_csetup: Warning. The problem has no general constraints. 
 ** Other tools may be preferable ** 

 Problem: CLPLATEA (n = 5041)
walltime at start:     0.000001

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

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


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

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         


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

Final f             : -1.259209458237632e-02
sup-norm of gradient:  9.210931176950599e-07
Number of iterations: 853       
Function evaluations: 1708      
Gradient evaluations: 855       

!!  CLPLATEA   5041    0    0    0    0    0    0    853   1708    855       1       0     0    9.2109312e-07   -1.2592095e-02    0.781914
 Final f                         = -1.2592095e-02  
 Function value at final x       = -1.2592095e-02  
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   CLPLATEB

 Problem name: CLPLATEB

 Double precision version will be formed

 The objective function uses 1 linear group
 The objective function uses 19600 nonlinear groups
 
 There are 4970 free variables
 There are 71 fixed variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully

 ** SUBROUTINE CUTEST_csetup: Warning. The problem has no general constraints. 
 ** Other tools may be preferable ** 

 Problem: CLPLATEB (n = 5041)
walltime at start:     0.000000

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

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


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

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         


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

Final f             : -5.094786167790573e-03
sup-norm of gradient:  9.769360193900369e-07
Number of iterations: 307       
Function evaluations: 616       
Gradient evaluations: 309       

!!  CLPLATEB   5041    0    0    0    0    0    0    307    616    309       1       0     0    9.7693602e-07   -5.0947862e-03    0.285823
 Final f                         = -5.0947862e-03  
 Function value at final x       = -5.0947862e-03  
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   CLPLATEC

 Problem name: CLPLATEC

 Double precision version will be formed

 The objective function uses 1 linear group
 The objective function uses 19600 nonlinear groups
 
 There are 4970 free variables
 There are 71 fixed variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully

 ** SUBROUTINE CUTEST_csetup: Warning. The problem has no general constraints. 
 ** Other tools may be preferable ** 

 Problem: CLPLATEC (n = 5041)
walltime at start:     0.000001

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

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


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

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         


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

Final f             : -5.020724214436474e-03
sup-norm of gradient:  9.328727523124592e-07
Number of iterations: 36547     
Function evaluations: 36553     
Gradient evaluations: 73088     

!!  CLPLATEC   5041    0    0    0    0    0    0  36547  36553  73088       1       0     0    9.3287275e-07   -5.0207242e-03   37.019147
 Final f                         = -5.0207242e-03  
 Function value at final x       = -5.0207242e-03  
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   DRCAV1LQ

 Problem name: DRCAV1LQ

 Double precision version will be formed

 The objective function uses 3969 nonlinear groups
 
 There are 3969 free variables
 There are 520 fixed variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully

 ** SUBROUTINE CUTEST_csetup: Warning. The problem has no general constraints. 
 ** Other tools may be preferable ** 

 Problem: DRCAV1LQ (n = 4489)
walltime at start:     0.000000

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

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


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

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         


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

Final f             :  1.546422182653122e-07
sup-norm of gradient:  9.779751664782760e-07
Number of iterations: 194500    
Function evaluations: 216361    
Gradient evaluations: 367139    

!!  DRCAV1LQ   4489    0    0    0    0    0    0 194500 216361 367139       1       0     0    9.7797517e-07    1.5464222e-07  321.403796
 Final f                         = 1.5464222e-07   
 Function value at final x       = 1.5464222e-07   
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   DRCAV2LQ

 Problem name: DRCAV2LQ

 Double precision version will be formed

 The objective function uses 3969 nonlinear groups
 
 There are 3969 free variables
 There are 520 fixed variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully

 ** SUBROUTINE CUTEST_csetup: Warning. The problem has no general constraints. 
 ** Other tools may be preferable ** 

 Problem: DRCAV2LQ (n = 4489)
walltime at start:     0.000000

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

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


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

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         


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

Final f             :  1.301764858747571e-07
sup-norm of gradient:  9.972724117213008e-07
Number of iterations: 405201    
Function evaluations: 429021    
Gradient evaluations: 786582    

!!  DRCAV2LQ   4489    0    0    0    0    0    0 405201 429021 786582       1       0     0    9.9727241e-07    1.3017649e-07  699.194296
 Final f                         = 1.3017649e-07   
 Function value at final x       = 1.3017649e-07   
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   DRCAV3LQ

 Problem name: DRCAV3LQ

 Double precision version will be formed

 The objective function uses 3969 nonlinear groups
 
 There are 3969 free variables
 There are 520 fixed variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully

 ** SUBROUTINE CUTEST_csetup: Warning. The problem has no general constraints. 
 ** Other tools may be preferable ** 

 Problem: DRCAV3LQ (n = 4489)
walltime at start:     0.000000

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

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


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

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         


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

Final f             :  3.848843596503228e-07
sup-norm of gradient:  9.176829785692955e-07
Number of iterations: 1453421   
Function evaluations: 1525626   
Gradient evaluations: 2834641   

!!  DRCAV3LQ   4489    0    0    0    0    0    0 1453421 1525626 2834641       1       0     0    9.1768298e-07    3.8488436e-07 2468.831985
 Final f                         = 3.8488436e-07   
 Function value at final x       = 3.8488436e-07   
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   EG1

 Problem name: EG1

 Double precision version will be formed

 The objective function uses 3 nonlinear groups
 
 There is 1 free variable 
 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

 ** SUBROUTINE CUTEST_csetup: Warning. The problem has no general constraints. 
 ** Other tools may be preferable ** 

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

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

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


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 2.138019816744219e-09    
Final f                               : -1.132800782583661e+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         


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

Final f             : -1.132800782583661e+00
sup-norm of gradient:  2.138019816744219e-09
Number of iterations: 6         
Function evaluations: 12        
Gradient evaluations: 6         

!!       EG1      3    0    0    0    1    1    1      6     12      6       1       0     0    2.1380198e-09   -1.1328008e+00    0.000095
 Final f                         = -1.1328008e+00  
 Function value at final x       = -1.1328008e+00  
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   EXPLIN

 Problem name: EXPLIN

 Double precision version will be formed

 The objective function uses 1 nonlinear group
 
 There are 1200 variables bounded from below and above 
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully

 ** SUBROUTINE CUTEST_csetup: Warning. The problem has no general constraints. 
 ** Other tools may be preferable ** 

 Problem: EXPLIN (n = 1200)
walltime at start:     0.000000

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

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


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

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


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

Final f             : -7.192548399947344e+07
sup-norm of gradient:  6.153576350698131e-07
Number of iterations: 220       
Function evaluations: 394       
Gradient evaluations: 260       

!!    EXPLIN   1200    5    3    3   53  101   74    220    394    260       1       0     0    6.1535764e-07   -7.1925484e+07    0.007754
 Final f                         = -7.1925484e+07  
 Function value at final x       = -7.1925484e+07  
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   EXPLIN2

 Problem name: EXPLIN2

 Double precision version will be formed

 The objective function uses 1 nonlinear group
 
 There are 1200 variables bounded from below and above 
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully

 ** SUBROUTINE CUTEST_csetup: Warning. The problem has no general constraints. 
 ** Other tools may be preferable ** 

 Problem: EXPLIN2 (n = 1200)
walltime at start:     0.000000

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

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


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

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


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

Final f             : -7.199883367983921e+07
sup-norm of gradient:  3.810739599430235e-07
Number of iterations: 67        
Function evaluations: 116       
Gradient evaluations: 75        

!!   EXPLIN2   1200   16    9    8   32   40   38     67    116     75       1       0     0    3.8107396e-07   -7.1998834e+07    0.002881
 Final f                         = -7.1998834e+07  
 Function value at final x       = -7.1998834e+07  
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   EXPQUAD

 Problem name: EXPQUAD

 Double precision version will be formed

 The objective function uses 1 nonlinear group
 
 There are 1100 free variables
 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

 ** SUBROUTINE CUTEST_csetup: Warning. The problem has no general constraints. 
 ** Other tools may be preferable ** 

 Problem: EXPQUAD (n = 1200)
walltime at start:     0.000001

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

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


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 9.615075668989448e-07    
Final f                               : -3.684939565731771e+09   

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


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

Final f             : -3.684939565731771e+09
sup-norm of gradient:  9.615075668989448e-07
Number of iterations: 305       
Function evaluations: 623       
Gradient evaluations: 402       
Subspace iterations: 15        
Number of subspaces: 7         


!!   EXPQUAD   1200   13    3    3   99  153  118    305    623    402       1       0     0    9.6150757e-07   -3.6849396e+09    0.033786
 Final f                         = -3.6849396e+09  
 Function value at final x       = -3.6849396e+09  
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   HADAMALS

 Problem name: HADAMALS

 Double precision version will be formed

 The objective function uses 590 nonlinear groups
 
 There are 380 variables bounded from below and above 
 There are 20 fixed variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully

 ** SUBROUTINE CUTEST_csetup: Warning. The problem has no general constraints. 
 ** Other tools may be preferable ** 

 Problem: HADAMALS (n = 400)
walltime at start:     0.000000

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

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


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

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 : 5         
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 0         
Gradient evaluations in active set GP : 4         


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

Final f             :  7.311843149959088e+03
sup-norm of gradient:  1.033270147221543e-08
Number of iterations: 7         
Function evaluations: 23        
Gradient evaluations: 17        
Subspace iterations: 1         
Number of subspaces: 1         


!!  HADAMALS    400    0    0    0    4    5    4      7     23     17       1       0     0    1.0332701e-08    7.3118431e+03    0.003988
 Final f                         = 7.3118431e+03   
 Function value at final x       = 7.3118431e+03   
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   HART6

 Problem name: HART6

 Double precision version will be formed

 The objective function uses 4 nonlinear groups
 
 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

 ** SUBROUTINE CUTEST_csetup: Warning. The problem has no general constraints. 
 ** Other tools may be preferable ** 

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

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

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


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 1.154592402013141e-07    
Final f                               : -3.322886891589317e+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         


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

Final f             : -3.322886891589317e+00
sup-norm of gradient:  1.154592402013141e-07
Number of iterations: 11        
Function evaluations: 22        
Gradient evaluations: 11        

!!     HART6      6    0    0    0    1    1    1     11     22     11       1       0     0    1.1545924e-07   -3.3228869e+00    0.000122
 Final f                         = -3.3228869e+00  
 Function value at final x       = -3.3228869e+00  
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   HIMMELP1

 Problem name: HIMMELP1

 Double precision version will be formed

 The objective function uses 1 nonlinear group
 
 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

 ** SUBROUTINE CUTEST_csetup: Warning. The problem has no general constraints. 
 ** Other tools may be preferable ** 

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

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

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


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

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 : 3         
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 0         
Gradient evaluations in active set GP : 2         


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

Final f             : -2.389741895043875e+01
sup-norm of gradient:  1.002758098778145e-07
Number of iterations: 3         
Function evaluations: 6         
Gradient evaluations: 3         

!!  HIMMELP1      2    0    0    0    2    3    2      3      6      3       1       0     0    1.0027581e-07   -2.3897419e+01    0.000076
 Final f                         = -2.3897419e+01  
 Function value at final x       = -2.3897419e+01  
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   HOLMES

 Problem name: HOLMES

 Double precision version will be formed

 The objective function uses 2039 nonlinear groups
 
 There are 180 variables bounded only from below 
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully

 ** SUBROUTINE CUTEST_csetup: Warning. The problem has no general constraints. 
 ** Other tools may be preferable ** 

 Problem: HOLMES (n = 180)
walltime at start:     0.000001

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

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


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

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


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

Final f             :  1.248150348141313e+03
sup-norm of gradient:  4.124119420967354e-07
Number of iterations: 21        
Function evaluations: 32        
Gradient evaluations: 23        

!!    HOLMES    180    2    3    1   22   27   22     21     32     23       1       0     0    4.1241194e-07    1.2481503e+03    0.089278
 Final f                         = 1.2481503e+03   
 Function value at final x       = 1.2481503e+03   
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   HS38

 Problem name: HS38

 Double precision version will be formed

 The objective function uses 7 nonlinear groups
 
 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

 ** SUBROUTINE CUTEST_csetup: Warning. The problem has no general constraints. 
 ** Other tools may be preferable ** 

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

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

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


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 1.388922813205794e-07    
Final f                               : 3.701512083004871e-15    

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         


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

Final f             :  3.701512083004871e-15
sup-norm of gradient:  1.388922813205794e-07
Number of iterations: 25        
Function evaluations: 55        
Gradient evaluations: 31        

!!      HS38      4    0    0    0    1    1    1     25     55     31       1       0     0    1.3889228e-07    3.7015121e-15    0.000119
 Final f                         = 3.7015121e-15   
 Function value at final x       = 3.7015121e-15   
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   HS4

 Problem name: HS4

 Double precision version will be formed

 The objective function uses 1 linear group
 The objective function uses 1 nonlinear group
 
 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

 ** SUBROUTINE CUTEST_csetup: Warning. The problem has no general constraints. 
 ** Other tools may be preferable ** 

 Problem: HS4 (n = 2)
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                               : 2.666666664000000e+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         


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

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

!!       HS4      2    0    0    0    1    1    1      0      0      0       1       0     0    0.0000000e+00    2.6666667e+00    0.000054
 Final f                         = 2.6666667e+00   
 Function value at final x       = 2.6666667e+00   
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   HS45

 Problem name: HS45

 Double precision version will be formed

 The objective function uses 1 nonlinear group
 
 There are 5 variables bounded from below and above 
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully

 ** SUBROUTINE CUTEST_csetup: Warning. The problem has no general constraints. 
 ** Other tools may be preferable ** 

 Problem: HS45 (n = 5)
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                               : 1.000000000400000e+00    

Iterations of gradient projection (GP): 1         
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         


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

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

!!      HS45      5    1    0    0    2    2    2      0      0      0       1       0     0    0.0000000e+00    1.0000000e+00    0.000058
 Final f                         = 1.0000000e+00   
 Function value at final x       = 1.0000000e+00   
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   HS5

 Problem name: HS5

 Double precision version will be formed

 The objective function uses 1 linear group
 The objective function uses 2 nonlinear groups
 
 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

 ** SUBROUTINE CUTEST_csetup: Warning. The problem has no general constraints. 
 ** Other tools may be preferable ** 

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

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

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


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 2.229710558410147e-07    
Final f                               : -1.913222954981016e+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         


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

Final f             : -1.913222954981016e+00
sup-norm of gradient:  2.229710558410147e-07
Number of iterations: 5         
Function evaluations: 10        
Gradient evaluations: 5         

!!       HS5      2    0    0    0    1    1    1      5     10      5       1       0     0    2.2297106e-07   -1.9132230e+00    0.000083
 Final f                         = -1.9132230e+00  
 Function value at final x       = -1.9132230e+00  
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   LMINSURF

 Problem name: LMINSURF

 Double precision version will be formed

 The objective function uses 5476 nonlinear groups
 
 There are 5329 free variables
 There are 296 fixed variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully

 ** SUBROUTINE CUTEST_csetup: Warning. The problem has no general constraints. 
 ** Other tools may be preferable ** 

 Problem: LMINSURF (n = 5625)
walltime at start:     0.000001

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

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


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 9.320802718225385e-07    
Final f                               : 8.999999994040602e+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         


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

Final f             :  8.999999994040602e+00
sup-norm of gradient:  9.320802718225385e-07
Number of iterations: 511       
Function evaluations: 1025      
Gradient evaluations: 514       

!!  LMINSURF   5625    0    0    0    0    0    0    511   1025    514       1       0     0    9.3208027e-07    9.0000000e+00    0.520623
 Final f                         = 9.0000000e+00   
 Function value at final x       = 9.0000000e+00   
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   LOGROS

 Problem name: LOGROS

 Double precision version will be formed

 The objective function uses 1 nonlinear group
 
 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

 ** SUBROUTINE CUTEST_csetup: Warning. The problem has no general constraints. 
 ** Other tools may be preferable ** 

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

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

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


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 2.887468042445103e-08    
Final f                               : 1.332267629550187e-15    

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         


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

Final f             :  1.332267629550187e-15
sup-norm of gradient:  2.887468042445103e-08
Number of iterations: 73        
Function evaluations: 191       
Gradient evaluations: 118       

!!    LOGROS      2    0    0    0    1    1    1     73    191    118       1       0     0    2.8874680e-08    1.3322676e-15    0.000213
 Final f                         = 1.3322676e-15   
 Function value at final x       = 1.3322676e-15   
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   MAXLIKA

 Problem name: MAXLIKA

 Double precision version will be formed

 The objective function uses 235 nonlinear groups
 
 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

 ** SUBROUTINE CUTEST_csetup: Warning. The problem has no general constraints. 
 ** Other tools may be preferable ** 

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

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

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


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

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


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

Final f             :  1.136307296897004e+03
sup-norm of gradient:  6.021849685566849e-12
Number of iterations: 98        
Function evaluations: 196       
Gradient evaluations: 108       

!!   MAXLIKA      8    5    4    2    6    7    6     98    196    108       1       0     0    6.0218497e-12    1.1363073e+03    0.016464
 Final f                         = 1.1363073e+03   
 Function value at final x       = 1.1363073e+03   
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   MCCORMCK

 Problem name: MCCORMCK

 Double precision version will be formed

 The objective function uses 4999 nonlinear groups
 
 There are 5000 variables bounded from below and above 
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully

 ** SUBROUTINE CUTEST_csetup: Warning. The problem has no general constraints. 
 ** Other tools may be preferable ** 

 Problem: MCCORMCK (n = 5000)
walltime at start:     0.000001

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

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


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

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         


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

Final f             : -4.566580552800192e+03
sup-norm of gradient:  9.702605399120046e-07
Number of iterations: 11        
Function evaluations: 19        
Gradient evaluations: 14        

!!  MCCORMCK   5000    0    0    0    2    2    2     11     19     14       1       0     0    9.7026054e-07   -4.5665806e+03    0.019834
 Final f                         = -4.5665806e+03  
 Function value at final x       = -4.5665806e+03  
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   MDHOLE

 Problem name: MDHOLE

 Double precision version will be formed

 The objective function uses 1 linear group
 The objective function uses 1 nonlinear group
 
 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

 ** SUBROUTINE CUTEST_csetup: Warning. The problem has no general constraints. 
 ** Other tools may be preferable ** 

 Problem: MDHOLE (n = 2)
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                               : 0.000000000000000e+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 : 3         
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 0         
Gradient evaluations in active set GP : 2         


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

Final f             :  0.000000000000000e+00
sup-norm of gradient:  0.000000000000000e+00
Number of iterations: 55        
Function evaluations: 130       
Gradient evaluations: 78        

!!    MDHOLE      2    0    0    0    2    3    2     55    130     78       1       0     0    0.0000000e+00    0.0000000e+00    0.000202
 Final f                         = 0.0000000e+00   
 Function value at final x       = 0.0000000e+00   
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   MINSURF

 Problem name: MINSURF

 Double precision version will be formed

 The objective function uses 49 nonlinear groups
 
 There are 36 free variables
 There are 28 fixed variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully

 ** SUBROUTINE CUTEST_csetup: Warning. The problem has no general constraints. 
 ** Other tools may be preferable ** 

 Problem: MINSURF (n = 64)
walltime at start:     0.000001

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

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


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 2.453372871253928e-07    
Final f                               : 1.000000001700355e+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         


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

Final f             :  1.000000001700355e+00
sup-norm of gradient:  2.453372871253928e-07
Number of iterations: 12        
Function evaluations: 24        
Gradient evaluations: 12        
Subspace iterations: 6         
Number of subspaces: 1         


!!   MINSURF     64    0    0    0    0    0    0     12     24     12       1       0     0    2.4533729e-07    1.0000000e+00    0.000237
 Final f                         = 1.0000000e+00   
 Function value at final x       = 1.0000000e+00   
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   MINSURFO

 Problem name: MINSURFO

 Double precision version will be formed

 The objective function uses 10302 nonlinear groups
 
 There are 5002 variables bounded only from below 
 There are 304 fixed variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully

 ** SUBROUTINE CUTEST_csetup: Warning. The problem has no general constraints. 
 ** Other tools may be preferable ** 

 Problem: MINSURFO (n = 5306)
walltime at start:     0.000000

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

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


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

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


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

Final f             :  2.506949264276260e+00
sup-norm of gradient:  8.727573747648607e-07
Number of iterations: 420       
Function evaluations: 841       
Gradient evaluations: 421       

!!  MINSURFO   5306    4    0    0    4    9    6    420    841    421       1       0     0    8.7275737e-07    2.5069493e+00    0.704591
 Final f                         = 2.5069493e+00   
 Function value at final x       = 2.5069493e+00   
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   NLMSURF

 Problem name: NLMSURF

 Double precision version will be formed

 The objective function uses 5476 nonlinear groups
 
 There are 5329 free variables
 There are 296 fixed variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully

 ** SUBROUTINE CUTEST_csetup: Warning. The problem has no general constraints. 
 ** Other tools may be preferable ** 

 Problem: NLMSURF (n = 5625)
walltime at start:     0.000001

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

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


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

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         


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

Final f             :  3.894898481589055e+01
sup-norm of gradient:  9.690488527395319e-07
Number of iterations: 3557      
Function evaluations: 7095      
Gradient evaluations: 3582      

!!   NLMSURF   5625    0    0    0    0    0    0   3557   7095   3582       1       0     0    9.6904885e-07    3.8948985e+01    3.565519
 Final f                         = 3.8948985e+01   
 Function value at final x       = 3.8948985e+01   
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   ODC

 Problem name: ODC

 Double precision version will be formed

 The objective function uses 10082 nonlinear groups
 
 There are 4900 free variables
 There are 284 fixed variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully

 ** SUBROUTINE CUTEST_csetup: Warning. The problem has no general constraints. 
 ** Other tools may be preferable ** 

 Problem: ODC (n = 5184)
walltime at start:     0.000000

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

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


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

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         


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

Final f             : -1.137179620585191e-02
sup-norm of gradient:  9.719932557891416e-07
Number of iterations: 263       
Function evaluations: 526       
Gradient evaluations: 263       

!!       ODC   5184    0    0    0    0    0    0    263    526    263       1       0     0    9.7199326e-07   -1.1371796e-02    0.581830
 Final f                         = -1.1371796e-02  
 Function value at final x       = -1.1371796e-02  
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   POWELLBC

 Problem name: POWELLBC

 Double precision version will be formed

 The objective function uses 1 nonlinear group
 
 There are 1000 variables bounded from below and above 
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully

 ** SUBROUTINE CUTEST_csetup: Warning. The problem has no general constraints. 
 ** Other tools may be preferable ** 

 Problem: POWELLBC (n = 1000)
walltime at start:     0.000000

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

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


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 9.899068986185533e-07    
Final f                               : 3.103640310825538e+05    

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


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

Final f             :  3.103640310825538e+05
sup-norm of gradient:  9.899068986185533e-07
Number of iterations: 2213      
Function evaluations: 3624      
Gradient evaluations: 3457      

!!  POWELLBC   1000    0    0    0  123  154  123   2213   3624   3457       1       0     0    9.8990690e-07    3.1036403e+05   18.870728
 Final f                         = 3.1036403e+05   
 Function value at final x       = 3.1036403e+05   
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   PROBPENL

 Problem name: PROBPENL

 Double precision version will be formed

 The objective function uses 500 nonlinear groups
 
 There are 500 variables bounded from below and above 
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully

 ** SUBROUTINE CUTEST_csetup: Warning. The problem has no general constraints. 
 ** Other tools may be preferable ** 

 Problem: PROBPENL (n = 500)
walltime at start:     0.000001

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

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


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

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         


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

Final f             :  3.991983927190978e-07
sup-norm of gradient:  1.992004347982958e-07
Number of iterations: 1         
Function evaluations: 2         
Gradient evaluations: 1         

!!  PROBPENL    500    0    0    0    1    1    1      1      2      1       1       0     0    1.9920043e-07    3.9919839e-07    0.000352
 Final f                         = 3.9919839e-07   
 Function value at final x       = 3.9919839e-07   
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   QRTQUAD

 Problem name: QRTQUAD

 Double precision version will be formed

 The objective function uses 1 nonlinear group
 
 There are 3900 free variables
 There are 1100 variables bounded from below and above 
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully

 ** SUBROUTINE CUTEST_csetup: Warning. The problem has no general constraints. 
 ** Other tools may be preferable ** 

 Problem: QRTQUAD (n = 5000)
walltime at start:     0.000001

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

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


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

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


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

Final f             : -2.648560298935965e+11
sup-norm of gradient:  7.841990736778826e-07
Number of iterations: 3441      
Function evaluations: 6118      
Gradient evaluations: 8103      
Subspace iterations: 959       
Number of subspaces: 187       


!!   QRTQUAD   5000   10    0    0  331  551  477   3441   6118   8103       1       0     0    7.8419907e-07   -2.6485603e+11    1.474658
 Final f                         = -2.6485603e+11  
 Function value at final x       = -2.6485603e+11  
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   RAYBENDL

 Problem name: RAYBENDL

 Double precision version will be formed

 The objective function uses 1024 nonlinear groups
 
 There are 2046 free variables
 There are 4 fixed variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully

 ** SUBROUTINE CUTEST_csetup: Warning. The problem has no general constraints. 
 ** Other tools may be preferable ** 

 Problem: RAYBENDL (n = 2050)
walltime at start:     0.000001

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

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


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

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         


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

Final f             :  9.624237838109690e+01
sup-norm of gradient:  9.490021052327435e-07
Number of iterations: 13044     
Function evaluations: 22434     
Gradient evaluations: 16706     

!!  RAYBENDL   2050    0    0    0    0    0    0  13044  22434  16706       1       0     0    9.4900211e-07    9.6242378e+01    2.554411
 Final f                         = 9.6242378e+01   
 Function value at final x       = 9.6242378e+01   
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   RAYBENDS

 Problem name: RAYBENDS

 Double precision version will be formed

 The objective function uses 1026 nonlinear groups
 
 There are 2046 free variables
 There are 4 fixed variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully

 ** SUBROUTINE CUTEST_csetup: Warning. The problem has no general constraints. 
 ** Other tools may be preferable ** 

 Problem: RAYBENDS (n = 2050)
walltime at start:     0.000001

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

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


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

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         


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

Final f             :  9.624171097879515e+01
sup-norm of gradient:  9.512089507168753e-07
Number of iterations: 1765      
Function evaluations: 3349      
Gradient evaluations: 1954      

!!  RAYBENDS   2050    0    0    0    0    0    0   1765   3349   1954       1       0     0    9.5120895e-07    9.6241711e+01   11.643763
 Final f                         = 9.6241711e+01   
 Function value at final x       = 9.6241711e+01   
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   S368

 Problem name: S368

 Double precision version will be formed

 The objective function uses 128 nonlinear groups
 
 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

 ** SUBROUTINE CUTEST_csetup: Warning. The problem has no general constraints. 
 ** Other tools may be preferable ** 

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

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

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


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

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         


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

Final f             : -7.499999999998372e-01
sup-norm of gradient:  6.332059878655372e-07
Number of iterations: 6         
Function evaluations: 12        
Gradient evaluations: 6         

!!      S368      8    0    0    0    2    2    2      6     12      6       1       0     0    6.3320599e-07   -7.5000000e-01    0.000210
 Final f                         = -7.5000000e-01  
 Function value at final x       = -7.5000000e-01  
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   SINEALI

 Problem name: SINEALI

 Double precision version will be formed

 The objective function uses 1 linear group
 The objective function uses 999 nonlinear groups
 
 There are 1000 variables bounded from below and above 
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully

 ** SUBROUTINE CUTEST_csetup: Warning. The problem has no general constraints. 
 ** Other tools may be preferable ** 

 Problem: SINEALI (n = 1000)
walltime at start:     0.000001

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

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


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

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         


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

Final f             : -9.990096164870949e+04
sup-norm of gradient:  6.270372980927772e-07
Number of iterations: 43        
Function evaluations: 75        
Gradient evaluations: 62        

!!   SINEALI   1000    0    0    0    1    1    1     43     75     62       1       0     0    6.2703730e-07   -9.9900962e+04    0.014829
 Final f                         = -9.9900962e+04  
 Function value at final x       = -9.9900962e+04  
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   SSC

 Problem name: SSC

 Double precision version will be formed

 The objective function uses 10082 nonlinear groups
 
 There are 4900 free variables
 There are 284 fixed variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully

 ** SUBROUTINE CUTEST_csetup: Warning. The problem has no general constraints. 
 ** Other tools may be preferable ** 

 Problem: SSC (n = 5184)
walltime at start:     0.000000

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

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


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 7.878113489443329e-07    
Final f                               : -2.078173275083308e+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         


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

Final f             : -2.078173275083308e+00
sup-norm of gradient:  7.878113489443329e-07
Number of iterations: 132       
Function evaluations: 186       
Gradient evaluations: 210       

!!       SSC   5184    0    0    0    0    0    0    132    186    210       1       0     0    7.8781135e-07   -2.0781733e+00    0.405933
 Final f                         = -2.0781733e+00  
 Function value at final x       = -2.0781733e+00  
 ====================================================

