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
Initializing PASAdata structure.
Successfully initialized PASAdata structure.

 Problem: BIGBANK (2230)
sup norm of Ax: 1.000000e+00
walltime at start:     0.000000

PASA run status (Version 1.0, July 1, 2019): 0

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


PASA run statistics (Version 1.0, July 1, 2019):
|| P (x - g) - x ||                   : 8.326889928272907e-07    
Final f                               : -4.205693299537724e+06   

Iterations of gradient projection (GP): 14        
Iterations of active set GP           : 466       
Function evaluation in main code      : 1         
Function evaluations in GP            : 40        
Function evaluations in active set GP : 819       
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 22        
Gradient evaluations in active set GP : 537       


PPROJ run statistics (Version 2.0, July 1, 2019):

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  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 ....................... 0
    change in column activity ........... 0
    change in row activity .............. 0
    failures of Armijo step ............. 0
Proximal updates ........................ 0
Cholesky factorizations ................. 277
    nonzeros in final factor ............ 6169 99.0% sparse
    rows dropped from L ................. 0
    rows added to L ..................... 0
    rank 1 downdates to L ............... 3017
    rank 1 updates to L ................. 23776
    Size breakdown of the updates ([size]: number of this size):
        updowns [  1]: 1044
        updowns [  2]: 345
        updowns [  3]: 233
        updowns [  4]: 214
        updowns [  5]: 134
        updowns [  6]: 86
        updowns [  7]: 64
        updowns [  8]: 50
        updowns [  9]: 43
        updowns [ 10]: 37
        updowns [ 11]: 36
        updowns [ 12]: 29
        updowns [ 13]: 15
        updowns [ 14]: 21
        updowns [ 15]: 17
        updowns [ 16]: 22
        updowns [ 17]: 15
        updowns [ 18]: 18
        updowns [ 19]: 11
        updowns [ 20]: 12
        updowns [ 21]: 12
        updowns [ 22]: 10
        updowns [ 23]: 5
        updowns [ 24]: 8
        updowns [ 25]: 6
        updowns [ 26]: 6
        updowns [ 27]: 3
        updowns [ 28]: 4
        updowns [ 29]: 1
        updowns [ 30]: 8
        updowns [ 31]: 2
        updowns [ 32]: 4
        updowns [ 33]: 4
        updowns [ 34]: 4
        updowns [ 35]: 3
        updowns [ 36]: 8
        updowns [ 37]: 8
        updowns [ 38]: 5
        updowns [ 39]: 1
        updowns [ 40]: 1
        updowns [ 42]: 4
        updowns [ 43]: 3
        updowns [ 44]: 2
        updowns [ 45]: 2
        updowns [ 46]: 2
        updowns [ 47]: 2
        updowns [ 48]: 3
        updowns [ 49]: 2
        updowns [ 51]: 1
        updowns [ 53]: 1
        updowns [ 54]: 2
        updowns [ 55]: 1
        updowns [ 56]: 3
        updowns [ 58]: 2
        updowns [ 59]: 1
        updowns [ 60]: 1
        updowns [ 61]: 3
        updowns [ 62]: 1
        updowns [ 64]: 1
        updowns [ 65]: 1
        updowns [ 66]: 2
        updowns [ 67]: 1
        updowns [ 68]: 4
        updowns [ 69]: 1
        updowns [ 70]: 1
        updowns [ 73]: 1
        updowns [ 75]: 3
        updowns [ 81]: 1
        updowns [ 85]: 1
        updowns [ 86]: 1
        updowns [ 90]: 1
        updowns [ 92]: 1
        updowns [ 94]: 1
        updowns [ 95]: 1
        updowns [102]: 1
        updowns [104]: 1
        updowns [114]: 1
        updowns [117]: 1
        updowns [119]: 1
        updowns [120]: 1
        updowns [123]: 1
        updowns [>=131]: 31
    No. of solves by depth in the multilevel partition tree:
        (deeper <=> further from root of tree <=> fewer flops)
        depth [ 0]: 1064
        depth [ 1]: 121991

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 2.329826e-03
Initialization (includes partition) ..... 1.931071e-02
Phase 1 ................................. 2.369070e-02
Coordinate ascent ....................... 4.816055e-05
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 0.000000e+00
DASA .................................... 5.569804e-01
DASA line search ........................ 1.185141e-01
Check error ............................. 4.695249e-02
Proximal update ......................... 0.000000e+00
Invert permutation ...................... 1.723766e-03
Row modifications of Cholesky factor .... 2.008915e-03
Column modifications of Cholesky factor . 6.615877e-02
Cholesky factorization .................. 6.019783e-02
Partial Cholesky factorization .......... 3.670597e-02
Back solves ............................. 9.885406e-02
Forward solves .......................... 1.876378e-02


CG_DESCENT (Version 7.0, July 1, 2019) run statistics:

Final f             : -4.205693299537724e+06
sup-norm of gradient:  9.679408120717504e-07
Number of iterations: 5637      
Function evaluations: 8871      
Gradient evaluations: 8167      

!!   BIGBANK   2230   14   40   22  466  819  537   5637   8871   8167     483     277     0    8.3268899e-07   -4.2056933e+06    2.572246
 Final f                         = -4.2056933e+06  
 Function value at final x       = -4.2056932995377239e+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
Initializing PASAdata structure.
Successfully initialized PASAdata structure.

 Problem: DALLASM (196)
sup norm of Ax: 1.000000e+00
walltime at start:     0.000001

PASA run status (Version 1.0, July 1, 2019): 0

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


PASA run statistics (Version 1.0, July 1, 2019):
|| P (x - g) - x ||                   : 9.522668045214289e-07    
Final f                               : -4.819818819205883e+04   

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


PPROJ run statistics (Version 2.0, July 1, 2019):

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  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 ....................... 0
    change in column activity ........... 0
    change in row activity .............. 0
    failures of Armijo step ............. 0
Proximal updates ........................ 0
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 ............... 35
    rank 1 updates to L ................. 104
    Size breakdown of the updates ([size]: number of this size):
        updowns [  1]: 32
        updowns [  2]: 9
        updowns [  3]: 2
        updowns [  4]: 4
        updowns [  5]: 3
        updowns [  6]: 1
        updowns [  7]: 2
        updowns [  8]: 1
        updowns [ 12]: 2
    No. of solves:   51

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 1.249313e-04
Initialization (includes partition) ..... 2.579689e-04
Phase 1 ................................. 3.297329e-04
Coordinate ascent ....................... 1.096725e-05
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 0.000000e+00
DASA .................................... 8.969307e-04
DASA line search ........................ 1.630783e-04
Check error ............................. 1.583099e-04
Proximal update ......................... 0.000000e+00
Invert permutation ...................... 2.098083e-05
Row modifications of Cholesky factor .... 2.455711e-05
Column modifications of Cholesky factor . 2.377033e-04
Cholesky factorization .................. 9.703636e-05
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 8.869171e-05
Forward solves .......................... 3.242493e-05


CG_DESCENT (Version 7.0, July 1, 2019) run statistics:

Final f             : -4.819818819205296e+04
sup-norm of gradient:  9.522668045214289e-07
Number of iterations: 551       
Function evaluations: 960       
Gradient evaluations: 786       
Subspace iterations: 38        
Number of subspaces: 10        


!!   DALLASM    196    2    5    2   14   16   14    551    960    786      18       2     0    9.5226680e-07   -4.8198188e+04    0.092476
 Final f                         = -4.8198188e+04  
 Function value at final x       = -4.8198188192058828e+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
Initializing PASAdata structure.
Successfully initialized PASAdata structure.

 Problem: DALLASS (46)
sup norm of Ax: 1.000000e+00
walltime at start:     0.000001

PASA run status (Version 1.0, July 1, 2019): 0

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


PASA run statistics (Version 1.0, July 1, 2019):
|| P (x - g) - x ||                   : 7.804523438209587e-07    
Final f                               : -3.239322429887727e+04   

Iterations of gradient projection (GP): 4         
Iterations of active set GP           : 15        
Function evaluation in main code      : 1         
Function evaluations in GP            : 9         
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, July 1, 2019):

No. blocks in multilevel partition of A . 1
Depth of multilevel partition tree ...... 0
Phase 1 iterations ...................... 5
Coordinate ascent iterations ............ 11
    variables freed in coordinate ascent  12
    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 ................. 3
    nonzeros in final factor ............ 106 78.6% sparse
    rows dropped from L ................. 0
    rows added to L ..................... 0
    rank 1 downdates to L ............... 14
    rank 1 updates to L ................. 22
    Size breakdown of the updates ([size]: number of this size):
        updowns [  1]: 16
        updowns [  2]: 3
        updowns [  3]: 2
        updowns [  4]: 2
    No. of solves:   20

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 6.818771e-05
Initialization (includes partition) ..... 1.378059e-04
Phase 1 ................................. 1.168251e-04
Coordinate ascent ....................... 2.884865e-05
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 0.000000e+00
DASA .................................... 3.359318e-04
DASA line search ........................ 2.789497e-05
Check error ............................. 7.653236e-05
Proximal update ......................... 0.000000e+00
Invert permutation ...................... 1.692772e-05
Row modifications of Cholesky factor .... 5.960464e-06
Column modifications of Cholesky factor . 8.082390e-05
Cholesky factorization .................. 4.720688e-05
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 1.907349e-05
Forward solves .......................... 1.764297e-05


CG_DESCENT (Version 7.0, July 1, 2019) run statistics:

Final f             : -3.239322429887682e+04
sup-norm of gradient:  7.804523438209587e-07
Number of iterations: 244       
Function evaluations: 450       
Gradient evaluations: 366       
Subspace iterations: 88        
Number of subspaces: 12        


!!   DALLASS     46    4    9    4   15   15   15    244    450    366      21       3     0    7.8045234e-07   -3.2393224e+04    0.010626
 Final f                         = -3.2393224e+04  
 Function value at final x       = -3.2393224298877270e+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
Initializing PASAdata structure.
Successfully initialized PASAdata structure.

 Problem: DTOC1L (5998)
sup norm of Ax: 1.000000e+00
walltime at start:     0.000000

PASA run status (Version 1.0, July 1, 2019): 0

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


PASA run statistics (Version 1.0, July 1, 2019):
|| P (x - g) - x ||                   : 2.763517617104805e-07    
Final f                               : 3.943043545506821e+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, July 1, 2019):

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 ....................... 0
    change in column activity ........... 0
    change in row activity .............. 0
    failures of Armijo step ............. 0
Proximal updates ........................ 0
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.319046e-03
Initialization (includes partition) ..... 6.930113e-03
Phase 1 ................................. 1.047802e-02
Coordinate ascent ....................... 1.299381e-04
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 0.000000e+00
DASA .................................... 2.702951e-03
DASA line search ........................ 2.565384e-04
Check error ............................. 1.821518e-04
Proximal update ......................... 0.000000e+00
Invert permutation ...................... 3.910065e-05
Row modifications of Cholesky factor .... 2.861023e-06
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 1.588106e-03
Partial Cholesky factorization .......... 1.137257e-04
Back solves ............................. 1.790524e-04
Forward solves .......................... 9.703636e-05


CG_DESCENT (Version 7.0, July 1, 2019) run statistics:

Final f             :  3.943043545511780e+00
sup-norm of gradient:  2.763517617104805e-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.7635176e-07    3.9430435e+00    0.032230
 Final f                         = 3.9430435e+00   
 Function value at final x       = 3.9430435455068209e+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
Initializing PASAdata structure.
Successfully initialized PASAdata structure.

 Problem: DUAL1 (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
sup norm of Ax: 1.000000e+00
walltime at start:     0.000001

PASA run status (Version 1.0, July 1, 2019): 0

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


PASA run statistics (Version 1.0, July 1, 2019):
|| P (x - g) - x ||                   : 9.032284918268331e-07    
Final f                               : 3.501296781587563e-02    

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


NAPHEAP statistics (Version 3.0, July 1, 2019):
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, July 1, 2019) run statistics:

Final f             :  3.501296781587563e-02
sup-norm of gradient:  9.032284918268331e-07
Number of iterations: 182       
Function evaluations: 0         
Gradient evaluations: 182       

!!     DUAL1     85    3    0    3   42    0   42    182      0    182      47       0     0    9.0322849e-07    3.5012968e-02    0.002403
 Final f                         = 3.5012968e-02   
 Function value at final x       = 3.5012967815875568e-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
Initializing PASAdata structure.
Successfully initialized PASAdata structure.

 Problem: DUAL2 (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
sup norm of Ax: 1.000000e+00
walltime at start:     0.000000

PASA run status (Version 1.0, July 1, 2019): 0

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


PASA run statistics (Version 1.0, July 1, 2019):
|| 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.0, July 1, 2019):
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, July 1, 2019) 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.001164
 Final f                         = 3.3733671e-02   
 Function value at final x       = 3.3733671364342167e-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
Initializing PASAdata structure.
Successfully initialized PASAdata structure.

 Problem: DUAL3 (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
sup norm of Ax: 1.000000e+00
walltime at start:     0.000001

PASA run status (Version 1.0, July 1, 2019): 0

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


PASA run statistics (Version 1.0, July 1, 2019):
|| P (x - g) - x ||                   : 5.648726055835865e-07    
Final f                               : 1.357558327515575e-01    

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


NAPHEAP statistics (Version 3.0, July 1, 2019):
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, July 1, 2019) run statistics:

Final f             :  1.357558327515575e-01
sup-norm of gradient:  5.648726055835865e-07
Number of iterations: 65        
Function evaluations: 0         
Gradient evaluations: 65        

!!     DUAL3    111    2    0    2   18    0   18     65      0     65      22       0     0    5.6487261e-07    1.3575583e-01    0.001588
 Final f                         = 1.3575583e-01   
 Function value at final x       = 1.3575583275155725e-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
Initializing PASAdata structure.
Successfully initialized PASAdata structure.

 Problem: DUAL4 (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
sup norm of Ax: 1.000000e+00
walltime at start:     0.000001

PASA run status (Version 1.0, July 1, 2019): 0

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


PASA run statistics (Version 1.0, July 1, 2019):
|| 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.0, July 1, 2019):
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, July 1, 2019) 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.000548
 Final f                         = 7.4609065e-01   
 Function value at final x       = 7.4609064935902214e-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
Initializing PASAdata structure.
Successfully initialized PASAdata structure.

 Problem: DUALC1 (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
sup norm of Ax: 2.059000e+03
walltime at start:     0.000000

PASA run status (Version 1.0, July 1, 2019): 0

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


PASA run statistics (Version 1.0, July 1, 2019):
|| P (x - g) - x ||                   : 2.191228531955858e-09    
Final f                               : 6.155251685648139e+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, July 1, 2019):

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 ....................... 0
    change in column activity ........... 0
    change in row activity .............. 0
    failures of Armijo step ............. 0
Proximal updates ........................ 0
Cholesky factorizations ................. 12
    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:   12

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 6.890297e-05
Initialization (includes partition) ..... 1.575947e-04
Phase 1 ................................. 1.692772e-04
Coordinate ascent ....................... 6.675720e-06
SSOR0 ................................... 6.198883e-06
SSOR1 ................................... 2.098083e-05
SpaRSA .................................. 0.000000e+00
DASA .................................... 2.825260e-04
DASA line search ........................ 1.478195e-05
Check error ............................. 9.059906e-05
Proximal update ......................... 0.000000e+00
Invert permutation ...................... 8.344650e-06
Row modifications of Cholesky factor .... 0.000000e+00
Column modifications of Cholesky factor . 1.025200e-05
Cholesky factorization .................. 1.215935e-04
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 8.106232e-06
Forward solves .......................... 8.344650e-06


CG_DESCENT (Version 7.0, July 1, 2019) run statistics:

Final f             :  6.155251685648139e+03
sup-norm of gradient:  2.191228531955858e-09
Number of iterations: 6         
Function evaluations: 0         
Gradient evaluations: 6         

!!    DUALC1      9    1    0    1    6    0    6      6      0      6       9      12     0    2.1912285e-09    6.1552517e+03    0.001032
 Final f                         = 6.1552517e+03   
 Function value at final x       = 6.1552516856481234e+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
Initializing PASAdata structure.
Successfully initialized PASAdata structure.

 Problem: DUALC2 (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
sup norm of Ax: 2.237000e+03
walltime at start:     0.000001

PASA run status (Version 1.0, July 1, 2019): 0

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


PASA run statistics (Version 1.0, July 1, 2019):
|| P (x - g) - x ||                   : 1.306869279460443e-09    
Final f                               : 3.551306384465632e+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, July 1, 2019):

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  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 ....................... 0
    change in column activity ........... 0
    change in row activity .............. 0
    failures of Armijo step ............. 0
Proximal updates ........................ 0
Cholesky factorizations ................. 12
    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:   13

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 6.508827e-05
Initialization (includes partition) ..... 1.516342e-04
Phase 1 ................................. 1.633167e-04
Coordinate ascent ....................... 5.006790e-06
SSOR0 ................................... 4.053116e-06
SSOR1 ................................... 1.907349e-05
SpaRSA .................................. 0.000000e+00
DASA .................................... 2.789497e-04
DASA line search ........................ 1.907349e-05
Check error ............................. 8.034706e-05
Proximal update ......................... 0.000000e+00
Invert permutation ...................... 6.675720e-06
Row modifications of Cholesky factor .... 9.059906e-06
Column modifications of Cholesky factor . 1.192093e-05
Cholesky factorization .................. 1.320839e-04
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 8.583069e-06
Forward solves .......................... 1.168251e-05


CG_DESCENT (Version 7.0, July 1, 2019) run statistics:

Final f             :  3.551306384465632e+03
sup-norm of gradient:  1.306869279460443e-09
Number of iterations: 6         
Function evaluations: 0         
Gradient evaluations: 6         

!!    DUALC2      7    1    0    1    6    0    6      6      0      6       9      12     0    1.3068693e-09    3.5513064e+03    0.001004
 Final f                         = 3.5513064e+03   
 Function value at final x       = 3.5513063844656340e+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
Initializing PASAdata structure.
Successfully initialized PASAdata structure.

 Problem: DUALC5 (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
sup norm of Ax: 6.000000e+02
walltime at start:     0.000001

PASA run status (Version 1.0, July 1, 2019): 0

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


PASA run statistics (Version 1.0, July 1, 2019):
|| P (x - g) - x ||                   : 2.967581735902058e-10    
Final f                               : 4.272325678478181e+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, July 1, 2019):

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

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 6.699562e-05
Initialization (includes partition) ..... 1.602173e-04
Phase 1 ................................. 1.473427e-04
Coordinate ascent ....................... 2.861023e-06
SSOR0 ................................... 2.861023e-06
SSOR1 ................................... 3.814697e-06
SpaRSA .................................. 0.000000e+00
DASA .................................... 1.001358e-04
DASA line search ........................ 5.245209e-06
Check error ............................. 3.385544e-05
Proximal update ......................... 0.000000e+00
Invert permutation ...................... 7.867813e-06
Row modifications of Cholesky factor .... 0.000000e+00
Column modifications of Cholesky factor . 8.106232e-06
Cholesky factorization .................. 5.197525e-05
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 1.907349e-06
Forward solves .......................... 4.053116e-06


CG_DESCENT (Version 7.0, July 1, 2019) run statistics:

Final f             :  4.272325678478181e+02
sup-norm of gradient:  2.967581735902058e-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.9675817e-10    4.2723257e+02    0.000729
 Final f                         = 4.2723257e+02   
 Function value at final x       = 4.2723256784781802e+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
Initializing PASAdata structure.
Successfully initialized PASAdata structure.

 Problem: DUALC8 (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
sup norm of Ax: 2.007000e+03
walltime at start:     0.000001

PASA run status (Version 1.0, July 1, 2019): 0

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


PASA run statistics (Version 1.0, July 1, 2019):
|| P (x - g) - x ||                   : 4.693128098143154e-07    
Final f                               : 1.830936123922382e+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, July 1, 2019):

No. blocks in multilevel partition of A . 1
Depth of multilevel partition tree ...... 0
Phase 1 iterations ...................... 7
Coordinate ascent iterations ............ 4
    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 ....................... 0
    change in column activity ........... 0
    change in row activity .............. 0
    failures of Armijo step ............. 0
Proximal updates ........................ 0
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 ...... 1.189709e-04
Initialization (includes partition) ..... 2.844334e-04
Phase 1 ................................. 3.423691e-04
Coordinate ascent ....................... 7.867813e-06
SSOR0 ................................... 5.006790e-06
SSOR1 ................................... 2.908707e-05
SpaRSA .................................. 0.000000e+00
DASA .................................... 3.399849e-04
DASA line search ........................ 1.811981e-05
Check error ............................. 1.189709e-04
Proximal update ......................... 0.000000e+00
Invert permutation ...................... 8.821487e-06
Row modifications of Cholesky factor .... 2.002716e-05
Column modifications of Cholesky factor . 4.053116e-06
Cholesky factorization .................. 1.680851e-04
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 5.006790e-06
Forward solves .......................... 7.867813e-06


CG_DESCENT (Version 7.0, July 1, 2019) run statistics:

Final f             :  1.830936123911700e+04
sup-norm of gradient:  1.963089744094759e-07
Number of iterations: 7         
Function evaluations: 0         
Gradient evaluations: 7         

!!    DUALC8      8    2    0    2    5    0    5      7      0      7      10       8     0    4.6931281e-07    1.8309361e+04    0.001596
 Final f                         = 1.8309361e+04   
 Function value at final x       = 1.8309361239223770e+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
Initializing PASAdata structure.
Successfully initialized PASAdata structure.

 Problem: EQC (9)
sup norm of Ax: 1.000000e+00
walltime at start:     0.000000

PASA run status (Version 1.0, July 1, 2019): 0

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


PASA run statistics (Version 1.0, July 1, 2019):
|| 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, July 1, 2019):

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

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


CG_DESCENT (Version 7.0, July 1, 2019) 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.000209
 Final f                         = -8.2954771e+02  
 Function value at final x       = -8.2954770531877341e+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
Initializing PASAdata structure.
Successfully initialized PASAdata structure.

 Problem: EXPFITA (5)
sup norm of Ax: 8.034215e+01
walltime at start:     0.000001

PASA run status (Version 1.0, July 1, 2019): 0

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


PASA run statistics (Version 1.0, July 1, 2019):
|| P (x - g) - x ||                   : 7.683422074751425e-07    
Final f                               : 1.136611928401490e-03    

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


PPROJ run statistics (Version 2.0, July 1, 2019):

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  0
    rows dropped in coordinate ascent ... 32
Gradient ascent iterations .............. 1
    variables freed in gradient ascent .. 0
    rows dropped in gradient ascent ..... 0
Preconditioned CG iterations ............ 3
    variables freed in CG ............... 0
    rows dropped in CG .................. 1
SpaRSA iterations ....................... 0
    change in column activity ........... 0
    change in row activity .............. 0
    failures of Armijo step ............. 0
Proximal updates ........................ 0
Cholesky factorizations ................. 5
    nonzeros in final factor ............ 10 96.0% sparse
    rows dropped from L ................. 19
    rows added to L ..................... 12
    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:   24

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 3.099442e-05
Initialization (includes partition) ..... 6.651878e-05
Phase 1 ................................. 5.269051e-05
Coordinate ascent ....................... 1.001358e-05
SSOR0 ................................... 4.768372e-06
SSOR1 ................................... 8.821487e-06
SpaRSA .................................. 0.000000e+00
DASA .................................... 2.655983e-04
DASA line search ........................ 2.837181e-05
Check error ............................. 3.886223e-05
Proximal update ......................... 0.000000e+00
Invert permutation ...................... 1.120567e-05
Row modifications of Cholesky factor .... 6.937981e-05
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 3.218651e-05
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 1.883507e-05
Forward solves .......................... 8.583069e-06


CG_DESCENT (Version 7.0, July 1, 2019) run statistics:

Final f             :  1.136611928445077e-03
sup-norm of gradient:  7.683422074751425e-07
Number of iterations: 8         
Function evaluations: 12        
Gradient evaluations: 8         

!!   EXPFITA      5    2    2    2    9    9    9      8     12      8      14       5     0    7.6834221e-07    1.1366119e-03    0.000707
 Final f                         = 1.1366119e-03   
 Function value at final x       = 1.1366119284014903e-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
Initializing PASAdata structure.
Successfully initialized PASAdata structure.

 Problem: EXPFITB (5)
sup norm of Ax: 8.034215e+01
walltime at start:     0.000000

PASA run status (Version 1.0, July 1, 2019): 0

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


PASA run statistics (Version 1.0, July 1, 2019):
|| P (x - g) - x ||                   : 2.113498317736994e-07    
Final f                               : 5.019365530609737e-03    

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


PPROJ run statistics (Version 2.0, July 1, 2019):

No. blocks in multilevel partition of A . 1
Depth of multilevel partition tree ...... 0
Phase 1 iterations ...................... 5
Coordinate ascent iterations ............ 49
    variables freed in coordinate ascent  0
    rows dropped in coordinate ascent ... 793
Gradient ascent iterations .............. 45
    variables freed in gradient ascent .. 0
    rows dropped in gradient ascent ..... 23
Preconditioned CG iterations ............ 75
    variables freed in CG ............... 0
    rows dropped in CG .................. 14
SpaRSA iterations ....................... 0
    change in column activity ........... 0
    change in row activity .............. 0
    failures of Armijo step ............. 0
Proximal updates ........................ 0
Cholesky factorizations ................. 13
    nonzeros in final factor ............ 10 99.8% sparse
    rows dropped from L ................. 258
    rows added to L ..................... 207
    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:   256

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 3.910065e-05
Initialization (includes partition) ..... 1.058578e-04
Phase 1 ................................. 1.380444e-04
Coordinate ascent ....................... 8.249283e-05
SSOR0 ................................... 4.386902e-05
SSOR1 ................................... 7.319450e-05
SpaRSA .................................. 0.000000e+00
DASA .................................... 2.536774e-03
DASA line search ........................ 2.508163e-04
Check error ............................. 3.118515e-04
Proximal update ......................... 0.000000e+00
Invert permutation ...................... 1.907349e-05
Row modifications of Cholesky factor .... 8.985996e-04
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 1.742840e-04
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 1.831055e-04
Forward solves .......................... 3.981590e-05


CG_DESCENT (Version 7.0, July 1, 2019) run statistics:

Final f             :  5.019365530712283e-03
sup-norm of gradient:  2.113498317736994e-07
Number of iterations: 5         
Function evaluations: 7         
Gradient evaluations: 5         

!!   EXPFITB      5    7    7    7   11   11   11      5      7      5      23      13     0    2.1134983e-07    5.0193655e-03    0.003535
 Final f                         = 5.0193655e-03   
 Function value at final x       = 5.0193655306097372e-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
Initializing PASAdata structure.
Successfully initialized PASAdata structure.

 Problem: EXPFITC (5)
sup norm of Ax: 8.034215e+01
walltime at start:     0.000001

PASA run status (Version 1.0, July 1, 2019): 0

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


PASA run statistics (Version 1.0, July 1, 2019):
|| P (x - g) - x ||                   : 1.560229979694988e-10    
Final f                               : 2.330257260641504e-02    

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


PPROJ run statistics (Version 2.0, July 1, 2019):

No. blocks in multilevel partition of A . 1
Depth of multilevel partition tree ...... 0
Phase 1 iterations ...................... 7
Coordinate ascent iterations ............ 87
    variables freed in coordinate ascent  0
    rows dropped in coordinate ascent ... 4253
Gradient ascent iterations .............. 433
    variables freed in gradient ascent .. 0
    rows dropped in gradient ascent ..... 686
Preconditioned CG iterations ............ 425
    variables freed in CG ............... 0
    rows dropped in CG .................. 79
SpaRSA iterations ....................... 0
    change in column activity ........... 0
    change in row activity .............. 0
    failures of Armijo step ............. 0
Proximal updates ........................ 0
Cholesky factorizations ................. 27
    nonzeros in final factor ............ 9 100.0% sparse
    rows dropped from L ................. 720
    rows added to L ..................... 448
    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:   675

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 8.893013e-05
Initialization (includes partition) ..... 2.217293e-04
Phase 1 ................................. 5.681515e-04
Coordinate ascent ....................... 2.551079e-04
SSOR0 ................................... 9.224415e-04
SSOR1 ................................... 4.527569e-04
SpaRSA .................................. 0.000000e+00
DASA .................................... 2.382755e-02
DASA line search ........................ 1.106262e-03
Check error ............................. 1.368999e-03
Proximal update ......................... 0.000000e+00
Invert permutation ...................... 2.741814e-05
Row modifications of Cholesky factor .... 1.470494e-02
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 2.072573e-03
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 1.794338e-03
Forward solves .......................... 9.274483e-05


CG_DESCENT (Version 7.0, July 1, 2019) run statistics:

Final f             :  2.330257260641521e-02
sup-norm of gradient:  1.560229979694988e-10
Number of iterations: 4         
Function evaluations: 7         
Gradient evaluations: 4         

!!   EXPFITC      5    8    9    8   14   14   14      4      7      4      27      27     0    1.5602300e-10    2.3302573e-02    0.027156
 Final f                         = 2.3302573e-02   
 Function value at final x       = 2.3302572606415037e-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
Initializing PASAdata structure.
Successfully initialized PASAdata structure.

 Problem: GMNCASE2 (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
sup norm of Ax: 1.000000e+00
walltime at start:     0.000001

PASA run status (Version 1.0, July 1, 2019): 0

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


PASA run statistics (Version 1.0, July 1, 2019):
|| P (x - g) - x ||                   : 6.766715298806646e-07    
Final f                               : -9.944449513727667e-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, July 1, 2019):

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 ....................... 0
    change in column activity ........... 0
    change in row activity .............. 0
    failures of Armijo step ............. 0
Proximal updates ........................ 0
Cholesky factorizations ................. 2
    nonzeros in final factor ............ 3319 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.284409e-02
Initialization (includes partition) ..... 1.342702e-02
Phase 1 ................................. 2.721071e-03
Coordinate ascent ....................... 7.963181e-05
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 0.000000e+00
DASA .................................... 6.018639e-03
DASA line search ........................ 5.412102e-05
Check error ............................. 5.452633e-04
Proximal update ......................... 0.000000e+00
Invert permutation ...................... 1.502037e-05
Row modifications of Cholesky factor .... 4.689693e-04
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 5.005836e-03
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 2.217293e-05
Forward solves .......................... 2.193451e-05


CG_DESCENT (Version 7.0, July 1, 2019) run statistics:

Final f             : -9.944449513727667e-01
sup-norm of gradient:  6.766715298806646e-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.7667153e-07   -9.9444495e-01    0.027966
 Final f                         = -9.9444495e-01  
 Function value at final x       = -9.9444495137277256e-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
Initializing PASAdata structure.
Successfully initialized PASAdata structure.

 Problem: GMNCASE3 (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
sup norm of Ax: 1.000000e+00
walltime at start:     0.000001

PASA run status (Version 1.0, July 1, 2019): 0

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


PASA run statistics (Version 1.0, July 1, 2019):
|| P (x - g) - x ||                   : 5.111130882702806e-07    
Final f                               : 1.525146674530259e+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, July 1, 2019):

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 ... 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 ................. 2
    nonzeros in final factor ............ 3400 99.4% sparse
    rows dropped from L ................. 22
    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:   6

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 1.283598e-02
Initialization (includes partition) ..... 1.341367e-02
Phase 1 ................................. 2.818108e-03
Coordinate ascent ....................... 5.912781e-05
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 0.000000e+00
DASA .................................... 5.853891e-03
DASA line search ........................ 4.386902e-05
Check error ............................. 3.879070e-04
Proximal update ......................... 0.000000e+00
Invert permutation ...................... 2.598763e-05
Row modifications of Cholesky factor .... 4.327297e-04
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 5.089760e-03
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 3.099442e-05
Forward solves .......................... 1.692772e-05


CG_DESCENT (Version 7.0, July 1, 2019) run statistics:

Final f             :  1.525146674530259e+00
sup-norm of gradient:  5.111130882702806e-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.027940
 Final f                         = 1.5251467e+00   
 Function value at final x       = 1.5251466745302527e+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
Initializing PASAdata structure.
Successfully initialized PASAdata structure.

 Problem: GMNCASE4 (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
sup norm of Ax: 9.525110e-01
walltime at start:     0.000001

PASA run status (Version 1.0, July 1, 2019): 0

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


PASA run statistics (Version 1.0, July 1, 2019):
|| P (x - g) - x ||                   : 1.320721310094086e-12    
Final f                               : 5.946884924457710e+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, July 1, 2019):

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 ... 26
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 ................. 2
    nonzeros in final factor ............ 39720 35.3% sparse
    rows dropped from L ................. 12
    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:   4

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 5.128384e-04
Initialization (includes partition) ..... 1.020193e-03
Phase 1 ................................. 3.386974e-03
Coordinate ascent ....................... 1.480579e-04
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 0.000000e+00
DASA .................................... 2.940083e-02
DASA line search ........................ 1.261234e-04
Check error ............................. 1.471043e-04
Proximal update ......................... 0.000000e+00
Invert permutation ...................... 6.818771e-05
Row modifications of Cholesky factor .... 1.155138e-03
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 2.759504e-02
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 9.703636e-05
Forward solves .......................... 5.507469e-05


CG_DESCENT (Version 7.0, July 1, 2019) 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    1.3207213e-12    5.9468849e+03    0.034885
 Final f                         = 5.9468849e+03   
 Function value at final x       = 5.9468849244576550e+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
Initializing PASAdata structure.
Successfully initialized PASAdata structure.

 Problem: GRIDNETD (7564)
sup norm of Ax: 1.000000e+00
walltime at start:     0.000000

PASA run status (Version 1.0, July 1, 2019): 0

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


PASA run statistics (Version 1.0, July 1, 2019):
|| P (x - g) - x ||                   : 8.614288682942821e-07    
Final f                               : 5.707119019084018e+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, July 1, 2019):

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  4
    rows dropped in coordinate ascent ... 0
Gradient ascent iterations .............. 0
    variables freed in gradient ascent .. 0
    rows dropped in gradient ascent ..... 0
Preconditioned CG iterations ............ 0
    variables freed in CG ............... 0
    rows dropped in CG .................. 0
SpaRSA iterations ....................... 0
    change in column activity ........... 0
    change in row activity .............. 0
    failures of Armijo step ............. 0
Proximal updates ........................ 0
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.908966e-03
Initialization (includes partition) ..... 7.615566e-03
Phase 1 ................................. 9.466171e-03
Coordinate ascent ....................... 8.702278e-05
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 0.000000e+00
DASA .................................... 7.588863e-03
DASA line search ........................ 1.979113e-03
Check error ............................. 1.290083e-03
Proximal update ......................... 0.000000e+00
Invert permutation ...................... 1.592636e-04
Row modifications of Cholesky factor .... 3.004074e-05
Column modifications of Cholesky factor . 5.171299e-04
Cholesky factorization .................. 1.410961e-03
Partial Cholesky factorization .......... 1.320839e-04
Back solves ............................. 1.195908e-03
Forward solves .......................... 6.599426e-04


CG_DESCENT (Version 7.0, July 1, 2019) run statistics:

Final f             :  5.707119019796554e+02
sup-norm of gradient:  8.614288682942821e-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.6142887e-07    5.7071190e+02    0.079331
 Final f                         = 5.7071190e+02   
 Function value at final x       = 5.7071190190840184e+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
Initializing PASAdata structure.
Successfully initialized PASAdata structure.

 Problem: GRIDNETE (7564)
sup norm of Ax: 1.000000e+00
walltime at start:     0.000000

PASA run status (Version 1.0, July 1, 2019): 0

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


PASA run statistics (Version 1.0, July 1, 2019):
|| P (x - g) - x ||                   : 8.784729344790687e-07    
Final f                               : 2.064805091605141e+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, July 1, 2019):

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 ....................... 0
    change in column activity ........... 0
    change in row activity .............. 0
    failures of Armijo step ............. 0
Proximal updates ........................ 0
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.104498e-02
Initialization (includes partition) ..... 1.163197e-02
Phase 1 ................................. 1.042509e-02
Coordinate ascent ....................... 2.861023e-04
SSOR0 ................................... 3.659725e-04
SSOR1 ................................... 1.231194e-03
SpaRSA .................................. 0.000000e+00
DASA .................................... 1.388288e-02
DASA line search ........................ 4.920959e-04
Check error ............................. 3.571510e-04
Proximal update ......................... 0.000000e+00
Invert permutation ...................... 4.124641e-05
Row modifications of Cholesky factor .... 5.483627e-06
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 3.386021e-03
Partial Cholesky factorization .......... 6.601334e-03
Back solves ............................. 5.187988e-04
Forward solves .......................... 3.287792e-04


CG_DESCENT (Version 7.0, July 1, 2019) run statistics:

Final f             :  2.064805091618884e+02
sup-norm of gradient:  8.784729344790687e-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.7847293e-07    2.0648051e+02    0.093692
 Final f                         = 2.0648051e+02   
 Function value at final x       = 2.0648050916051409e+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
Initializing PASAdata structure.
Successfully initialized PASAdata structure.

 Problem: GRIDNETF (7564)
sup norm of Ax: 1.000000e+00
walltime at start:     0.000000

PASA run status (Version 1.0, July 1, 2019): 0

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


PASA run statistics (Version 1.0, July 1, 2019):
|| P (x - g) - x ||                   : 9.597261855280809e-07    
Final f                               : 2.435423262358511e+02    

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


PPROJ run statistics (Version 2.0, July 1, 2019):

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  13
    rows dropped in coordinate ascent ... 0
Gradient ascent iterations .............. 28
    variables freed in gradient ascent .. 111
    rows dropped in gradient ascent ..... 0
Preconditioned CG iterations ............ 3
    variables freed in CG ............... 245
    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 ................. 6
    nonzeros in final factor ............ 52882 99.3% sparse
    rows dropped from L ................. 0
    rows added to L ..................... 0
    rank 1 downdates to L ............... 297
    rank 1 updates to L ................. 2129
    Size breakdown of the updates ([size]: number of this size):
        updowns [  1]: 20
        updowns [  2]: 17
        updowns [  3]: 5
        updowns [  4]: 6
        updowns [  5]: 10
        updowns [  6]: 5
        updowns [  7]: 1
        updowns [  8]: 3
        updowns [  9]: 3
        updowns [ 10]: 1
        updowns [ 12]: 2
        updowns [ 14]: 1
        updowns [ 17]: 1
        updowns [ 18]: 1
        updowns [ 20]: 2
        updowns [ 22]: 1
        updowns [ 23]: 1
        updowns [ 24]: 1
        updowns [ 25]: 1
        updowns [ 27]: 2
        updowns [ 28]: 3
        updowns [ 30]: 1
        updowns [ 33]: 3
        updowns [ 38]: 2
        updowns [ 43]: 1
        updowns [ 45]: 1
        updowns [ 48]: 1
        updowns [ 62]: 1
        updowns [ 64]: 1
        updowns [ 84]: 1
        updowns [ 86]: 1
        updowns [ 94]: 1
        updowns [150]: 1
        updowns [165]: 1
        updowns [168]: 1
        updowns [175]: 1
        updowns [212]: 1
        updowns [239]: 1
    No. of solves by depth in the multilevel partition tree:
        (deeper <=> further from root of tree <=> fewer flops)
        depth [ 0]: 48
        depth [ 1]: 99
        depth [ 2]: 184
        depth [ 3]: 367

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 1.099610e-02
Initialization (includes partition) ..... 1.679730e-02
Phase 1 ................................. 1.633906e-02
Coordinate ascent ....................... 1.451969e-04
SSOR0 ................................... 5.373001e-03
SSOR1 ................................... 7.882118e-04
SpaRSA .................................. 0.000000e+00
DASA .................................... 9.646392e-02
DASA line search ........................ 1.207352e-02
Check error ............................. 6.984234e-03
Proximal update ......................... 0.000000e+00
Invert permutation ...................... 2.689362e-04
Row modifications of Cholesky factor .... 1.277924e-04
Column modifications of Cholesky factor . 1.932216e-02
Cholesky factorization .................. 7.750034e-03
Partial Cholesky factorization .......... 1.562452e-02
Back solves ............................. 1.251626e-02
Forward solves .......................... 1.077247e-02


CG_DESCENT (Version 7.0, July 1, 2019) run statistics:

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

!!  GRIDNETF   7564    3    4    3   23   26   23     40     76     43      29       6     0    9.5972619e-07    2.4354233e+02    0.207712
 Final f                         = 2.4354233e+02   
 Function value at final x       = 2.4354232623585111e+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
Initializing PASAdata structure.
Successfully initialized PASAdata structure.

 Problem: GRIDNETG (7564)
sup norm of Ax: 1.000000e+00
walltime at start:     0.000000

PASA run status (Version 1.0, July 1, 2019): 0

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


PASA run statistics (Version 1.0, July 1, 2019):
|| P (x - g) - x ||                   : 4.790363210306625e-07    
Final f                               : 6.157842031355777e+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, July 1, 2019):

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  4
    rows dropped in coordinate ascent ... 0
Gradient ascent iterations .............. 0
    variables freed in gradient ascent .. 0
    rows dropped in gradient ascent ..... 0
Preconditioned CG iterations ............ 0
    variables freed in CG ............... 0
    rows dropped in CG .................. 0
SpaRSA iterations ....................... 0
    change in column activity ........... 0
    change in row activity .............. 0
    failures of Armijo step ............. 0
Proximal updates ........................ 0
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 ............... 23
    rank 1 updates to L ................. 187
    Size breakdown of the updates ([size]: number of this size):
        updowns [  1]: 13
        updowns [  2]: 5
        updowns [  3]: 3
        updowns [  4]: 4
        updowns [  5]: 2
        updowns [  6]: 2
        updowns [  7]: 3
        updowns [ 10]: 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]: 13
        depth [ 1]: 53
        depth [ 2]: 176
        depth [ 3]: 250

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 5.948067e-03
Initialization (includes partition) ..... 7.611752e-03
Phase 1 ................................. 9.455204e-03
Coordinate ascent ....................... 8.797646e-05
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 0.000000e+00
DASA .................................... 1.035929e-02
DASA line search ........................ 2.755880e-03
Check error ............................. 2.121687e-03
Proximal update ......................... 0.000000e+00
Invert permutation ...................... 1.299381e-04
Row modifications of Cholesky factor .... 3.457069e-05
Column modifications of Cholesky factor . 6.389618e-04
Cholesky factorization .................. 1.402855e-03
Partial Cholesky factorization .......... 1.304150e-04
Back solves ............................. 1.730680e-03
Forward solves .......................... 1.093864e-03


CG_DESCENT (Version 7.0, July 1, 2019) run statistics:

Final f             :  6.157842032178245e+02
sup-norm of gradient:  4.790363210306625e-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.7903632e-07    6.1578420e+02    0.093172
 Final f                         = 6.1578420e+02   
 Function value at final x       = 6.1578420313557774e+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
Initializing PASAdata structure.
Successfully initialized PASAdata structure.

 Problem: GRIDNETH (7564)
sup norm of Ax: 1.000000e+00
walltime at start:     0.000001

PASA run status (Version 1.0, July 1, 2019): 0

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


PASA run statistics (Version 1.0, July 1, 2019):
|| P (x - g) - x ||                   : 8.593202068946093e-07    
Final f                               : 2.064805091605419e+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, July 1, 2019):

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 ....................... 0
    change in column activity ........... 0
    change in row activity .............. 0
    failures of Armijo step ............. 0
Proximal updates ........................ 0
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.097298e-02
Initialization (includes partition) ..... 1.155257e-02
Phase 1 ................................. 1.036096e-02
Coordinate ascent ....................... 2.272129e-04
SSOR0 ................................... 3.652573e-04
SSOR1 ................................... 1.233816e-03
SpaRSA .................................. 0.000000e+00
DASA .................................... 1.375818e-02
DASA line search ........................ 4.968643e-04
Check error ............................. 3.678799e-04
Proximal update ......................... 0.000000e+00
Invert permutation ...................... 4.315376e-05
Row modifications of Cholesky factor .... 3.814697e-06
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 3.381014e-03
Partial Cholesky factorization .......... 6.578922e-03
Back solves ............................. 5.104542e-04
Forward solves .......................... 3.194809e-04


CG_DESCENT (Version 7.0, July 1, 2019) run statistics:

Final f             :  2.064805091619162e+02
sup-norm of gradient:  8.593202068946093e-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.5932021e-07    2.0648051e+02    0.093503
 Final f                         = 2.0648051e+02   
 Function value at final x       = 2.0648050916054194e+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
Initializing PASAdata structure.
Successfully initialized PASAdata structure.

 Problem: GRIDNETI (7564)
sup norm of Ax: 1.000000e+00
walltime at start:     0.000001

PASA run status (Version 1.0, July 1, 2019): 0

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


PASA run statistics (Version 1.0, July 1, 2019):
|| P (x - g) - x ||                   : 9.992371146611933e-07    
Final f                               : 2.435423262489387e+02    

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


PPROJ run statistics (Version 2.0, July 1, 2019):

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  13
    rows dropped in coordinate ascent ... 0
Gradient ascent iterations .............. 28
    variables freed in gradient ascent .. 111
    rows dropped in gradient ascent ..... 0
Preconditioned CG iterations ............ 3
    variables freed in CG ............... 245
    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 ................. 6
    nonzeros in final factor ............ 52882 99.3% sparse
    rows dropped from L ................. 0
    rows added to L ..................... 0
    rank 1 downdates to L ............... 295
    rank 1 updates to L ................. 2127
    Size breakdown of the updates ([size]: number of this size):
        updowns [  1]: 19
        updowns [  2]: 17
        updowns [  3]: 6
        updowns [  4]: 9
        updowns [  5]: 7
        updowns [  6]: 4
        updowns [  7]: 1
        updowns [  8]: 3
        updowns [  9]: 3
        updowns [ 10]: 1
        updowns [ 12]: 2
        updowns [ 14]: 1
        updowns [ 17]: 1
        updowns [ 18]: 1
        updowns [ 20]: 2
        updowns [ 22]: 1
        updowns [ 23]: 1
        updowns [ 25]: 2
        updowns [ 27]: 1
        updowns [ 28]: 4
        updowns [ 30]: 1
        updowns [ 33]: 3
        updowns [ 38]: 2
        updowns [ 43]: 1
        updowns [ 45]: 1
        updowns [ 48]: 1
        updowns [ 62]: 1
        updowns [ 65]: 1
        updowns [ 84]: 1
        updowns [ 86]: 1
        updowns [ 94]: 1
        updowns [150]: 1
        updowns [165]: 1
        updowns [168]: 1
        updowns [175]: 1
        updowns [212]: 1
        updowns [239]: 1
    No. of solves by depth in the multilevel partition tree:
        (deeper <=> further from root of tree <=> fewer flops)
        depth [ 0]: 48
        depth [ 1]: 98
        depth [ 2]: 185
        depth [ 3]: 365

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 1.099014e-02
Initialization (includes partition) ..... 1.682687e-02
Phase 1 ................................. 1.624656e-02
Coordinate ascent ....................... 1.449585e-04
SSOR0 ................................... 5.332947e-03
SSOR1 ................................... 7.629395e-04
SpaRSA .................................. 0.000000e+00
DASA .................................... 9.673595e-02
DASA line search ........................ 1.219082e-02
Check error ............................. 7.175207e-03
Proximal update ......................... 0.000000e+00
Invert permutation ...................... 2.696514e-04
Row modifications of Cholesky factor .... 1.258850e-04
Column modifications of Cholesky factor . 1.933718e-02
Cholesky factorization .................. 7.742167e-03
Partial Cholesky factorization .......... 1.560760e-02
Back solves ............................. 1.260805e-02
Forward solves .......................... 1.066446e-02


CG_DESCENT (Version 7.0, July 1, 2019) run statistics:

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

!!  GRIDNETI   7564    3    4    3   23   26   23     40     76     43      29       6     0    9.9923711e-07    2.4354233e+02    0.209093
 Final f                         = 2.4354233e+02   
 Function value at final x       = 2.4354232624893865e+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
Initializing PASAdata structure.
Successfully initialized PASAdata structure.

 Problem: HAGER1 (5001)
sup norm of Ax: 2.500500e+03
walltime at start:     0.000001

PASA run status (Version 1.0, July 1, 2019): 0

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


PASA run statistics (Version 1.0, July 1, 2019):
|| P (x - g) - x ||                   : 2.369946318134101e-08    
Final f                               : 8.807970809155848e-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, July 1, 2019):

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 ....................... 0
    change in column activity ........... 0
    change in row activity .............. 0
    failures of Armijo step ............. 0
Proximal updates ........................ 0
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.415895e-03
Initialization (includes partition) ..... 2.737045e-03
Phase 1 ................................. 9.293079e-03
Coordinate ascent ....................... 2.188683e-04
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 0.000000e+00
DASA .................................... 2.394915e-03
DASA line search ........................ 4.234314e-04
Check error ............................. 2.329350e-04
Proximal update ......................... 0.000000e+00
Invert permutation ...................... 2.622604e-05
Row modifications of Cholesky factor .... 4.053116e-06
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 8.370876e-04
Partial Cholesky factorization .......... 5.078316e-05
Back solves ............................. 4.014969e-04
Forward solves .......................... 1.935959e-04


CG_DESCENT (Version 7.0, July 1, 2019) run statistics:

Final f             :  8.807970809156167e-01
sup-norm of gradient:  2.369946318134101e-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.016976
 Final f                         = 8.8079708e-01   
 Function value at final x       = 8.8079708091558484e-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
Initializing PASAdata structure.
Successfully initialized PASAdata structure.

 Problem: HAGER2 (5001)
sup norm of Ax: 2.500250e+03
walltime at start:     0.000001

PASA run status (Version 1.0, July 1, 2019): 0

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


PASA run statistics (Version 1.0, July 1, 2019):
|| P (x - g) - x ||                   : 5.726204956881496e-08    
Final f                               : 4.320822586636229e-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, July 1, 2019):

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 ....................... 0
    change in column activity ........... 0
    change in row activity .............. 0
    failures of Armijo step ............. 0
Proximal updates ........................ 0
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.460957e-03
Initialization (includes partition) ..... 2.796173e-03
Phase 1 ................................. 9.388924e-03
Coordinate ascent ....................... 2.238750e-04
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 0.000000e+00
DASA .................................... 2.437830e-03
DASA line search ........................ 4.568100e-04
Check error ............................. 2.312660e-04
Proximal update ......................... 0.000000e+00
Invert permutation ...................... 2.932549e-05
Row modifications of Cholesky factor .... 5.006790e-06
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 8.411407e-04
Partial Cholesky factorization .......... 4.720688e-05
Back solves ............................. 3.969669e-04
Forward solves .......................... 1.885891e-04


CG_DESCENT (Version 7.0, July 1, 2019) run statistics:

Final f             :  4.320822591219653e-01
sup-norm of gradient:  5.726204956881496e-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.7262050e-08    4.3208226e-01    0.017886
 Final f                         = 4.3208226e-01   
 Function value at final x       = 4.3208225866362293e-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
Initializing PASAdata structure.
Successfully initialized PASAdata structure.

 Problem: HAGER3 (5001)
sup norm of Ax: 2.500250e+03
walltime at start:     0.000000

PASA run status (Version 1.0, July 1, 2019): 0

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


PASA run statistics (Version 1.0, July 1, 2019):
|| P (x - g) - x ||                   : 5.916466331874065e-08    
Final f                               : 1.409612553702359e-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, July 1, 2019):

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 ....................... 0
    change in column activity ........... 0
    change in row activity .............. 0
    failures of Armijo step ............. 0
Proximal updates ........................ 0
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.469063e-03
Initialization (includes partition) ..... 2.816916e-03
Phase 1 ................................. 9.400368e-03
Coordinate ascent ....................... 2.238750e-04
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 0.000000e+00
DASA .................................... 2.443790e-03
DASA line search ........................ 4.429817e-04
Check error ............................. 2.322197e-04
Proximal update ......................... 0.000000e+00
Invert permutation ...................... 2.646446e-05
Row modifications of Cholesky factor .... 5.960464e-06
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 8.568764e-04
Partial Cholesky factorization .......... 4.625320e-05
Back solves ............................. 3.967285e-04
Forward solves .......................... 1.950264e-04


CG_DESCENT (Version 7.0, July 1, 2019) run statistics:

Final f             :  1.409612556564674e-01
sup-norm of gradient:  5.916466331874065e-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.9164663e-08    1.4096126e-01    0.018314
 Final f                         = 1.4096126e-01   
 Function value at final x       = 1.4096125537023591e-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
Initializing PASAdata structure.
Successfully initialized PASAdata structure.

 Problem: HAGER4 (5001)
sup norm of Ax: 2.500000e+03
walltime at start:     0.000000

PASA run status (Version 1.0, July 1, 2019): 0

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


PASA run statistics (Version 1.0, July 1, 2019):
|| P (x - g) - x ||                   : 9.845860614443721e-07    
Final f                               : 2.794084067845214e+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, July 1, 2019):

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 ....................... 0
    change in column activity ........... 0
    change in row activity .............. 0
    failures of Armijo step ............. 0
Proximal updates ........................ 0
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.472878e-03
Initialization (includes partition) ..... 3.015995e-03
Phase 1 ................................. 6.049871e-03
Coordinate ascent ....................... 3.221035e-04
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 0.000000e+00
DASA .................................... 7.030487e-03
DASA line search ........................ 1.326084e-03
Check error ............................. 1.284122e-03
Proximal update ......................... 0.000000e+00
Invert permutation ...................... 4.887581e-05
Row modifications of Cholesky factor .... 2.622604e-05
Column modifications of Cholesky factor . 1.330376e-04
Cholesky factorization .................. 2.960920e-03
Partial Cholesky factorization .......... 2.021790e-04
Back solves ............................. 5.989075e-04
Forward solves .......................... 4.053116e-04


CG_DESCENT (Version 7.0, July 1, 2019) run statistics:

Final f             :  2.794256325253440e+00
sup-norm of gradient:  1.459248955142540e-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.8458606e-07    2.7940841e+00    0.019796
 Final f                         = 2.7940841e+00   
 Function value at final x       = 2.7940840678452141e+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
Initializing PASAdata structure.
Successfully initialized PASAdata structure.

 Problem: HIMMELBI (100)
sup norm of Ax: 1.000000e+00
walltime at start:     0.000001

PASA run status (Version 1.0, July 1, 2019): 0

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


PASA run statistics (Version 1.0, July 1, 2019):
|| P (x - g) - x ||                   : 8.571115126731685e-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, July 1, 2019):

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 ... 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 ................. 5
    nonzeros in final factor ............ 11 85.9% sparse
    rows dropped from L ................. 3
    rows added to L ..................... 6
    rank 1 downdates to L ............... 56
    rank 1 updates to L ................. 12
    Size breakdown of the updates ([size]: number of this size):
        updowns [  1]: 26
        updowns [  2]: 8
        updowns [  3]: 3
        updowns [  5]: 2
        updowns [  7]: 1
    No. of solves:   29

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 6.294250e-05
Initialization (includes partition) ..... 1.468658e-04
Phase 1 ................................. 1.196861e-04
Coordinate ascent ....................... 1.549721e-05
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 0.000000e+00
DASA .................................... 3.881454e-04
DASA line search ........................ 3.290176e-05
Check error ............................. 1.530647e-04
Proximal update ......................... 0.000000e+00
Invert permutation ...................... 3.290176e-05
Row modifications of Cholesky factor .... 2.479553e-05
Column modifications of Cholesky factor . 9.846687e-05
Cholesky factorization .................. 4.386902e-05
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 3.147125e-05
Forward solves .......................... 1.955032e-05


CG_DESCENT (Version 7.0, July 1, 2019) run statistics:

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

!!  HIMMELBI    100    2    3    2   32   39   34     54     95     55      36       5     0    8.5711151e-07   -1.7355696e+03    0.003793
 Final f                         = -1.7355696e+03  
 Function value at final x       = -1.7355695798557338e+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
Initializing PASAdata structure.
Successfully initialized PASAdata structure.

 Problem: HONG (4)
sup norm of Ax: 1.000000e+00
walltime at start:     0.000001

PASA run status (Version 1.0, July 1, 2019): 0

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


PASA run statistics (Version 1.0, July 1, 2019):
|| 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.0, July 1, 2019):
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, July 1, 2019) 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.2571087363489056e+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
Initializing PASAdata structure.
Successfully initialized PASAdata structure.

 Problem: HS105 (8)
sup norm of Ax: 1.000000e+00
walltime at start:     0.000001

PASA run status (Version 1.0, July 1, 2019): 0

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


PASA run statistics (Version 1.0, July 1, 2019):
|| 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.0, July 1, 2019):
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, July 1, 2019) 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.011049
 Final f                         = 1.0447251e+03   
 Function value at final x       = 1.0447251296809895e+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
Initializing PASAdata structure.
Successfully initialized PASAdata structure.

 Problem: HS112 (10)
sup norm of Ax: 2.000000e+00
walltime at start:     0.000001

PASA run status (Version 1.0, July 1, 2019): 0

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


PASA run statistics (Version 1.0, July 1, 2019):
|| P (x - g) - x ||                   : 6.174124200786224e-08    
Final f                               : -4.776109085936840e+01   

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


PPROJ run statistics (Version 2.0, July 1, 2019):

No. blocks in multilevel partition of A . 1
Depth of multilevel partition tree ...... 0
Phase 1 iterations ...................... 5
Coordinate ascent iterations ............ 9
    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 ................. 11
    nonzeros in final factor ............ 6  0.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:   11

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 3.314018e-05
Initialization (includes partition) ..... 6.747246e-05
Phase 1 ................................. 4.386902e-05
Coordinate ascent ....................... 1.215935e-05
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 0.000000e+00
DASA .................................... 1.423359e-04
DASA line search ........................ 1.525879e-05
Check error ............................. 4.673004e-05
Proximal update ......................... 0.000000e+00
Invert permutation ...................... 6.675720e-06
Row modifications of Cholesky factor .... 0.000000e+00
Column modifications of Cholesky factor . 1.001358e-05
Cholesky factorization .................. 4.434586e-05
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 7.867813e-06
Forward solves .......................... 5.245209e-06


CG_DESCENT (Version 7.0, July 1, 2019) run statistics:

Final f             : -4.776109085936586e+01
sup-norm of gradient:  6.174124200786224e-08
Number of iterations: 20        
Function evaluations: 39        
Gradient evaluations: 21        

!!     HS112     10    1    6    1    4    5    4     20     39     21       8      11     0    6.1741242e-08   -4.7761091e+01    0.000647
 Final f                         = -4.7761091e+01  
 Function value at final x       = -4.7761090859368402e+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
Initializing PASAdata structure.
Successfully initialized PASAdata structure.

 Problem: HS119 (16)
sup norm of Ax: 1.820000e+00
walltime at start:     0.000001

PASA run status (Version 1.0, July 1, 2019): 0

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


PASA run statistics (Version 1.0, July 1, 2019):
|| P (x - g) - x ||                   : 1.115490580461120e-08    
Final f                               : 2.448996975167497e+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, July 1, 2019):

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 ....................... 0
    change in column activity ........... 0
    change in row activity .............. 0
    failures of Armijo step ............. 0
Proximal updates ........................ 0
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.503395e-05
Initialization (includes partition) ..... 5.960464e-05
Phase 1 ................................. 6.198883e-05
Coordinate ascent ....................... 1.144409e-05
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 0.000000e+00
DASA .................................... 1.716614e-04
DASA line search ........................ 1.597404e-05
Check error ............................. 3.600121e-05
Proximal update ......................... 0.000000e+00
Invert permutation ...................... 4.053116e-06
Row modifications of Cholesky factor .... 2.861023e-06
Column modifications of Cholesky factor . 4.529953e-05
Cholesky factorization .................. 2.098083e-05
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 7.152557e-06
Forward solves .......................... 5.960464e-06


CG_DESCENT (Version 7.0, July 1, 2019) run statistics:

Final f             :  2.448996975168008e+02
sup-norm of gradient:  1.115490580461120e-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.1154906e-08    2.4489970e+02    0.000566
 Final f                         = 2.4489970e+02   
 Function value at final x       = 2.4489969751674968e+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
Initializing PASAdata structure.
Successfully initialized PASAdata structure.

 Problem: HS24 (2)
sup norm of Ax: 1.732051e+00
walltime at start:     0.000000

PASA run status (Version 1.0, July 1, 2019): 0

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


PASA run statistics (Version 1.0, July 1, 2019):
|| P (x - g) - x ||                   : 5.662137425588298e-14    
Final f                               : -1.000000082691938e+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, July 1, 2019):

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 ....................... 0
    change in column activity ........... 0
    change in row activity .............. 0
    failures of Armijo step ............. 0
Proximal updates ........................ 0
Cholesky factorizations ................. 2
    nonzeros in final factor ............ 4 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:   2

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 4.506111e-05
Initialization (includes partition) ..... 7.510185e-05
Phase 1 ................................. 3.480911e-05
Coordinate ascent ....................... 4.053116e-06
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 0.000000e+00
DASA .................................... 4.887581e-05
DASA line search ........................ 5.006790e-06
Check error ............................. 1.788139e-05
Proximal update ......................... 0.000000e+00
Invert permutation ...................... 7.152557e-06
Row modifications of Cholesky factor .... 0.000000e+00
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 2.217293e-05
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 9.536743e-07
Forward solves .......................... 1.907349e-06


CG_DESCENT (Version 7.0, July 1, 2019) 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.6621374e-14   -1.0000001e+00    0.000277
 Final f                         = -1.0000001e+00  
 Function value at final x       = -1.0000000826919384e+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
Initializing PASAdata structure.
Successfully initialized PASAdata structure.

 Problem: HS36 (3)
sup norm of Ax: 2.000000e+00
walltime at start:     0.000000

PASA run status (Version 1.0, July 1, 2019): 0

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


PASA run statistics (Version 1.0, July 1, 2019):
|| 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.0, July 1, 2019):
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, July 1, 2019) 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.000083
 Final f                         = -3.3000000e+03  
 Function value at final x       = -3.3000000000000000e+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
Initializing PASAdata structure.
Successfully initialized PASAdata structure.

 Problem: HS37 (3)
sup norm of Ax: 2.000000e+00
walltime at start:     0.000000

PASA run status (Version 1.0, July 1, 2019): 0

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


PASA run statistics (Version 1.0, July 1, 2019):
|| P (x - g) - x ||                   : 3.378003299303600e-08    
Final f                               : -3.456000000000207e+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, July 1, 2019):

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 ....................... 0
    change in column activity ........... 0
    change in row activity .............. 0
    failures of Armijo step ............. 0
Proximal updates ........................ 0
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.789497e-05
Initialization (includes partition) ..... 5.722046e-05
Phase 1 ................................. 4.196167e-05
Coordinate ascent ....................... 2.861023e-06
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 0.000000e+00
DASA .................................... 4.816055e-05
DASA line search ........................ 5.245209e-06
Check error ............................. 1.788139e-05
Proximal update ......................... 0.000000e+00
Invert permutation ...................... 6.198883e-06
Row modifications of Cholesky factor .... 0.000000e+00
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 1.883507e-05
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 1.907349e-06
Forward solves .......................... 3.099442e-06


CG_DESCENT (Version 7.0, July 1, 2019) run statistics:

Final f             : -3.456000000000004e+03
sup-norm of gradient:  3.378003299303600e-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.3780033e-08   -3.4560000e+03    0.000321
 Final f                         = -3.4560000e+03  
 Function value at final x       = -3.4560000000002069e+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
Initializing PASAdata structure.
Successfully initialized PASAdata structure.

 Problem: HS41 (4)
sup norm of Ax: 2.000000e+00
walltime at start:     0.000000

PASA run status (Version 1.0, July 1, 2019): 0

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


PASA run statistics (Version 1.0, July 1, 2019):
|| 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.0, July 1, 2019):
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, July 1, 2019) 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.000142
 Final f                         = 1.9259259e+00   
 Function value at final x       = 1.9259259259260866e+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
Initializing PASAdata structure.
Successfully initialized PASAdata structure.

 Problem: HS49 (5)
sup norm of Ax: 5.000000e+00
walltime at start:     0.000001

PASA run status (Version 1.0, July 1, 2019): 0

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


PASA run statistics (Version 1.0, July 1, 2019):
|| 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, July 1, 2019):

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 ....................... 0
    change in column activity ........... 0
    change in row activity .............. 0
    failures of Armijo step ............. 0
Proximal updates ........................ 0
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.384186e-05
Initialization (includes partition) ..... 4.887581e-05
Phase 1 ................................. 3.314018e-05
Coordinate ascent ....................... 0.000000e+00
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 0.000000e+00
DASA .................................... 2.598763e-05
DASA line search ........................ 3.099442e-06
Check error ............................. 8.821487e-06
Proximal update ......................... 0.000000e+00
Invert permutation ...................... 4.053116e-06
Row modifications of Cholesky factor .... 0.000000e+00
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 1.192093e-05
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 9.536743e-07
Forward solves .......................... 9.536743e-07


CG_DESCENT (Version 7.0, July 1, 2019) 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.000404
 Final f                         = 2.3082780e-11   
 Function value at final x       = 2.3082780400618174e-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
Initializing PASAdata structure.
Successfully initialized PASAdata structure.

 Problem: HS50 (5)
sup norm of Ax: 3.000000e+00
walltime at start:     0.000001

PASA run status (Version 1.0, July 1, 2019): 0

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


PASA run statistics (Version 1.0, July 1, 2019):
|| 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, July 1, 2019):

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 ....................... 0
    change in column activity ........... 0
    change in row activity .............. 0
    failures of Armijo step ............. 0
Proximal updates ........................ 0
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.099442e-05
Initialization (includes partition) ..... 6.008148e-05
Phase 1 ................................. 3.623962e-05
Coordinate ascent ....................... 3.099442e-06
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 0.000000e+00
DASA .................................... 3.814697e-05
DASA line search ........................ 3.099442e-06
Check error ............................. 1.478195e-05
Proximal update ......................... 0.000000e+00
Invert permutation ...................... 7.152557e-06
Row modifications of Cholesky factor .... 0.000000e+00
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 1.502037e-05
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 9.536743e-07
Forward solves .......................... 1.907349e-06


CG_DESCENT (Version 7.0, July 1, 2019) 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.000303
 Final f                         = 4.6560802e-26   
 Function value at final x       = 4.6560801623391695e-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
Initializing PASAdata structure.
Successfully initialized PASAdata structure.

 Problem: HS54 (6)
sup norm of Ax: 4.000000e+03
walltime at start:     0.000001

PASA run status (Version 1.0, July 1, 2019): 0

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


PASA run statistics (Version 1.0, July 1, 2019):
|| 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.0, July 1, 2019):
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, July 1, 2019) 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.000164
 Final f                         = -8.6740883e-01  
 Function value at final x       = -8.6740882538860853e-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
Initializing PASAdata structure.
Successfully initialized PASAdata structure.

 Problem: HS55 (6)
sup norm of Ax: 5.000000e+00
walltime at start:     0.000001

PASA run status (Version 1.0, July 1, 2019): 0

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


PASA run statistics (Version 1.0, July 1, 2019):
|| P (x - g) - x ||                   : 3.431976924872515e-14    
Final f                               : 6.666666666666705e+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, July 1, 2019):

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 ....................... 0
    change in column activity ........... 0
    change in row activity .............. 0
    failures of Armijo step ............. 0
Proximal updates ........................ 0
Cholesky factorizations ................. 2
    nonzeros in final factor ............ 16 23.8% sparse
    rows dropped from L ................. 0
    rows added to L ..................... 0
    rank 1 downdates to L ............... 0
    rank 1 updates to L ................. 0
    Size breakdown of the updates ([size]: number of this size):
    No. of solves:   2

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 3.695488e-05
Initialization (includes partition) ..... 6.484985e-05
Phase 1 ................................. 3.504753e-05
Coordinate ascent ....................... 4.053116e-06
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 0.000000e+00
DASA .................................... 4.601479e-05
DASA line search ........................ 4.053116e-06
Check error ............................. 1.478195e-05
Proximal update ......................... 0.000000e+00
Invert permutation ...................... 3.099442e-06
Row modifications of Cholesky factor .... 0.000000e+00
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 1.716614e-05
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 9.536743e-07
Forward solves .......................... 2.861023e-06


CG_DESCENT (Version 7.0, July 1, 2019) 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    3.4319769e-14    6.6666667e+00    0.000238
 Final f                         = 6.6666667e+00   
 Function value at final x       = 6.6666666666667052e+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
Initializing PASAdata structure.
Successfully initialized PASAdata structure.

 Problem: HS62 (3)
sup norm of Ax: 1.000000e+00
walltime at start:     0.000000

PASA run status (Version 1.0, July 1, 2019): 0

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


PASA run statistics (Version 1.0, July 1, 2019):
|| 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.0, July 1, 2019):
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, July 1, 2019) 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.000174
 Final f                         = -2.6272515e+04  
 Function value at final x       = -2.6272514647971591e+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
Initializing PASAdata structure.
Successfully initialized PASAdata structure.

 Problem: HS86 (5)
sup norm of Ax: 1.600000e+01
walltime at start:     0.000000

PASA run status (Version 1.0, July 1, 2019): 0

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


PASA run statistics (Version 1.0, July 1, 2019):
|| P (x - g) - x ||                   : 1.441486988991046e-09    
Final f                               : -3.234867896572664e+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, July 1, 2019):

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 ....................... 0
    change in column activity ........... 0
    change in row activity .............. 0
    failures of Armijo step ............. 0
Proximal updates ........................ 0
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 ...... 3.194809e-05
Initialization (includes partition) ..... 6.866455e-05
Phase 1 ................................. 5.459785e-05
Coordinate ascent ....................... 5.006790e-06
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 0.000000e+00
DASA .................................... 7.486343e-05
DASA line search ........................ 8.106232e-06
Check error ............................. 1.978874e-05
Proximal update ......................... 0.000000e+00
Invert permutation ...................... 5.722046e-06
Row modifications of Cholesky factor .... 1.811981e-05
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 3.099442e-05
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 2.861023e-06
Forward solves .......................... 5.006790e-06


CG_DESCENT (Version 7.0, July 1, 2019) run statistics:

Final f             : -3.234867896572273e+01
sup-norm of gradient:  1.441486988991046e-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.4414870e-09   -3.2348679e+01    0.000441
 Final f                         = -3.2348679e+01  
 Function value at final x       = -3.2348678965726641e+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
Initializing PASAdata structure.
Successfully initialized PASAdata structure.

 Problem: HS9 (2)
sup norm of Ax: 4.000000e+00
walltime at start:     0.000000

PASA run status (Version 1.0, July 1, 2019): 0

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


PASA run statistics (Version 1.0, July 1, 2019):
|| 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.0, July 1, 2019):
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, July 1, 2019) 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.000148
 Final f                         = -5.0000000e-01  
 Function value at final x       = 0.0000000000000000e+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
Initializing PASAdata structure.
Successfully initialized PASAdata structure.

 Problem: HUBFIT (2)
sup norm of Ax: 1.000000e+00
walltime at start:     0.000001

PASA run status (Version 1.0, July 1, 2019): 0

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


PASA run statistics (Version 1.0, July 1, 2019):
|| P (x - g) - x ||                   : 0.000000000000000e+00    
Final f                               : 6.806248472778481e-02    

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         


NAPHEAP statistics (Version 3.0, July 1, 2019):
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, July 1, 2019) 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    0    0    2    2    2      1      2      1       5       0     0    0.0000000e+00    6.8062485e-02    0.000124
 Final f                         = 6.8062485e-02   
 Function value at final x       = 1.6893493939393951e-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
Initializing PASAdata structure.
Successfully initialized PASAdata structure.

 Problem: HYDROELL (1009)
sup norm of Ax: 1.666667e-03
walltime at start:     0.000001

PASA run status (Version 1.0, July 1, 2019): 0

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


PASA run statistics (Version 1.0, July 1, 2019):
|| P (x - g) - x ||                   : 1.318369222819138e-09    
Final f                               : -3.585546798588492e+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, July 1, 2019):

No. blocks in multilevel partition of A . 7
Depth of multilevel partition tree ...... 2
Phase 1 iterations ...................... 10
Coordinate ascent iterations ............ 4
    variables freed in coordinate ascent  210
    rows dropped in coordinate ascent ... 0
Gradient ascent iterations .............. 3
    variables freed in gradient ascent .. 0
    rows dropped in gradient ascent ..... 0
Preconditioned CG iterations ............ 9
    variables freed in CG ............... 6
    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 ................. 5
    nonzeros in final factor ............ 1271 99.8% sparse
    rows dropped from L ................. 149
    rows added to L ..................... 674
    rank 1 downdates to L ............... 40
    rank 1 updates to L ................. 735
    Size breakdown of the updates ([size]: number of this size):
        updowns [  1]: 75
        updowns [  2]: 21
        updowns [  3]: 2
        updowns [  4]: 6
        updowns [  5]: 7
        updowns [  6]: 24
        updowns [  8]: 1
        updowns [  9]: 1
        updowns [ 10]: 5
        updowns [ 11]: 19
        updowns [ 12]: 12
        updowns [ 13]: 1
        updowns [ 16]: 1
    No. of solves by depth in the multilevel partition tree:
        (deeper <=> further from root of tree <=> fewer flops)
        depth [ 0]: 0
        depth [ 1]: 170
        depth [ 2]: 935

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 8.728504e-04
Initialization (includes partition) ..... 1.085997e-03
Phase 1 ................................. 3.900528e-04
Coordinate ascent ....................... 2.193451e-05
SSOR0 ................................... 2.813339e-05
SSOR1 ................................... 8.320808e-05
SpaRSA .................................. 0.000000e+00
DASA .................................... 1.301050e-02
DASA line search ........................ 4.109383e-03
Check error ............................. 3.817320e-03
Proximal update ......................... 0.000000e+00
Invert permutation ...................... 2.408028e-05
Row modifications of Cholesky factor .... 9.665489e-04
Column modifications of Cholesky factor . 9.107590e-04
Cholesky factorization .................. 3.602505e-04
Partial Cholesky factorization .......... 9.775162e-06
Back solves ............................. 1.313448e-03
Forward solves .......................... 6.449223e-04


CG_DESCENT (Version 7.0, July 1, 2019) run statistics:

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

!!  HYDROELL   1009    1    1    1    2    2    2      0      0      0       6       5     0    1.3183692e-09   -3.5855468e+06    0.017333
 Final f                         = -3.5855468e+06  
 Function value at final x       = -3.5855467985884924e+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
Initializing PASAdata structure.
Successfully initialized PASAdata structure.

 Problem: HYDROELM (505)
sup norm of Ax: 8.333333e-04
walltime at start:     0.000000

PASA run status (Version 1.0, July 1, 2019): 0

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


PASA run statistics (Version 1.0, July 1, 2019):
|| P (x - g) - x ||                   : 5.909817201582568e-10    
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, July 1, 2019):

No. blocks in multilevel partition of A . 3
Depth of multilevel partition tree ...... 1
Phase 1 iterations ...................... 7
Coordinate ascent iterations ............ 4
    variables freed in coordinate ascent  167
    rows dropped in coordinate ascent ... 0
Gradient ascent iterations .............. 5
    variables freed in gradient ascent .. 7
    rows dropped in gradient ascent ..... 0
Preconditioned CG iterations ............ 9
    variables freed in CG ............... 4
    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 ................. 5
    nonzeros in final factor ............ 594 99.5% sparse
    rows dropped from L ................. 88
    rows added to L ..................... 326
    rank 1 downdates to L ............... 30
    rank 1 updates to L ................. 350
    Size breakdown of the updates ([size]: number of this size):
        updowns [  1]: 45
        updowns [  2]: 6
        updowns [  3]: 3
        updowns [  4]: 7
        updowns [  5]: 6
        updowns [  6]: 10
        updowns [  7]: 1
        updowns [ 10]: 2
        updowns [ 12]: 13
        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]: 275

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 4.401207e-04
Initialization (includes partition) ..... 5.781651e-04
Phase 1 ................................. 1.728535e-04
Coordinate ascent ....................... 2.598763e-05
SSOR0 ................................... 3.194809e-05
SSOR1 ................................... 5.793571e-05
SpaRSA .................................. 0.000000e+00
DASA .................................... 3.698111e-03
DASA line search ........................ 7.791519e-04
Check error ............................. 1.136303e-03
Proximal update ......................... 0.000000e+00
Invert permutation ...................... 1.454353e-05
Row modifications of Cholesky factor .... 4.279613e-04
Column modifications of Cholesky factor . 4.439354e-04
Cholesky factorization .................. 1.873970e-04
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 3.020763e-04
Forward solves .......................... 1.227856e-04


CG_DESCENT (Version 7.0, July 1, 2019) run statistics:

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

!!  HYDROELM    505    1    1    1    2    2    2      0      0      0       6       5     0    5.9098172e-10   -3.5820155e+06    0.005585
 Final f                         = -3.5820155e+06  
 Function value at final x       = -3.5820154956933591e+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
Initializing PASAdata structure.
Successfully initialized PASAdata structure.

 Problem: HYDROELS (169)
sup norm of Ax: 2.777778e-04
walltime at start:     0.000000

PASA run status (Version 1.0, July 1, 2019): 0

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


PASA run statistics (Version 1.0, July 1, 2019):
|| P (x - g) - x ||                   : 4.755914993423427e-10    
Final f                               : -3.582268299810011e+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, July 1, 2019):

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  114
    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 ............... 1
    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 ................. 3
    nonzeros in final factor ............ 182 98.7% sparse
    rows dropped from L ................. 21
    rows added to L ..................... 79
    rank 1 downdates to L ............... 1
    rank 1 updates to L ................. 90
    Size breakdown of the updates ([size]: number of this size):
        updowns [  1]: 28
        updowns [  2]: 3
        updowns [  3]: 2
        updowns [  4]: 1
        updowns [  5]: 1
        updowns [  6]: 5
        updowns [ 12]: 1
    No. of solves:   69

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 9.393692e-05
Initialization (includes partition) ..... 1.637936e-04
Phase 1 ................................. 8.034706e-05
Coordinate ascent ....................... 1.692772e-05
SSOR0 ................................... 9.298325e-06
SSOR1 ................................... 2.908707e-05
SpaRSA .................................. 0.000000e+00
DASA .................................... 8.342266e-04
DASA line search ........................ 1.535416e-04
Check error ............................. 2.303123e-04
Proximal update ......................... 0.000000e+00
Invert permutation ...................... 1.001358e-05
Row modifications of Cholesky factor .... 1.099110e-04
Column modifications of Cholesky factor . 8.630753e-05
Cholesky factorization .................. 5.984306e-05
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 6.914139e-05
Forward solves .......................... 2.431870e-05


CG_DESCENT (Version 7.0, July 1, 2019) run statistics:

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

!!  HYDROELS    169    1    1    1    2    2    2      0      0      0       6       3     0    4.7559150e-10   -3.5822683e+06    0.001499
 Final f                         = -3.5822683e+06  
 Function value at final x       = -3.5822682998100114e+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
Initializing PASAdata structure.
Successfully initialized PASAdata structure.

 Problem: LIN (4)
sup norm of Ax: 1.000000e+00
walltime at start:     0.000000

PASA run status (Version 1.0, July 1, 2019): 0

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


PASA run statistics (Version 1.0, July 1, 2019):
|| P (x - g) - x ||                   : 3.783666435876069e-10    
Final f                               : -1.757754317621724e-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, July 1, 2019):

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

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 4.601479e-05
Initialization (includes partition) ..... 7.772446e-05
Phase 1 ................................. 3.886223e-05
Coordinate ascent ....................... 3.814697e-06
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 0.000000e+00
DASA .................................... 6.675720e-05
DASA line search ........................ 5.960464e-06
Check error ............................. 1.406670e-05
Proximal update ......................... 0.000000e+00
Invert permutation ...................... 6.198883e-06
Row modifications of Cholesky factor .... 1.907349e-06
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 1.692772e-05
Partial Cholesky factorization .......... 2.145767e-06
Back solves ............................. 3.814697e-06
Forward solves .......................... 4.053116e-06


CG_DESCENT (Version 7.0, July 1, 2019) run statistics:

Final f             : -1.757754317621685e-02
sup-norm of gradient:  3.783666435876069e-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.7836664e-10   -1.7577543e-02    0.000376
 Final f                         = -1.7577543e-02  
 Function value at final x       = -1.7577543176217236e-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
Initializing PASAdata structure.
Successfully initialized PASAdata structure.

 Problem: LOADBAL (31)
sup norm of Ax: 8.000000e+01
walltime at start:     0.000001

PASA run status (Version 1.0, July 1, 2019): 0

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


PASA run statistics (Version 1.0, July 1, 2019):
|| P (x - g) - x ||                   : 4.561474049378977e-07    
Final f                               : 4.528510394415005e-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, July 1, 2019):

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

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 6.008148e-05
Initialization (includes partition) ..... 1.106262e-04
Phase 1 ................................. 8.726120e-05
Coordinate ascent ....................... 2.360344e-05
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 0.000000e+00
DASA .................................... 2.648830e-04
DASA line search ........................ 2.479553e-05
Check error ............................. 7.081032e-05
Proximal update ......................... 0.000000e+00
Invert permutation ...................... 1.144409e-05
Row modifications of Cholesky factor .... 1.573563e-05
Column modifications of Cholesky factor . 4.291534e-05
Cholesky factorization .................. 5.006790e-05
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 1.406670e-05
Forward solves .......................... 1.287460e-05


CG_DESCENT (Version 7.0, July 1, 2019) run statistics:

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

!!   LOADBAL     31    1    2    1    8   11    8     10     18     10      12       6     0    4.5614740e-07    4.5285104e-01    0.000934
 Final f                         = 4.5285104e-01   
 Function value at final x       = 4.5285103944150051e-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
Initializing PASAdata structure.
Successfully initialized PASAdata structure.

 Problem: LSNNODOC (5)
sup norm of Ax: 1.000000e+00
walltime at start:     0.000000

PASA run status (Version 1.0, July 1, 2019): 0

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


PASA run statistics (Version 1.0, July 1, 2019):
|| P (x - g) - x ||                   : 1.119104808822158e-12    
Final f                               : 1.231124487914436e+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, July 1, 2019):

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  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 ....................... 0
    change in column activity ........... 0
    change in row activity .............. 0
    failures of Armijo step ............. 0
Proximal updates ........................ 0
Cholesky factorizations ................. 4
    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:   4

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 4.887581e-05
Initialization (includes partition) ..... 7.915497e-05
Phase 1 ................................. 4.148483e-05
Coordinate ascent ....................... 6.437302e-06
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 0.000000e+00
DASA .................................... 7.414818e-05
DASA line search ........................ 8.106232e-06
Check error ............................. 1.931190e-05
Proximal update ......................... 0.000000e+00
Invert permutation ...................... 6.914139e-06
Row modifications of Cholesky factor .... 0.000000e+00
Column modifications of Cholesky factor . 9.059906e-06
Cholesky factorization .................. 2.574921e-05
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 2.861023e-06
Forward solves .......................... 4.291534e-06


CG_DESCENT (Version 7.0, July 1, 2019) run statistics:

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

!!  LSNNODOC      5    1    1    1    2    2    2      1      1      1       5       4     0    1.1191048e-12    1.2311245e+02    0.000388
 Final f                         = 1.2311245e+02   
 Function value at final x       = 1.2311244879144357e+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
Initializing PASAdata structure.
Successfully initialized PASAdata structure.

 Problem: ODFITS (10)
sup norm of Ax: 1.000000e+00
walltime at start:     0.000001

PASA run status (Version 1.0, July 1, 2019): 0

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


PASA run statistics (Version 1.0, July 1, 2019):
|| P (x - g) - x ||                   : 2.871986657477718e-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, July 1, 2019):

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 ....................... 0
    change in column activity ........... 0
    change in row activity .............. 0
    failures of Armijo step ............. 0
Proximal updates ........................ 0
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.695488e-05
Initialization (includes partition) ..... 6.794930e-05
Phase 1 ................................. 3.314018e-05
Coordinate ascent ....................... 3.814697e-06
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 0.000000e+00
DASA .................................... 6.580353e-05
DASA line search ........................ 5.245209e-06
Check error ............................. 1.478195e-05
Proximal update ......................... 0.000000e+00
Invert permutation ...................... 3.099442e-06
Row modifications of Cholesky factor .... 1.907349e-06
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 1.621246e-05
Partial Cholesky factorization .......... 4.291534e-06
Back solves ............................. 9.536743e-07
Forward solves .......................... 4.768372e-06


CG_DESCENT (Version 7.0, July 1, 2019) run statistics:

Final f             : -2.380026775403071e+03
sup-norm of gradient:  2.871986657477718e-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.8719867e-08   -2.3800268e+03    0.000357
 Final f                         = -2.3800268e+03  
 Function value at final x       = -2.3800267754031238e+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
Initializing PASAdata structure.
Successfully initialized PASAdata structure.

 Problem: PENTAGON (6)
sup norm of Ax: 1.000000e+00
walltime at start:     0.000000

PASA run status (Version 1.0, July 1, 2019): 0

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


PASA run statistics (Version 1.0, July 1, 2019):
|| P (x - g) - x ||                   : 4.637055082196877e-07    
Final f                               : 1.365217816769540e-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, July 1, 2019):

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 ................. 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 ...... 5.197525e-05
Initialization (includes partition) ..... 8.583069e-05
Phase 1 ................................. 4.673004e-05
Coordinate ascent ....................... 0.000000e+00
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 0.000000e+00
DASA .................................... 8.320808e-05
DASA line search ........................ 8.106232e-06
Check error ............................. 1.597404e-05
Proximal update ......................... 0.000000e+00
Invert permutation ...................... 7.867813e-06
Row modifications of Cholesky factor .... 2.074242e-05
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 1.907349e-05
Partial Cholesky factorization .......... 1.192093e-06
Back solves ............................. 3.814697e-06
Forward solves .......................... 3.099442e-06


CG_DESCENT (Version 7.0, July 1, 2019) run statistics:

Final f             :  1.365217816769921e-04
sup-norm of gradient:  4.637055082196877e-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.000419
 Final f                         = 1.3652178e-04   
 Function value at final x       = 1.3652178167695400e-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
Initializing PASAdata structure.
Successfully initialized PASAdata structure.

 Problem: QC (9)
sup norm of Ax: 1.000000e+00
walltime at start:     0.000000

PASA run status (Version 1.0, July 1, 2019): 0

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


PASA run statistics (Version 1.0, July 1, 2019):
|| 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, July 1, 2019):

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 ....................... 0
    change in column activity ........... 0
    change in row activity .............. 0
    failures of Armijo step ............. 0
Proximal updates ........................ 0
Cholesky factorizations ................. 0
    nonzeros in final factor ............ 0 100.0% sparse
    rows dropped from L ................. 0
    rows added to L ..................... 0
    rank 1 downdates to L ............... 0
    rank 1 updates to L ................. 0
    Size breakdown of the updates ([size]: number of this size):
    No. of solves by depth in the multilevel partition tree:
        (deeper <=> further from root of tree <=> fewer flops)
        depth [ 0]: 0
        depth [ 1]: 0

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 3.504753e-05
Initialization (includes partition) ..... 7.176399e-05
Phase 1 ................................. 2.980232e-05
Coordinate ascent ....................... 1.907349e-06
SSOR0 ................................... 2.861023e-06
SSOR1 ................................... 9.536743e-07
SpaRSA .................................. 0.000000e+00
DASA .................................... 1.597404e-05
DASA line search ........................ 0.000000e+00
Check error ............................. 9.775162e-06
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, July 1, 2019) 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.000341
 Final f                         = -9.5653773e+02  
 Function value at final x       = -9.5653773330395734e+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
Initializing PASAdata structure.
Successfully initialized PASAdata structure.

 Problem: QCNEW (9)
sup norm of Ax: 1.000000e+00
walltime at start:     0.000000

PASA run status (Version 1.0, July 1, 2019): 0

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


PASA run statistics (Version 1.0, July 1, 2019):
|| 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, July 1, 2019):

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.315376e-05
Initialization (includes partition) ..... 7.486343e-05
Phase 1 ................................. 2.670288e-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, July 1, 2019) 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.000235
 Final f                         = -8.0652185e+02  
 Function value at final x       = -8.0652185438883294e+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
Initializing PASAdata structure.
Successfully initialized PASAdata structure.

 Problem: SMBANK (117)
sup norm of Ax: 1.000000e+00
walltime at start:     0.000002

PASA run status (Version 1.0, July 1, 2019): 0

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


PASA run statistics (Version 1.0, July 1, 2019):
|| P (x - g) - x ||                   : 9.391197072494695e-07    
Final f                               : -7.129291999999858e+06   

Iterations of gradient projection (GP): 8         
Iterations of active set GP           : 34        
Function evaluation in main code      : 1         
Function evaluations in GP            : 41        
Function evaluations in active set GP : 69        
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 15        
Gradient evaluations in active set GP : 42        


PPROJ run statistics (Version 2.0, July 1, 2019):

No. blocks in multilevel partition of A . 1
Depth of multilevel partition tree ...... 0
Phase 1 iterations ...................... 5
Coordinate ascent iterations ............ 51
    variables freed in coordinate ascent  10
    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 ................. 29
    nonzeros in final factor ............ 297 85.7% sparse
    rows dropped from L ................. 0
    rows added to L ..................... 0
    rank 1 downdates to L ............... 140
    rank 1 updates to L ................. 165
    Size breakdown of the updates ([size]: number of this size):
        updowns [  1]: 55
        updowns [  2]: 22
        updowns [  3]: 10
        updowns [  4]: 8
        updowns [  5]: 6
        updowns [  6]: 4
        updowns [  7]: 4
        updowns [  8]: 1
        updowns [ 10]: 1
        updowns [ 14]: 1
        updowns [ 15]: 2
    No. of solves:   118

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 9.202957e-05
Initialization (includes partition) ..... 2.870560e-04
Phase 1 ................................. 3.328323e-04
Coordinate ascent ....................... 1.790524e-04
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 0.000000e+00
DASA .................................... 2.239466e-03
DASA line search ........................ 2.193451e-04
Check error ............................. 6.170273e-04
Proximal update ......................... 0.000000e+00
Invert permutation ...................... 5.197525e-05
Row modifications of Cholesky factor .... 2.360344e-05
Column modifications of Cholesky factor . 4.522800e-04
Cholesky factorization .................. 5.548000e-04
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 1.387596e-04
Forward solves .......................... 1.196861e-04


CG_DESCENT (Version 7.0, July 1, 2019) run statistics:

Final f             : -7.129291999999858e+06
sup-norm of gradient:  9.391197072494695e-07
Number of iterations: 979       
Function evaluations: 1867      
Gradient evaluations: 1399      
Subspace iterations: 429       
Number of subspaces: 48        


!!    SMBANK    117    8   41   15   34   69   42    979   1867   1399      52      29     0    9.3911971e-07   -7.1292920e+06    0.045830
 Final f                         = -7.1292920e+06  
 Function value at final x       = -7.1292919999998584e+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
Initializing PASAdata structure.
Successfully initialized PASAdata structure.

 Problem: SPANHYD (97)
sup norm of Ax: 1.000000e+00
walltime at start:     0.000001

PASA run status (Version 1.0, July 1, 2019): 0

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


PASA run statistics (Version 1.0, July 1, 2019):
|| P (x - g) - x ||                   : 4.113507077602984e-07    
Final f                               : 2.397380007047549e+02    

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


PPROJ run statistics (Version 2.0, July 1, 2019):

No. blocks in multilevel partition of A . 1
Depth of multilevel partition tree ...... 0
Phase 1 iterations ...................... 5
Coordinate ascent iterations ............ 37
    variables freed in coordinate ascent  117
    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 ................. 20
    nonzeros in final factor ............ 113 79.9% sparse
    rows dropped from L ................. 0
    rows added to L ..................... 0
    rank 1 downdates to L ............... 55
    rank 1 updates to L ................. 59
    Size breakdown of the updates ([size]: number of this size):
        updowns [  1]: 38
        updowns [  2]: 16
        updowns [  3]: 9
        updowns [  4]: 3
        updowns [  5]: 1
    No. of solves:   70

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 6.794930e-05
Initialization (includes partition) ..... 1.399517e-04
Phase 1 ................................. 1.590252e-04
Coordinate ascent ....................... 1.180172e-04
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 0.000000e+00
DASA .................................... 1.080036e-03
DASA line search ........................ 1.189709e-04
Check error ............................. 2.558231e-04
Proximal update ......................... 0.000000e+00
Invert permutation ...................... 2.288818e-05
Row modifications of Cholesky factor .... 1.907349e-05
Column modifications of Cholesky factor . 1.790524e-04
Cholesky factorization .................. 2.200603e-04
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 7.009506e-05
Forward solves .......................... 4.816055e-05


CG_DESCENT (Version 7.0, July 1, 2019) run statistics:

Final f             :  2.397380007047549e+02
sup-norm of gradient:  1.530618556576392e-07
Number of iterations: 14        
Function evaluations: 26        
Gradient evaluations: 17        
Subspace iterations: 1         
Number of subspaces: 1         


!!   SPANHYD     97    5    6    4   15   20   20     14     26     17      22      20     0    4.1135071e-07    2.3973800e+02    0.002128
 Final f                         = 2.3973800e+02   
 Function value at final x       = 2.3973800070475491e+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
Initializing PASAdata structure.
Successfully initialized PASAdata structure.

 Problem: STANCMIN (3)
sup norm of Ax: 4.000000e+00
walltime at start:     0.000001

PASA run status (Version 1.0, July 1, 2019): 0

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


PASA run statistics (Version 1.0, July 1, 2019):
|| P (x - g) - x ||                   : 2.533112608560373e-12    
Final f                               : 4.249999999995842e+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, July 1, 2019):

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 ....................... 0
    change in column activity ........... 0
    change in row activity .............. 0
    failures of Armijo step ............. 0
Proximal updates ........................ 0
Cholesky factorizations ................. 4
    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:   4

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 2.479553e-05
Initialization (includes partition) ..... 4.792213e-05
Phase 1 ................................. 3.004074e-05
Coordinate ascent ....................... 4.768372e-06
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 0.000000e+00
DASA .................................... 6.270409e-05
DASA line search ........................ 4.768372e-06
Check error ............................. 2.193451e-05
Proximal update ......................... 0.000000e+00
Invert permutation ...................... 1.907349e-06
Row modifications of Cholesky factor .... 0.000000e+00
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 2.026558e-05
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 9.536743e-07
Forward solves .......................... 4.768372e-06


CG_DESCENT (Version 7.0, July 1, 2019) run statistics:

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

!!  STANCMIN      3    0    0    0    0    0    0      0      0      0       2       4     0    2.5331126e-12    4.2500000e+00    0.000239
 Final f                         = 4.2500000e+00   
 Function value at final x       = 4.2499999999958415e+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
Initializing PASAdata structure.
Successfully initialized PASAdata structure.

 Problem: STEENBRB (468)
sup norm of Ax: 1.000000e+00
walltime at start:     0.000001

PASA run status (Version 1.0, July 1, 2019): 0

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


PASA run statistics (Version 1.0, July 1, 2019):
|| P (x - g) - x ||                   : 9.677602342793301e-07    
Final f                               : 9.075855378607988e+03    

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


PPROJ run statistics (Version 2.0, July 1, 2019):

No. blocks in multilevel partition of A . 12
Depth of multilevel partition tree ...... 1
Phase 1 iterations ...................... 5
Coordinate ascent iterations ............ 9
    variables freed in coordinate ascent  33
    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 ................. 9
    nonzeros in final factor ............ 198 96.6% sparse
    rows dropped from L ................. 0
    rows added to L ..................... 0
    rank 1 downdates to L ............... 211
    rank 1 updates to L ................. 268
    Size breakdown of the updates ([size]: number of this size):
        updowns [  1]: 58
        updowns [  2]: 25
        updowns [  3]: 12
        updowns [  4]: 5
        updowns [  5]: 9
        updowns [  6]: 11
        updowns [  7]: 3
        updowns [  9]: 3
        updowns [ 11]: 2
        updowns [ 12]: 1
        updowns [ 13]: 1
        updowns [ 21]: 1
        updowns [ 23]: 1
        updowns [>= 64]: 1
    No. of solves by depth in the multilevel partition tree:
        (deeper <=> further from root of tree <=> fewer flops)
        depth [ 0]: 69
        depth [ 1]: 795

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 1.068115e-04
Initialization (includes partition) ..... 3.499985e-04
Phase 1 ................................. 4.987717e-04
Coordinate ascent ....................... 4.816055e-05
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 0.000000e+00
DASA .................................... 4.207850e-03
DASA line search ........................ 9.241104e-04
Check error ............................. 5.776882e-04
Proximal update ......................... 0.000000e+00
Invert permutation ...................... 4.792213e-05
Row modifications of Cholesky factor .... 1.020432e-04
Column modifications of Cholesky factor . 3.826618e-04
Cholesky factorization .................. 2.360344e-04
Partial Cholesky factorization .......... 1.597404e-05
Back solves ............................. 6.217957e-04
Forward solves .......................... 1.626015e-04


CG_DESCENT (Version 7.0, July 1, 2019) run statistics:

Final f             :  9.075855378618318e+03
sup-norm of gradient:  9.677602342793301e-07
Number of iterations: 68        
Function evaluations: 158       
Gradient evaluations: 91        
Subspace iterations: 9         
Number of subspaces: 1         


!!  STEENBRB    468    4    5    5   43   58   48     68    158     91      52       9     0    9.6776023e-07    9.0758554e+03    0.008336
 Final f                         = 9.0758554e+03   
 Function value at final x       = 9.0758553786079883e+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
Initializing PASAdata structure.
Successfully initialized PASAdata structure.

 Problem: STEENBRC (540)
sup norm of Ax: 1.000000e+00
walltime at start:     0.000001

PASA run status (Version 1.0, July 1, 2019): 0

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


PASA run statistics (Version 1.0, July 1, 2019):
|| P (x - g) - x ||                   : 6.603567620478389e-07    
Final f                               : 2.750493682425081e+04    

Iterations of gradient projection (GP): 6         
Iterations of active set GP           : 109       
Function evaluation in main code      : 1         
Function evaluations in GP            : 7         
Function evaluations in active set GP : 173       
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 6         
Gradient evaluations in active set GP : 116       


PPROJ run statistics (Version 2.0, July 1, 2019):

No. blocks in multilevel partition of A . 14
Depth of multilevel partition tree ...... 1
Phase 1 iterations ...................... 5
Coordinate ascent iterations ............ 5
    variables freed in coordinate ascent  54
    rows dropped in coordinate ascent ... 0
Gradient ascent iterations .............. 7
    variables freed in gradient ascent .. 27
    rows dropped in gradient ascent ..... 0
Preconditioned CG iterations ............ 3
    variables freed in CG ............... 7
    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 ................. 10
    nonzeros in final factor ............ 242 97.0% sparse
    rows dropped from L ................. 0
    rows added to L ..................... 0
    rank 1 downdates to L ............... 648
    rank 1 updates to L ................. 818
    Size breakdown of the updates ([size]: number of this size):
        updowns [  1]: 230
        updowns [  2]: 60
        updowns [  3]: 45
        updowns [  4]: 37
        updowns [  5]: 40
        updowns [  6]: 19
        updowns [  7]: 14
        updowns [  8]: 3
        updowns [  9]: 6
        updowns [ 10]: 1
        updowns [ 11]: 2
        updowns [ 12]: 2
        updowns [ 14]: 1
        updowns [ 15]: 2
        updowns [ 17]: 1
        updowns [ 18]: 1
        updowns [ 29]: 1
        updowns [ 30]: 1
        updowns [ 40]: 1
        updowns [ 45]: 1
        updowns [ 64]: 1
    No. of solves by depth in the multilevel partition tree:
        (deeper <=> further from root of tree <=> fewer flops)
        depth [ 0]: 147
        depth [ 1]: 2227

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 1.168251e-04
Initialization (includes partition) ..... 5.841255e-04
Phase 1 ................................. 7.600784e-04
Coordinate ascent ....................... 5.221367e-05
SSOR0 ................................... 5.483627e-05
SSOR1 ................................... 3.695488e-05
SpaRSA .................................. 0.000000e+00
DASA .................................... 1.057482e-02
DASA line search ........................ 2.244234e-03
Check error ............................. 1.204014e-03
Proximal update ......................... 0.000000e+00
Invert permutation ...................... 1.115799e-04
Row modifications of Cholesky factor .... 2.746582e-04
Column modifications of Cholesky factor . 1.082659e-03
Cholesky factorization .................. 2.920628e-04
Partial Cholesky factorization .......... 2.098083e-05
Back solves ............................. 1.702547e-03
Forward solves .......................... 3.790855e-04


CG_DESCENT (Version 7.0, July 1, 2019) run statistics:

Final f             :  2.750493682427220e+04
sup-norm of gradient:  6.603567620478389e-07
Number of iterations: 246       
Function evaluations: 712       
Gradient evaluations: 494       
Subspace iterations: 11        
Number of subspaces: 5         


!!  STEENBRC    540    6    7    6  109  173  116    246    712    494     120      10     0    6.6035676e-07    2.7504937e+04    0.023396
 Final f                         = 2.7504937e+04   
 Function value at final x       = 2.7504936824250814e+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
Initializing PASAdata structure.
Successfully initialized PASAdata structure.

 Problem: STEENBRD (468)
sup norm of Ax: 1.000000e+00
walltime at start:     0.000001

PASA run status (Version 1.0, July 1, 2019): 0

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


PASA run statistics (Version 1.0, July 1, 2019):
|| P (x - g) - x ||                   : 7.329496948581607e-07    
Final f                               : 9.144724934466869e+03    

Iterations of gradient projection (GP): 6         
Iterations of active set GP           : 94        
Function evaluation in main code      : 1         
Function evaluations in GP            : 7         
Function evaluations in active set GP : 136       
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 7         
Gradient evaluations in active set GP : 110       


PPROJ run statistics (Version 2.0, July 1, 2019):

No. blocks in multilevel partition of A . 12
Depth of multilevel partition tree ...... 1
Phase 1 iterations ...................... 5
Coordinate ascent iterations ............ 12
    variables freed in coordinate ascent  53
    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 ................. 8
    nonzeros in final factor ............ 199 96.6% sparse
    rows dropped from L ................. 0
    rows added to L ..................... 0
    rank 1 downdates to L ............... 559
    rank 1 updates to L ................. 644
    Size breakdown of the updates ([size]: number of this size):
        updowns [  1]: 180
        updowns [  2]: 127
        updowns [  3]: 21
        updowns [  4]: 15
        updowns [  5]: 6
        updowns [  6]: 8
        updowns [  7]: 20
        updowns [  8]: 16
        updowns [  9]: 4
        updowns [ 10]: 2
        updowns [ 11]: 1
        updowns [ 17]: 1
        updowns [ 18]: 1
        updowns [ 19]: 1
        updowns [ 28]: 1
        updowns [ 30]: 1
        updowns [ 37]: 1
        updowns [ 42]: 2
    No. of solves by depth in the multilevel partition tree:
        (deeper <=> further from root of tree <=> fewer flops)
        depth [ 0]: 132
        depth [ 1]: 1762

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 1.070499e-04
Initialization (includes partition) ..... 4.971027e-04
Phase 1 ................................. 6.775856e-04
Coordinate ascent ....................... 5.698204e-05
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 0.000000e+00
DASA .................................... 8.471012e-03
DASA line search ........................ 1.791000e-03
Check error ............................. 1.009226e-03
Proximal update ......................... 0.000000e+00
Invert permutation ...................... 9.870529e-05
Row modifications of Cholesky factor .... 2.160072e-04
Column modifications of Cholesky factor . 8.695126e-04
Cholesky factorization .................. 2.229214e-04
Partial Cholesky factorization .......... 1.764297e-05
Back solves ............................. 1.377106e-03
Forward solves .......................... 3.128052e-04


CG_DESCENT (Version 7.0, July 1, 2019) run statistics:

Final f             :  9.144724934485799e+03
sup-norm of gradient:  8.129150277764140e-07
Number of iterations: 143       
Function evaluations: 289       
Gradient evaluations: 170       
Subspace iterations: 12        
Number of subspaces: 4         


!!  STEENBRD    468    6    7    7   94  136  110    143    289    170     107       8     0    7.3294969e-07    9.1447249e+03    0.015768
 Final f                         = 9.1447249e+03   
 Function value at final x       = 9.1447249344668689e+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
Initializing PASAdata structure.
Successfully initialized PASAdata structure.

 Problem: STEENBRE (540)
sup norm of Ax: 1.000000e+00
walltime at start:     0.000000

PASA run status (Version 1.0, July 1, 2019): 0

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


PASA run statistics (Version 1.0, July 1, 2019):
|| P (x - g) - x ||                   : 6.662309709921932e-07    
Final f                               : 2.745916331683534e+04    

Iterations of gradient projection (GP): 6         
Iterations of active set GP           : 91        
Function evaluation in main code      : 1         
Function evaluations in GP            : 14        
Function evaluations in active set GP : 131       
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 7         
Gradient evaluations in active set GP : 97        


PPROJ run statistics (Version 2.0, July 1, 2019):

No. blocks in multilevel partition of A . 14
Depth of multilevel partition tree ...... 1
Phase 1 iterations ...................... 5
Coordinate ascent iterations ............ 3
    variables freed in coordinate ascent  28
    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 ................. 9
    nonzeros in final factor ............ 236 97.1% sparse
    rows dropped from L ................. 0
    rows added to L ..................... 0
    rank 1 downdates to L ............... 852
    rank 1 updates to L ................. 991
    Size breakdown of the updates ([size]: number of this size):
        updowns [  1]: 184
        updowns [  2]: 53
        updowns [  3]: 39
        updowns [  4]: 53
        updowns [  5]: 31
        updowns [  6]: 25
        updowns [  7]: 10
        updowns [  8]: 28
        updowns [  9]: 18
        updowns [ 10]: 7
        updowns [ 11]: 4
        updowns [ 14]: 1
        updowns [ 15]: 1
        updowns [ 16]: 3
        updowns [ 21]: 1
        updowns [ 22]: 1
        updowns [ 25]: 1
        updowns [ 37]: 1
        updowns [ 38]: 1
        updowns [ 39]: 1
        updowns [ 41]: 1
        updowns [ 49]: 1
    No. of solves by depth in the multilevel partition tree:
        (deeper <=> further from root of tree <=> fewer flops)
        depth [ 0]: 128
        depth [ 1]: 2205

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 1.142025e-04
Initialization (includes partition) ..... 5.679131e-04
Phase 1 ................................. 7.617474e-04
Coordinate ascent ....................... 3.004074e-05
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 0.000000e+00
DASA .................................... 1.038694e-02
DASA line search ........................ 2.213717e-03
Check error ............................. 1.143694e-03
Proximal update ......................... 0.000000e+00
Invert permutation ...................... 1.056194e-04
Row modifications of Cholesky factor .... 2.844334e-04
Column modifications of Cholesky factor . 1.143217e-03
Cholesky factorization .................. 2.615452e-04
Partial Cholesky factorization .......... 1.740456e-05
Back solves ............................. 1.736164e-03
Forward solves .......................... 3.430843e-04


CG_DESCENT (Version 7.0, July 1, 2019) run statistics:

Final f             :  2.745916331686475e+04
sup-norm of gradient:  7.583706347485952e-07
Number of iterations: 265       
Function evaluations: 681       
Gradient evaluations: 433       
Subspace iterations: 76        
Number of subspaces: 10        


!!  STEENBRE    540    6   14    7   91  131   97    265    681    433     104       9     0    6.6623097e-07    2.7459163e+04    0.024143
 Final f                         = 2.7459163e+04   
 Function value at final x       = 2.7459163316835340e+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
Initializing PASAdata structure.
Successfully initialized PASAdata structure.

 Problem: STEENBRF (468)
sup norm of Ax: 1.000000e+00
walltime at start:     0.000001

PASA run status (Version 1.0, July 1, 2019): 0

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


PASA run statistics (Version 1.0, July 1, 2019):
|| P (x - g) - x ||                   : 7.461665991175676e-07    
Final f                               : 8.991848221339864e+03    

Iterations of gradient projection (GP): 6         
Iterations of active set GP           : 74        
Function evaluation in main code      : 1         
Function evaluations in GP            : 8         
Function evaluations in active set GP : 104       
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 8         
Gradient evaluations in active set GP : 85        


PPROJ run statistics (Version 2.0, July 1, 2019):

No. blocks in multilevel partition of A . 12
Depth of multilevel partition tree ...... 1
Phase 1 iterations ...................... 5
Coordinate ascent iterations ............ 11
    variables freed in coordinate ascent  46
    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 ................. 8
    nonzeros in final factor ............ 196 96.7% sparse
    rows dropped from L ................. 0
    rows added to L ..................... 0
    rank 1 downdates to L ............... 575
    rank 1 updates to L ................. 659
    Size breakdown of the updates ([size]: number of this size):
        updowns [  1]: 243
        updowns [  2]: 74
        updowns [  3]: 28
        updowns [  4]: 9
        updowns [  5]: 31
        updowns [  6]: 23
        updowns [  7]: 17
        updowns [  8]: 5
        updowns [  9]: 3
        updowns [ 10]: 3
        updowns [ 11]: 4
        updowns [ 12]: 1
        updowns [ 13]: 1
        updowns [ 21]: 1
        updowns [ 26]: 1
        updowns [ 33]: 1
        updowns [>= 64]: 1
    No. of solves by depth in the multilevel partition tree:
        (deeper <=> further from root of tree <=> fewer flops)
        depth [ 0]: 106
        depth [ 1]: 1545

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 1.041889e-04
Initialization (includes partition) ..... 4.403591e-04
Phase 1 ................................. 6.082058e-04
Coordinate ascent ....................... 5.888939e-05
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 0.000000e+00
DASA .................................... 7.735014e-03
DASA line search ........................ 1.602173e-03
Check error ............................. 8.339882e-04
Proximal update ......................... 0.000000e+00
Invert permutation ...................... 7.534027e-05
Row modifications of Cholesky factor .... 2.810955e-04
Column modifications of Cholesky factor . 9.019375e-04
Cholesky factorization .................. 2.317429e-04
Partial Cholesky factorization .......... 1.454353e-05
Back solves ............................. 1.184464e-03
Forward solves .......................... 2.474785e-04


CG_DESCENT (Version 7.0, July 1, 2019) run statistics:

Final f             :  8.991848221379074e+03
sup-norm of gradient:  7.496344063724625e-07
Number of iterations: 83        
Function evaluations: 225       
Gradient evaluations: 148       
Subspace iterations: 7         
Number of subspaces: 2         


!!  STEENBRF    468    6    8    8   74  104   85     83    225    148      86       8     0    7.4616660e-07    8.9918482e+03    0.013718
 Final f                         = 8.9918482e+03   
 Function value at final x       = 8.9918482213398638e+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
Initializing PASAdata structure.
Successfully initialized PASAdata structure.

 Problem: STEENBRG (540)
sup norm of Ax: 1.000000e+00
walltime at start:     0.000001

PASA run status (Version 1.0, July 1, 2019): 0

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


PASA run statistics (Version 1.0, July 1, 2019):
|| P (x - g) - x ||                   : 6.446789372876321e-07    
Final f                               : 2.742092967470960e+04    

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


PPROJ run statistics (Version 2.0, July 1, 2019):

No. blocks in multilevel partition of A . 14
Depth of multilevel partition tree ...... 1
Phase 1 iterations ...................... 5
Coordinate ascent iterations ............ 4
    variables freed in coordinate ascent  24
    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 ................. 9
    nonzeros in final factor ............ 242 97.0% sparse
    rows dropped from L ................. 0
    rows added to L ..................... 0
    rank 1 downdates to L ............... 365
    rank 1 updates to L ................. 516
    Size breakdown of the updates ([size]: number of this size):
        updowns [  1]: 103
        updowns [  2]: 55
        updowns [  3]: 41
        updowns [  4]: 9
        updowns [  5]: 12
        updowns [  6]: 9
        updowns [  7]: 6
        updowns [  8]: 3
        updowns [  9]: 6
        updowns [ 11]: 1
        updowns [ 14]: 1
        updowns [ 15]: 1
        updowns [ 16]: 1
        updowns [ 20]: 1
        updowns [ 21]: 1
        updowns [ 29]: 1
        updowns [ 40]: 1
        updowns [ 45]: 1
        updowns [ 64]: 1
    No. of solves by depth in the multilevel partition tree:
        (deeper <=> further from root of tree <=> fewer flops)
        depth [ 0]: 102
        depth [ 1]: 1423

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 1.249313e-04
Initialization (includes partition) ..... 4.494190e-04
Phase 1 ................................. 6.241798e-04
Coordinate ascent ....................... 3.266335e-05
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 0.000000e+00
DASA .................................... 6.908894e-03
DASA line search ........................ 1.509905e-03
Check error ............................. 8.687973e-04
Proximal update ......................... 0.000000e+00
Invert permutation ...................... 8.010864e-05
Row modifications of Cholesky factor .... 1.516342e-04
Column modifications of Cholesky factor . 6.914139e-04
Cholesky factorization .................. 2.696514e-04
Partial Cholesky factorization .......... 1.764297e-05
Back solves ............................. 1.108646e-03
Forward solves .......................... 2.582073e-04


CG_DESCENT (Version 7.0, July 1, 2019) run statistics:

Final f             :  2.742092967472884e+04
sup-norm of gradient:  6.446789372876321e-07
Number of iterations: 283       
Function evaluations: 784       
Gradient evaluations: 520       
Subspace iterations: 45        
Number of subspaces: 6         


!!  STEENBRG    540    5    6    5   65  100   65    283    784    520      74       9     0    6.4467894e-07    2.7420930e+04    0.019225
 Final f                         = 2.7420930e+04   
 Function value at final x       = 2.7420929674709598e+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
Initializing PASAdata structure.
Successfully initialized PASAdata structure.

 Problem: TFI3 (3)
sup norm of Ax: 1.000000e+00
walltime at start:     0.000001

PASA run status (Version 1.0, July 1, 2019): 0

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


PASA run statistics (Version 1.0, July 1, 2019):
|| P (x - g) - x ||                   : 6.887268533262159e-12    
Final f                               : 4.301157878304936e+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, July 1, 2019):

No. blocks in multilevel partition of A . 1
Depth of multilevel partition tree ...... 0
Phase 1 iterations ...................... 5
Coordinate ascent iterations ............ 11
    variables freed in coordinate ascent  0
    rows dropped in coordinate ascent ... 40
Gradient ascent iterations .............. 66
    variables freed in gradient ascent .. 0
    rows dropped in gradient ascent ..... 73
Preconditioned CG iterations ............ 31
    variables freed in CG ............... 0
    rows dropped in CG .................. 30
SpaRSA iterations ....................... 0
    change in column activity ........... 0
    change in row activity .............. 0
    failures of Armijo step ............. 0
Proximal updates ........................ 0
Cholesky factorizations ................. 5
    nonzeros in final factor ............ 8 99.8% sparse
    rows dropped from L ................. 97
    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:   84

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 4.100800e-05
Initialization (includes partition) ..... 9.441376e-05
Phase 1 ................................. 8.916855e-05
Coordinate ascent ....................... 1.883507e-05
SSOR0 ................................... 1.027584e-04
SSOR1 ................................... 9.107590e-05
SpaRSA .................................. 0.000000e+00
DASA .................................... 1.632452e-03
DASA line search ........................ 9.965897e-05
Check error ............................. 8.416176e-05
Proximal update ......................... 0.000000e+00
Invert permutation ...................... 1.120567e-05
Row modifications of Cholesky factor .... 6.413460e-04
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 3.490448e-04
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 9.846687e-05
Forward solves .......................... 1.382828e-05


CG_DESCENT (Version 7.0, July 1, 2019) run statistics:

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

!!      TFI3      3    2    2    2    2    2    2      0      0      0       6       5     0    6.8872685e-12    4.3011579e+00    0.002047
 Final f                         = 4.3011579e+00   
 Function value at final x       = 4.3011578783049362e+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
Initializing PASAdata structure.
Successfully initialized PASAdata structure.

 Problem: WATER (31)
sup norm of Ax: 1.000000e+00
walltime at start:     0.000000

PASA run status (Version 1.0, July 1, 2019): 0

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


PASA run statistics (Version 1.0, July 1, 2019):
|| P (x - g) - x ||                   : 7.237938265403088e-07    
Final f                               : 1.054937946581453e+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, July 1, 2019):

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 ....................... 0
    change in column activity ........... 0
    change in row activity .............. 0
    failures of Armijo step ............. 0
Proximal updates ........................ 0
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 ............... 6
    rank 1 updates to L ................. 4
    Size breakdown of the updates ([size]: number of this size):
        updowns [  1]: 4
        updowns [  2]: 3
    No. of solves:   7

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 4.315376e-05
Initialization (includes partition) ..... 8.058548e-05
Phase 1 ................................. 6.103516e-05
Coordinate ascent ....................... 1.072884e-05
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 0.000000e+00
DASA .................................... 1.299381e-04
DASA line search ........................ 1.192093e-05
Check error ............................. 5.102158e-05
Proximal update ......................... 0.000000e+00
Invert permutation ...................... 8.106232e-06
Row modifications of Cholesky factor .... 0.000000e+00
Column modifications of Cholesky factor . 2.193451e-05
Cholesky factorization .................. 2.694130e-05
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 8.106232e-06
Forward solves .......................... 5.722046e-06


CG_DESCENT (Version 7.0, July 1, 2019) run statistics:

Final f             :  1.054937946582714e+04
sup-norm of gradient:  7.237938265403088e-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.2379383e-07    1.0549379e+04    0.000643
 Final f                         = 1.0549379e+04   
 Function value at final x       = 1.0549379465814531e+04   
 ====================================================

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
Initializing PASAdata structure.
Successfully initialized PASAdata structure.

 ** SUBROUTINE CUTEST_csetup: Warning. The problem has no general constraints. 
 ** Other tools may be preferable ** 

 Problem: ALLINIT (4)
walltime at start:     0.000001

PASA run status (Version 1.0, July 1, 2019): 0

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


PASA run statistics (Version 1.0, July 1, 2019):
|| 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, July 1, 2019) 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.000137
 Final f                         = 1.6705968e+01   
 Function value at final x       = 1.6705968432879899e+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
Initializing PASAdata structure.
Successfully initialized PASAdata structure.

 ** SUBROUTINE CUTEST_csetup: Warning. The problem has no general constraints. 
 ** Other tools may be preferable ** 

 Problem: BDEXP (5000)
walltime at start:     0.000001

PASA run status (Version 1.0, July 1, 2019): 0

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


PASA run statistics (Version 1.0, July 1, 2019):
|| 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, July 1, 2019) 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.006150
 Final f                         = 2.8593467e-05   
 Function value at final x       = 2.8593467473123225e-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
Initializing PASAdata structure.
Successfully initialized PASAdata structure.

 ** SUBROUTINE CUTEST_csetup: Warning. The problem has no general constraints. 
 ** Other tools may be preferable ** 

 Problem: BRATU1D (1003)
walltime at start:     0.000001

PASA run status (Version 1.0, July 1, 2019): 0

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


PASA run statistics (Version 1.0, July 1, 2019):
|| P (x - g) - x ||                   : 8.907634310162393e-07    
Final f                               : -8.518927279102391e+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, July 1, 2019) run statistics:

Final f             : -8.518927279102391e+00
sup-norm of gradient:  8.907634310162393e-07
Number of iterations: 7003      
Function evaluations: 7205      
Gradient evaluations: 14196     

!!   BRATU1D   1003    0    0    0    0    0    0   7003   7205  14196       1       0     0    8.9076343e-07   -8.5189273e+00    4.875525
 Final f                         = -8.5189273e+00  
 Function value at final x       = -8.5189272791023907e+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
Initializing PASAdata structure.
Successfully initialized PASAdata structure.

 ** SUBROUTINE CUTEST_csetup: Warning. The problem has no general constraints. 
 ** Other tools may be preferable ** 

 Problem: CAMEL6 (2)
walltime at start:     0.000001

PASA run status (Version 1.0, July 1, 2019): 0

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


PASA run statistics (Version 1.0, July 1, 2019):
|| 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, July 1, 2019) 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.000107
 Final f                         = -1.0316285e+00  
 Function value at final x       = -1.0316284534898779e+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
Initializing PASAdata structure.
Successfully initialized PASAdata structure.

 ** SUBROUTINE CUTEST_csetup: Warning. The problem has no general constraints. 
 ** Other tools may be preferable ** 

 Problem: CLPLATEA (5041)
walltime at start:     0.000001

PASA run status (Version 1.0, July 1, 2019): 0

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


PASA run statistics (Version 1.0, July 1, 2019):
|| 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, July 1, 2019) 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.797975
 Final f                         = -1.2592095e-02  
 Function value at final x       = -1.2592094582376324e-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
Initializing PASAdata structure.
Successfully initialized PASAdata structure.

 ** SUBROUTINE CUTEST_csetup: Warning. The problem has no general constraints. 
 ** Other tools may be preferable ** 

 Problem: CLPLATEB (5041)
walltime at start:     0.000001

PASA run status (Version 1.0, July 1, 2019): 0

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


PASA run statistics (Version 1.0, July 1, 2019):
|| 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, July 1, 2019) 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.287155
 Final f                         = -5.0947862e-03  
 Function value at final x       = -5.0947861677905727e-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
Initializing PASAdata structure.
Successfully initialized PASAdata structure.

 ** SUBROUTINE CUTEST_csetup: Warning. The problem has no general constraints. 
 ** Other tools may be preferable ** 

 Problem: CLPLATEC (5041)
walltime at start:     0.000000

PASA run status (Version 1.0, July 1, 2019): 0

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


PASA run statistics (Version 1.0, July 1, 2019):
|| 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, July 1, 2019) 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   43.182929
 Final f                         = -5.0207242e-03  
 Function value at final x       = -5.0207242144364736e-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
Initializing PASAdata structure.
Successfully initialized PASAdata structure.

 ** SUBROUTINE CUTEST_csetup: Warning. The problem has no general constraints. 
 ** Other tools may be preferable ** 

 Problem: DRCAV1LQ (4489)
walltime at start:     0.000001

PASA run status (Version 1.0, July 1, 2019): 0

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


PASA run statistics (Version 1.0, July 1, 2019):
|| P (x - g) - x ||                   : 9.984832987532306e-07    
Final f                               : 1.490650263104133e-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, July 1, 2019) run statistics:

Final f             :  1.490650263104133e-07
sup-norm of gradient:  9.984832987532306e-07
Number of iterations: 240062    
Function evaluations: 261923    
Gradient evaluations: 458263    

!!  DRCAV1LQ   4489    0    0    0    0    0    0 240062 261923 458263       1       0     0    9.9848330e-07    1.4906503e-07  472.587537
 Final f                         = 1.4906503e-07   
 Function value at final x       = 1.4906502631041326e-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
Initializing PASAdata structure.
Successfully initialized PASAdata structure.

 ** SUBROUTINE CUTEST_csetup: Warning. The problem has no general constraints. 
 ** Other tools may be preferable ** 

 Problem: DRCAV2LQ (4489)
walltime at start:     0.000000

PASA run status (Version 1.0, July 1, 2019): 0

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


PASA run statistics (Version 1.0, July 1, 2019):
|| P (x - g) - x ||                   : 9.941853128601109e-07    
Final f                               : 1.201473263729679e-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, July 1, 2019) run statistics:

Final f             :  1.201473263729679e-07
sup-norm of gradient:  9.941853128601109e-07
Number of iterations: 441448    
Function evaluations: 465268    
Gradient evaluations: 859076    

!!  DRCAV2LQ   4489    0    0    0    0    0    0 441448 465268 859076       1       0     0    9.9418531e-07    1.2014733e-07  798.366883
 Final f                         = 1.2014733e-07   
 Function value at final x       = 1.2014732637296789e-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
Initializing PASAdata structure.
Successfully initialized PASAdata structure.

 ** SUBROUTINE CUTEST_csetup: Warning. The problem has no general constraints. 
 ** Other tools may be preferable ** 

 Problem: DRCAV3LQ (4489)
walltime at start:     0.000000

PASA run status (Version 1.0, July 1, 2019): 0

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


PASA run statistics (Version 1.0, July 1, 2019):
|| P (x - g) - x ||                   : 8.998037557649940e-07    
Final f                               : 3.713822819354992e-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, July 1, 2019) run statistics:

Final f             :  3.713822819354992e-07
sup-norm of gradient:  8.998037557649940e-07
Number of iterations: 1786849   
Function evaluations: 1978138   
Gradient evaluations: 3382413   

!!  DRCAV3LQ   4489    0    0    0    0    0    0 1786849 1978138 3382413       1       0     0    8.9980376e-07    3.7138228e-07 3063.433223
 Final f                         = 3.7138228e-07   
 Function value at final x       = 3.7138228193549918e-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
Initializing PASAdata structure.
Successfully initialized PASAdata structure.

 ** SUBROUTINE CUTEST_csetup: Warning. The problem has no general constraints. 
 ** Other tools may be preferable ** 

 Problem: EG1 (3)
walltime at start:     0.000001

PASA run status (Version 1.0, July 1, 2019): 0

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


PASA run statistics (Version 1.0, July 1, 2019):
|| 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, July 1, 2019) 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.000093
 Final f                         = -1.1328008e+00  
 Function value at final x       = -1.1328007825836615e+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
Initializing PASAdata structure.
Successfully initialized PASAdata structure.

 ** SUBROUTINE CUTEST_csetup: Warning. The problem has no general constraints. 
 ** Other tools may be preferable ** 

 Problem: EXPLIN (1200)
walltime at start:     0.000001

PASA run status (Version 1.0, July 1, 2019): 0

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


PASA run statistics (Version 1.0, July 1, 2019):
|| 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, July 1, 2019) 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.007905
 Final f                         = -7.1925484e+07  
 Function value at final x       = -7.1925483999473438e+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
Initializing PASAdata structure.
Successfully initialized PASAdata structure.

 ** SUBROUTINE CUTEST_csetup: Warning. The problem has no general constraints. 
 ** Other tools may be preferable ** 

 Problem: EXPLIN2 (1200)
walltime at start:     0.000001

PASA run status (Version 1.0, July 1, 2019): 0

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


PASA run statistics (Version 1.0, July 1, 2019):
|| P (x - g) - x ||                   : 5.315121143212309e-07    
Final f                               : -7.199883367983918e+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 : 38        
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 8         
Gradient evaluations in active set GP : 36        


CG_DESCENT (Version 7.0, July 1, 2019) run statistics:

Final f             : -7.199883367983918e+07
sup-norm of gradient:  5.315121143212309e-07
Number of iterations: 73        
Function evaluations: 129       
Gradient evaluations: 80        
Subspace iterations: 1         
Number of subspaces: 1         


!!   EXPLIN2   1200   16    9    8   32   38   36     73    129     80       1       0     0    5.3151211e-07   -7.1998834e+07    0.003002
 Final f                         = -7.1998834e+07  
 Function value at final x       = -7.1998833679839179e+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
Initializing PASAdata structure.
Successfully initialized PASAdata structure.

 ** SUBROUTINE CUTEST_csetup: Warning. The problem has no general constraints. 
 ** Other tools may be preferable ** 

 Problem: EXPQUAD (1200)
walltime at start:     0.000001

PASA run status (Version 1.0, July 1, 2019): 0

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


PASA run statistics (Version 1.0, July 1, 2019):
|| 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, July 1, 2019) 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.033904
 Final f                         = -3.6849396e+09  
 Function value at final x       = -3.6849395657317705e+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
Initializing PASAdata structure.
Successfully initialized PASAdata structure.

 ** SUBROUTINE CUTEST_csetup: Warning. The problem has no general constraints. 
 ** Other tools may be preferable ** 

 Problem: HADAMALS (400)
walltime at start:     0.000001

PASA run status (Version 1.0, July 1, 2019): 0

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


PASA run statistics (Version 1.0, July 1, 2019):
|| 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, July 1, 2019) 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.004050
 Final f                         = 7.3118431e+03   
 Function value at final x       = 7.3118431499590879e+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
Initializing PASAdata structure.
Successfully initialized PASAdata structure.

 ** SUBROUTINE CUTEST_csetup: Warning. The problem has no general constraints. 
 ** Other tools may be preferable ** 

 Problem: HART6 (6)
walltime at start:     0.000001

PASA run status (Version 1.0, July 1, 2019): 0

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


PASA run statistics (Version 1.0, July 1, 2019):
|| 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, July 1, 2019) 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.000107
 Final f                         = -3.3228869e+00  
 Function value at final x       = -3.3228868915893166e+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
Initializing PASAdata structure.
Successfully initialized PASAdata structure.

 ** SUBROUTINE CUTEST_csetup: Warning. The problem has no general constraints. 
 ** Other tools may be preferable ** 

 Problem: HIMMELP1 (2)
walltime at start:     0.000001

PASA run status (Version 1.0, July 1, 2019): 0

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


PASA run statistics (Version 1.0, July 1, 2019):
|| 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, July 1, 2019) 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.000081
 Final f                         = -2.3897419e+01  
 Function value at final x       = -2.3897418950438748e+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
Initializing PASAdata structure.
Successfully initialized PASAdata structure.

 ** SUBROUTINE CUTEST_csetup: Warning. The problem has no general constraints. 
 ** Other tools may be preferable ** 

 Problem: HOLMES (180)
walltime at start:     0.000000

PASA run status (Version 1.0, July 1, 2019): 0

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


PASA run statistics (Version 1.0, July 1, 2019):
|| 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, July 1, 2019) 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.089642
 Final f                         = 1.2481503e+03   
 Function value at final x       = 1.2481503481413133e+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
Initializing PASAdata structure.
Successfully initialized PASAdata structure.

 ** SUBROUTINE CUTEST_csetup: Warning. The problem has no general constraints. 
 ** Other tools may be preferable ** 

 Problem: HS38 (4)
walltime at start:     0.000001

PASA run status (Version 1.0, July 1, 2019): 0

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


PASA run statistics (Version 1.0, July 1, 2019):
|| 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, July 1, 2019) 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.000123
 Final f                         = 3.7015121e-15   
 Function value at final x       = 3.7015120830048707e-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
Initializing PASAdata structure.
Successfully initialized PASAdata structure.

 ** SUBROUTINE CUTEST_csetup: Warning. The problem has no general constraints. 
 ** Other tools may be preferable ** 

 Problem: HS4 (2)
walltime at start:     0.000001

PASA run status (Version 1.0, July 1, 2019): 0

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


PASA run statistics (Version 1.0, July 1, 2019):
|| 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, July 1, 2019) 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.000051
 Final f                         = 2.6666667e+00   
 Function value at final x       = 2.6666666640000001e+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
Initializing PASAdata structure.
Successfully initialized PASAdata structure.

 ** SUBROUTINE CUTEST_csetup: Warning. The problem has no general constraints. 
 ** Other tools may be preferable ** 

 Problem: HS45 (5)
walltime at start:     0.000000

PASA run status (Version 1.0, July 1, 2019): 0

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


PASA run statistics (Version 1.0, July 1, 2019):
|| 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, July 1, 2019) 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.000059
 Final f                         = 1.0000000e+00   
 Function value at final x       = 1.0000000004000000e+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
Initializing PASAdata structure.
Successfully initialized PASAdata structure.

 ** SUBROUTINE CUTEST_csetup: Warning. The problem has no general constraints. 
 ** Other tools may be preferable ** 

 Problem: HS5 (2)
walltime at start:     0.000001

PASA run status (Version 1.0, July 1, 2019): 0

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


PASA run statistics (Version 1.0, July 1, 2019):
|| 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, July 1, 2019) 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.000100
 Final f                         = -1.9132230e+00  
 Function value at final x       = -1.9132229549810158e+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
Initializing PASAdata structure.
Successfully initialized PASAdata structure.

 ** SUBROUTINE CUTEST_csetup: Warning. The problem has no general constraints. 
 ** Other tools may be preferable ** 

 Problem: LMINSURF (5625)
walltime at start:     0.000000

PASA run status (Version 1.0, July 1, 2019): 0

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


PASA run statistics (Version 1.0, July 1, 2019):
|| P (x - g) - x ||                   : 9.450769133494130e-07    
Final f                               : 8.999999994058504e+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, July 1, 2019) run statistics:

Final f             :  8.999999994058504e+00
sup-norm of gradient:  9.450769133494130e-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.4507691e-07    9.0000000e+00    0.543930
 Final f                         = 9.0000000e+00   
 Function value at final x       = 8.9999999940585038e+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
Initializing PASAdata structure.
Successfully initialized PASAdata structure.

 ** SUBROUTINE CUTEST_csetup: Warning. The problem has no general constraints. 
 ** Other tools may be preferable ** 

 Problem: LOGROS (2)
walltime at start:     0.000001

PASA run status (Version 1.0, July 1, 2019): 0

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


PASA run statistics (Version 1.0, July 1, 2019):
|| 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, July 1, 2019) 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.000207
 Final f                         = 1.3322676e-15   
 Function value at final x       = 1.3322676295501871e-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
Initializing PASAdata structure.
Successfully initialized PASAdata structure.

 ** SUBROUTINE CUTEST_csetup: Warning. The problem has no general constraints. 
 ** Other tools may be preferable ** 

 Problem: MAXLIKA (8)
walltime at start:     0.000000

PASA run status (Version 1.0, July 1, 2019): 0

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


PASA run statistics (Version 1.0, July 1, 2019):
|| P (x - g) - x ||                   : 7.947553388731876e-07    
Final f                               : 1.136307296897006e+03    

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


CG_DESCENT (Version 7.0, July 1, 2019) run statistics:

Final f             :  1.136307296897006e+03
sup-norm of gradient:  7.947553388731876e-07
Number of iterations: 94        
Function evaluations: 188       
Gradient evaluations: 101       

!!   MAXLIKA      8    5    3    2    7    9    8     94    188    101       1       0     0    7.9475534e-07    1.1363073e+03    0.015910
 Final f                         = 1.1363073e+03   
 Function value at final x       = 1.1363072968970057e+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
Initializing PASAdata structure.
Successfully initialized PASAdata structure.

 ** SUBROUTINE CUTEST_csetup: Warning. The problem has no general constraints. 
 ** Other tools may be preferable ** 

 Problem: MCCORMCK (5000)
walltime at start:     0.000000

PASA run status (Version 1.0, July 1, 2019): 0

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


PASA run statistics (Version 1.0, July 1, 2019):
|| 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, July 1, 2019) 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.020193
 Final f                         = -4.5665806e+03  
 Function value at final x       = -4.5665805528001920e+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
Initializing PASAdata structure.
Successfully initialized PASAdata structure.

 ** SUBROUTINE CUTEST_csetup: Warning. The problem has no general constraints. 
 ** Other tools may be preferable ** 

 Problem: MDHOLE (2)
walltime at start:     0.000001

PASA run status (Version 1.0, July 1, 2019): 0

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


PASA run statistics (Version 1.0, July 1, 2019):
|| 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, July 1, 2019) 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.000183
 Final f                         = 0.0000000e+00   
 Function value at final x       = 0.0000000000000000e+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
Initializing PASAdata structure.
Successfully initialized PASAdata structure.

 ** SUBROUTINE CUTEST_csetup: Warning. The problem has no general constraints. 
 ** Other tools may be preferable ** 

 Problem: MINSURF (64)
walltime at start:     0.000000

PASA run status (Version 1.0, July 1, 2019): 0

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


PASA run statistics (Version 1.0, July 1, 2019):
|| 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, July 1, 2019) 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.000263
 Final f                         = 1.0000000e+00   
 Function value at final x       = 1.0000000017003547e+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
Initializing PASAdata structure.
Successfully initialized PASAdata structure.

 ** SUBROUTINE CUTEST_csetup: Warning. The problem has no general constraints. 
 ** Other tools may be preferable ** 

 Problem: MINSURFO (5306)
walltime at start:     0.000000

PASA run status (Version 1.0, July 1, 2019): 0

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


PASA run statistics (Version 1.0, July 1, 2019):
|| 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, July 1, 2019) 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.711216
 Final f                         = 2.5069493e+00   
 Function value at final x       = 2.5069492642762601e+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
Initializing PASAdata structure.
Successfully initialized PASAdata structure.

 ** SUBROUTINE CUTEST_csetup: Warning. The problem has no general constraints. 
 ** Other tools may be preferable ** 

 Problem: NLMSURF (5625)
walltime at start:     0.000000

PASA run status (Version 1.0, July 1, 2019): 0

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


PASA run statistics (Version 1.0, July 1, 2019):
|| P (x - g) - x ||                   : 9.222208050609104e-07    
Final f                               : 3.894898481487326e+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, July 1, 2019) run statistics:

Final f             :  3.894898481487326e+01
sup-norm of gradient:  9.222208050609104e-07
Number of iterations: 3604      
Function evaluations: 7144      
Gradient evaluations: 3674      

!!   NLMSURF   5625    0    0    0    0    0    0   3604   7144   3674       1       0     0    9.2222081e-07    3.8948985e+01    3.856263
 Final f                         = 3.8948985e+01   
 Function value at final x       = 3.8948984814873263e+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
Initializing PASAdata structure.
Successfully initialized PASAdata structure.

 ** SUBROUTINE CUTEST_csetup: Warning. The problem has no general constraints. 
 ** Other tools may be preferable ** 

 Problem: ODC (5184)
walltime at start:     0.000001

PASA run status (Version 1.0, July 1, 2019): 0

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


PASA run statistics (Version 1.0, July 1, 2019):
|| 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, July 1, 2019) 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.584588
 Final f                         = -1.1371796e-02  
 Function value at final x       = -1.1371796205851910e-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
Initializing PASAdata structure.
Successfully initialized PASAdata structure.

 ** SUBROUTINE CUTEST_csetup: Warning. The problem has no general constraints. 
 ** Other tools may be preferable ** 

 Problem: POWELLBC (1000)
walltime at start:     0.000000

PASA run status (Version 1.0, July 1, 2019): 0

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


PASA run statistics (Version 1.0, July 1, 2019):
|| 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, July 1, 2019) 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   21.520877
 Final f                         = 3.1036403e+05   
 Function value at final x       = 3.1036403108255379e+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
Initializing PASAdata structure.
Successfully initialized PASAdata structure.

 ** SUBROUTINE CUTEST_csetup: Warning. The problem has no general constraints. 
 ** Other tools may be preferable ** 

 Problem: PROBPENL (500)
walltime at start:     0.000001

PASA run status (Version 1.0, July 1, 2019): 0

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


PASA run statistics (Version 1.0, July 1, 2019):
|| 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, July 1, 2019) 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.000360
 Final f                         = 3.9919839e-07   
 Function value at final x       = 3.9919839271909780e-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
Initializing PASAdata structure.
Successfully initialized PASAdata structure.

 ** SUBROUTINE CUTEST_csetup: Warning. The problem has no general constraints. 
 ** Other tools may be preferable ** 

 Problem: QRTQUAD (5000)
walltime at start:     0.000001

PASA run status (Version 1.0, July 1, 2019): 0

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


PASA run statistics (Version 1.0, July 1, 2019):
|| P (x - g) - x ||                   : 9.533341653877869e-07    
Final f                               : -2.648561822315248e+11   

Iterations of gradient projection (GP): 11        
Iterations of active set GP           : 328       
Function evaluation in main code      : 1         
Function evaluations in GP            : 9         
Function evaluations in active set GP : 567       
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 9         
Gradient evaluations in active set GP : 489       


CG_DESCENT (Version 7.0, July 1, 2019) run statistics:

Final f             : -2.648561822315248e+11
sup-norm of gradient:  9.533341653877869e-07
Number of iterations: 2943      
Function evaluations: 5054      
Gradient evaluations: 6291      
Subspace iterations: 676       
Number of subspaces: 133       


!!   QRTQUAD   5000   11    9    9  328  567  489   2943   5054   6291       1       0     0    9.5333417e-07   -2.6485618e+11    1.243050
 Final f                         = -2.6485618e+11  
 Function value at final x       = -2.6485618223152478e+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
Initializing PASAdata structure.
Successfully initialized PASAdata structure.

 ** SUBROUTINE CUTEST_csetup: Warning. The problem has no general constraints. 
 ** Other tools may be preferable ** 

 Problem: RAYBENDL (2050)
walltime at start:     0.000000

PASA run status (Version 1.0, July 1, 2019): 0

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


PASA run statistics (Version 1.0, July 1, 2019):
|| 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, July 1, 2019) 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.851041
 Final f                         = 9.6242378e+01   
 Function value at final x       = 9.6242378381096898e+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
Initializing PASAdata structure.
Successfully initialized PASAdata structure.

 ** SUBROUTINE CUTEST_csetup: Warning. The problem has no general constraints. 
 ** Other tools may be preferable ** 

 Problem: RAYBENDS (2050)
walltime at start:     0.000000

PASA run status (Version 1.0, July 1, 2019): 0

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


PASA run statistics (Version 1.0, July 1, 2019):
|| 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, July 1, 2019) 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   13.389176
 Final f                         = 9.6241711e+01   
 Function value at final x       = 9.6241710978795155e+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
Initializing PASAdata structure.
Successfully initialized PASAdata structure.

 ** SUBROUTINE CUTEST_csetup: Warning. The problem has no general constraints. 
 ** Other tools may be preferable ** 

 Problem: S368 (8)
walltime at start:     0.000001

PASA run status (Version 1.0, July 1, 2019): 0

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


PASA run statistics (Version 1.0, July 1, 2019):
|| 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, July 1, 2019) 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.000212
 Final f                         = -7.5000000e-01  
 Function value at final x       = -7.4999999999983724e-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
Initializing PASAdata structure.
Successfully initialized PASAdata structure.

 ** SUBROUTINE CUTEST_csetup: Warning. The problem has no general constraints. 
 ** Other tools may be preferable ** 

 Problem: SINEALI (1000)
walltime at start:     0.000001

PASA run status (Version 1.0, July 1, 2019): 0

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


PASA run statistics (Version 1.0, July 1, 2019):
|| 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, July 1, 2019) 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.014978
 Final f                         = -9.9900962e+04  
 Function value at final x       = -9.9900961648709490e+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
Initializing PASAdata structure.
Successfully initialized PASAdata structure.

 ** SUBROUTINE CUTEST_csetup: Warning. The problem has no general constraints. 
 ** Other tools may be preferable ** 

 Problem: SSC (5184)
walltime at start:     0.000001

PASA run status (Version 1.0, July 1, 2019): 0

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


PASA run statistics (Version 1.0, July 1, 2019):
|| 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, July 1, 2019) 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.406966
 Final f                         = -2.0781733e+00  
 Function value at final x       = -2.0781732750833082e+00  
 ====================================================

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

CG_DESCENT (Version 7.0, July 1, 2019) 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.000178    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.000002
!!  ALLINITU      4      12      30      18     0    1.5419435e-09    5.7443849e+00    0.000063

CG_DESCENT (Version 7.0, July 1, 2019) 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.000063    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.000134

CG_DESCENT (Version 7.0, July 1, 2019) 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.000134    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.000001
!!   ARGLINB    200       5      15      13     0    8.3382474e-09    9.9625468e+01    0.004498

CG_DESCENT (Version 7.0, July 1, 2019) 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.004498    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.006737

CG_DESCENT (Version 7.0, July 1, 2019) 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.006737    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.000078

CG_DESCENT (Version 7.0, July 1, 2019) 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.000078    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.173268

CG_DESCENT (Version 7.0, July 1, 2019) 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.173268    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.000001
!!     BEALE      2      15      31      16     0    4.4989214e-08    2.7264213e-15    0.000066

CG_DESCENT (Version 7.0, July 1, 2019) 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.000066    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.000001
!!    BIGGS6      6      26      55      29     0    1.2469933e-07    5.6556498e-03    0.000205

CG_DESCENT (Version 7.0, July 1, 2019) 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.000205    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.025479

CG_DESCENT (Version 7.0, July 1, 2019) 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.025479    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.000001
!!      BOX3      3      11      24      13     0    7.5844458e-07    3.8194901e-13    0.000080

CG_DESCENT (Version 7.0, July 1, 2019) 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.000080    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.034394

CG_DESCENT (Version 7.0, July 1, 2019) 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.034394    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.000028

CG_DESCENT (Version 7.0, July 1, 2019) 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.000028    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.000000
!!   BROWNAL    200       9      27      18     0    9.5220187e-10    9.0719515e-19    0.003501

CG_DESCENT (Version 7.0, July 1, 2019) 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.003501    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.000041

CG_DESCENT (Version 7.0, July 1, 2019) 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.000041    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.000001
!!  BROWNDEN      4      16      31      19     0    6.2987965e-08    8.5822201e+04    0.000107

CG_DESCENT (Version 7.0, July 1, 2019) 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.000107    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.671546

CG_DESCENT (Version 7.0, July 1, 2019) 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.671546    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.041382

CG_DESCENT (Version 7.0, July 1, 2019) 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.041382    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.000001
!!  CHAINWOO   4000     250     474     312     0    8.6481796e-07    4.5727672e+00    0.204032

CG_DESCENT (Version 7.0, July 1, 2019) 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.204032    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.003471

CG_DESCENT (Version 7.0, July 1, 2019) 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.003471    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.003261

CG_DESCENT (Version 7.0, July 1, 2019) 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.003261    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.000000
!!     CLIFF      2      13      46      33     0    2.3391621e-07    1.9978661e-01    0.000067

CG_DESCENT (Version 7.0, July 1, 2019) 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.000067    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.057088

CG_DESCENT (Version 7.0, July 1, 2019) 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.057088    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.174557

CG_DESCENT (Version 7.0, July 1, 2019) 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.174557    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.000000
!!      CUBE      2      35      85      50     0    3.2723735e-10    3.2828157e-23    0.000091

CG_DESCENT (Version 7.0, July 1, 2019) 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.000091    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   50.727819

CG_DESCENT (Version 7.0, July 1, 2019) 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                = 50.727819   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  117.225567

CG_DESCENT (Version 7.0, July 1, 2019) 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                = 117.225567  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  191.103138

CG_DESCENT (Version 7.0, July 1, 2019) 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                = 191.103138  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.009340

CG_DESCENT (Version 7.0, July 1, 2019) 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.009340    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.000001
!!  DENSCHNA      2       9      19      10     0    3.5273288e-08    3.1668570e-16    0.000042

CG_DESCENT (Version 7.0, July 1, 2019) 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.000042    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.000037

CG_DESCENT (Version 7.0, July 1, 2019) 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.000037    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.000001
!!  DENSCHNC      2      12      26      14     0    3.2760930e-09    3.2531884e-19    0.000055

CG_DESCENT (Version 7.0, July 1, 2019) 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.000055    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.000094

CG_DESCENT (Version 7.0, July 1, 2019) 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.000094    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.000073

CG_DESCENT (Version 7.0, July 1, 2019) 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.000073    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.000037

CG_DESCENT (Version 7.0, July 1, 2019) 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.000037    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.000001
!!  DIXMAANA   3000       7      15       8     0    4.8306833e-12    1.0000000e+00    0.002149

CG_DESCENT (Version 7.0, July 1, 2019) 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.002149    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.001882

CG_DESCENT (Version 7.0, July 1, 2019) 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.001882    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.001875

CG_DESCENT (Version 7.0, July 1, 2019) 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.001875    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.002203

CG_DESCENT (Version 7.0, July 1, 2019) 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.002203    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.000000
!!  DIXMAANE   3000     222     239     429     0    9.8403702e-07    1.0000000e+00    0.090784

CG_DESCENT (Version 7.0, July 1, 2019) 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.090784    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.000001
!!  DIXMAANF   3000     161     323     162     0    8.8563506e-07    1.0000000e+00    0.042348

CG_DESCENT (Version 7.0, July 1, 2019) 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.042348    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.041408

CG_DESCENT (Version 7.0, July 1, 2019) 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.041408    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.045826

CG_DESCENT (Version 7.0, July 1, 2019) 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.045826    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.509029

CG_DESCENT (Version 7.0, July 1, 2019) 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.509029    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.000000
!!  DIXMAANJ   3000     327     655     328     0    9.8677323e-07    1.0000002e+00    0.085207

CG_DESCENT (Version 7.0, July 1, 2019) 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.085207    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.000001
!!  DIXMAANK   3000     283     567     284     0    9.4621288e-07    1.0000002e+00    0.074340

CG_DESCENT (Version 7.0, July 1, 2019) 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.074340    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.000001
!!  DIXMAANL   3000     237     475     238     0    9.6696144e-07    1.0000002e+00    0.062661

CG_DESCENT (Version 7.0, July 1, 2019) 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.062661    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.000000
!!  DIXMAANM   3000    4478    4533    8903     0    9.9536141e-07    1.0000001e+00    1.807948

CG_DESCENT (Version 7.0, July 1, 2019) 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                = 1.807948    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.180057

CG_DESCENT (Version 7.0, July 1, 2019) 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.180057    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.161362

CG_DESCENT (Version 7.0, July 1, 2019) 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.161362    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.000001
!!  DIXMAANP   3000     686    1373     687     0    9.9695480e-07    1.0000003e+00    0.177955

CG_DESCENT (Version 7.0, July 1, 2019) 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.177955    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.939441

CG_DESCENT (Version 7.0, July 1, 2019) 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.939441    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.000000
!!      DJTL      2      76     882     809     0    3.8264909e-07   -8.9515447e+03    0.001636

CG_DESCENT (Version 7.0, July 1, 2019) 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.001636    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.000002
!!   DQDRTIC   5000       5       0       6     0    2.2053470e-11   -5.0515592e-10    0.000492

CG_DESCENT (Version 7.0, July 1, 2019) 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.000492    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.006760

CG_DESCENT (Version 7.0, July 1, 2019) 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.006760    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.013051

CG_DESCENT (Version 7.0, July 1, 2019) 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.013051    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.000001
!!       EG2   1000       5      11       6     0    1.2434529e-08   -9.9894739e+02    0.001482

CG_DESCENT (Version 7.0, July 1, 2019) 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.001482    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.000000
!!  EIGENALS   2550   10772   19531   12798     0    9.7568473e-07    2.9513288e-11   64.087589

CG_DESCENT (Version 7.0, July 1, 2019) 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                = 64.087589   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  138.666312

CG_DESCENT (Version 7.0, July 1, 2019) 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                = 138.666312  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   68.293595

CG_DESCENT (Version 7.0, July 1, 2019) 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                = 68.293595   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.020853

CG_DESCENT (Version 7.0, July 1, 2019) 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.020853    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.000078

CG_DESCENT (Version 7.0, July 1, 2019) 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.000078    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.017033

CG_DESCENT (Version 7.0, July 1, 2019) 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.017033    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.136067

CG_DESCENT (Version 7.0, July 1, 2019) 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.136067    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.000000
!!    EXPFIT      2      13      29      16     0    4.2083119e-07    2.4051059e-01    0.000069

CG_DESCENT (Version 7.0, July 1, 2019) 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.000069    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.572284

CG_DESCENT (Version 7.0, July 1, 2019) 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.572284    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.061568

CG_DESCENT (Version 7.0, July 1, 2019) 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.061568    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.000948

CG_DESCENT (Version 7.0, July 1, 2019) 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.000948    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.042225

CG_DESCENT (Version 7.0, July 1, 2019) 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.042225    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.386708

CG_DESCENT (Version 7.0, July 1, 2019) 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.386708    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.000001
!!  FMINSURF   5625     473     947     474     0    9.7701254e-07    1.0000000e+00    0.546814

CG_DESCENT (Version 7.0, July 1, 2019) 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.546814    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.037469

CG_DESCENT (Version 7.0, July 1, 2019) 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.037469    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.000001
!!  GENHUMPS   5000   16870   33799   16930     0    1.5424709e-09    1.0339232e-17   25.697967

CG_DESCENT (Version 7.0, July 1, 2019) 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                = 25.697967   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.000001
!!   GENROSE    500    1073    2161    1096     0    5.5912374e-07    1.0000000e+00    0.077659

CG_DESCENT (Version 7.0, July 1, 2019) 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.077659    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.000001
!!  GROWTHLS      3     133     430     289     0    2.8618672e-09    1.0040406e+00    0.001504

CG_DESCENT (Version 7.0, July 1, 2019) 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.001504    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.004240

CG_DESCENT (Version 7.0, July 1, 2019) 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.004240    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.000000
!!     HAIRY      2      24      74      52     0    4.5217323e-10    2.0000000e+01    0.000118

CG_DESCENT (Version 7.0, July 1, 2019) 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.000118    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.000000
!!   HATFLDD      3      19      42      23     0    3.1155866e-07    2.5469009e-07    0.000114

CG_DESCENT (Version 7.0, July 1, 2019) 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.000114    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.000001
!!   HATFLDE      3      29      79      50     0    1.6745412e-07    5.1203769e-07    0.000328

CG_DESCENT (Version 7.0, July 1, 2019) 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.000328    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.000000
!!  HATFLDFL      3      39      93      54     0    7.1641030e-07    6.3266268e-05    0.000110

CG_DESCENT (Version 7.0, July 1, 2019) 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.000110    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.000000
!!  HEART6LS      6     661    1603     942     0    8.2442952e-08    2.0434367e-16    0.002422

CG_DESCENT (Version 7.0, July 1, 2019) 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.002422    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.000001
!!  HEART8LS      8     279     581     302     0    8.2390325e-08    1.2350888e-17    0.000941

CG_DESCENT (Version 7.0, July 1, 2019) 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.000941    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.000001
!!     HELIX      3      23      50      27     0    5.6033548e-07    1.0462137e-15    0.000072

CG_DESCENT (Version 7.0, July 1, 2019) 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.000072    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.021686

CG_DESCENT (Version 7.0, July 1, 2019) 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.021686    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.000020

CG_DESCENT (Version 7.0, July 1, 2019) 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.000020    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, July 1, 2019) 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.000001
!!  HIMMELBB      2       8      28      20     0    6.2805676e-08    6.4619801e-14    0.000045

CG_DESCENT (Version 7.0, July 1, 2019) 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.000045    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.000000
!!  HIMMELBF      4      26      60      36     0    3.7446603e-07    3.1857175e+02    0.000104

CG_DESCENT (Version 7.0, July 1, 2019) 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.000104    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.000050

CG_DESCENT (Version 7.0, July 1, 2019) 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.000050    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.000000
!!  HIMMELBH      2       7      16       9     0    2.9620306e-11   -1.0000000e+00    0.000046

CG_DESCENT (Version 7.0, July 1, 2019) 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.000046    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.000108

CG_DESCENT (Version 7.0, July 1, 2019) 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.000108    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   10.296000

CG_DESCENT (Version 7.0, July 1, 2019) 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                = 10.296000   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.000000
!!    JENSMP      2      15      33      22     0    5.3069016e-10    1.2436218e+02    0.000118

CG_DESCENT (Version 7.0, July 1, 2019) 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.000118    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  415.376306

CG_DESCENT (Version 7.0, July 1, 2019) 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                = 415.376306  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.000081

CG_DESCENT (Version 7.0, July 1, 2019) 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.000081    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.000000
!!   LIARWHD   5000      17      38      21     0    3.0028894e-07    2.5312134e-18    0.013638

CG_DESCENT (Version 7.0, July 1, 2019) 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.013638    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.000124

CG_DESCENT (Version 7.0, July 1, 2019) 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.000124    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.047215

CG_DESCENT (Version 7.0, July 1, 2019) 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.047215    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.002485

CG_DESCENT (Version 7.0, July 1, 2019) 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.002485    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.000063

CG_DESCENT (Version 7.0, July 1, 2019) 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.000063    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.000001
!!    MOREBV   5000     161     168     317     0    9.9408232e-07    1.0864330e-10    0.150835

CG_DESCENT (Version 7.0, July 1, 2019) 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.150835    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.000001
!!  MSQRTALS   1024    2927    5857    2931     0    9.8080911e-07    6.6252836e-10    3.266621

CG_DESCENT (Version 7.0, July 1, 2019) 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                = 3.266621    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.549392

CG_DESCENT (Version 7.0, July 1, 2019) 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.549392    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.234792

CG_DESCENT (Version 7.0, July 1, 2019) 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.234792   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.476838

CG_DESCENT (Version 7.0, July 1, 2019) 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.476838   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.370775

CG_DESCENT (Version 7.0, July 1, 2019) 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.370775    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.011088

CG_DESCENT (Version 7.0, July 1, 2019) 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.011088    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.000001
!!  NONDQUAR   5000    2066    4139    2073     0    8.5389045e-07    3.0061041e-06    0.623549

CG_DESCENT (Version 7.0, July 1, 2019) 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.623549    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.000001
!!  OSBORNEA      5      67     157      90     0    4.0533134e-07    5.4652996e-05    0.000897

CG_DESCENT (Version 7.0, July 1, 2019) 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.000897    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.000000
!!  OSBORNEB     11      62     127      65     0    4.3772597e-07    4.0137736e-02    0.002420

CG_DESCENT (Version 7.0, July 1, 2019) 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.002420    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.646712

CG_DESCENT (Version 7.0, July 1, 2019) 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.646712    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.000000
!!  OSCIPATH     10  307869  667457  360238     0    9.9275643e-07    2.3127114e-05    0.829026

CG_DESCENT (Version 7.0, July 1, 2019) 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.829026    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.000000
!!  PALMER1C      8      16       0      19     0    2.4244819e-09    9.7604956e-02    0.000024

CG_DESCENT (Version 7.0, July 1, 2019) 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.000024    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.000018

CG_DESCENT (Version 7.0, July 1, 2019) 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.000018    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.000028

CG_DESCENT (Version 7.0, July 1, 2019) 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.000028    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.000000
!!  PALMER3C      8       9       0      11     0    2.6737155e-09    1.9537629e-02    0.000019

CG_DESCENT (Version 7.0, July 1, 2019) 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.000019    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.000000
!!  PALMER4C      8      10       0      13     0    1.0183288e-14    5.0310635e-02    0.000024

CG_DESCENT (Version 7.0, July 1, 2019) 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.000024    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.000000
!!  PALMER5C      6       6      13       7     0    3.7526926e-12    2.1280866e+00    0.000042

CG_DESCENT (Version 7.0, July 1, 2019) 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.000042    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.000068

CG_DESCENT (Version 7.0, July 1, 2019) 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.000068    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.000146

CG_DESCENT (Version 7.0, July 1, 2019) 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.000146    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.000000
!!  PALMER8C      8      11      18      17     0    8.7351837e-10    1.5976783e-01    0.000063

CG_DESCENT (Version 7.0, July 1, 2019) 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.000063    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.000001
!!  PENALTY1   1000      23      61      38     0    6.5035329e-07    9.6861805e-03    0.002376

CG_DESCENT (Version 7.0, July 1, 2019) 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.002376    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.026438

CG_DESCENT (Version 7.0, July 1, 2019) 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.026438    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.932699

CG_DESCENT (Version 7.0, July 1, 2019) 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.932699    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.007095

CG_DESCENT (Version 7.0, July 1, 2019) 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.007095    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.123191

CG_DESCENT (Version 7.0, July 1, 2019) 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.123191    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.000001
!!    QUARTC   5000      21      51      30     0    4.9243335e-07    7.3281603e-08    0.006748

CG_DESCENT (Version 7.0, July 1, 2019) 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.006748    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.000000
!!   ROSENBR      2      33      77      44     0    7.6359613e-07    1.1840457e-13    0.000073

CG_DESCENT (Version 7.0, July 1, 2019) 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.000073    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.000001
!!      S308      2       8      20      12     0    9.0151496e-07    7.7319906e-01    0.000040

CG_DESCENT (Version 7.0, July 1, 2019) 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.000040    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.000001
!!  SCHMVETT   5000      43      73      60     0    6.4347041e-07   -1.4994000e+04    0.106563

CG_DESCENT (Version 7.0, July 1, 2019) 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.106563    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.000000
!!   SENSORS    100      23      52      32     0    7.3606626e-07   -2.0958750e+03    0.141772

CG_DESCENT (Version 7.0, July 1, 2019) 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.141772    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.000001
!!   SINEVAL      2      72     174     102     0    1.1805903e-12    9.2038786e-27    0.000167

CG_DESCENT (Version 7.0, July 1, 2019) 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.000167    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.000000
!!   SINQUAD   5000      15      42      29     0    3.3231800e-08   -6.7570138e+06    0.034035

CG_DESCENT (Version 7.0, July 1, 2019) 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.034035    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.000001
!!    SISSER      2       6      20      14     0    1.3844742e-08    3.6654462e-12    0.000043

CG_DESCENT (Version 7.0, July 1, 2019) 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.000043    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.000201

CG_DESCENT (Version 7.0, July 1, 2019) 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.000201    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   63.489686

CG_DESCENT (Version 7.0, July 1, 2019) 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                = 63.489686   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.089935

CG_DESCENT (Version 7.0, July 1, 2019) 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.089935    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.217017

CG_DESCENT (Version 7.0, July 1, 2019) 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.217017    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.000001
!!  SROSENBR   5000      11      23      12     0    4.8292836e-10    4.2359717e-19    0.004433

CG_DESCENT (Version 7.0, July 1, 2019) 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.004433    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   12.216613

CG_DESCENT (Version 7.0, July 1, 2019) 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                = 12.216613   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.000001
!!   STRATEC     10     248     615     373     0    3.2321960e-07    2.2122623e+03    4.504558

CG_DESCENT (Version 7.0, July 1, 2019) 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.504558    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.000001
!!  TESTQUAD   5000    1490       0    1491     0    8.4102097e-07   -1.8608709e-06    0.077737

CG_DESCENT (Version 7.0, July 1, 2019) 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.077737    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.000000
!!  TOINTGOR     50     135     234     175     0    9.9819687e-07    1.3739055e+03    0.002525

CG_DESCENT (Version 7.0, July 1, 2019) 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.002525    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.004044

CG_DESCENT (Version 7.0, July 1, 2019) 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.004044    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.000000
!!  TOINTPSP     50     148     288     200     0    9.8830470e-07    2.2556041e+02    0.001615

CG_DESCENT (Version 7.0, July 1, 2019) 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.001615    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.000162

CG_DESCENT (Version 7.0, July 1, 2019) 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.000162    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.012270

CG_DESCENT (Version 7.0, July 1, 2019) 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.012270    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.058068

CG_DESCENT (Version 7.0, July 1, 2019) 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.058068    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.000001
!!    VARDIM    200      10      21      11     0    2.5959262e-07    4.2117690e-19    0.000167

CG_DESCENT (Version 7.0, July 1, 2019) 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.000167    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.000000
!!  VAREIGVL     50      23      47      24     0    8.4765966e-07    3.7975332e-13    0.000402

CG_DESCENT (Version 7.0, July 1, 2019) 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.000402    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.000000
!!  VIBRBEAM      8     182     429     281     0    1.0721851e-07    1.7488668e+00    0.006772

CG_DESCENT (Version 7.0, July 1, 2019) 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.006772    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.000556

CG_DESCENT (Version 7.0, July 1, 2019) 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.000556    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.000001
!!     WOODS   4000      24      54      30     0    5.3658147e-07    3.3449015e-13    0.011153

CG_DESCENT (Version 7.0, July 1, 2019) 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.011153    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.000579

CG_DESCENT (Version 7.0, July 1, 2019) 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.000579    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.000001
!!  ZANGWIL2      2       1       0       2     0    2.2204460e-16   -1.8200000e+01    0.000013

CG_DESCENT (Version 7.0, July 1, 2019) 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.000013    seconds

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

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

