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

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

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



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

Code used                 : cg_descent
Problem                   : AKIVA
# variables               = 2         

# cg iterations           = 10        

# cg function evals       = 21        

# cg gradient evals       = 11        

|| g ||                   = 6.6670154e-09   
Final f                   = 6.1660422e+00   
Function value at final x = 6.1660422e+00   
Solve time                = 0.000173    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.000000
!!  ALLINITU      4      12      29      18     0    3.3843223e-08    5.7443849e+00    0.000066

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

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



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

Code used                 : cg_descent
Problem                   : ALLINITU
# variables               = 4         

# cg iterations           = 12        

# cg function evals       = 29        

# cg gradient evals       = 18        

|| g ||                   = 3.3843223e-08   
Final f                   = 5.7443849e+00   
Function value at final x = 5.7443849e+00   
Solve time                = 0.000066    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.000120

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

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



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

Code used                 : cg_descent
Problem                   : ARGLINA
# variables               = 200       

# cg iterations           = 1         

# cg function evals       = 0         

# cg gradient evals       = 2         

|| g ||                   = 4.2188475e-14   
Final f                   = 2.0000000e+02   
Function value at final x = 2.0000000e+02   
Solve time                = 0.000120    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      12      13     0    8.3382474e-09    9.9625468e+01    0.004387

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

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



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

Code used                 : cg_descent
Problem                   : ARGLINB
# variables               = 200       

# cg iterations           = 5         

# cg function evals       = 12        

# cg gradient evals       = 13        

|| g ||                   = 8.3382474e-09   
Final f                   = 9.9625468e+01   
Function value at final x = 9.9625468e+01   
Solve time                = 0.004387    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.006961

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

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



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

Code used                 : cg_descent
Problem                   : ARWHEAD
# variables               = 5000      

# cg iterations           = 7         

# cg function evals       = 15        

# cg gradient evals       = 8         

|| g ||                   = 9.9119508e-07   
Final f                   = 0.0000000e+00   
Function value at final x = 0.0000000e+00   
Solve time                = 0.006961    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.000000
!!      BARD      3      16      33      17     0    3.4949567e-09    8.2148773e-03    0.000078

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

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



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

Code used                 : cg_descent
Problem                   : BARD
# variables               = 3         

# cg iterations           = 16        

# cg function evals       = 33        

# cg gradient evals       = 17        

|| g ||                   = 3.4949567e-09   
Final f                   = 8.2148773e-03   
Function value at final x = 8.2148773e-03   
Solve time                = 0.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.000000
!!   BDQRTIC   5000     125     224     204     0    8.5811069e-07    2.0006257e+04    0.165546

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

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



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

Code used                 : cg_descent
Problem                   : BDQRTIC
# variables               = 5000      

# cg iterations           = 125       

# cg function evals       = 224       

# cg gradient evals       = 204       

|| g ||                   = 8.5811069e-07   
Final f                   = 2.0006257e+04   
Function value at final x = 2.0006257e+04   
Solve time                = 0.165546    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.000080

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

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



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

Code used                 : cg_descent
Problem                   : BEALE
# variables               = 2         

# cg iterations           = 15        

# cg function evals       = 31        

# cg gradient evals       = 16        

|| g ||                   = 4.4989214e-08   
Final f                   = 2.7264213e-15   
Function value at final x = 2.7264213e-15   
Solve time                = 0.000080    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.000220

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

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



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

Code used                 : cg_descent
Problem                   : BIGGS6
# variables               = 6         

# cg iterations           = 26        

# cg function evals       = 55        

# cg gradient evals       = 29        

|| g ||                   = 1.2469933e-07   
Final f                   = 5.6556498e-03   
Function value at final x = 5.6556498e-03   
Solve time                = 0.000220    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.000000
!!       BOX  10000       8      21      20     0    1.9746362e-07   -1.8645379e+03    0.026203

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

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



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

Code used                 : cg_descent
Problem                   : BOX
# variables               = 10000     

# cg iterations           = 8         

# cg function evals       = 21        

# cg gradient evals       = 20        

|| g ||                   = 1.9746362e-07   
Final f                   = -1.8645379e+03  
Function value at final x = -1.8645379e+03  
Solve time                = 0.026203    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.000092

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

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



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

Code used                 : cg_descent
Problem                   : BOX3
# variables               = 3         

# cg iterations           = 11        

# cg function evals       = 24        

# cg gradient evals       = 13        

|| g ||                   = 7.5844458e-07   
Final f                   = 3.8194901e-13   
Function value at final x = 3.8194901e-13   
Solve time                = 0.000092    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      23      52      31     0    1.1067197e-07    1.9932024e-08    0.033071

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

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



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

Code used                 : cg_descent
Problem                   : BOXPOWER
# variables               = 20000     

# cg iterations           = 23        

# cg function evals       = 52        

# cg gradient evals       = 31        

|| g ||                   = 1.1067197e-07   
Final f                   = 1.9932024e-08   
Function value at final x = 1.9932024e-08   
Solve time                = 0.033071    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.000032

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

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



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

Code used                 : cg_descent
Problem                   : BRKMCC
# variables               = 2         

# cg iterations           = 5         

# cg function evals       = 11        

# cg gradient evals       = 6         

|| g ||                   = 6.2205812e-08   
Final f                   = 1.6904268e-01   
Function value at final x = 1.6904268e-01   
Solve time                = 0.000032    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      10      26      18     0    7.9963147e-10    1.9410428e-19    0.003601

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

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



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

Code used                 : cg_descent
Problem                   : BROWNAL
# variables               = 200       

# cg iterations           = 10        

# cg function evals       = 26        

# cg gradient evals       = 18        

|| g ||                   = 7.9963147e-10   
Final f                   = 1.9410428e-19   
Function value at final x = 1.9410428e-19   
Solve time                = 0.003601    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.000050

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

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



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

Code used                 : cg_descent
Problem                   : BROWNBS
# variables               = 2         

# cg iterations           = 13        

# cg function evals       = 27        

# cg gradient evals       = 15        

|| g ||                   = 0.0000000e+00   
Final f                   = 0.0000000e+00   
Function value at final x = 0.0000000e+00   
Solve time                = 0.000050    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.000100

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

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



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

Code used                 : cg_descent
Problem                   : BROWNDEN
# variables               = 4         

# cg iterations           = 16        

# cg function evals       = 31        

# cg gradient evals       = 19        

|| g ||                   = 6.2987965e-08   
Final f                   = 8.5822201e+04   
Function value at final x = 8.5822201e+04   
Solve time                = 0.000100    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.186354

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

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



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

Code used                 : cg_descent
Problem                   : BROYDN7D
# variables               = 5000      

# cg iterations           = 1371      

# cg function evals       = 2730      

# cg gradient evals       = 1389      

|| g ||                   = 8.4634809e-07   
Final f                   = 1.9691757e+03   
Function value at final x = 1.9691757e+03   
Solve time                = 3.186354    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      85     174      90     0    4.9700970e-07    2.5588929e-14    0.095993

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

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



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

Code used                 : cg_descent
Problem                   : BRYBND
# variables               = 5000      

# cg iterations           = 85        

# cg function evals       = 174       

# cg gradient evals       = 90        

|| g ||                   = 4.9700970e-07   
Final f                   = 2.5588929e-14   
Function value at final x = 2.5588929e-14   
Solve time                = 0.095993    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     336     643     393     0    7.1851264e-07    4.5727672e+00    0.261611

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

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



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

Code used                 : cg_descent
Problem                   : CHAINWOO
# variables               = 4000      

# cg iterations           = 336       

# cg function evals       = 643       

# cg gradient evals       = 393       

|| g ||                   = 7.1851264e-07   
Final f                   = 4.5727672e+00   
Function value at final x = 4.5727672e+00   
Solve time                = 0.261611    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.003226

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

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



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

Code used                 : cg_descent
Problem                   : CHNROSNB
# variables               = 50        

# cg iterations           = 287       

# cg function evals       = 566       

# cg gradient evals       = 297       

|| g ||                   = 7.4547674e-07   
Final f                   = 9.0756918e-14   
Function value at final x = 9.0756918e-14   
Solve time                = 0.003226    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.003366

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

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



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

Code used                 : cg_descent
Problem                   : CHNRSNBM
# variables               = 50        

# cg iterations           = 263       

# cg function evals       = 527       

# cg gradient evals       = 264       

|| g ||                   = 7.0616784e-07   
Final f                   = 6.8357034e-14   
Function value at final x = 6.8357034e-14   
Solve time                = 0.003366    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      17      46      42     0    2.5769421e-08    1.9978661e-01    0.000075

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

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



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

Code used                 : cg_descent
Problem                   : CLIFF
# variables               = 2         

# cg iterations           = 17        

# cg function evals       = 46        

# cg gradient evals       = 42        

|| g ||                   = 2.5769421e-08   
Final f                   = 1.9978661e-01   
Function value at final x = 1.9978661e-01   
Solve time                = 0.000075    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       9      22      19     0    2.9361693e-07   -9.9990000e+03    0.034611

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

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



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

Code used                 : cg_descent
Problem                   : COSINE
# variables               = 10000     

# cg iterations           = 9         

# cg function evals       = 22        

# cg gradient evals       = 19        

|| g ||                   = 2.9361693e-07   
Final f                   = -9.9990000e+03  
Function value at final x = -9.9990000e+03  
Solve time                = 0.034611    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.000000
!!  CRAGGLVY   5000     103     197     147     0    9.3235344e-07    1.6882153e+03    0.176557

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

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



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

Code used                 : cg_descent
Problem                   : CRAGGLVY
# variables               = 5000      

# cg iterations           = 103       

# cg function evals       = 197       

# cg gradient evals       = 147       

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

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

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

sifdecoder -A pc64.lnx.gfo -st   CUBE

 Problem name: CUBE

 Double precision version will be formed

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

 Problem: CUBE (n = 2)
walltime at start:     0.000001
!!      CUBE      2      31      75      46     0    9.7031464e-08    2.6217214e-18    0.000074

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

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



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

Code used                 : cg_descent
Problem                   : CUBE
# variables               = 2         

# cg iterations           = 31        

# cg function evals       = 75        

# cg gradient evals       = 46        

|| g ||                   = 9.7031464e-08   
Final f                   = 2.6217214e-18   
Function value at final x = 2.6217214e-18   
Solve time                = 0.000074    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.000001
!!   CURLY10  10000   47873   67378   76264     0    9.9422264e-07   -1.0031629e+06   47.647812

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

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



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

Code used                 : cg_descent
Problem                   : CURLY10
# variables               = 10000     

# cg iterations           = 47873     

# cg function evals       = 67378     

# cg gradient evals       = 76264     

|| g ||                   = 9.9422264e-07   
Final f                   = -1.0031629e+06  
Function value at final x = -1.0031629e+06  
Solve time                = 47.647812   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   66922   89820  110969     0    9.7657335e-07   -1.0031629e+06  104.929589

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

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



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

Code used                 : cg_descent
Problem                   : CURLY20
# variables               = 10000     

# cg iterations           = 66922     

# cg function evals       = 89820     

# cg gradient evals       = 110969    

|| g ||                   = 9.7657335e-07   
Final f                   = -1.0031629e+06  
Function value at final x = -1.0031629e+06  
Solve time                = 104.929589  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.000001
!!   CURLY30  10000   75409   99060  127236     0    9.9088622e-07   -1.0031629e+06  161.593766

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

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



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

Code used                 : cg_descent
Problem                   : CURLY30
# variables               = 10000     

# cg iterations           = 75409     

# cg function evals       = 99060     

# cg gradient evals       = 127236    

|| g ||                   = 9.9088622e-07   
Final f                   = -1.0031629e+06  
Function value at final x = -1.0031629e+06  
Solve time                = 161.593766  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.009008

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

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



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

Code used                 : cg_descent
Problem                   : DECONVU
# variables               = 63        

# cg iterations           = 400       

# cg function evals       = 801       

# cg gradient evals       = 401       

|| g ||                   = 8.5007783e-07   
Final f                   = 4.4591100e-08   
Function value at final x = 4.4591100e-08   
Solve time                = 0.009008    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, May 1, 2018) run status: 0

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



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

Code used                 : cg_descent
Problem                   : DENSCHNA
# variables               = 2         

# cg iterations           = 9         

# cg function evals       = 19        

# cg gradient evals       = 10        

|| g ||                   = 3.5273288e-08   
Final f                   = 3.1668570e-16   
Function value at final x = 3.1668570e-16   
Solve time                = 0.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.000040

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

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



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

Code used                 : cg_descent
Problem                   : DENSCHNB
# variables               = 2         

# cg iterations           = 7         

# cg function evals       = 15        

# cg gradient evals       = 8         

|| g ||                   = 1.0342574e-08   
Final f                   = 3.6407413e-17   
Function value at final x = 3.6407413e-17   
Solve time                = 0.000040    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.000048

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

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



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

Code used                 : cg_descent
Problem                   : DENSCHNC
# variables               = 2         

# cg iterations           = 12        

# cg function evals       = 26        

# cg gradient evals       = 14        

|| g ||                   = 3.2760930e-09   
Final f                   = 3.2531884e-19   
Function value at final x = 3.2531884e-19   
Solve time                = 0.000048    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.000000
!!  DENSCHND      3      43      89      46     0    1.9002489e-07    6.1976908e-10    0.000089

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

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



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

Code used                 : cg_descent
Problem                   : DENSCHND
# variables               = 3         

# cg iterations           = 43        

# cg function evals       = 89        

# cg gradient evals       = 46        

|| g ||                   = 1.9002489e-07   
Final f                   = 6.1976908e-10   
Function value at final x = 6.1976908e-10   
Solve time                = 0.000089    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.000000
!!  DENSCHNE      3      17      47      30     0    5.6950746e-08    1.0066394e-15    0.000077

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

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



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

Code used                 : cg_descent
Problem                   : DENSCHNE
# variables               = 3         

# cg iterations           = 17        

# cg function evals       = 47        

# cg gradient evals       = 30        

|| g ||                   = 5.6950746e-08   
Final f                   = 1.0066394e-15   
Function value at final x = 1.0066394e-15   
Solve time                = 0.000077    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.000040

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

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



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

Code used                 : cg_descent
Problem                   : DENSCHNF
# variables               = 2         

# cg iterations           = 8         

# cg function evals       = 17        

# cg gradient evals       = 9         

|| g ||                   = 6.4551431e-07   
Final f                   = 2.1261987e-15   
Function value at final x = 2.1261987e-15   
Solve time                = 0.000040    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.002132

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

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



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

Code used                 : cg_descent
Problem                   : DIXMAANA
# variables               = 3000      

# cg iterations           = 7         

# cg function evals       = 15        

# cg gradient evals       = 8         

|| g ||                   = 4.8306833e-12   
Final f                   = 1.0000000e+00   
Function value at final x = 1.0000000e+00   
Solve time                = 0.002132    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.001868

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

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



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

Code used                 : cg_descent
Problem                   : DIXMAANB
# variables               = 3000      

# cg iterations           = 6         

# cg function evals       = 13        

# cg gradient evals       = 7         

|| g ||                   = 8.9774746e-08   
Final f                   = 1.0000000e+00   
Function value at final x = 1.0000000e+00   
Solve time                = 0.001868    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.001876

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

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



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

Code used                 : cg_descent
Problem                   : DIXMAANC
# variables               = 3000      

# cg iterations           = 6         

# cg function evals       = 13        

# cg gradient evals       = 7         

|| g ||                   = 7.0332716e-07   
Final f                   = 1.0000000e+00   
Function value at final x = 1.0000000e+00   
Solve time                = 0.001876    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.002147

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

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



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

Code used                 : cg_descent
Problem                   : DIXMAAND
# variables               = 3000      

# cg iterations           = 7         

# cg function evals       = 15        

# cg gradient evals       = 8         

|| g ||                   = 7.3560463e-07   
Final f                   = 1.0000000e+00   
Function value at final x = 1.0000000e+00   
Solve time                = 0.002147    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.090134

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

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



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

Code used                 : cg_descent
Problem                   : DIXMAANE
# variables               = 3000      

# cg iterations           = 222       

# cg function evals       = 239       

# cg gradient evals       = 429       

|| g ||                   = 9.8403702e-07   
Final f                   = 1.0000000e+00   
Function value at final x = 1.0000000e+00   
Solve time                = 0.090134    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.042325

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

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



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

Code used                 : cg_descent
Problem                   : DIXMAANF
# variables               = 3000      

# cg iterations           = 161       

# cg function evals       = 323       

# cg gradient evals       = 162       

|| g ||                   = 8.8563506e-07   
Final f                   = 1.0000000e+00   
Function value at final x = 1.0000000e+00   
Solve time                = 0.042325    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.000001
!!  DIXMAANG   3000     157     315     158     0    9.4422251e-07    1.0000000e+00    0.041161

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

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



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

Code used                 : cg_descent
Problem                   : DIXMAANG
# variables               = 3000      

# cg iterations           = 157       

# cg function evals       = 315       

# cg gradient evals       = 158       

|| g ||                   = 9.4422251e-07   
Final f                   = 1.0000000e+00   
Function value at final x = 1.0000000e+00   
Solve time                = 0.041161    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.000000
!!  DIXMAANH   3000     173     347     174     0    9.9204488e-07    1.0000000e+00    0.045716

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

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



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

Code used                 : cg_descent
Problem                   : DIXMAANH
# variables               = 3000      

# cg iterations           = 173       

# cg function evals       = 347       

# cg gradient evals       = 174       

|| g ||                   = 9.9204488e-07   
Final f                   = 1.0000000e+00   
Function value at final x = 1.0000000e+00   
Solve time                = 0.045716    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.000001
!!  DIXMAANI   3000    3754    3824    7440     0    9.7067715e-07    1.0000001e+00    1.333040

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

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



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

Code used                 : cg_descent
Problem                   : DIXMAANI
# variables               = 3000      

# cg iterations           = 3754      

# cg function evals       = 3824      

# cg gradient evals       = 7440      

|| g ||                   = 9.7067715e-07   
Final f                   = 1.0000001e+00   
Function value at final x = 1.0000001e+00   
Solve time                = 1.333040    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.084981

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

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



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

Code used                 : cg_descent
Problem                   : DIXMAANJ
# variables               = 3000      

# cg iterations           = 327       

# cg function evals       = 655       

# cg gradient evals       = 328       

|| g ||                   = 9.8677323e-07   
Final f                   = 1.0000002e+00   
Function value at final x = 1.0000002e+00   
Solve time                = 0.084981    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.073729

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

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



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

Code used                 : cg_descent
Problem                   : DIXMAANK
# variables               = 3000      

# cg iterations           = 283       

# cg function evals       = 567       

# cg gradient evals       = 284       

|| g ||                   = 9.4621288e-07   
Final f                   = 1.0000002e+00   
Function value at final x = 1.0000002e+00   
Solve time                = 0.073729    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.062363

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

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



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

Code used                 : cg_descent
Problem                   : DIXMAANL
# variables               = 3000      

# cg iterations           = 237       

# cg function evals       = 475       

# cg gradient evals       = 238       

|| g ||                   = 9.6696144e-07   
Final f                   = 1.0000002e+00   
Function value at final x = 1.0000002e+00   
Solve time                = 0.062363    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.562035

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

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



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

Code used                 : cg_descent
Problem                   : DIXMAANM
# variables               = 3000      

# cg iterations           = 4478      

# cg function evals       = 4533      

# cg gradient evals       = 8903      

|| g ||                   = 9.9536141e-07   
Final f                   = 1.0000001e+00   
Function value at final x = 1.0000001e+00   
Solve time                = 1.562035    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.181004

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

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



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

Code used                 : cg_descent
Problem                   : DIXMAANN
# variables               = 3000      

# cg iterations           = 698       

# cg function evals       = 1397      

# cg gradient evals       = 699       

|| g ||                   = 9.9855824e-07   
Final f                   = 1.0000003e+00   
Function value at final x = 1.0000003e+00   
Solve time                = 0.181004    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     638    1279     642     0    9.9359445e-07    1.0000003e+00    0.165066

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

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



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

Code used                 : cg_descent
Problem                   : DIXMAANO
# variables               = 3000      

# cg iterations           = 638       

# cg function evals       = 1279      

# cg gradient evals       = 642       

|| g ||                   = 9.9359445e-07   
Final f                   = 1.0000003e+00   
Function value at final x = 1.0000003e+00   
Solve time                = 0.165066    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.176803

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

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



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

Code used                 : cg_descent
Problem                   : DIXMAANP
# variables               = 3000      

# cg iterations           = 686       

# cg function evals       = 1373      

# cg gradient evals       = 687       

|| g ||                   = 9.9695480e-07   
Final f                   = 1.0000003e+00   
Function value at final x = 1.0000003e+00   
Solve time                = 0.176803    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.920576

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

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



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

Code used                 : cg_descent
Problem                   : DIXON3DQ
# variables               = 10000     

# cg iterations           = 10000     

# cg function evals       = 0         

# cg gradient evals       = 10001     

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

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

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

sifdecoder -A pc64.lnx.gfo -st   DJTL

 Problem name: DJTL

 Double precision version will be formed

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

 Problem: DJTL (n = 2)
walltime at start:     0.000001
!!      DJTL      2     112    1045    1163     0    6.5893699e-08   -8.9515447e+03    0.002233

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

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



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

Code used                 : cg_descent
Problem                   : DJTL
# variables               = 2         

# cg iterations           = 112       

# cg function evals       = 1045      

# cg gradient evals       = 1163      

|| g ||                   = 6.5893699e-08   
Final f                   = -8.9515447e+03  
Function value at final x = -8.9515447e+03  
Solve time                = 0.002233    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.000001
!!   DQDRTIC   5000       5       0       6     0    2.2053470e-11   -5.0515592e-10    0.000478

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

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



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

Code used                 : cg_descent
Problem                   : DQDRTIC
# variables               = 5000      

# cg iterations           = 5         

# cg function evals       = 0         

# cg gradient evals       = 6         

|| g ||                   = 2.2053470e-11   
Final f                   = -5.0515592e-10  
Function value at final x = 2.5896904e-24   
Solve time                = 0.000478    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      17      37      21     0    7.0514220e-07    2.7590839e-06    0.004929

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

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



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

Code used                 : cg_descent
Problem                   : DQRTIC
# variables               = 5000      

# cg iterations           = 17        

# cg function evals       = 37        

# cg gradient evals       = 21        

|| g ||                   = 7.0514220e-07   
Final f                   = 2.7590839e-06   
Function value at final x = 2.7590839e-06   
Solve time                = 0.004929    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      26      52      38     0    6.9637571e-07    1.2003285e+04    0.012567

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

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



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

Code used                 : cg_descent
Problem                   : EDENSCH
# variables               = 2000      

# cg iterations           = 26        

# cg function evals       = 52        

# cg gradient evals       = 38        

|| g ||                   = 6.9637571e-07   
Final f                   = 1.2003285e+04   
Function value at final x = 1.2003285e+04   
Solve time                = 0.012567    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.001506

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

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



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

Code used                 : cg_descent
Problem                   : EG2
# variables               = 1000      

# cg iterations           = 5         

# cg function evals       = 11        

# cg gradient evals       = 6         

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

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

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

sifdecoder -A pc64.lnx.gfo -st   EIGENALS

 Problem name: EIGENALS

 Double precision version will be formed

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

 Problem: EIGENALS (n = 2550)
walltime at start:     0.000001
!!  EIGENALS   2550    9363   16977   11124     0    6.2130528e-07    8.3698051e-11   51.339315

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

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



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

Code used                 : cg_descent
Problem                   : EIGENALS
# variables               = 2550      

# cg iterations           = 9363      

# cg function evals       = 16977     

# cg gradient evals       = 11124     

|| g ||                   = 6.2130528e-07   
Final f                   = 8.3698051e-11   
Function value at final x = 8.3698051e-11   
Solve time                = 51.339315   seconds

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

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

sifdecoder -A pc64.lnx.gfo -st   EIGENBLS

 Problem name: EIGENBLS

 Double precision version will be formed

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

 Problem: EIGENBLS (n = 2550)
walltime at start:     0.000001
!!  EIGENBLS   2550   26938   53877   26939     0    9.0552654e-07    6.3927358e-09  129.716573

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

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



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

Code used                 : cg_descent
Problem                   : EIGENBLS
# variables               = 2550      

# cg iterations           = 26938     

# cg function evals       = 53877     

# cg gradient evals       = 26939     

|| g ||                   = 9.0552654e-07   
Final f                   = 6.3927358e-09   
Function value at final x = 6.3927358e-09   
Solve time                = 129.716573  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   57.368315

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

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



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

Code used                 : cg_descent
Problem                   : EIGENCLS
# variables               = 2652      

# cg iterations           = 10377     

# cg function evals       = 19792     

# cg gradient evals       = 11341     

|| g ||                   = 7.0462417e-07   
Final f                   = 1.3820286e-11   
Function value at final x = 1.3820286e-11   
Solve time                = 57.368315   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.000000
!!   ENGVAL1   5000      27      50      36     0    9.2445863e-07    5.5486684e+03    0.024627

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

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



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

Code used                 : cg_descent
Problem                   : ENGVAL1
# variables               = 5000      

# cg iterations           = 27        

# cg function evals       = 50        

# cg gradient evals       = 36        

|| g ||                   = 9.2445863e-07   
Final f                   = 5.5486684e+03   
Function value at final x = 5.5486684e+03   
Solve time                = 0.024627    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.000001
!!   ENGVAL2      3      27      58      33     0    2.6896502e-07    3.6611398e-16    0.000077

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

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



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

Code used                 : cg_descent
Problem                   : ENGVAL2
# variables               = 3         

# cg iterations           = 27        

# cg function evals       = 58        

# cg gradient evals       = 33        

|| g ||                   = 2.6896502e-07   
Final f                   = 3.6611398e-16   
Function value at final x = 3.6611398e-16   
Solve time                = 0.000077    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.000000
!!  ERRINROS     50   13362   25884   14899     0    8.2322857e-07    3.9904154e+01    0.163211

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

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



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

Code used                 : cg_descent
Problem                   : ERRINROS
# variables               = 50        

# cg iterations           = 13362     

# cg function evals       = 25884     

# cg gradient evals       = 14899     

|| g ||                   = 8.2322857e-07   
Final f                   = 3.9904154e+01   
Function value at final x = 3.9904154e+01   
Solve time                = 0.163211    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.000000
!!  ERRINRSM     50     309     629     363     0    8.3833344e-07    3.7729903e+01    0.004007

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

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



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

Code used                 : cg_descent
Problem                   : ERRINRSM
# variables               = 50        

# cg iterations           = 309       

# cg function evals       = 629       

# cg gradient evals       = 363       

|| g ||                   = 8.3833344e-07   
Final f                   = 3.7729903e+01   
Function value at final x = 3.7729903e+01   
Solve time                = 0.004007    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.000073

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

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



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

Code used                 : cg_descent
Problem                   : EXPFIT
# variables               = 2         

# cg iterations           = 13        

# cg function evals       = 29        

# cg gradient evals       = 16        

|| g ||                   = 4.2083119e-07   
Final f                   = 2.4051059e-01   
Function value at final x = 2.4051059e-01   
Solve time                = 0.000073    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    3816    7764    3978     0    9.4995359e-07    3.3912515e-07    0.440922

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

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



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

Code used                 : cg_descent
Problem                   : EXTROSNB
# variables               = 1000      

# cg iterations           = 3816      

# cg function evals       = 7764      

# cg gradient evals       = 3978      

|| g ||                   = 9.4995359e-07   
Final f                   = 3.3912515e-07   
Function value at final x = 3.3912515e-07   
Solve time                = 0.440922    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.000001
!!  FLETBV3M   5000      29      63      37     0    6.7729467e-07   -2.4858979e+05    0.064347

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

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



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

Code used                 : cg_descent
Problem                   : FLETBV3M
# variables               = 5000      

# cg iterations           = 29        

# cg function evals       = 63        

# cg gradient evals       = 37        

|| g ||                   = 6.7729467e-07   
Final f                   = -2.4858979e+05  
Function value at final x = -2.4858979e+05  
Solve time                = 0.064347    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.000944

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

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



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

Code used                 : cg_descent
Problem                   : FLETCBV2
# variables               = 5000      

# cg iterations           = 0         

# cg function evals       = 1         

# cg gradient evals       = 1         

|| g ||                   = 7.9960014e-08   
Final f                   = -5.0026817e-01  
Function value at final x = -5.0026817e-01  
Solve time                = 0.000944    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     152     290     176     0    5.8328737e-07    7.1290785e-15    0.024005

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

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



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

Code used                 : cg_descent
Problem                   : FLETCHCR
# variables               = 1000      

# cg iterations           = 152       

# cg function evals       = 290       

# cg gradient evals       = 176       

|| g ||                   = 5.8328737e-07   
Final f                   = 7.1290785e-15   
Function value at final x = 7.1290785e-15   
Solve time                = 0.024005    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.000000
!!  FMINSRF2   5625     346     693     347     0    9.4411255e-07    1.0000241e+00    0.382990

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

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



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

Code used                 : cg_descent
Problem                   : FMINSRF2
# variables               = 5625      

# cg iterations           = 346       

# cg function evals       = 693       

# cg gradient evals       = 347       

|| g ||                   = 9.4411255e-07   
Final f                   = 1.0000241e+00   
Function value at final x = 1.0000241e+00   
Solve time                = 0.382990    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.476822

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

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



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

Code used                 : cg_descent
Problem                   : FMINSURF
# variables               = 5625      

# cg iterations           = 473       

# cg function evals       = 947       

# cg gradient evals       = 474       

|| g ||                   = 9.7701254e-07   
Final f                   = 1.0000000e+00   
Function value at final x = 1.0000000e+00   
Solve time                = 0.476822    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      28      57      50     0    6.0680874e-07    6.0815919e+05    0.047162

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

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



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

Code used                 : cg_descent
Problem                   : FREUROTH
# variables               = 5000      

# cg iterations           = 28        

# cg function evals       = 57        

# cg gradient evals       = 50        

|| g ||                   = 6.0680874e-07   
Final f                   = 6.0815919e+05   
Function value at final x = 6.0815919e+05   
Solve time                = 0.047162    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    6497   13019    6526     0    8.4025309e-07    4.5132571e-12    9.224595

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

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



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

Code used                 : cg_descent
Problem                   : GENHUMPS
# variables               = 5000      

# cg iterations           = 6497      

# cg function evals       = 13019     

# cg gradient evals       = 6526      

|| g ||                   = 8.4025309e-07   
Final f                   = 4.5132571e-12   
Function value at final x = 4.5132571e-12   
Solve time                = 9.224595    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    1075    2155    1088     0    6.3184233e-07    1.0000000e+00    0.076440

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

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



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

Code used                 : cg_descent
Problem                   : GENROSE
# variables               = 500       

# cg iterations           = 1075      

# cg function evals       = 2155      

# cg gradient evals       = 1088      

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

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

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

sifdecoder -A pc64.lnx.gfo -st   GROWTHLS

 Problem name: GROWTHLS

 Double precision version will be formed

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

 Problem: GROWTHLS (n = 3)
walltime at start:     0.000000
!!  GROWTHLS      3     149     394     287     0    3.8807002e-10    1.0040406e+00    0.001566

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

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



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

Code used                 : cg_descent
Problem                   : GROWTHLS
# variables               = 3         

# cg iterations           = 149       

# cg function evals       = 394       

# cg gradient evals       = 287       

|| g ||                   = 3.8807002e-10   
Final f                   = 1.0040406e+00   
Function value at final x = 1.0040406e+00   
Solve time                = 0.001566    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.000001
!!      GULF      3      37      92      55     0    3.8480274e-08    7.6878307e-15    0.004472

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

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



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

Code used                 : cg_descent
Problem                   : GULF
# variables               = 3         

# cg iterations           = 37        

# cg function evals       = 92        

# cg gradient evals       = 55        

|| g ||                   = 3.8480274e-08   
Final f                   = 7.6878307e-15   
Function value at final x = 7.6878307e-15   
Solve time                = 0.004472    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      34     111      83     0    1.1544388e-08    2.0000000e+01    0.000160

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

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



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

Code used                 : cg_descent
Problem                   : HAIRY
# variables               = 2         

# cg iterations           = 34        

# cg function evals       = 111       

# cg gradient evals       = 83        

|| g ||                   = 1.1544388e-08   
Final f                   = 2.0000000e+01   
Function value at final x = 2.0000000e+01   
Solve time                = 0.000160    seconds

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

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

sifdecoder -A pc64.lnx.gfo -st   HATFLDD

 Problem name: HATFLDD

 Double precision version will be formed

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

 Problem: HATFLDD (n = 3)
walltime at start:     0.000001
!!   HATFLDD      3      20      43      24     0    1.9359497e-07    2.5471486e-07    0.000135

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

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



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

Code used                 : cg_descent
Problem                   : HATFLDD
# variables               = 3         

# cg iterations           = 20        

# cg function evals       = 43        

# cg gradient evals       = 24        

|| g ||                   = 1.9359497e-07   
Final f                   = 2.5471486e-07   
Function value at final x = 2.5471486e-07   
Solve time                = 0.000135    seconds

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

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

sifdecoder -A pc64.lnx.gfo -st   HATFLDE

 Problem name: HATFLDE

 Double precision version will be formed

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

 Problem: HATFLDE (n = 3)
walltime at start:     0.000000
!!   HATFLDE      3      30      72      45     0    1.0667080e-07    5.1203781e-07    0.000332

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

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



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

Code used                 : cg_descent
Problem                   : HATFLDE
# variables               = 3         

# cg iterations           = 30        

# cg function evals       = 72        

# cg gradient evals       = 45        

|| g ||                   = 1.0667080e-07   
Final f                   = 5.1203781e-07   
Function value at final x = 5.1203781e-07   
Solve time                = 0.000332    seconds

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

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

sifdecoder -A pc64.lnx.gfo -st   HATFLDFL

 Problem name: HATFLDFL

 Double precision version will be formed

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

 Problem: HATFLDFL (n = 3)
walltime at start:     0.000001
!!  HATFLDFL      3      39      96      59     0    7.0419998e-07    6.3200994e-05    0.000105

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

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



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

Code used                 : cg_descent
Problem                   : HATFLDFL
# variables               = 3         

# cg iterations           = 39        

# cg function evals       = 96        

# cg gradient evals       = 59        

|| g ||                   = 7.0419998e-07   
Final f                   = 6.3200994e-05   
Function value at final x = 6.3200994e-05   
Solve time                = 0.000105    seconds

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

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

sifdecoder -A pc64.lnx.gfo -st   HEART6LS

 Problem name: HEART6LS

 Double precision version will be formed

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

 Problem: HEART6LS (n = 6)
walltime at start:     0.000001
!!  HEART6LS      6     685    1541     944     0    5.2287359e-07    5.0303507e-10    0.002466

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

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



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

Code used                 : cg_descent
Problem                   : HEART6LS
# variables               = 6         

# cg iterations           = 685       

# cg function evals       = 1541      

# cg gradient evals       = 944       

|| g ||                   = 5.2287359e-07   
Final f                   = 5.0303507e-10   
Function value at final x = 5.0303507e-10   
Solve time                = 0.002466    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     282     591     311     0    2.8302099e-07    1.6549182e-16    0.000906

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

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



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

Code used                 : cg_descent
Problem                   : HEART8LS
# variables               = 8         

# cg iterations           = 282       

# cg function evals       = 591       

# cg gradient evals       = 311       

|| g ||                   = 2.8302099e-07   
Final f                   = 1.6549182e-16   
Function value at final x = 1.6549182e-16   
Solve time                = 0.000906    seconds

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

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

sifdecoder -A pc64.lnx.gfo -st   HELIX

 Problem name: HELIX

 Double precision version will be formed

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

 Problem: HELIX (n = 3)
walltime at start:     0.000000
!!     HELIX      3      23      49      27     0    3.1346301e-07    1.6037621e-15    0.000081

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

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



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

Code used                 : cg_descent
Problem                   : HELIX
# variables               = 3         

# cg iterations           = 23        

# cg function evals       = 49        

# cg gradient evals       = 27        

|| g ||                   = 3.1346301e-07   
Final f                   = 1.6037621e-15   
Function value at final x = 1.6037621e-15   
Solve time                = 0.000081    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.021581

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

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



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

Code used                 : cg_descent
Problem                   : HIELOW
# variables               = 3         

# cg iterations           = 14        

# cg function evals       = 30        

# cg gradient evals       = 16        

|| g ||                   = 4.4008730e-07   
Final f                   = 8.7416543e+02   
Function value at final x = 8.7416543e+02   
Solve time                = 0.021581    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.000017

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

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



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

Code used                 : cg_descent
Problem                   : HILBERTA
# variables               = 2         

# cg iterations           = 2         

# cg function evals       = 0         

# cg gradient evals       = 3         

|| g ||                   = 2.2065683e-14   
Final f                   = 1.3183898e-16   
Function value at final x = 2.6045558e-28   
Solve time                = 0.000017    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.000019

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

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



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

Code used                 : cg_descent
Problem                   : HILBERTB
# variables               = 10        

# cg iterations           = 4         

# cg function evals       = 0         

# cg gradient evals       = 5         

|| g ||                   = 2.2720367e-09   
Final f                   = 1.9755976e-14   
Function value at final x = 9.9477316e-19   
Solve time                = 0.000019    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      10      28      21     0    2.3749514e-07    9.2954871e-13    0.000053

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

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



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

Code used                 : cg_descent
Problem                   : HIMMELBB
# variables               = 2         

# cg iterations           = 10        

# cg function evals       = 28        

# cg gradient evals       = 21        

|| g ||                   = 2.3749514e-07   
Final f                   = 9.2954871e-13   
Function value at final x = 9.2954871e-13   
Solve time                = 0.000053    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      56      36     0    3.7446603e-07    3.1857175e+02    0.000099

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

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



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

Code used                 : cg_descent
Problem                   : HIMMELBF
# variables               = 4         

# cg iterations           = 26        

# cg function evals       = 56        

# cg gradient evals       = 36        

|| g ||                   = 3.7446603e-07   
Final f                   = 3.1857175e+02   
Function value at final x = 3.1857175e+02   
Solve time                = 0.000099    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.000000
!!  HIMMELBG      2       8      18      12     0    5.5074167e-07    3.1614338e-14    0.000048

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

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



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

Code used                 : cg_descent
Problem                   : HIMMELBG
# variables               = 2         

# cg iterations           = 8         

# cg function evals       = 18        

# cg gradient evals       = 12        

|| g ||                   = 5.5074167e-07   
Final f                   = 3.1614338e-14   
Function value at final x = 3.1614338e-14   
Solve time                = 0.000048    seconds

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

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

sifdecoder -A pc64.lnx.gfo -st   HIMMELBH

 Problem name: HIMMELBH

 Double precision version will be formed

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

 Problem: HIMMELBH (n = 2)
walltime at start:     0.000001
!!  HIMMELBH      2       7      16       9     0    2.9620306e-11   -1.0000000e+00    0.000060

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

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



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

Code used                 : cg_descent
Problem                   : HIMMELBH
# variables               = 2         

# cg iterations           = 7         

# cg function evals       = 16        

# cg gradient evals       = 9         

|| g ||                   = 2.9620306e-11   
Final f                   = -1.0000000e+00  
Function value at final x = -1.0000000e+00  
Solve time                = 0.000060    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      41     133      99     0    4.2904202e-08    9.2616851e-15    0.000138

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

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



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

Code used                 : cg_descent
Problem                   : HUMPS
# variables               = 2         

# cg iterations           = 41        

# cg function evals       = 133       

# cg gradient evals       = 99        

|| g ||                   = 4.2904202e-08   
Final f                   = 9.2616851e-15   
Function value at final x = 9.2616851e-15   
Solve time                = 0.000138    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.000001
!!    INDEFM 100000     159     375     309     0    8.3037477e-07   -9.7639633e+06    6.563283

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

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



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

Code used                 : cg_descent
Problem                   : INDEFM
# variables               = 100000    

# cg iterations           = 159       

# cg function evals       = 375       

# cg gradient evals       = 309       

|| g ||                   = 8.3037477e-07   
Final f                   = -9.7639633e+06  
Function value at final x = -9.7639633e+06  
Solve time                = 6.563283    seconds

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

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

sifdecoder -A pc64.lnx.gfo -st   JENSMP

 Problem name: JENSMP

 Double precision version will be formed

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

 Problem: JENSMP (n = 2)
walltime at start:     0.000001
!!    JENSMP      2      15      29      22     0    5.3069016e-10    1.2436218e+02    0.000123

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

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



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

Code used                 : cg_descent
Problem                   : JENSMP
# variables               = 2         

# cg iterations           = 15        

# cg function evals       = 29        

# cg gradient evals       = 22        

|| g ||                   = 5.3069016e-10   
Final f                   = 1.2436218e+02   
Function value at final x = 1.2436218e+02   
Solve time                = 0.000123    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  387.097563

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

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



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

Code used                 : cg_descent
Problem                   : JIMACK
# variables               = 3549      

# cg iterations           = 8317      

# cg function evals       = 16635     

# cg gradient evals       = 8318      

|| g ||                   = 9.3995640e-07   
Final f                   = 8.6679330e-01   
Function value at final x = 8.6679330e-01   
Solve time                = 387.097563  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      39      23     0    3.7035629e-07    3.0780095e-04    0.000079

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

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



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

Code used                 : cg_descent
Problem                   : KOWOSB
# variables               = 4         

# cg iterations           = 17        

# cg function evals       = 39        

# cg gradient evals       = 23        

|| g ||                   = 3.7035629e-07   
Final f                   = 3.0780095e-04   
Function value at final x = 3.0780095e-04   
Solve time                = 0.000079    seconds

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

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

sifdecoder -A pc64.lnx.gfo -st   LIARWHD

 Problem name: LIARWHD

 Double precision version will be formed

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

 Problem: LIARWHD (n = 5000)
walltime at start:     0.000001
!!   LIARWHD   5000      19      46      29     0    8.4390051e-11    9.0006379e-26    0.018329

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

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



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

Code used                 : cg_descent
Problem                   : LIARWHD
# variables               = 5000      

# cg iterations           = 19        

# cg function evals       = 46        

# cg gradient evals       = 29        

|| g ||                   = 8.4390051e-11   
Final f                   = 9.0006379e-26   
Function value at final x = 9.0006379e-26   
Solve time                = 0.018329    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.000000
!!  LOGHAIRY      2      22      67      46     0    4.1593002e-07    1.8232156e-01    0.000131

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

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



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

Code used                 : cg_descent
Problem                   : LOGHAIRY
# variables               = 2         

# cg iterations           = 22        

# cg function evals       = 67        

# cg gradient evals       = 46        

|| g ||                   = 4.1593002e-07   
Final f                   = 1.8232156e-01   
Function value at final x = 1.8232156e-01   
Solve time                = 0.000131    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.047183

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

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



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

Code used                 : cg_descent
Problem                   : MANCINO
# variables               = 100       

# cg iterations           = 11        

# cg function evals       = 23        

# cg gradient evals       = 12        

|| g ||                   = 7.2392005e-08   
Final f                   = 9.2313203e-21   
Function value at final x = 9.2313203e-21   
Solve time                = 0.047183    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    1135    3291    2779     0    3.4592964e-09   -1.0000001e+00    0.002699

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

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



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

Code used                 : cg_descent
Problem                   : MARATOSB
# variables               = 2         

# cg iterations           = 1135      

# cg function evals       = 3291      

# cg gradient evals       = 2779      

|| g ||                   = 3.4592964e-09   
Final f                   = -1.0000001e+00  
Function value at final x = -1.0000001e+00  
Solve time                = 0.002699    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      20      50      39     0    7.0787821e-09   -4.0010000e-02    0.000068

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

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



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

Code used                 : cg_descent
Problem                   : MEXHAT
# variables               = 2         

# cg iterations           = 20        

# cg function evals       = 50        

# cg gradient evals       = 39        

|| g ||                   = 7.0787821e-09   
Final f                   = -4.0010000e-02  
Function value at final x = -4.0010000e-02  
Solve time                = 0.000068    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.157268

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

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



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

Code used                 : cg_descent
Problem                   : MOREBV
# variables               = 5000      

# cg iterations           = 161       

# cg function evals       = 168       

# cg gradient evals       = 317       

|| g ||                   = 9.9408232e-07   
Final f                   = 1.0864330e-10   
Function value at final x = 1.0864330e-10   
Solve time                = 0.157268    seconds

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

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

sifdecoder -A pc64.lnx.gfo -st   MSQRTALS

 Problem name: MSQRTALS

 Double precision version will be formed

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

 Problem: MSQRTALS (n = 1024)
walltime at start:     0.000000
!!  MSQRTALS   1024    2789    5581    2794     0    9.9666795e-07    6.7719173e-10    2.838021

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

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



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

Code used                 : cg_descent
Problem                   : MSQRTALS
# variables               = 1024      

# cg iterations           = 2789      

# cg function evals       = 5581      

# cg gradient evals       = 2794      

|| g ||                   = 9.9666795e-07   
Final f                   = 6.7719173e-10   
Function value at final x = 6.7719173e-10   
Solve time                = 2.838021    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    2253    4507    2260     0    9.6355900e-07    3.3955336e-10    2.221697

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

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



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

Code used                 : cg_descent
Problem                   : MSQRTBLS
# variables               = 1024      

# cg iterations           = 2253      

# cg function evals       = 4507      

# cg gradient evals       = 2260      

|| g ||                   = 9.6355900e-07   
Final f                   = 3.3955336e-10   
Function value at final x = 3.3955336e-10   
Solve time                = 2.221697    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    3641    4733     0    6.2318023e-07   -1.1174683e+03   14.154036

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

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



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

Code used                 : cg_descent
Problem                   : NCB20
# variables               = 5010      

# cg iterations           = 2596      

# cg function evals       = 3641      

# cg gradient evals       = 4733      

|| g ||                   = 6.2318023e-07   
Final f                   = -1.1174683e+03  
Function value at final x = -1.1174683e+03  
Solve time                = 14.154036   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.000000
!!    NCB20B   5000    3023    3853    6193     0    9.3818203e-07    7.3513006e+03   18.012411

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

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



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

Code used                 : cg_descent
Problem                   : NCB20B
# variables               = 5000      

# cg iterations           = 3023      

# cg function evals       = 3853      

# cg gradient evals       = 6193      

|| g ||                   = 9.3818203e-07   
Final f                   = 7.3513006e+03   
Function value at final x = 7.3513006e+03   
Solve time                = 18.012411   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.142564

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

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



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

Code used                 : cg_descent
Problem                   : NONCVXU2
# variables               = 5000      

# cg iterations           = 6740      

# cg function evals       = 12777     

# cg gradient evals       = 7445      

|| g ||                   = 9.6555603e-07   
Final f                   = 1.1584984e+04   
Function value at final x = 1.1584984e+04   
Solve time                = 7.142564    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       7      18      20     0    8.8854080e-10    3.9554748e-25    0.010033

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

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



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

Code used                 : cg_descent
Problem                   : NONDIA
# variables               = 5000      

# cg iterations           = 7         

# cg function evals       = 18        

# cg gradient evals       = 20        

|| g ||                   = 8.8854080e-10   
Final f                   = 3.9554748e-25   
Function value at final x = 3.9554748e-25   
Solve time                = 0.010033    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    2496    4997    2503     0    7.0697875e-07    2.2772235e-06    0.748236

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

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



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

Code used                 : cg_descent
Problem                   : NONDQUAR
# variables               = 5000      

# cg iterations           = 2496      

# cg function evals       = 4997      

# cg gradient evals       = 2503      

|| g ||                   = 7.0697875e-07   
Final f                   = 2.2772235e-06   
Function value at final x = 2.2772235e-06   
Solve time                = 0.748236    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      95     219     134     0    4.0791063e-07    5.4648947e-05    0.001364

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

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



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

Code used                 : cg_descent
Problem                   : OSBORNEA
# variables               = 5         

# cg iterations           = 95        

# cg function evals       = 219       

# cg gradient evals       = 134       

|| g ||                   = 4.0791063e-07   
Final f                   = 5.4648947e-05   
Function value at final x = 5.4648947e-05   
Solve time                = 0.001364    seconds

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

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

sifdecoder -A pc64.lnx.gfo -st   OSBORNEB

 Problem name: OSBORNEB

 Double precision version will be formed

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

 Problem: OSBORNEB (n = 11)
walltime at start:     0.000001
!!  OSBORNEB     11      62     127      65     0    4.3772597e-07    4.0137736e-02    0.002410

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

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



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

Code used                 : cg_descent
Problem                   : OSBORNEB
# variables               = 11        

# cg iterations           = 62        

# cg function evals       = 127       

# cg gradient evals       = 65        

|| g ||                   = 4.3772597e-07   
Final f                   = 4.0137736e-02   
Function value at final x = 4.0137736e-02   
Solve time                = 0.002410    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.000000
!!  OSCIGRAD 100000      87     144     121     0    6.6369132e-07    3.6368841e-20    1.464402

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

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



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

Code used                 : cg_descent
Problem                   : OSCIGRAD
# variables               = 100000    

# cg iterations           = 87        

# cg function evals       = 144       

# cg gradient evals       = 121       

|| g ||                   = 6.6369132e-07   
Final f                   = 3.6368841e-20   
Function value at final x = 3.6368841e-20   
Solve time                = 1.464402    seconds

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

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

sifdecoder -A pc64.lnx.gfo -st   OSCIPATH

 Problem name: OSCIPATH

 Double precision version will be formed

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

 Problem: OSCIPATH (n = 10)
walltime at start:     0.000001
!!  OSCIPATH     10  310269  662178  362876     0    9.9842498e-07    2.2889727e-05    0.831059

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

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



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

Code used                 : cg_descent
Problem                   : OSCIPATH
# variables               = 10        

# cg iterations           = 310269    

# cg function evals       = 662178    

# cg gradient evals       = 362876    

|| g ||                   = 9.9842498e-07   
Final f                   = 2.2889727e-05   
Function value at final x = 2.2889727e-05   
Solve time                = 0.831059    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.000023

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

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



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

Code used                 : cg_descent
Problem                   : PALMER1C
# variables               = 8         

# cg iterations           = 16        

# cg function evals       = 0         

# cg gradient evals       = 19        

|| g ||                   = 2.4244819e-09   
Final f                   = 9.7604956e-02   
Function value at final x = 9.7605048e-02   
Solve time                = 0.000023    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.000000
!!  PALMER1D      7       8       0      10     0    1.9908839e-09    6.5267393e-01    0.000018

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

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



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

Code used                 : cg_descent
Problem                   : PALMER1D
# variables               = 7         

# cg iterations           = 8         

# cg function evals       = 0         

# cg gradient evals       = 10        

|| g ||                   = 1.9908839e-09   
Final f                   = 6.5267393e-01   
Function value at final x = 6.5267398e-01   
Solve time                = 0.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.000000
!!  PALMER2C      8      16       0      19     0    3.4370657e-09    1.4368901e-02    0.000026

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

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



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

Code used                 : cg_descent
Problem                   : PALMER2C
# variables               = 8         

# cg iterations           = 16        

# cg function evals       = 0         

# cg gradient evals       = 19        

|| g ||                   = 3.4370657e-09   
Final f                   = 1.4368901e-02   
Function value at final x = 1.4368886e-02   
Solve time                = 0.000026    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.000018

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

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



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

Code used                 : cg_descent
Problem                   : PALMER3C
# variables               = 8         

# cg iterations           = 9         

# cg function evals       = 0         

# cg gradient evals       = 11        

|| g ||                   = 2.6737155e-09   
Final f                   = 1.9537629e-02   
Function value at final x = 1.9537639e-02   
Solve time                = 0.000018    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.000019

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

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



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

Code used                 : cg_descent
Problem                   : PALMER4C
# variables               = 8         

# cg iterations           = 10        

# cg function evals       = 0         

# cg gradient evals       = 13        

|| g ||                   = 1.0183288e-14   
Final f                   = 5.0310635e-02   
Function value at final x = 5.0310687e-02   
Solve time                = 0.000019    seconds

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

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

sifdecoder -A pc64.lnx.gfo -st   PALMER5C

 Problem name: PALMER5C

 Double precision version will be formed

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

 Problem: PALMER5C (n = 6)
walltime at start:     0.000001
!!  PALMER5C      6       6      13       7     0    3.7526926e-12    2.1280866e+00    0.000041

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

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



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

Code used                 : cg_descent
Problem                   : PALMER5C
# variables               = 6         

# cg iterations           = 6         

# cg function evals       = 13        

# cg gradient evals       = 7         

|| g ||                   = 3.7526926e-12   
Final f                   = 2.1280866e+00   
Function value at final x = 2.1280866e+00   
Solve time                = 0.000041    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.000001
!!  PALMER6C      8      11      19      24     0    3.2098588e-08    1.6387438e-02    0.000065

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

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



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

Code used                 : cg_descent
Problem                   : PALMER6C
# variables               = 8         

# cg iterations           = 11        

# cg function evals       = 19        

# cg gradient evals       = 24        

|| g ||                   = 3.2098588e-08   
Final f                   = 1.6387438e-02   
Function value at final x = 1.6387438e-02   
Solve time                = 0.000065    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      20      20     0    4.0473345e-08    6.0198720e-01    0.000059

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

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



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

Code used                 : cg_descent
Problem                   : PALMER7C
# variables               = 8         

# cg iterations           = 11        

# cg function evals       = 20        

# cg gradient evals       = 20        

|| g ||                   = 4.0473345e-08   
Final f                   = 6.0198720e-01   
Function value at final x = 6.0198720e-01   
Solve time                = 0.000059    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, May 1, 2018) run status: 0

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



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

Code used                 : cg_descent
Problem                   : PALMER8C
# variables               = 8         

# cg iterations           = 11        

# cg function evals       = 18        

# cg gradient evals       = 17        

|| g ||                   = 8.7351837e-10   
Final f                   = 1.5976783e-01   
Function value at final x = 1.5976783e-01   
Solve time                = 0.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      27      67      44     0    7.5684237e-07    9.6861796e-03    0.002758

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

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



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

Code used                 : cg_descent
Problem                   : PENALTY1
# variables               = 1000      

# cg iterations           = 27        

# cg function evals       = 67        

# cg gradient evals       = 44        

|| g ||                   = 7.5684237e-07   
Final f                   = 9.6861796e-03   
Function value at final x = 9.6861796e-03   
Solve time                = 0.002758    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.000000
!!  PENALTY2    200     191     221     354     0    9.3555135e-07    4.7116277e+13    0.026064

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

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



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

Code used                 : cg_descent
Problem                   : PENALTY2
# variables               = 200       

# cg iterations           = 191       

# cg function evals       = 221       

# cg gradient evals       = 354       

|| g ||                   = 9.3555135e-07   
Final f                   = 4.7116277e+13   
Function value at final x = 4.7116277e+13   
Solve time                = 0.026064    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.000000
!!  PENALTY3    200      92     256     220     0    7.0238956e-07    1.0011921e-03    0.641123

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

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



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

Code used                 : cg_descent
Problem                   : PENALTY3
# variables               = 200       

# cg iterations           = 92        

# cg function evals       = 256       

# cg gradient evals       = 220       

|| g ||                   = 7.0238956e-07   
Final f                   = 1.0011921e-03   
Function value at final x = 1.0011921e-03   
Solve time                = 0.641123    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.000000
!!  POWELLSG   5000      26      53      27     0    1.2018814e-07    8.6653896e-12    0.007086

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

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



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

Code used                 : cg_descent
Problem                   : POWELLSG
# variables               = 5000      

# cg iterations           = 26        

# cg function evals       = 53        

# cg gradient evals       = 27        

|| g ||                   = 1.2018814e-07   
Final f                   = 8.6653896e-12   
Function value at final x = 8.6653896e-12   
Solve time                = 0.007086    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     375     759     386     0    9.9428323e-07    1.9177242e-09    0.115853

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

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



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

Code used                 : cg_descent
Problem                   : POWER
# variables               = 10000     

# cg iterations           = 375       

# cg function evals       = 759       

# cg gradient evals       = 386       

|| g ||                   = 9.9428323e-07   
Final f                   = 1.9177242e-09   
Function value at final x = 1.9177242e-09   
Solve time                = 0.115853    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      17      37      21     0    7.0514220e-07    2.7590839e-06    0.004872

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

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



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

Code used                 : cg_descent
Problem                   : QUARTC
# variables               = 5000      

# cg iterations           = 17        

# cg function evals       = 37        

# cg gradient evals       = 21        

|| g ||                   = 7.0514220e-07   
Final f                   = 2.7590839e-06   
Function value at final x = 2.7590839e-06   
Solve time                = 0.004872    seconds

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

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

sifdecoder -A pc64.lnx.gfo -st   ROSENBR

 Problem name: ROSENBR

 Double precision version will be formed

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

 Problem: ROSENBR (n = 2)
walltime at start:     0.000001
!!   ROSENBR      2      33      76      45     0    3.6716479e-09    8.8085204e-21    0.000075

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

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



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

Code used                 : cg_descent
Problem                   : ROSENBR
# variables               = 2         

# cg iterations           = 33        

# cg function evals       = 76        

# cg gradient evals       = 45        

|| g ||                   = 3.6716479e-09   
Final f                   = 8.8085204e-21   
Function value at final x = 8.8085204e-21   
Solve time                = 0.000075    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      19      12     0    9.4535388e-07    7.7319906e-01    0.000042

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

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



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

Code used                 : cg_descent
Problem                   : S308
# variables               = 2         

# cg iterations           = 8         

# cg function evals       = 19        

# cg gradient evals       = 12        

|| g ||                   = 9.4535388e-07   
Final f                   = 7.7319906e-01   
Function value at final x = 7.7319906e-01   
Solve time                = 0.000042    seconds

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

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

sifdecoder -A pc64.lnx.gfo -st   SCHMVETT

 Problem name: SCHMVETT

 Double precision version will be formed

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

 Problem: SCHMVETT (n = 5000)
walltime at start:     0.000000
!!  SCHMVETT   5000      43      73      60     0    6.4347041e-07   -1.4994000e+04    0.107190

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

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



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

Code used                 : cg_descent
Problem                   : SCHMVETT
# variables               = 5000      

# cg iterations           = 43        

# cg function evals       = 73        

# cg gradient evals       = 60        

|| g ||                   = 6.4347041e-07   
Final f                   = -1.4994000e+04  
Function value at final x = -1.4994000e+04  
Solve time                = 0.107190    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      22      49      32     0    9.5218079e-07   -2.0882812e+03    0.142763

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

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



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

Code used                 : cg_descent
Problem                   : SENSORS
# variables               = 100       

# cg iterations           = 22        

# cg function evals       = 49        

# cg gradient evals       = 32        

|| g ||                   = 9.5218079e-07   
Final f                   = -2.0882812e+03  
Function value at final x = -2.0882812e+03  
Solve time                = 0.142763    seconds

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

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

sifdecoder -A pc64.lnx.gfo -st   SINEVAL

 Problem name: SINEVAL

 Double precision version will be formed

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

 Problem: SINEVAL (n = 2)
walltime at start:     0.000000
!!   SINEVAL      2      59     141      88     0    1.2414829e-12    2.5844564e-27    0.000150

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

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



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

Code used                 : cg_descent
Problem                   : SINEVAL
# variables               = 2         

# cg iterations           = 59        

# cg function evals       = 141       

# cg gradient evals       = 88        

|| g ||                   = 1.2414829e-12   
Final f                   = 2.5844564e-27   
Function value at final x = 2.5844564e-27   
Solve time                = 0.000150    seconds

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

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

sifdecoder -A pc64.lnx.gfo -st   SINQUAD

 Problem name: SINQUAD

 Double precision version will be formed

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

 Problem: SINQUAD (n = 5000)
walltime at start:     0.000001
!!   SINQUAD   5000      14      39      32     0    2.0715902e-08   -6.7570138e+06    0.035363

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

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



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

Code used                 : cg_descent
Problem                   : SINQUAD
# variables               = 5000      

# cg iterations           = 14        

# cg function evals       = 39        

# cg gradient evals       = 32        

|| g ||                   = 2.0715902e-08   
Final f                   = -6.7570138e+06  
Function value at final x = -6.7570138e+06  
Solve time                = 0.035363    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      18      14     0    2.2204721e-08    6.8302615e-12    0.000042

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

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



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

Code used                 : cg_descent
Problem                   : SISSER
# variables               = 2         

# cg iterations           = 6         

# cg function evals       = 18        

# cg gradient evals       = 14        

|| g ||                   = 2.2204721e-08   
Final f                   = 6.8302615e-12   
Function value at final x = 6.8302615e-12   
Solve time                = 0.000042    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      92     216     127     0    1.3263120e-07    5.3634239e-15    0.000204

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

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



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

Code used                 : cg_descent
Problem                   : SNAIL
# variables               = 2         

# cg iterations           = 92        

# cg function evals       = 216       

# cg gradient evals       = 127       

|| g ||                   = 1.3263120e-07   
Final f                   = 5.3634239e-15   
Function value at final x = 5.3634239e-15   
Solve time                = 0.000204    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   59.657451

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

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



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

Code used                 : cg_descent
Problem                   : SPARSINE
# variables               = 5000      

# cg iterations           = 27272     

# cg function evals       = 27561     

# cg gradient evals       = 54259     

|| g ||                   = 9.9891100e-07   
Final f                   = 1.3590556e-10   
Function value at final x = 1.3590556e-10   
Solve time                = 59.657451   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      61      35     0    1.1572768e-07    9.7199564e-10    0.087313

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

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



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

Code used                 : cg_descent
Problem                   : SPARSQUR
# variables               = 10000     

# cg iterations           = 28        

# cg function evals       = 61        

# cg gradient evals       = 35        

|| g ||                   = 1.1572768e-07   
Final f                   = 9.7199564e-10   
Function value at final x = 9.7199564e-10   
Solve time                = 0.087313    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     201     405     206     0    9.5830239e-07    3.3105147e-11    0.205954

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

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



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

Code used                 : cg_descent
Problem                   : SPMSRTLS
# variables               = 4999      

# cg iterations           = 201       

# cg function evals       = 405       

# cg gradient evals       = 206       

|| g ||                   = 9.5830239e-07   
Final f                   = 3.3105147e-11   
Function value at final x = 3.3105147e-11   
Solve time                = 0.205954    seconds

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

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

sifdecoder -A pc64.lnx.gfo -st   SROSENBR

 Problem name: SROSENBR

 Double precision version will be formed

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

 Problem: SROSENBR (n = 5000)
walltime at start:     0.000000
!!  SROSENBR   5000      11      23      12     0    4.8292836e-10    4.2359717e-19    0.004456

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

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



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

Code used                 : cg_descent
Problem                   : SROSENBR
# variables               = 5000      

# cg iterations           = 11        

# cg function evals       = 23        

# cg gradient evals       = 12        

|| g ||                   = 4.8292836e-10   
Final f                   = 4.2359717e-19   
Function value at final x = 4.2359717e-19   
Solve time                = 0.004456    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    9355   15845   12246     0    9.5206114e-07    7.5733075e-15   10.292649

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

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



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

Code used                 : cg_descent
Problem                   : SSBRYBND
# variables               = 5000      

# cg iterations           = 9355      

# cg function evals       = 15845     

# cg gradient evals       = 12246     

|| g ||                   = 9.5206114e-07   
Final f                   = 7.5733075e-15   
Function value at final x = 7.5733075e-15   
Solve time                = 10.292649   seconds

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

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

sifdecoder -A pc64.lnx.gfo -st   STRATEC

 Problem name: STRATEC

 Double precision version will be formed

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

 Problem: STRATEC (n = 10)
walltime at start:     0.000000
!!   STRATEC     10     224     486     286     0    2.4025239e-07    2.2122623e+03    3.055569

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

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



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

Code used                 : cg_descent
Problem                   : STRATEC
# variables               = 10        

# cg iterations           = 224       

# cg function evals       = 486       

# cg gradient evals       = 286       

|| g ||                   = 2.4025239e-07   
Final f                   = 2.2122623e+03   
Function value at final x = 2.2122623e+03   
Solve time                = 3.055569    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.078091

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

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



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

Code used                 : cg_descent
Problem                   : TESTQUAD
# variables               = 5000      

# cg iterations           = 1490      

# cg function evals       = 0         

# cg gradient evals       = 1491      

|| g ||                   = 8.4102097e-07   
Final f                   = -1.8608709e-06  
Function value at final x = 4.9868548e-13   
Solve time                = 0.078091    seconds

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

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

sifdecoder -A pc64.lnx.gfo -st   TOINTGOR

 Problem name: TOINTGOR

 Double precision version will be formed

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

 Problem: TOINTGOR (n = 50)
walltime at start:     0.000001
!!  TOINTGOR     50     135     233     175     0    9.9819687e-07    1.3739055e+03    0.002535

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

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



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

Code used                 : cg_descent
Problem                   : TOINTGOR
# variables               = 50        

# cg iterations           = 135       

# cg function evals       = 233       

# cg gradient evals       = 175       

|| g ||                   = 9.9819687e-07   
Final f                   = 1.3739055e+03   
Function value at final x = 1.3739055e+03   
Solve time                = 0.002535    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.000000
!!  TOINTGSS   5000       4       9       5     0    2.2872519e-07    1.0002001e+01    0.004070

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

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



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

Code used                 : cg_descent
Problem                   : TOINTGSS
# variables               = 5000      

# cg iterations           = 4         

# cg function evals       = 9         

# cg gradient evals       = 5         

|| g ||                   = 2.2872519e-07   
Final f                   = 1.0002001e+01   
Function value at final x = 1.0002001e+01   
Solve time                = 0.004070    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     273     200     0    9.8830470e-07    2.2556041e+02    0.001532

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

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



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

Code used                 : cg_descent
Problem                   : TOINTPSP
# variables               = 50        

# cg iterations           = 148       

# cg function evals       = 273       

# cg gradient evals       = 200       

|| g ||                   = 9.8830470e-07   
Final f                   = 2.2556041e+02   
Function value at final x = 2.2556041e+02   
Solve time                = 0.001532    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.000157

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

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



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

Code used                 : cg_descent
Problem                   : TOINTQOR
# variables               = 50        

# cg iterations           = 29        

# cg function evals       = 0         

# cg gradient evals       = 30        

|| g ||                   = 4.4231462e-07   
Final f                   = 1.1754722e+03   
Function value at final x = 1.1754722e+03   
Solve time                = 0.000157    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.000000
!!  TQUARTIC   5000      14      37      24     0    3.1842134e-08    1.4909251e-20    0.013855

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

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



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

Code used                 : cg_descent
Problem                   : TQUARTIC
# variables               = 5000      

# cg iterations           = 14        

# cg function evals       = 37        

# cg gradient evals       = 24        

|| g ||                   = 3.1842134e-08   
Final f                   = 1.4909251e-20   
Function value at final x = 1.4909251e-20   
Solve time                = 0.013855    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.058074

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

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



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

Code used                 : cg_descent
Problem                   : TRIDIA
# variables               = 5000      

# cg iterations           = 780       

# cg function evals       = 0         

# cg gradient evals       = 781       

|| g ||                   = 9.7406364e-07   
Final f                   = 9.9879629e-10   
Function value at final x = 4.9904374e-15   
Solve time                = 0.058074    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.000170

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

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



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

Code used                 : cg_descent
Problem                   : VARDIM
# variables               = 200       

# cg iterations           = 10        

# cg function evals       = 21        

# cg gradient evals       = 11        

|| g ||                   = 2.5959262e-07   
Final f                   = 4.2117690e-19   
Function value at final x = 4.2117690e-19   
Solve time                = 0.000170    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.000385

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

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



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

Code used                 : cg_descent
Problem                   : VAREIGVL
# variables               = 50        

# cg iterations           = 23        

# cg function evals       = 47        

# cg gradient evals       = 24        

|| g ||                   = 8.4765966e-07   
Final f                   = 3.7975332e-13   
Function value at final x = 3.7975332e-13   
Solve time                = 0.000385    seconds

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

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

sifdecoder -A pc64.lnx.gfo -st   VIBRBEAM

 Problem name: VIBRBEAM

 Double precision version will be formed

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

 Problem: VIBRBEAM (n = 8)
walltime at start:     0.000001
!!  VIBRBEAM      8     285     637     603     0    5.7821853e-07    8.9119788e+00    0.013492

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

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



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

Code used                 : cg_descent
Problem                   : VIBRBEAM
# variables               = 8         

# cg iterations           = 285       

# cg function evals       = 637       

# cg gradient evals       = 603       

|| g ||                   = 5.7821853e-07   
Final f                   = 8.9119788e+00   
Function value at final x = 8.9119788e+00   
Solve time                = 0.013492    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.000000
!!    WATSON     12      53     110      58     0    7.7563358e-07    1.5918571e-07    0.000536

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

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



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

Code used                 : cg_descent
Problem                   : WATSON
# variables               = 12        

# cg iterations           = 53        

# cg function evals       = 110       

# cg gradient evals       = 58        

|| g ||                   = 7.7563358e-07   
Final f                   = 1.5918571e-07   
Function value at final x = 1.5918571e-07   
Solve time                = 0.000536    seconds

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

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

sifdecoder -A pc64.lnx.gfo -st   WOODS

 Problem name: WOODS

 Double precision version will be formed

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

 Problem: WOODS (n = 4000)
walltime at start:     0.000000
!!     WOODS   4000      22      51      30     0    3.1509000e-08    1.5548814e-15    0.010795

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

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



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

Code used                 : cg_descent
Problem                   : WOODS
# variables               = 4000      

# cg iterations           = 22        

# cg function evals       = 51        

# cg gradient evals       = 30        

|| g ||                   = 3.1509000e-08   
Final f                   = 1.5548814e-15   
Function value at final x = 1.5548814e-15   
Solve time                = 0.010795    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.000000
!!     YFITU      3      75     179     110     0    5.5958745e-08    1.7197110e-11    0.000622

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

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



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

Code used                 : cg_descent
Problem                   : YFITU
# variables               = 3         

# cg iterations           = 75        

# cg function evals       = 179       

# cg gradient evals       = 110       

|| g ||                   = 5.5958745e-08   
Final f                   = 1.7197110e-11   
Function value at final x = 1.7197110e-11   
Solve time                = 0.000622    seconds

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

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

sifdecoder -A pc64.lnx.gfo -st   ZANGWIL2

 Problem name: ZANGWIL2

 Double precision version will be formed

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

 Problem: ZANGWIL2 (n = 2)
the problem has a quadratic objective
walltime at start:     0.000000
!!  ZANGWIL2      2       1       0       2     0    2.2204460e-16   -1.8200000e+01    0.000014

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

Success: Error 2.220446e-16 satisfies error tolerance 1.000000e-06.



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

Code used                 : cg_descent
Problem                   : ZANGWIL2
# variables               = 2         

# cg iterations           = 1         

# cg function evals       = 0         

# cg gradient evals       = 2         

|| g ||                   = 2.2204460e-16   
Final f                   = -1.8200000e+01  
Function value at final x = -1.8200000e+01  
Solve time                = 0.000014    seconds

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

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

sifdecoder -A pc64.lnx.gfo -st   BIGBANK

 Problem name: BIGBANK

 Double precision version will be formed

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

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

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

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


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

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


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

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

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 2.323151e-03
Initialization (includes partition) ..... 3.581786e-02
Phase 1 ................................. 4.627061e-02
Coordinate ascent ....................... 4.291534e-05
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 4.315376e-05
DASA .................................... 1.272016e+00
DASA line search ........................ 2.634463e-01
Check error ............................. 9.302783e-02
Proximal update ......................... 5.571342e-02
Invert permutation ...................... 2.984762e-03
Row modifications of Cholesky factor .... 4.589796e-03
Column modifications of Cholesky factor . 1.660428e-01
Cholesky factorization .................. 1.337359e-01
Partial Cholesky factorization .......... 7.731438e-02
Back solves ............................. 2.171717e-01
Forward solves .......................... 3.744745e-02


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

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

!!   BIGBANK   2230      54     122      82    7198   11410   10315     981     644     0    3.9470793e-07   -4.2056933e+06    4.012743
 Final f                         = -4.2056933e+06  
 Function value at final x       = -4.2056933e+06  
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   DALLASM

 Problem name: DALLASM

 Double precision version will be formed

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

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

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

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


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

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


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

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

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 1.230240e-04
Initialization (includes partition) ..... 2.753735e-04
Phase 1 ................................. 3.645420e-04
Coordinate ascent ....................... 9.059906e-06
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 6.914139e-06
DASA .................................... 1.229525e-03
DASA line search ........................ 1.966953e-04
Check error ............................. 2.501011e-04
Proximal update ......................... 1.771450e-04
Invert permutation ...................... 2.431870e-05
Row modifications of Cholesky factor .... 2.837181e-05
Column modifications of Cholesky factor . 2.534389e-04
Cholesky factorization .................. 8.106232e-05
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 1.091957e-04
Forward solves .......................... 4.959106e-05


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

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


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

sifdecoder -A pc64.lnx.gfo -st   DALLASS

 Problem name: DALLASS

 Double precision version will be formed

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

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

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

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


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

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


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

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

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 5.698204e-05
Initialization (includes partition) ..... 1.261234e-04
Phase 1 ................................. 1.094341e-04
Coordinate ascent ....................... 3.385544e-05
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 2.145767e-06
DASA .................................... 4.234314e-04
DASA line search ........................ 3.218651e-05
Check error ............................. 9.202957e-05
Proximal update ......................... 7.581711e-05
Invert permutation ...................... 1.955032e-05
Row modifications of Cholesky factor .... 3.814697e-06
Column modifications of Cholesky factor . 7.486343e-05
Cholesky factorization .................. 3.790855e-05
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 1.931190e-05
Forward solves .......................... 1.978874e-05


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

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


!!   DALLASS     46       4      10       4     283     459     441      23       3     0    9.0572079e-07   -3.2393224e+04    0.012176
 Final f                         = -3.2393224e+04  
 Function value at final x       = -3.2393224e+04  
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   DTOC1L

 Problem name: DTOC1L

 Double precision version will be formed

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

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

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

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


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

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


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

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

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 6.294966e-03
Initialization (includes partition) ..... 7.000923e-03
Phase 1 ................................. 1.046586e-02
Coordinate ascent ....................... 1.211166e-04
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 2.210140e-04
DASA .................................... 2.883196e-03
DASA line search ........................ 2.498627e-04
Check error ............................. 1.811981e-04
Proximal update ......................... 2.579689e-04
Invert permutation ...................... 2.098083e-05
Row modifications of Cholesky factor .... 1.907349e-06
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 1.578093e-03
Partial Cholesky factorization .......... 1.008511e-04
Back solves ............................. 1.978874e-04
Forward solves .......................... 9.679794e-05


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

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

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

sifdecoder -A pc64.lnx.gfo -st   DUAL1

 Problem name: DUAL1

 Double precision version will be formed

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

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

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

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


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

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


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

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

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 3.099442e-05
Initialization (includes partition) ..... 1.094341e-04
Phase 1 ................................. 1.430511e-04
Coordinate ascent ....................... 5.006790e-06
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 3.099442e-06
DASA .................................... 3.976822e-04
DASA line search ........................ 2.956390e-05
Check error ............................. 1.211166e-04
Proximal update ......................... 1.385212e-04
Invert permutation ...................... 4.363060e-05
Row modifications of Cholesky factor .... 0.000000e+00
Column modifications of Cholesky factor . 6.389618e-05
Cholesky factorization .................. 9.822845e-05
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 2.145767e-05
Forward solves .......................... 2.121925e-05


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

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

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

sifdecoder -A pc64.lnx.gfo -st   DUAL2

 Problem name: DUAL2

 Double precision version will be formed

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

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

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

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


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

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


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

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

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 2.503395e-05
Initialization (includes partition) ..... 5.674362e-05
Phase 1 ................................. 6.031990e-05
Coordinate ascent ....................... 5.960464e-06
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 1.907349e-05
DASA .................................... 7.176399e-05
DASA line search ........................ 4.768372e-06
Check error ............................. 1.525879e-05
Proximal update ......................... 1.502037e-05
Invert permutation ...................... 7.629395e-06
Row modifications of Cholesky factor .... 0.000000e+00
Column modifications of Cholesky factor . 1.096725e-05
Cholesky factorization .................. 1.502037e-05
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 2.145767e-06
Forward solves .......................... 1.907349e-06


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

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

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

sifdecoder -A pc64.lnx.gfo -st   DUAL3

 Problem name: DUAL3

 Double precision version will be formed

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

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

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

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


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

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


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

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

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 3.290176e-05
Initialization (includes partition) ..... 9.965897e-05
Phase 1 ................................. 1.115799e-04
Coordinate ascent ....................... 0.000000e+00
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 3.099442e-06
DASA .................................... 1.540184e-04
DASA line search ........................ 1.311302e-05
Check error ............................. 4.601479e-05
Proximal update ......................... 5.173683e-05
Invert permutation ...................... 2.121925e-05
Row modifications of Cholesky factor .... 0.000000e+00
Column modifications of Cholesky factor . 5.364418e-05
Cholesky factorization .................. 4.434586e-05
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 8.106232e-06
Forward solves .......................... 5.722046e-06


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

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

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

sifdecoder -A pc64.lnx.gfo -st   DUAL4

 Problem name: DUAL4

 Double precision version will be formed

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

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

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

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


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

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


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

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

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 2.503395e-05
Initialization (includes partition) ..... 6.341934e-05
Phase 1 ................................. 7.009506e-05
Coordinate ascent ....................... 4.053116e-06
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 3.099442e-06
DASA .................................... 1.380444e-04
DASA line search ........................ 1.025200e-05
Check error ............................. 3.576279e-05
Proximal update ......................... 3.933907e-05
Invert permutation ...................... 1.406670e-05
Row modifications of Cholesky factor .... 0.000000e+00
Column modifications of Cholesky factor . 1.215935e-05
Cholesky factorization .................. 3.099442e-05
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 7.152557e-06
Forward solves .......................... 5.722046e-06


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

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

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

sifdecoder -A pc64.lnx.gfo -st   DUALC1

 Problem name: DUALC1

 Double precision version will be formed

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

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

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

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


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

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


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

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

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 6.318092e-05
Initialization (includes partition) ..... 1.561642e-04
Phase 1 ................................. 1.568794e-04
Coordinate ascent ....................... 2.861023e-06
SSOR0 ................................... 4.291534e-06
SSOR1 ................................... 1.788139e-05
SpaRSA .................................. 8.106232e-06
DASA .................................... 3.161430e-04
DASA line search ........................ 1.382828e-05
Check error ............................. 7.390976e-05
Proximal update ......................... 8.249283e-05
Invert permutation ...................... 7.152557e-06
Row modifications of Cholesky factor .... 0.000000e+00
Column modifications of Cholesky factor . 8.106232e-06
Cholesky factorization .................. 1.041889e-04
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 6.198883e-06
Forward solves .......................... 8.583069e-06


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

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

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

sifdecoder -A pc64.lnx.gfo -st   DUALC2

 Problem name: DUALC2

 Double precision version will be formed

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

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

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

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


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

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


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

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

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 6.484985e-05
Initialization (includes partition) ..... 1.554489e-04
Phase 1 ................................. 1.668930e-04
Coordinate ascent ....................... 6.675720e-06
SSOR0 ................................... 5.006790e-06
SSOR1 ................................... 2.217293e-05
SpaRSA .................................. 6.914139e-06
DASA .................................... 3.132820e-04
DASA line search ........................ 1.239777e-05
Check error ............................. 6.628036e-05
Proximal update ......................... 7.677078e-05
Invert permutation ...................... 6.198883e-06
Row modifications of Cholesky factor .... 1.883507e-05
Column modifications of Cholesky factor . 4.053116e-06
Cholesky factorization .................. 9.346008e-05
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 5.006790e-06
Forward solves .......................... 7.867813e-06


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

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

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

sifdecoder -A pc64.lnx.gfo -st   DUALC5

 Problem name: DUALC5

 Double precision version will be formed

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

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

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

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


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

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


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

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

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 6.914139e-05
Initialization (includes partition) ..... 1.657009e-04
Phase 1 ................................. 1.430511e-04
Coordinate ascent ....................... 2.861023e-06
SSOR0 ................................... 2.861023e-06
SSOR1 ................................... 5.006790e-06
SpaRSA .................................. 1.406670e-05
DASA .................................... 1.387596e-04
DASA line search ........................ 4.768372e-06
Check error ............................. 3.314018e-05
Proximal update ......................... 4.482269e-05
Invert permutation ...................... 5.006790e-06
Row modifications of Cholesky factor .... 0.000000e+00
Column modifications of Cholesky factor . 6.914139e-06
Cholesky factorization .................. 5.197525e-05
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 2.861023e-06
Forward solves .......................... 2.861023e-06


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

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

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

sifdecoder -A pc64.lnx.gfo -st   DUALC8

 Problem name: DUALC8

 Double precision version will be formed

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

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

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

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


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

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


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

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

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 1.099110e-04
Initialization (includes partition) ..... 2.758503e-04
Phase 1 ................................. 3.402233e-04
Coordinate ascent ....................... 4.053116e-06
SSOR0 ................................... 4.053116e-06
SSOR1 ................................... 2.598763e-05
SpaRSA .................................. 1.597404e-05
DASA .................................... 4.298687e-04
DASA line search ........................ 1.072884e-05
Check error ............................. 9.560585e-05
Proximal update ......................... 1.263618e-04
Invert permutation ...................... 1.096725e-05
Row modifications of Cholesky factor .... 1.811981e-05
Column modifications of Cholesky factor . 4.053116e-06
Cholesky factorization .................. 1.471043e-04
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 7.152557e-06
Forward solves .......................... 4.768372e-06


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

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

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

sifdecoder -A pc64.lnx.gfo -st   EQC

 Problem name: EQC

 Double precision version will be formed

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

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

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

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


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

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


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

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

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 3.814697e-05
Initialization (includes partition) ..... 6.294250e-05
Phase 1 ................................. 2.884865e-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 ...................... 2.861023e-06
Row modifications of Cholesky factor .... 0.000000e+00
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 0.000000e+00
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 0.000000e+00
Forward solves .......................... 0.000000e+00


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

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

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

sifdecoder -A pc64.lnx.gfo -st   EXPFITA

 Problem name: EXPFITA

 Double precision version will be formed

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

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

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

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


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

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


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

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

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 2.884865e-05
Initialization (includes partition) ..... 6.842613e-05
Phase 1 ................................. 6.127357e-05
Coordinate ascent ....................... 9.298325e-06
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 2.145767e-06
DASA .................................... 3.781319e-04
DASA line search ........................ 3.743172e-05
Check error ............................. 4.577637e-05
Proximal update ......................... 1.621246e-05
Invert permutation ...................... 1.358986e-05
Row modifications of Cholesky factor .... 1.335144e-04
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 3.194809e-05
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 2.360344e-05
Forward solves .......................... 1.001358e-05


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

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

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

sifdecoder -A pc64.lnx.gfo -st   EXPFITB

 Problem name: EXPFITB

 Double precision version will be formed

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

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

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

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


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

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


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

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

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 3.695488e-05
Initialization (includes partition) ..... 1.020432e-04
Phase 1 ................................. 1.418591e-04
Coordinate ascent ....................... 6.246567e-05
SSOR0 ................................... 9.679794e-05
SSOR1 ................................... 1.237392e-04
SpaRSA .................................. 4.053116e-06
DASA .................................... 5.806208e-03
DASA line search ........................ 6.365776e-04
Check error ............................. 2.753735e-04
Proximal update ......................... 1.099110e-04
Invert permutation ...................... 2.241135e-05
Row modifications of Cholesky factor .... 2.111435e-03
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 6.821156e-04
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 5.233288e-04
Forward solves .......................... 4.649162e-05


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

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

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

sifdecoder -A pc64.lnx.gfo -st   EXPFITC

 Problem name: EXPFITC

 Double precision version will be formed

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

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

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

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


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

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


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

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

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 8.702278e-05
Initialization (includes partition) ..... 2.212524e-04
Phase 1 ................................. 5.323887e-04
Coordinate ascent ....................... 2.274513e-04
SSOR0 ................................... 4.347324e-03
SSOR1 ................................... 6.155968e-04
SpaRSA .................................. 1.382828e-05
DASA .................................... 8.904052e-02
DASA line search ........................ 3.029823e-03
Check error ............................. 1.230717e-03
Proximal update ......................... 3.113747e-04
Invert permutation ...................... 2.646446e-05
Row modifications of Cholesky factor .... 6.417990e-02
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 5.197048e-03
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 6.569624e-03
Forward solves .......................... 1.628399e-04


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

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

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

sifdecoder -A pc64.lnx.gfo -st   GMNCASE2

 Problem name: GMNCASE2

 Double precision version will be formed

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

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

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

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


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

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


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

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

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 1.279283e-02
Initialization (includes partition) ..... 1.339626e-02
Phase 1 ................................. 2.513170e-03
Coordinate ascent ....................... 7.891655e-05
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 1.399517e-04
DASA .................................... 6.441832e-03
DASA line search ........................ 4.982948e-05
Check error ............................. 5.502701e-04
Proximal update ......................... 7.801056e-04
Invert permutation ...................... 8.106232e-06
Row modifications of Cholesky factor .... 4.708767e-04
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 4.840136e-03
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 1.907349e-05
Forward solves .......................... 2.098083e-05


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

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

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

sifdecoder -A pc64.lnx.gfo -st   GMNCASE3

 Problem name: GMNCASE3

 Double precision version will be formed

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

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

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

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


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

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


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

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

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 1.282692e-02
Initialization (includes partition) ..... 1.345086e-02
Phase 1 ................................. 2.709627e-03
Coordinate ascent ....................... 5.698204e-05
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 1.399517e-04
DASA .................................... 6.098747e-03
DASA line search ........................ 3.457069e-05
Check error ............................. 3.948212e-04
Proximal update ......................... 6.220341e-04
Invert permutation ...................... 7.629395e-06
Row modifications of Cholesky factor .... 3.840923e-04
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 4.895926e-03
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 1.120567e-05
Forward solves .......................... 1.740456e-05


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

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

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

sifdecoder -A pc64.lnx.gfo -st   GMNCASE4

 Problem name: GMNCASE4

 Double precision version will be formed

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

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

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

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


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

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


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

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

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 5.071163e-04
Initialization (includes partition) ..... 1.013041e-03
Phase 1 ................................. 3.380060e-03
Coordinate ascent ....................... 1.547337e-04
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 9.489059e-05
DASA .................................... 5.715370e-02
DASA line search ........................ 1.912594e-03
Check error ............................. 1.397133e-04
Proximal update ......................... 3.309250e-04
Invert permutation ...................... 1.339912e-04
Row modifications of Cholesky factor .... 2.463341e-02
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 2.827382e-02
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 1.566887e-03
Forward solves .......................... 5.602837e-05


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

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

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

sifdecoder -A pc64.lnx.gfo -st   GRIDNETD

 Problem name: GRIDNETD

 Double precision version will be formed

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

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

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

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


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

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


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

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

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 5.887985e-03
Initialization (includes partition) ..... 7.719517e-03
Phase 1 ................................. 9.521246e-03
Coordinate ascent ....................... 8.511543e-05
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 1.890659e-04
DASA .................................... 8.504868e-03
DASA line search ........................ 1.932383e-03
Check error ............................. 1.246452e-03
Proximal update ......................... 1.339197e-03
Invert permutation ...................... 1.077652e-04
Row modifications of Cholesky factor .... 2.598763e-05
Column modifications of Cholesky factor . 5.211830e-04
Cholesky factorization .................. 1.376867e-03
Partial Cholesky factorization .......... 1.335144e-04
Back solves ............................. 1.204014e-03
Forward solves .......................... 6.680489e-04


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

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

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

sifdecoder -A pc64.lnx.gfo -st   GRIDNETE

 Problem name: GRIDNETE

 Double precision version will be formed

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

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

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

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


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

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


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

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

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 1.101804e-02
Initialization (includes partition) ..... 1.163697e-02
Phase 1 ................................. 1.032901e-02
Coordinate ascent ....................... 1.940727e-04
SSOR0 ................................... 3.609657e-04
SSOR1 ................................... 1.249790e-03
SpaRSA .................................. 1.499653e-04
DASA .................................... 1.402187e-02
DASA line search ........................ 4.930496e-04
Check error ............................. 3.468990e-04
Proximal update ......................... 4.882812e-04
Invert permutation ...................... 2.026558e-05
Row modifications of Cholesky factor .... 3.814697e-06
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 3.407717e-03
Partial Cholesky factorization .......... 6.554842e-03
Back solves ............................. 5.095005e-04
Forward solves .......................... 3.206730e-04


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

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

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

sifdecoder -A pc64.lnx.gfo -st   GRIDNETF

 Problem name: GRIDNETF

 Double precision version will be formed

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

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

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

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


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

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


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

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

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 1.096082e-02
Initialization (includes partition) ..... 1.679897e-02
Phase 1 ................................. 1.630974e-02
Coordinate ascent ....................... 1.330376e-04
SSOR0 ................................... 9.088993e-03
SSOR1 ................................... 7.710457e-04
SpaRSA .................................. 4.019737e-04
DASA .................................... 1.033864e-01
DASA line search ........................ 1.175237e-02
Check error ............................. 6.516457e-03
Proximal update ......................... 5.721092e-03
Invert permutation ...................... 2.329350e-04
Row modifications of Cholesky factor .... 1.301765e-04
Column modifications of Cholesky factor . 1.929021e-02
Cholesky factorization .................. 7.847071e-03
Partial Cholesky factorization .......... 1.503038e-02
Back solves ............................. 1.215935e-02
Forward solves .......................... 1.064944e-02


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

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

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

sifdecoder -A pc64.lnx.gfo -st   GRIDNETG

 Problem name: GRIDNETG

 Double precision version will be formed

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

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

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

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


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

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


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

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

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 5.913973e-03
Initialization (includes partition) ..... 7.767200e-03
Phase 1 ................................. 9.566069e-03
Coordinate ascent ....................... 8.320808e-05
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 1.869202e-04
DASA .................................... 1.182842e-02
DASA line search ........................ 2.745390e-03
Check error ............................. 2.064943e-03
Proximal update ......................... 1.764536e-03
Invert permutation ...................... 1.204014e-04
Row modifications of Cholesky factor .... 3.457069e-05
Column modifications of Cholesky factor . 6.453991e-04
Cholesky factorization .................. 1.413107e-03
Partial Cholesky factorization .......... 1.311302e-04
Back solves ............................. 1.739025e-03
Forward solves .......................... 1.077890e-03


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

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

!!  GRIDNETG   7564       1       2       1      56     100      64      14       2     0    4.7023628e-07    6.1578420e+02    0.096567
 Final f                         = 6.1578420e+02   
 Function value at final x       = 6.1578420e+02   
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   GRIDNETH

 Problem name: GRIDNETH

 Double precision version will be formed

 The objective function uses 1 nonlinear group
 
 There are 3844 linear equality constraints
 
 There are 7564 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully

 Problem: GRIDNETH (n = 7564)
walltime at start:     0.000000

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 8.605162e-07 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 8.605161953070817e-07    
Final f                               : 2.064805091605429e+02    

Iterations of gradient projection (GP): 0         
Iterations of active set GP           : 1         
Function evaluation in main code      : 1         
Function evaluations in GP            : 0         
Function evaluations in active set GP : 1         
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 0         
Gradient evaluations in active set GP : 1         


PPROJ run statistics (Version 2.0, May 1, 2018):

No. blocks in multilevel partition of A . 15
Depth of multilevel partition tree ...... 3
Phase 1 iterations ...................... 15
Coordinate ascent iterations ............ 2
    variables freed in coordinate ascent  0
    rows dropped in coordinate ascent ... 0
Gradient ascent iterations .............. 2
    variables freed in gradient ascent .. 0
    rows dropped in gradient ascent ..... 0
Preconditioned CG iterations ............ 6
    variables freed in CG ............... 0
    rows dropped in CG .................. 0
SpaRSA iterations ....................... 2
    change in column activity ........... 0
    change in row activity .............. 0
    failures of Armijo step ............. 1
Proximal updates ........................ 2
Cholesky factorizations ................. 2
    nonzeros in final factor ............ 65319 99.1% sparse
    rows dropped from L ................. 0
    rows added to L ..................... 0
    rank 1 downdates to L ............... 0
    rank 1 updates to L ................. 0
    Size breakdown of the updates ([size]: number of this size):
    No. of solves by depth in the multilevel partition tree:
        (deeper <=> further from root of tree <=> fewer flops)
        depth [ 0]: 2
        depth [ 1]: 4
        depth [ 2]: 8
        depth [ 3]: 16

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 1.093984e-02
Initialization (includes partition) ..... 1.155305e-02
Phase 1 ................................. 1.036406e-02
Coordinate ascent ....................... 2.100468e-04
SSOR0 ................................... 4.129410e-04
SSOR1 ................................... 1.294851e-03
SpaRSA .................................. 1.900196e-04
DASA .................................... 1.428318e-02
DASA line search ........................ 4.847050e-04
Check error ............................. 3.383160e-04
Proximal update ......................... 4.868507e-04
Invert permutation ...................... 2.193451e-05
Row modifications of Cholesky factor .... 3.814697e-06
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 3.433943e-03
Partial Cholesky factorization .......... 6.514072e-03
Back solves ............................. 5.280972e-04
Forward solves .......................... 3.306866e-04


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             :  2.064805091619174e+02
sup-norm of gradient:  8.605161953070817e-07
Number of iterations: 48        
Function evaluations: 96        
Gradient evaluations: 48        

!!  GRIDNETH   7564       0       0       0      48      96      48       3       2     0    8.6051620e-07    2.0648051e+02    0.094178
 Final f                         = 2.0648051e+02   
 Function value at final x       = 2.0648051e+02   
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   GRIDNETI

 Problem name: GRIDNETI

 Double precision version will be formed

 The objective function uses 1 nonlinear group
 
 There are 3844 linear equality constraints
 
 There are 5043 free variables
 There are 2521 variables bounded only from below 
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully

 Problem: GRIDNETI (n = 7564)
walltime at start:     0.000000

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 7.515424e-07 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 7.515424496295450e-07    
Final f                               : 2.435423262499826e+02    

Iterations of gradient projection (GP): 3         
Iterations of active set GP           : 22        
Function evaluation in main code      : 1         
Function evaluations in GP            : 4         
Function evaluations in active set GP : 25        
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 3         
Gradient evaluations in active set GP : 22        


PPROJ run statistics (Version 2.0, May 1, 2018):

No. blocks in multilevel partition of A . 15
Depth of multilevel partition tree ...... 3
Phase 1 iterations ...................... 15
Coordinate ascent iterations ............ 1
    variables freed in coordinate ascent  9
    rows dropped in coordinate ascent ... 0
Gradient ascent iterations .............. 48
    variables freed in gradient ascent .. 181
    rows dropped in gradient ascent ..... 0
Preconditioned CG iterations ............ 3
    variables freed in CG ............... 298
    rows dropped in CG .................. 0
SpaRSA iterations ....................... 23
    change in column activity ........... 25
    change in row activity .............. 0
    failures of Armijo step ............. 15
Proximal updates ........................ 23
Cholesky factorizations ................. 6
    nonzeros in final factor ............ 52882 99.3% sparse
    rows dropped from L ................. 0
    rows added to L ..................... 0
    rank 1 downdates to L ............... 293
    rank 1 updates to L ................. 2010
    Size breakdown of the updates ([size]: number of this size):
        updowns [  1]: 19
        updowns [  2]: 13
        updowns [  3]: 6
        updowns [  4]: 9
        updowns [  5]: 7
        updowns [  6]: 4
        updowns [  7]: 2
        updowns [  8]: 5
        updowns [  9]: 1
        updowns [ 11]: 1
        updowns [ 12]: 1
        updowns [ 13]: 1
        updowns [ 15]: 1
        updowns [ 17]: 1
        updowns [ 20]: 2
        updowns [ 21]: 1
        updowns [ 22]: 2
        updowns [ 23]: 1
        updowns [ 25]: 1
        updowns [ 27]: 1
        updowns [ 28]: 3
        updowns [ 29]: 1
        updowns [ 30]: 3
        updowns [ 33]: 2
        updowns [ 34]: 1
        updowns [ 37]: 1
        updowns [ 38]: 1
        updowns [ 49]: 1
        updowns [ 51]: 1
        updowns [ 65]: 1
        updowns [ 75]: 1
        updowns [ 86]: 1
        updowns [ 92]: 1
        updowns [ 95]: 1
        updowns [150]: 1
        updowns [152]: 1
        updowns [178]: 1
        updowns [212]: 1
        updowns [251]: 1
    No. of solves by depth in the multilevel partition tree:
        (deeper <=> further from root of tree <=> fewer flops)
        depth [ 0]: 48
        depth [ 1]: 94
        depth [ 2]: 180
        depth [ 3]: 347

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 1.091790e-02
Initialization (includes partition) ..... 1.672649e-02
Phase 1 ................................. 1.610470e-02
Coordinate ascent ....................... 1.320839e-04
SSOR0 ................................... 9.111166e-03
SSOR1 ................................... 7.619858e-04
SpaRSA .................................. 1.909733e-04
DASA .................................... 1.031222e-01
DASA line search ........................ 1.168752e-02
Check error ............................. 6.508350e-03
Proximal update ......................... 5.739450e-03
Invert permutation ...................... 2.319813e-04
Row modifications of Cholesky factor .... 1.254082e-04
Column modifications of Cholesky factor . 1.912451e-02
Cholesky factorization .................. 7.779360e-03
Partial Cholesky factorization .......... 1.494384e-02
Back solves ............................. 1.213431e-02
Forward solves .......................... 1.066875e-02


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             :  2.435423262540583e+02
sup-norm of gradient:  7.515424496295450e-07
Number of iterations: 40        
Function evaluations: 77        
Gradient evaluations: 42        

!!  GRIDNETI   7564       3       4       3      40      77      42      28       6     0    7.5154245e-07    2.4354233e+02    0.215802
 Final f                         = 2.4354233e+02   
 Function value at final x       = 2.4354233e+02   
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   HAGER1

 Problem name: HAGER1

 Double precision version will be formed

 The objective function uses 2501 nonlinear groups
 
 There are 2500 linear equality constraints
 
 There are 5000 free variables
 There is 1 fixed variable
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully

 Problem: HAGER1 (n = 5001)
walltime at start:     0.000000

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 2.369946e-08 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 2.369946321692995e-08    
Final f                               : 8.807970809155822e-01    

Iterations of gradient projection (GP): 0         
Iterations of active set GP           : 1         
Function evaluation in main code      : 1         
Function evaluations in GP            : 0         
Function evaluations in active set GP : 1         
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 0         
Gradient evaluations in active set GP : 1         


PPROJ run statistics (Version 2.0, May 1, 2018):

No. blocks in multilevel partition of A . 15
Depth of multilevel partition tree ...... 3
Phase 1 iterations ...................... 13
Coordinate ascent iterations ............ 2
    variables freed in coordinate ascent  0
    rows dropped in coordinate ascent ... 0
Gradient ascent iterations .............. 0
    variables freed in gradient ascent .. 0
    rows dropped in gradient ascent ..... 0
Preconditioned CG iterations ............ 0
    variables freed in CG ............... 0
    rows dropped in CG .................. 0
SpaRSA iterations ....................... 2
    change in column activity ........... 0
    change in row activity .............. 0
    failures of Armijo step ............. 1
Proximal updates ........................ 2
Cholesky factorizations ................. 2
    nonzeros in final factor ............ 7288 99.8% sparse
    rows dropped from L ................. 0
    rows added to L ..................... 0
    rank 1 downdates to L ............... 0
    rank 1 updates to L ................. 0
    Size breakdown of the updates ([size]: number of this size):
    No. of solves by depth in the multilevel partition tree:
        (deeper <=> further from root of tree <=> fewer flops)
        depth [ 0]: 2
        depth [ 1]: 6
        depth [ 2]: 14
        depth [ 3]: 8

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 2.475977e-03
Initialization (includes partition) ..... 2.846003e-03
Phase 1 ................................. 1.009893e-02
Coordinate ascent ....................... 2.217293e-04
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 8.916855e-05
DASA .................................... 3.007174e-03
DASA line search ........................ 4.198551e-04
Check error ............................. 3.440380e-04
Proximal update ......................... 2.834797e-04
Invert permutation ...................... 1.287460e-05
Row modifications of Cholesky factor .... 5.245209e-06
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 8.430481e-04
Partial Cholesky factorization .......... 4.458427e-05
Back solves ............................. 4.124641e-04
Forward solves .......................... 1.869202e-04


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             :  8.807970809156176e-01
sup-norm of gradient:  2.369946321692995e-08
Number of iterations: 3         
Function evaluations: 6         
Gradient evaluations: 3         

!!    HAGER1   5001       0       0       0       3       6       3       3       2     0    2.3699463e-08    8.8079708e-01    0.018681
 Final f                         = 8.8079708e-01   
 Function value at final x       = 8.8079708e-01   
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   HAGER2

 Problem name: HAGER2

 Double precision version will be formed

 The objective function uses 5000 nonlinear groups
 
 There are 2500 linear equality constraints
 
 There are 5000 free variables
 There is 1 fixed variable
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully

 Problem: HAGER2 (n = 5001)
walltime at start:     0.000000

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 5.726208e-08 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 5.726207554586533e-08    
Final f                               : 4.320822586636269e-01    

Iterations of gradient projection (GP): 0         
Iterations of active set GP           : 1         
Function evaluation in main code      : 1         
Function evaluations in GP            : 0         
Function evaluations in active set GP : 1         
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 0         
Gradient evaluations in active set GP : 1         


PPROJ run statistics (Version 2.0, May 1, 2018):

No. blocks in multilevel partition of A . 15
Depth of multilevel partition tree ...... 3
Phase 1 iterations ...................... 13
Coordinate ascent iterations ............ 2
    variables freed in coordinate ascent  0
    rows dropped in coordinate ascent ... 0
Gradient ascent iterations .............. 0
    variables freed in gradient ascent .. 0
    rows dropped in gradient ascent ..... 0
Preconditioned CG iterations ............ 0
    variables freed in CG ............... 0
    rows dropped in CG .................. 0
SpaRSA iterations ....................... 2
    change in column activity ........... 0
    change in row activity .............. 0
    failures of Armijo step ............. 0
Proximal updates ........................ 2
Cholesky factorizations ................. 2
    nonzeros in final factor ............ 7288 99.8% sparse
    rows dropped from L ................. 0
    rows added to L ..................... 0
    rank 1 downdates to L ............... 0
    rank 1 updates to L ................. 0
    Size breakdown of the updates ([size]: number of this size):
    No. of solves by depth in the multilevel partition tree:
        (deeper <=> further from root of tree <=> fewer flops)
        depth [ 0]: 2
        depth [ 1]: 6
        depth [ 2]: 14
        depth [ 3]: 8

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 2.454996e-03
Initialization (includes partition) ..... 2.825975e-03
Phase 1 ................................. 1.021981e-02
Coordinate ascent ....................... 2.591610e-04
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 8.916855e-05
DASA .................................... 2.970219e-03
DASA line search ........................ 4.396439e-04
Check error ............................. 3.421307e-04
Proximal update ......................... 2.799034e-04
Invert permutation ...................... 1.311302e-05
Row modifications of Cholesky factor .... 5.722046e-06
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 8.492470e-04
Partial Cholesky factorization .......... 4.792213e-05
Back solves ............................. 4.017353e-04
Forward solves .......................... 1.866817e-04


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             :  4.320822590564583e-01
sup-norm of gradient:  5.726207554586533e-08
Number of iterations: 2         
Function evaluations: 4         
Gradient evaluations: 2         

!!    HAGER2   5001       0       0       0       2       4       2       3       2     0    5.7262076e-08    4.3208226e-01    0.019436
 Final f                         = 4.3208226e-01   
 Function value at final x       = 4.3208226e-01   
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   HAGER3

 Problem name: HAGER3

 Double precision version will be formed

 The objective function uses 5000 nonlinear groups
 
 There are 2500 linear equality constraints
 
 There are 5000 free variables
 There is 1 fixed variable
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully

 Problem: HAGER3 (n = 5001)
walltime at start:     0.000001

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 5.916466e-08 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 5.916465586918752e-08    
Final f                               : 1.409612553702352e-01    

Iterations of gradient projection (GP): 0         
Iterations of active set GP           : 1         
Function evaluation in main code      : 1         
Function evaluations in GP            : 0         
Function evaluations in active set GP : 1         
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 0         
Gradient evaluations in active set GP : 1         


PPROJ run statistics (Version 2.0, May 1, 2018):

No. blocks in multilevel partition of A . 15
Depth of multilevel partition tree ...... 3
Phase 1 iterations ...................... 13
Coordinate ascent iterations ............ 2
    variables freed in coordinate ascent  0
    rows dropped in coordinate ascent ... 0
Gradient ascent iterations .............. 0
    variables freed in gradient ascent .. 0
    rows dropped in gradient ascent ..... 0
Preconditioned CG iterations ............ 0
    variables freed in CG ............... 0
    rows dropped in CG .................. 0
SpaRSA iterations ....................... 2
    change in column activity ........... 0
    change in row activity .............. 0
    failures of Armijo step ............. 0
Proximal updates ........................ 2
Cholesky factorizations ................. 2
    nonzeros in final factor ............ 7288 99.8% sparse
    rows dropped from L ................. 0
    rows added to L ..................... 0
    rank 1 downdates to L ............... 0
    rank 1 updates to L ................. 0
    Size breakdown of the updates ([size]: number of this size):
    No. of solves by depth in the multilevel partition tree:
        (deeper <=> further from root of tree <=> fewer flops)
        depth [ 0]: 2
        depth [ 1]: 6
        depth [ 2]: 14
        depth [ 3]: 8

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 2.401829e-03
Initialization (includes partition) ..... 2.792120e-03
Phase 1 ................................. 1.020527e-02
Coordinate ascent ....................... 2.567768e-04
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 8.893013e-05
DASA .................................... 2.954960e-03
DASA line search ........................ 4.353523e-04
Check error ............................. 3.471375e-04
Proximal update ......................... 2.791882e-04
Invert permutation ...................... 1.192093e-05
Row modifications of Cholesky factor .... 3.099442e-06
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 8.478165e-04
Partial Cholesky factorization .......... 4.601479e-05
Back solves ............................. 4.017353e-04
Forward solves .......................... 1.888275e-04


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             :  1.409612556294952e-01
sup-norm of gradient:  5.916465586918752e-08
Number of iterations: 2         
Function evaluations: 4         
Gradient evaluations: 2         

!!    HAGER3   5001       0       0       0       2       4       2       3       2     0    5.9164656e-08    1.4096126e-01    0.019734
 Final f                         = 1.4096126e-01   
 Function value at final x       = 1.4096126e-01   
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   HAGER4

 Problem name: HAGER4

 Double precision version will be formed

 The objective function uses 1 nonlinear group
 
 There are 2500 linear equality constraints
 
 There are 2500 free variables
 There are 2500 variables bounded only from above 
 There is 1 fixed variable
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully

 Problem: HAGER4 (n = 5001)
walltime at start:     0.000001

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 9.845861e-07 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 9.845860532862387e-07    
Final f                               : 2.794084067845239e+00    

Iterations of gradient projection (GP): 1         
Iterations of active set GP           : 3         
Function evaluation in main code      : 1         
Function evaluations in GP            : 1         
Function evaluations in active set GP : 3         
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 1         
Gradient evaluations in active set GP : 3         


PPROJ run statistics (Version 2.0, May 1, 2018):

No. blocks in multilevel partition of A . 15
Depth of multilevel partition tree ...... 3
Phase 1 iterations ...................... 13
Coordinate ascent iterations ............ 5
    variables freed in coordinate ascent  0
    rows dropped in coordinate ascent ... 0
Gradient ascent iterations .............. 0
    variables freed in gradient ascent .. 0
    rows dropped in gradient ascent ..... 0
Preconditioned CG iterations ............ 0
    variables freed in CG ............... 0
    rows dropped in CG .................. 0
SpaRSA iterations ....................... 3
    change in column activity ........... 0
    change in row activity .............. 0
    failures of Armijo step ............. 1
Proximal updates ........................ 3
Cholesky factorizations ................. 9
    nonzeros in final factor ............ 7288 99.8% sparse
    rows dropped from L ................. 0
    rows added to L ..................... 0
    rank 1 downdates to L ............... 7
    rank 1 updates to L ................. 0
    Size breakdown of the updates ([size]: number of this size):
        updowns [  7]: 1
    No. of solves by depth in the multilevel partition tree:
        (deeper <=> further from root of tree <=> fewer flops)
        depth [ 0]: 10
        depth [ 1]: 30
        depth [ 2]: 70
        depth [ 3]: 40

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 2.430916e-03
Initialization (includes partition) ..... 3.039122e-03
Phase 1 ................................. 5.951881e-03
Coordinate ascent ....................... 2.958775e-04
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 1.380444e-04
DASA .................................... 7.343531e-03
DASA line search ........................ 1.341105e-03
Check error ............................. 1.258612e-03
Proximal update ......................... 4.377365e-04
Invert permutation ...................... 3.147125e-05
Row modifications of Cholesky factor .... 1.621246e-05
Column modifications of Cholesky factor . 1.029968e-04
Cholesky factorization .................. 2.947092e-03
Partial Cholesky factorization .......... 2.121925e-04
Back solves ............................. 5.903244e-04
Forward solves .......................... 4.036427e-04


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             :  2.794256324971653e+00
sup-norm of gradient:  1.459248928800181e-06
Number of iterations: 1         
Function evaluations: 2         
Gradient evaluations: 1         

!!    HAGER4   5001       1       1       1       1       2       1       6       9     0    9.8458605e-07    2.7940841e+00    0.020172
 Final f                         = 2.7940841e+00   
 Function value at final x       = 2.7940841e+00   
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   HIMMELBI

 Problem name: HIMMELBI

 Double precision version will be formed

 The objective function uses 20 nonlinear groups
 
 There are 12 linear inequality constraints
 
 There are 100 variables bounded from below and above 
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully

 Problem: HIMMELBI (n = 100)
walltime at start:     0.000000

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 8.599032e-07 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 8.599032238413955e-07    
Final f                               : -1.735569579855782e+03   

Iterations of gradient projection (GP): 2         
Iterations of active set GP           : 31        
Function evaluation in main code      : 1         
Function evaluations in GP            : 3         
Function evaluations in active set GP : 39        
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 2         
Gradient evaluations in active set GP : 31        


PPROJ run statistics (Version 2.0, May 1, 2018):

No. blocks in multilevel partition of A . 1
Depth of multilevel partition tree ...... 0
Phase 1 iterations ...................... 5
Coordinate ascent iterations ............ 8
    variables freed in coordinate ascent  4
    rows dropped in coordinate ascent ... 0
Gradient ascent iterations .............. 0
    variables freed in gradient ascent .. 0
    rows dropped in gradient ascent ..... 0
Preconditioned CG iterations ............ 0
    variables freed in CG ............... 0
    rows dropped in CG .................. 0
SpaRSA iterations ....................... 18
    change in column activity ........... 32
    change in row activity .............. 0
    failures of Armijo step ............. 7
Proximal updates ........................ 18
Cholesky factorizations ................. 5
    nonzeros in final factor ............ 11 85.9% sparse
    rows dropped from L ................. 2
    rows added to L ..................... 4
    rank 1 downdates to L ............... 49
    rank 1 updates to L ................. 19
    Size breakdown of the updates ([size]: number of this size):
        updowns [  1]: 26
        updowns [  2]: 2
        updowns [  3]: 2
        updowns [  7]: 1
        updowns [ 12]: 1
        updowns [ 13]: 1
    No. of solves:   19

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 5.793571e-05
Initialization (includes partition) ..... 1.494884e-04
Phase 1 ................................. 1.165867e-04
Coordinate ascent ....................... 1.382828e-05
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 3.814697e-06
DASA .................................... 3.859997e-04
DASA line search ........................ 2.431870e-05
Check error ............................. 8.463860e-05
Proximal update ......................... 9.441376e-05
Invert permutation ...................... 3.027916e-05
Row modifications of Cholesky factor .... 2.455711e-05
Column modifications of Cholesky factor . 1.099110e-04
Cholesky factorization .................. 4.005432e-05
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 1.358986e-05
Forward solves .......................... 1.716614e-05


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             : -1.735569579855782e+03
sup-norm of gradient:  8.599032238413955e-07
Number of iterations: 59        
Function evaluations: 104       
Gradient evaluations: 59        

!!  HIMMELBI    100       2       3       2      59     104      59      35       5     0    8.5990322e-07   -1.7355696e+03    0.003878
 Final f                         = -1.7355696e+03  
 Function value at final x       = -1.7355696e+03  
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   HONG

 Problem name: HONG

 Double precision version will be formed

 The objective function uses 1 nonlinear group
 
 There is 1 linear equality constraint
 
 There are 4 variables bounded from below and above 
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully

 Problem: HONG (n = 4)
walltime at start:     0.000001

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 7.583759e-07 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 7.583759191742701e-07    
Final f                               : 2.257108736348865e+01    

Iterations of gradient projection (GP): 1         
Iterations of active set GP           : 1         
Function evaluation in main code      : 1         
Function evaluations in GP            : 1         
Function evaluations in active set GP : 1         
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 1         
Gradient evaluations in active set GP : 1         


PPROJ run statistics (Version 2.0, May 1, 2018):

No. blocks in multilevel partition of A . 1
Depth of multilevel partition tree ...... 0
Phase 1 iterations ...................... 5
Coordinate ascent iterations ............ 1
    variables freed in coordinate ascent  0
    rows dropped in coordinate ascent ... 0
Gradient ascent iterations .............. 0
    variables freed in gradient ascent .. 0
    rows dropped in gradient ascent ..... 0
Preconditioned CG iterations ............ 0
    variables freed in CG ............... 0
    rows dropped in CG .................. 0
SpaRSA iterations ....................... 2
    change in column activity ........... 0
    change in row activity .............. 0
    failures of Armijo step ............. 0
Proximal updates ........................ 2
Cholesky factorizations ................. 2
    nonzeros in final factor ............ 1  0.0% sparse
    rows dropped from L ................. 0
    rows added to L ..................... 0
    rank 1 downdates to L ............... 0
    rank 1 updates to L ................. 0
    Size breakdown of the updates ([size]: number of this size):
    No. of solves:   2

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 2.884865e-05
Initialization (includes partition) ..... 6.031990e-05
Phase 1 ................................. 3.170967e-05
Coordinate ascent ....................... 1.192093e-06
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 9.536743e-07
DASA .................................... 5.364418e-05
DASA line search ........................ 2.861023e-06
Check error ............................. 1.502037e-05
Proximal update ......................... 1.096725e-05
Invert permutation ...................... 5.006790e-06
Row modifications of Cholesky factor .... 0.000000e+00
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 1.597404e-05
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 4.053116e-06
Forward solves .......................... 1.907349e-06


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             :  2.257108736348907e+01
sup-norm of gradient:  7.583759191742701e-07
Number of iterations: 5         
Function evaluations: 10        
Gradient evaluations: 5         

!!      HONG      4       1       1       1       5      10       5       4       2     0    7.5837592e-07    2.2571087e+01    0.000317
 Final f                         = 2.2571087e+01   
 Function value at final x       = 2.2571087e+01   
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   HS105

 Problem name: HS105

 Double precision version will be formed

 The objective function uses 235 nonlinear groups
 
 There is 1 linear inequality constraint
 
 There are 8 variables bounded from below and above 
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully

 Problem: HS105 (n = 8)
walltime at start:     0.000001

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 2.745314e-07 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 2.745314341689070e-07    
Final f                               : 1.044725129680992e+03    

Iterations of gradient projection (GP): 2         
Iterations of active set GP           : 8         
Function evaluation in main code      : 1         
Function evaluations in GP            : 5         
Function evaluations in active set GP : 10        
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 2         
Gradient evaluations in active set GP : 8         


PPROJ run statistics (Version 2.0, May 1, 2018):

No. blocks in multilevel partition of A . 1
Depth of multilevel partition tree ...... 0
Phase 1 iterations ...................... 5
Coordinate ascent iterations ............ 3
    variables freed in coordinate ascent  0
    rows dropped in coordinate ascent ... 0
Gradient ascent iterations .............. 3
    variables freed in gradient ascent .. 0
    rows dropped in gradient ascent ..... 0
Preconditioned CG iterations ............ 3
    variables freed in CG ............... 0
    rows dropped in CG .................. 0
SpaRSA iterations ....................... 3
    change in column activity ........... 0
    change in row activity .............. 0
    failures of Armijo step ............. 0
Proximal updates ........................ 3
Cholesky factorizations ................. 0
    nonzeros in final factor ............ 0 100.0% sparse
    rows dropped from L ................. 0
    rows added to L ..................... 0
    rank 1 downdates to L ............... 0
    rank 1 updates to L ................. 0
    Size breakdown of the updates ([size]: number of this size):
    No. of solves:   0

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 2.408028e-05
Initialization (includes partition) ..... 5.173683e-05
Phase 1 ................................. 3.361702e-05
Coordinate ascent ....................... 1.907349e-06
SSOR0 ................................... 2.861023e-06
SSOR1 ................................... 1.907349e-06
SpaRSA .................................. 1.192093e-06
DASA .................................... 3.123283e-05
DASA line search ........................ 0.000000e+00
Check error ............................. 1.573563e-05
Proximal update ......................... 9.536743e-06
Invert permutation ...................... 8.106232e-06
Row modifications of Cholesky factor .... 0.000000e+00
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 0.000000e+00
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 0.000000e+00
Forward solves .......................... 0.000000e+00


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             :  1.044725129680992e+03
sup-norm of gradient:  2.745314341689070e-07
Number of iterations: 56        
Function evaluations: 114       
Gradient evaluations: 66        

!!     HS105      8       2       5       2      56     114      66      12       0     0    2.7453143e-07    1.0447251e+03    0.011604
 Final f                         = 1.0447251e+03   
 Function value at final x       = 1.0447251e+03   
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   HS112

 Problem name: HS112

 Double precision version will be formed

 The objective function uses 1 nonlinear group
 
 There are 3 linear equality constraints
 
 There are 10 variables bounded only from below 
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully

 Problem: HS112 (n = 10)
walltime at start:     0.000000

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 8.537884e-07 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 8.537884084169889e-07    
Final f                               : -4.776109085936812e+01   

Iterations of gradient projection (GP): 2         
Iterations of active set GP           : 3         
Function evaluation in main code      : 1         
Function evaluations in GP            : 6         
Function evaluations in active set GP : 6         
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 2         
Gradient evaluations in active set GP : 3         


PPROJ run statistics (Version 2.0, May 1, 2018):

No. blocks in multilevel partition of A . 1
Depth of multilevel partition tree ...... 0
Phase 1 iterations ...................... 5
Coordinate ascent iterations ............ 8
    variables freed in coordinate ascent  6
    rows dropped in coordinate ascent ... 0
Gradient ascent iterations .............. 0
    variables freed in gradient ascent .. 0
    rows dropped in gradient ascent ..... 0
Preconditioned CG iterations ............ 0
    variables freed in CG ............... 0
    rows dropped in CG .................. 0
SpaRSA iterations ....................... 6
    change in column activity ........... 17
    change in row activity .............. 0
    failures of Armijo step ............. 0
Proximal updates ........................ 6
Cholesky factorizations ................. 10
    nonzeros in final factor ............ 6  0.0% sparse
    rows dropped from L ................. 0
    rows added to L ..................... 0
    rank 1 downdates to L ............... 0
    rank 1 updates to L ................. 0
    Size breakdown of the updates ([size]: number of this size):
    No. of solves:   10

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 3.099442e-05
Initialization (includes partition) ..... 6.675720e-05
Phase 1 ................................. 4.220009e-05
Coordinate ascent ....................... 1.168251e-05
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 9.536743e-07
DASA .................................... 1.480579e-04
DASA line search ........................ 1.120567e-05
Check error ............................. 4.243851e-05
Proximal update ......................... 2.551079e-05
Invert permutation ...................... 6.914139e-06
Row modifications of Cholesky factor .... 0.000000e+00
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 3.576279e-05
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 5.006790e-06
Forward solves .......................... 6.914139e-06


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             : -4.776109085936589e+01
sup-norm of gradient:  8.537884084169889e-07
Number of iterations: 22        
Function evaluations: 46        
Gradient evaluations: 25        

!!     HS112     10       2       6       2      22      46      25       8      10     0    8.5378841e-07   -4.7761091e+01    0.000641
 Final f                         = -4.7761091e+01  
 Function value at final x       = -4.7761091e+01  
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   HS119

 Problem name: HS119

 Double precision version will be formed

 The objective function uses 16 nonlinear groups
 
 There are 8 linear equality constraints
 
 There are 16 variables bounded from below and above 
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully

 Problem: HS119 (n = 16)
walltime at start:     0.000001

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 1.115542e-08 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 1.115542245036516e-08    
Final f                               : 2.448996975167498e+02    

Iterations of gradient projection (GP): 0         
Iterations of active set GP           : 4         
Function evaluation in main code      : 1         
Function evaluations in GP            : 0         
Function evaluations in active set GP : 4         
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 0         
Gradient evaluations in active set GP : 4         


PPROJ run statistics (Version 2.0, May 1, 2018):

No. blocks in multilevel partition of A . 1
Depth of multilevel partition tree ...... 0
Phase 1 iterations ...................... 5
Coordinate ascent iterations ............ 6
    variables freed in coordinate ascent  1
    rows dropped in coordinate ascent ... 0
Gradient ascent iterations .............. 0
    variables freed in gradient ascent .. 0
    rows dropped in gradient ascent ..... 0
Preconditioned CG iterations ............ 0
    variables freed in CG ............... 0
    rows dropped in CG .................. 0
SpaRSA iterations ....................... 5
    change in column activity ........... 2
    change in row activity .............. 0
    failures of Armijo step ............. 2
Proximal updates ........................ 5
Cholesky factorizations ................. 2
    nonzeros in final factor ............ 36  0.0% sparse
    rows dropped from L ................. 0
    rows added to L ..................... 0
    rank 1 downdates to L ............... 5
    rank 1 updates to L ................. 12
    Size breakdown of the updates ([size]: number of this size):
        updowns [  1]: 8
        updowns [  2]: 2
        updowns [  5]: 1
    No. of solves:   13

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 3.790855e-05
Initialization (includes partition) ..... 8.678436e-05
Phase 1 ................................. 6.914139e-05
Coordinate ascent ....................... 8.344650e-06
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 1.907349e-06
DASA .................................... 2.398491e-04
DASA line search ........................ 1.955032e-05
Check error ............................. 3.862381e-05
Proximal update ......................... 3.433228e-05
Invert permutation ...................... 6.675720e-06
Row modifications of Cholesky factor .... 3.337860e-06
Column modifications of Cholesky factor . 6.175041e-05
Cholesky factorization .................. 2.408028e-05
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 1.406670e-05
Forward solves .......................... 1.025200e-05


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             :  2.448996975168007e+02
sup-norm of gradient:  1.115542245036516e-08
Number of iterations: 4         
Function evaluations: 8         
Gradient evaluations: 4         

!!     HS119     16       0       0       0       4       8       4       6       2     0    1.1155422e-08    2.4489970e+02    0.000693
 Final f                         = 2.4489970e+02   
 Function value at final x       = 2.4489970e+02   
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   HS24

 Problem name: HS24

 Double precision version will be formed

 The objective function uses 1 nonlinear group
 
 There are 3 linear inequality constraints
 
 There are 2 variables bounded only from below 
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully

 Problem: HS24 (n = 2)
walltime at start:     0.000000

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 5.662137e-14 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 5.662137425588298e-14    
Final f                               : -1.000000082692019e+00   

Iterations of gradient projection (GP): 0         
Iterations of active set GP           : 1         
Function evaluation in main code      : 1         
Function evaluations in GP            : 0         
Function evaluations in active set GP : 1         
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 0         
Gradient evaluations in active set GP : 1         


PPROJ run statistics (Version 2.0, May 1, 2018):

No. blocks in multilevel partition of A . 1
Depth of multilevel partition tree ...... 0
Phase 1 iterations ...................... 5
Coordinate ascent iterations ............ 0
    variables freed in coordinate ascent  0
    rows dropped in coordinate ascent ... 0
Gradient ascent iterations .............. 0
    variables freed in gradient ascent .. 0
    rows dropped in gradient ascent ..... 0
Preconditioned CG iterations ............ 0
    variables freed in CG ............... 0
    rows dropped in CG .................. 0
SpaRSA iterations ....................... 1
    change in column activity ........... 0
    change in row activity .............. 0
    failures of Armijo step ............. 0
Proximal updates ........................ 1
Cholesky factorizations ................. 1
    nonzeros in final factor ............ 1 83.3% sparse
    rows dropped from L ................. 0
    rows added to L ..................... 1
    rank 1 downdates to L ............... 0
    rank 1 updates to L ................. 0
    Size breakdown of the updates ([size]: number of this size):
    No. of solves:   1

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 2.884865e-05
Initialization (includes partition) ..... 5.483627e-05
Phase 1 ................................. 4.029274e-05
Coordinate ascent ....................... 0.000000e+00
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 5.960464e-06
DASA .................................... 3.981590e-05
DASA line search ........................ 2.861023e-06
Check error ............................. 1.192093e-05
Proximal update ......................... 9.059906e-06
Invert permutation ...................... 2.861023e-06
Row modifications of Cholesky factor .... 6.198883e-06
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 1.406670e-05
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 1.907349e-06
Forward solves .......................... 9.536743e-07


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             : -1.000000082692005e+00
sup-norm of gradient:  1.717347671762134e-01
Number of iterations: 1         
Function evaluations: 2         
Gradient evaluations: 1         

!!      HS24      2       0       0       0       1       2       1       3       1     0    5.6621374e-14   -1.0000001e+00    0.000271
 Final f                         = -1.0000001e+00  
 Function value at final x       = -1.0000001e+00  
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   HS36

 Problem name: HS36

 Double precision version will be formed

 The objective function uses 1 nonlinear group
 
 There is 1 linear inequality constraint
 
 There are 3 variables bounded from below and above 
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully

 Problem: HS36 (n = 3)
walltime at start:     0.000000

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 6.252776e-12 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 6.252776074688882e-12    
Final f                               : -3.300000000000131e+03   

Iterations of gradient projection (GP): 1         
Iterations of active set GP           : 1         
Function evaluation in main code      : 1         
Function evaluations in GP            : 1         
Function evaluations in active set GP : 1         
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 1         
Gradient evaluations in active set GP : 1         


PPROJ run statistics (Version 2.0, May 1, 2018):

No. blocks in multilevel partition of A . 1
Depth of multilevel partition tree ...... 0
Phase 1 iterations ...................... 5
Coordinate ascent iterations ............ 2
    variables freed in coordinate ascent  0
    rows dropped in coordinate ascent ... 0
Gradient ascent iterations .............. 0
    variables freed in gradient ascent .. 0
    rows dropped in gradient ascent ..... 0
Preconditioned CG iterations ............ 0
    variables freed in CG ............... 0
    rows dropped in CG .................. 0
SpaRSA iterations ....................... 3
    change in column activity ........... 0
    change in row activity .............. 0
    failures of Armijo step ............. 0
Proximal updates ........................ 3
Cholesky factorizations ................. 3
    nonzeros in final factor ............ 1  0.0% sparse
    rows dropped from L ................. 0
    rows added to L ..................... 0
    rank 1 downdates to L ............... 0
    rank 1 updates to L ................. 0
    Size breakdown of the updates ([size]: number of this size):
    No. of solves:   3

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 2.312660e-05
Initialization (includes partition) ..... 4.863739e-05
Phase 1 ................................. 3.290176e-05
Coordinate ascent ....................... 3.099442e-06
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 1.192093e-06
DASA .................................... 5.984306e-05
DASA line search ........................ 5.006790e-06
Check error ............................. 1.740456e-05
Proximal update ......................... 1.382828e-05
Invert permutation ...................... 4.053116e-06
Row modifications of Cholesky factor .... 0.000000e+00
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 1.668930e-05
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 1.907349e-06
Forward solves .......................... 4.053116e-06


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Number of iterations: 0         
Function evaluations: 0         
Gradient evaluations: 0         

!!      HS36      3       1       1       1       0       0       0       4       3     0    6.2527761e-12   -3.3000000e+03    0.000252
 Final f                         = -3.3000000e+03  
 Function value at final x       = -3.3000000e+03  
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   HS37

 Problem name: HS37

 Double precision version will be formed

 The objective function uses 1 nonlinear group
 
 There are 2 linear inequality constraints
 
 There are 3 variables bounded from below and above 
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully

 Problem: HS37 (n = 3)
walltime at start:     0.000001

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 3.379961e-08 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 3.379961222016448e-08    
Final f                               : -3.456000000000205e+03   

Iterations of gradient projection (GP): 1         
Iterations of active set GP           : 1         
Function evaluation in main code      : 1         
Function evaluations in GP            : 1         
Function evaluations in active set GP : 1         
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 1         
Gradient evaluations in active set GP : 1         


PPROJ run statistics (Version 2.0, May 1, 2018):

No. blocks in multilevel partition of A . 1
Depth of multilevel partition tree ...... 0
Phase 1 iterations ...................... 5
Coordinate ascent iterations ............ 1
    variables freed in coordinate ascent  0
    rows dropped in coordinate ascent ... 0
Gradient ascent iterations .............. 0
    variables freed in gradient ascent .. 0
    rows dropped in gradient ascent ..... 0
Preconditioned CG iterations ............ 0
    variables freed in CG ............... 0
    rows dropped in CG .................. 0
SpaRSA iterations ....................... 2
    change in column activity ........... 0
    change in row activity .............. 0
    failures of Armijo step ............. 1
Proximal updates ........................ 2
Cholesky factorizations ................. 2
    nonzeros in final factor ............ 1 66.7% sparse
    rows dropped from L ................. 0
    rows added to L ..................... 0
    rank 1 downdates to L ............... 0
    rank 1 updates to L ................. 0
    Size breakdown of the updates ([size]: number of this size):
    No. of solves:   2

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 3.099442e-05
Initialization (includes partition) ..... 6.294250e-05
Phase 1 ................................. 3.814697e-05
Coordinate ascent ....................... 2.145767e-06
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 2.145767e-06
DASA .................................... 6.389618e-05
DASA line search ........................ 5.006790e-06
Check error ............................. 1.573563e-05
Proximal update ......................... 1.239777e-05
Invert permutation ...................... 4.768372e-06
Row modifications of Cholesky factor .... 0.000000e+00
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 1.692772e-05
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 1.907349e-06
Forward solves .......................... 1.907349e-06


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             : -3.456000000000002e+03
sup-norm of gradient:  3.379961222016448e-08
Number of iterations: 3         
Function evaluations: 6         
Gradient evaluations: 3         

!!      HS37      3       1       1       1       3       6       3       4       2     0    3.3799612e-08   -3.4560000e+03    0.000318
 Final f                         = -3.4560000e+03  
 Function value at final x       = -3.4560000e+03  
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   HS41

 Problem name: HS41

 Double precision version will be formed

 The objective function uses 1 nonlinear group
 
 There is 1 linear equality constraint
 
 There are 4 variables bounded from below and above 
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully

 Problem: HS41 (n = 4)
walltime at start:     0.000001

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 2.271587e-07 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 2.271587336230303e-07    
Final f                               : 1.925925925926049e+00    

Iterations of gradient projection (GP): 0         
Iterations of active set GP           : 2         
Function evaluation in main code      : 1         
Function evaluations in GP            : 0         
Function evaluations in active set GP : 2         
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 0         
Gradient evaluations in active set GP : 2         


PPROJ run statistics (Version 2.0, May 1, 2018):

No. blocks in multilevel partition of A . 1
Depth of multilevel partition tree ...... 0
Phase 1 iterations ...................... 5
Coordinate ascent iterations ............ 0
    variables freed in coordinate ascent  0
    rows dropped in coordinate ascent ... 0
Gradient ascent iterations .............. 0
    variables freed in gradient ascent .. 0
    rows dropped in gradient ascent ..... 0
Preconditioned CG iterations ............ 0
    variables freed in CG ............... 0
    rows dropped in CG .................. 0
SpaRSA iterations ....................... 1
    change in column activity ........... 0
    change in row activity .............. 0
    failures of Armijo step ............. 0
Proximal updates ........................ 1
Cholesky factorizations ................. 1
    nonzeros in final factor ............ 1  0.0% sparse
    rows dropped from L ................. 0
    rows added to L ..................... 0
    rank 1 downdates to L ............... 0
    rank 1 updates to L ................. 0
    Size breakdown of the updates ([size]: number of this size):
    No. of solves:   1

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 2.288818e-05
Initialization (includes partition) ..... 5.030632e-05
Phase 1 ................................. 3.075600e-05
Coordinate ascent ....................... 0.000000e+00
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 5.006790e-06
DASA .................................... 3.600121e-05
DASA line search ........................ 2.861023e-06
Check error ............................. 1.001358e-05
Proximal update ......................... 8.106232e-06
Invert permutation ...................... 2.861023e-06
Row modifications of Cholesky factor .... 0.000000e+00
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 1.192093e-05
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 1.907349e-06
Forward solves .......................... 9.536743e-07


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             :  1.925925925926057e+00
sup-norm of gradient:  2.271587336230303e-07
Number of iterations: 3         
Function evaluations: 6         
Gradient evaluations: 3         

!!      HS41      4       0       0       0       3       6       3       4       1     0    2.2715873e-07    1.9259259e+00    0.000238
 Final f                         = 1.9259259e+00   
 Function value at final x       = 1.9259259e+00   
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   HS49

 Problem name: HS49

 Double precision version will be formed

 The objective function uses 1 nonlinear group
 
 There are 2 linear equality constraints
 
 There are 5 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully

 Problem: HS49 (n = 5)
walltime at start:     0.000001

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 3.113731e-07 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 3.113730802084547e-07    
Final f                               : 2.308278040061817e-11    

Iterations of gradient projection (GP): 0         
Iterations of active set GP           : 1         
Function evaluation in main code      : 1         
Function evaluations in GP            : 0         
Function evaluations in active set GP : 1         
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 0         
Gradient evaluations in active set GP : 1         


PPROJ run statistics (Version 2.0, May 1, 2018):

No. blocks in multilevel partition of A . 1
Depth of multilevel partition tree ...... 0
Phase 1 iterations ...................... 5
Coordinate ascent iterations ............ 0
    variables freed in coordinate ascent  0
    rows dropped in coordinate ascent ... 0
Gradient ascent iterations .............. 0
    variables freed in gradient ascent .. 0
    rows dropped in gradient ascent ..... 0
Preconditioned CG iterations ............ 0
    variables freed in CG ............... 0
    rows dropped in CG .................. 0
SpaRSA iterations ....................... 1
    change in column activity ........... 0
    change in row activity .............. 0
    failures of Armijo step ............. 0
Proximal updates ........................ 1
Cholesky factorizations ................. 1
    nonzeros in final factor ............ 3  0.0% sparse
    rows dropped from L ................. 0
    rows added to L ..................... 0
    rank 1 downdates to L ............... 0
    rank 1 updates to L ................. 0
    Size breakdown of the updates ([size]: number of this size):
    No. of solves:   1

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 3.194809e-05
Initialization (includes partition) ..... 6.318092e-05
Phase 1 ................................. 3.790855e-05
Coordinate ascent ....................... 0.000000e+00
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 5.960464e-06
DASA .................................... 4.100800e-05
DASA line search ........................ 3.099442e-06
Check error ............................. 9.059906e-06
Proximal update ......................... 9.059906e-06
Invert permutation ...................... 4.053116e-06
Row modifications of Cholesky factor .... 0.000000e+00
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 1.406670e-05
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 1.907349e-06
Forward solves .......................... 1.907349e-06


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             :  3.024207500282027e-11
sup-norm of gradient:  3.113730802084547e-07
Number of iterations: 14        
Function evaluations: 28        
Gradient evaluations: 14        

!!      HS49      5       0       0       0      14      28      14       3       1     0    3.1137308e-07    2.3082780e-11    0.000293
 Final f                         = 2.3082780e-11   
 Function value at final x       = 2.3082780e-11   
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   HS50

 Problem name: HS50

 Double precision version will be formed

 The objective function uses 1 nonlinear group
 
 There are 3 linear equality constraints
 
 There are 5 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully

 Problem: HS50 (n = 5)
walltime at start:     0.000000

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 1.755041e-12 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 1.755040557327447e-12    
Final f                               : 4.656080162339169e-26    

Iterations of gradient projection (GP): 0         
Iterations of active set GP           : 1         
Function evaluation in main code      : 1         
Function evaluations in GP            : 0         
Function evaluations in active set GP : 2         
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 0         
Gradient evaluations in active set GP : 1         


PPROJ run statistics (Version 2.0, May 1, 2018):

No. blocks in multilevel partition of A . 1
Depth of multilevel partition tree ...... 0
Phase 1 iterations ...................... 5
Coordinate ascent iterations ............ 1
    variables freed in coordinate ascent  0
    rows dropped in coordinate ascent ... 0
Gradient ascent iterations .............. 0
    variables freed in gradient ascent .. 0
    rows dropped in gradient ascent ..... 0
Preconditioned CG iterations ............ 0
    variables freed in CG ............... 0
    rows dropped in CG .................. 0
SpaRSA iterations ....................... 1
    change in column activity ........... 0
    change in row activity .............. 0
    failures of Armijo step ............. 0
Proximal updates ........................ 1
Cholesky factorizations ................. 1
    nonzeros in final factor ............ 6  0.0% sparse
    rows dropped from L ................. 0
    rows added to L ..................... 0
    rank 1 downdates to L ............... 0
    rank 1 updates to L ................. 0
    Size breakdown of the updates ([size]: number of this size):
    No. of solves:   1

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 2.503395e-05
Initialization (includes partition) ..... 5.483627e-05
Phase 1 ................................. 3.099442e-05
Coordinate ascent ....................... 9.536743e-07
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 5.006790e-06
DASA .................................... 4.005432e-05
DASA line search ........................ 1.907349e-06
Check error ............................. 7.867813e-06
Proximal update ......................... 6.914139e-06
Invert permutation ...................... 3.814697e-06
Row modifications of Cholesky factor .... 0.000000e+00
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 1.311302e-05
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 2.145767e-06
Forward solves .......................... 1.907349e-06


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             :  1.246092681006800e-11
sup-norm of gradient:  1.755040557327447e-12
Number of iterations: 10        
Function evaluations: 20        
Gradient evaluations: 10        

!!      HS50      5       0       0       0      10      20      10       3       1     0    1.7550406e-12    4.6560802e-26    0.000256
 Final f                         = 4.6560802e-26   
 Function value at final x       = 4.6560802e-26   
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   HS54

 Problem name: HS54

 Double precision version will be formed

 The objective function uses 1 nonlinear group
 
 There is 1 linear equality constraint
 
 There are 6 variables bounded from below and above 
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully

 Problem: HS54 (n = 6)
walltime at start:     0.000001

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 4.014581e-07 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 4.014580797440046e-07    
Final f                               : -8.674088253776221e-01   

Iterations of gradient projection (GP): 0         
Iterations of active set GP           : 1         
Function evaluation in main code      : 1         
Function evaluations in GP            : 0         
Function evaluations in active set GP : 5         
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 0         
Gradient evaluations in active set GP : 1         


PPROJ run statistics (Version 2.0, May 1, 2018):

No. blocks in multilevel partition of A . 1
Depth of multilevel partition tree ...... 0
Phase 1 iterations ...................... 5
Coordinate ascent iterations ............ 2
    variables freed in coordinate ascent  0
    rows dropped in coordinate ascent ... 0
Gradient ascent iterations .............. 0
    variables freed in gradient ascent .. 0
    rows dropped in gradient ascent ..... 0
Preconditioned CG iterations ............ 0
    variables freed in CG ............... 0
    rows dropped in CG .................. 0
SpaRSA iterations ....................... 3
    change in column activity ........... 0
    change in row activity .............. 0
    failures of Armijo step ............. 0
Proximal updates ........................ 3
Cholesky factorizations ................. 3
    nonzeros in final factor ............ 1  0.0% sparse
    rows dropped from L ................. 0
    rows added to L ..................... 0
    rank 1 downdates to L ............... 0
    rank 1 updates to L ................. 0
    Size breakdown of the updates ([size]: number of this size):
    No. of solves:   3

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 2.217293e-05
Initialization (includes partition) ..... 4.792213e-05
Phase 1 ................................. 2.694130e-05
Coordinate ascent ....................... 1.907349e-06
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 9.536743e-07
DASA .................................... 5.793571e-05
DASA line search ........................ 3.099442e-06
Check error ............................. 1.454353e-05
Proximal update ......................... 1.192093e-05
Invert permutation ...................... 3.337860e-06
Row modifications of Cholesky factor .... 0.000000e+00
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 1.573563e-05
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 2.861023e-06
Forward solves .......................... 4.053116e-06


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             : -8.674088199111348e-01
sup-norm of gradient:  4.014580797440046e-07
Number of iterations: 11        
Function evaluations: 28        
Gradient evaluations: 18        

!!      HS54      6       0       0       0      11      28      18       4       3     0    4.0145808e-07   -8.6740883e-01    0.000300
 Final f                         = -8.6740883e-01  
 Function value at final x       = -8.6740883e-01  
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   HS55

 Problem name: HS55

 Double precision version will be formed

 The objective function uses 1 nonlinear group
 
 There are 6 linear equality constraints
 
 There are 4 variables bounded only from below 
 There are 2 variables bounded from below and above 
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully

 Problem: HS55 (n = 6)
walltime at start:     0.000000

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 7.651657e-13 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 7.651657085716579e-13    
Final f                               : 6.666666666666802e+00    

Iterations of gradient projection (GP): 0         
Iterations of active set GP           : 0         
Function evaluation in main code      : 1         
Function evaluations in GP            : 0         
Function evaluations in active set GP : 0         
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 0         
Gradient evaluations in active set GP : 0         


PPROJ run statistics (Version 2.0, May 1, 2018):

No. blocks in multilevel partition of A . 1
Depth of multilevel partition tree ...... 0
Phase 1 iterations ...................... 5
Coordinate ascent iterations ............ 2
    variables freed in coordinate ascent  0
    rows dropped in coordinate ascent ... 0
Gradient ascent iterations .............. 0
    variables freed in gradient ascent .. 0
    rows dropped in gradient ascent ..... 0
Preconditioned CG iterations ............ 0
    variables freed in CG ............... 0
    rows dropped in CG .................. 0
SpaRSA iterations ....................... 2
    change in column activity ........... 0
    change in row activity .............. 0
    failures of Armijo step ............. 1
Proximal updates ........................ 2
Cholesky factorizations ................. 2
    nonzeros in final factor ............ 16 23.8% sparse
    rows dropped from L ................. 0
    rows added to L ..................... 0
    rank 1 downdates to L ............... 0
    rank 1 updates to L ................. 0
    Size breakdown of the updates ([size]: number of this size):
    No. of solves:   2

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 5.197525e-05
Initialization (includes partition) ..... 8.106232e-05
Phase 1 ................................. 3.623962e-05
Coordinate ascent ....................... 3.814697e-06
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 1.907349e-06
DASA .................................... 6.270409e-05
DASA line search ........................ 2.861023e-06
Check error ............................. 1.502037e-05
Proximal update ......................... 1.311302e-05
Invert permutation ...................... 1.907349e-06
Row modifications of Cholesky factor .... 0.000000e+00
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 1.811981e-05
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 1.907349e-06
Forward solves .......................... 4.053116e-06


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Number of iterations: 0         
Function evaluations: 0         
Gradient evaluations: 0         

!!      HS55      6       0       0       0       0       0       0       2       2     0    7.6516571e-13    6.6666667e+00    0.000272
 Final f                         = 6.6666667e+00   
 Function value at final x       = 6.6666667e+00   
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   HS62

 Problem name: HS62

 Double precision version will be formed

 The objective function uses 1 nonlinear group
 
 There is 1 linear equality constraint
 
 There are 3 variables bounded from below and above 
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully

 Problem: HS62 (n = 3)
walltime at start:     0.000000

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 7.851161e-07 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 7.851160717109451e-07    
Final f                               : -2.627251464797164e+04   

Iterations of gradient projection (GP): 1         
Iterations of active set GP           : 1         
Function evaluation in main code      : 1         
Function evaluations in GP            : 2         
Function evaluations in active set GP : 2         
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 1         
Gradient evaluations in active set GP : 1         


PPROJ run statistics (Version 2.0, May 1, 2018):

No. blocks in multilevel partition of A . 1
Depth of multilevel partition tree ...... 0
Phase 1 iterations ...................... 5
Coordinate ascent iterations ............ 2
    variables freed in coordinate ascent  0
    rows dropped in coordinate ascent ... 0
Gradient ascent iterations .............. 0
    variables freed in gradient ascent .. 0
    rows dropped in gradient ascent ..... 0
Preconditioned CG iterations ............ 0
    variables freed in CG ............... 0
    rows dropped in CG .................. 0
SpaRSA iterations ....................... 3
    change in column activity ........... 1
    change in row activity .............. 0
    failures of Armijo step ............. 3
Proximal updates ........................ 3
Cholesky factorizations ................. 3
    nonzeros in final factor ............ 1  0.0% sparse
    rows dropped from L ................. 0
    rows added to L ..................... 0
    rank 1 downdates to L ............... 0
    rank 1 updates to L ................. 0
    Size breakdown of the updates ([size]: number of this size):
    No. of solves:   3

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 2.384186e-05
Initialization (includes partition) ..... 4.529953e-05
Phase 1 ................................. 2.884865e-05
Coordinate ascent ....................... 3.099442e-06
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 9.536743e-07
DASA .................................... 6.008148e-05
DASA line search ........................ 3.814697e-06
Check error ............................. 1.502037e-05
Proximal update ......................... 1.215935e-05
Invert permutation ...................... 4.053116e-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 ............................. 2.145767e-06
Forward solves .......................... 2.861023e-06


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             : -2.627251464797159e+04
sup-norm of gradient:  7.851160717109451e-07
Number of iterations: 10        
Function evaluations: 20        
Gradient evaluations: 10        

!!      HS62      3       1       2       1      10      20      10       5       3     0    7.8511607e-07   -2.6272515e+04    0.000304
 Final f                         = -2.6272515e+04  
 Function value at final x       = -2.6272515e+04  
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   HS86

 Problem name: HS86

 Double precision version will be formed

 The objective function uses 1 nonlinear group
 
 There are 10 linear inequality constraints
 
 There are 5 variables bounded only from below 
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully

 Problem: HS86 (n = 5)
walltime at start:     0.000000

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 1.445101e-09 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 1.445100920708948e-09    
Final f                               : -3.234867896572663e+01   

Iterations of gradient projection (GP): 2         
Iterations of active set GP           : 3         
Function evaluation in main code      : 1         
Function evaluations in GP            : 2         
Function evaluations in active set GP : 4         
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 2         
Gradient evaluations in active set GP : 3         


PPROJ run statistics (Version 2.0, May 1, 2018):

No. blocks in multilevel partition of A . 1
Depth of multilevel partition tree ...... 0
Phase 1 iterations ...................... 5
Coordinate ascent iterations ............ 3
    variables freed in coordinate ascent  0
    rows dropped in coordinate ascent ... 0
Gradient ascent iterations .............. 0
    variables freed in gradient ascent .. 0
    rows dropped in gradient ascent ..... 0
Preconditioned CG iterations ............ 0
    variables freed in CG ............... 0
    rows dropped in CG .................. 0
SpaRSA iterations ....................... 3
    change in column activity ........... 0
    change in row activity .............. 0
    failures of Armijo step ............. 2
Proximal updates ........................ 3
Cholesky factorizations ................. 4
    nonzeros in final factor ............ 6 89.1% sparse
    rows dropped from L ................. 0
    rows added to L ..................... 1
    rank 1 downdates to L ............... 0
    rank 1 updates to L ................. 0
    Size breakdown of the updates ([size]: number of this size):
    No. of solves:   4

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 3.290176e-05
Initialization (includes partition) ..... 7.033348e-05
Phase 1 ................................. 5.269051e-05
Coordinate ascent ....................... 3.099442e-06
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 2.145767e-06
DASA .................................... 1.008511e-04
DASA line search ........................ 8.106232e-06
Check error ............................. 1.811981e-05
Proximal update ......................... 1.668930e-05
Invert permutation ...................... 6.914139e-06
Row modifications of Cholesky factor .... 1.597404e-05
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 3.695488e-05
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 3.099442e-06
Forward solves .......................... 5.960464e-06


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             : -3.234867896572270e+01
sup-norm of gradient:  1.445100920708948e-09
Number of iterations: 5         
Function evaluations: 9         
Gradient evaluations: 6         

!!      HS86      5       2       2       2       5       9       6       7       4     0    1.4451009e-09   -3.2348679e+01    0.000448
 Final f                         = -3.2348679e+01  
 Function value at final x       = -3.2348679e+01  
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   HS9

 Problem name: HS9

 Double precision version will be formed

 The objective function uses 1 nonlinear group
 
 There is 1 linear equality constraint
 
 There are 2 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully

 Problem: HS9 (n = 2)
walltime at start:     0.000001

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 1.659360e-12 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 1.659360149286471e-12    
Final f                               : -5.000000000000013e-01   

Iterations of gradient projection (GP): 0         
Iterations of active set GP           : 1         
Function evaluation in main code      : 1         
Function evaluations in GP            : 0         
Function evaluations in active set GP : 1         
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 0         
Gradient evaluations in active set GP : 1         


PPROJ run statistics (Version 2.0, May 1, 2018):

No. blocks in multilevel partition of A . 1
Depth of multilevel partition tree ...... 0
Phase 1 iterations ...................... 5
Coordinate ascent iterations ............ 0
    variables freed in coordinate ascent  0
    rows dropped in coordinate ascent ... 0
Gradient ascent iterations .............. 0
    variables freed in gradient ascent .. 0
    rows dropped in gradient ascent ..... 0
Preconditioned CG iterations ............ 0
    variables freed in CG ............... 0
    rows dropped in CG .................. 0
SpaRSA iterations ....................... 1
    change in column activity ........... 0
    change in row activity .............. 0
    failures of Armijo step ............. 0
Proximal updates ........................ 1
Cholesky factorizations ................. 1
    nonzeros in final factor ............ 1  0.0% sparse
    rows dropped from L ................. 0
    rows added to L ..................... 0
    rank 1 downdates to L ............... 0
    rank 1 updates to L ................. 0
    Size breakdown of the updates ([size]: number of this size):
    No. of solves:   1

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 2.717972e-05
Initialization (includes partition) ..... 5.722046e-05
Phase 1 ................................. 3.099442e-05
Coordinate ascent ....................... 0.000000e+00
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 5.960464e-06
DASA .................................... 4.196167e-05
DASA line search ........................ 2.145767e-06
Check error ............................. 1.001358e-05
Proximal update ......................... 7.867813e-06
Invert permutation ...................... 3.099442e-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 .......................... 3.099442e-06


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             : -4.999999999999998e-01
sup-norm of gradient:  1.659360149286471e-12
Number of iterations: 4         
Function evaluations: 9         
Gradient evaluations: 5         

!!       HS9      2       0       0       0       4       9       5       3       1     0    1.6593601e-12   -5.0000000e-01    0.000282
 Final f                         = -5.0000000e-01  
 Function value at final x       = -5.0000000e-01  
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   HUBFIT

 Problem name: HUBFIT

 Double precision version will be formed

 The objective function uses 5 nonlinear groups
 
 There is 1 linear inequality constraint
 
 There is 1 free variable 
 There is 1 variable bounded only from below 
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully

 Problem: HUBFIT (n = 2)
walltime at start:     0.000000

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 1.072753e-14 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 1.072752997544058e-14    
Final f                               : 1.689349393939367e-02    

Iterations of gradient projection (GP): 1         
Iterations of active set GP           : 1         
Function evaluation in main code      : 1         
Function evaluations in GP            : 1         
Function evaluations in active set GP : 1         
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 1         
Gradient evaluations in active set GP : 1         


PPROJ run statistics (Version 2.0, May 1, 2018):

No. blocks in multilevel partition of A . 1
Depth of multilevel partition tree ...... 0
Phase 1 iterations ...................... 5
Coordinate ascent iterations ............ 0
    variables freed in coordinate ascent  0
    rows dropped in coordinate ascent ... 0
Gradient ascent iterations .............. 0
    variables freed in gradient ascent .. 0
    rows dropped in gradient ascent ..... 0
Preconditioned CG iterations ............ 0
    variables freed in CG ............... 0
    rows dropped in CG .................. 0
SpaRSA iterations ....................... 1
    change in column activity ........... 0
    change in row activity .............. 0
    failures of Armijo step ............. 1
Proximal updates ........................ 1
Cholesky factorizations ................. 1
    nonzeros in final factor ............ 1  0.0% sparse
    rows dropped from L ................. 0
    rows added to L ..................... 0
    rank 1 downdates to L ............... 0
    rank 1 updates to L ................. 0
    Size breakdown of the updates ([size]: number of this size):
    No. of solves:   1

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 2.312660e-05
Initialization (includes partition) ..... 4.792213e-05
Phase 1 ................................. 3.218651e-05
Coordinate ascent ....................... 0.000000e+00
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 4.053116e-06
DASA .................................... 3.504753e-05
DASA line search ........................ 3.099442e-06
Check error ............................. 1.001358e-05
Proximal update ......................... 6.914139e-06
Invert permutation ...................... 4.053116e-06
Row modifications of Cholesky factor .... 0.000000e+00
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 1.096725e-05
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 1.907349e-06
Forward solves .......................... 2.145767e-06


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             :  1.689349393938636e-02
sup-norm of gradient:  9.658940314238862e-15
Number of iterations: 1         
Function evaluations: 2         
Gradient evaluations: 1         

!!    HUBFIT      2       1       1       1       1       2       1       5       1     0    1.0727530e-14    1.6893494e-02    0.000238
 Final f                         = 1.6893494e-02   
 Function value at final x       = 1.6893494e-02   
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   HYDROELL

 Problem name: HYDROELL

 Double precision version will be formed

 The objective function uses 1 nonlinear group
 
 There are 1008 linear inequality constraints
 
 There are 1007 variables bounded from below and above 
 There are 2 fixed variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully

 Problem: HYDROELL (n = 1009)
walltime at start:     0.000000

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 6.403425e-08 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 6.403425109373308e-08    
Final f                               : -3.585546798588495e+06   

Iterations of gradient projection (GP): 1         
Iterations of active set GP           : 2         
Function evaluation in main code      : 1         
Function evaluations in GP            : 1         
Function evaluations in active set GP : 2         
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 1         
Gradient evaluations in active set GP : 2         


PPROJ run statistics (Version 2.0, May 1, 2018):

No. blocks in multilevel partition of A . 7
Depth of multilevel partition tree ...... 2
Phase 1 iterations ...................... 10
Coordinate ascent iterations ............ 3
    variables freed in coordinate ascent  91
    rows dropped in coordinate ascent ... 0
Gradient ascent iterations .............. 2
    variables freed in gradient ascent .. 0
    rows dropped in gradient ascent ..... 0
Preconditioned CG iterations ............ 42
    variables freed in CG ............... 2
    rows dropped in CG .................. 0
SpaRSA iterations ....................... 4
    change in column activity ........... 54
    change in row activity .............. 90
    failures of Armijo step ............. 12
Proximal updates ........................ 6
Cholesky factorizations ................. 44
    nonzeros in final factor ............ 1271 99.8% sparse
    rows dropped from L ................. 156
    rows added to L ..................... 783
    rank 1 downdates to L ............... 63
    rank 1 updates to L ................. 1065
    Size breakdown of the updates ([size]: number of this size):
        updowns [  1]: 90
        updowns [  2]: 14
        updowns [  3]: 5
        updowns [  4]: 4
        updowns [  5]: 4
        updowns [  6]: 21
        updowns [  8]: 3
        updowns [  9]: 2
        updowns [ 10]: 6
        updowns [ 11]: 18
        updowns [ 12]: 10
        updowns [ 15]: 1
        updowns [ 17]: 1
        updowns [ 18]: 19
        updowns [ 19]: 1
        updowns [ 20]: 1
    No. of solves by depth in the multilevel partition tree:
        (deeper <=> further from root of tree <=> fewer flops)
        depth [ 0]: 0
        depth [ 1]: 175
        depth [ 2]: 1133

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 8.831024e-04
Initialization (includes partition) ..... 1.118898e-03
Phase 1 ................................. 4.045963e-04
Coordinate ascent ....................... 1.215935e-05
SSOR0 ................................... 1.597404e-05
SSOR1 ................................... 2.229214e-04
SpaRSA .................................. 3.004074e-05
DASA .................................... 1.599646e-02
DASA line search ........................ 4.150629e-03
Check error ............................. 4.558563e-03
Proximal update ......................... 1.940727e-04
Invert permutation ...................... 2.169609e-05
Row modifications of Cholesky factor .... 1.009226e-03
Column modifications of Cholesky factor . 1.009941e-03
Cholesky factorization .................. 1.829624e-03
Partial Cholesky factorization .......... 1.025200e-05
Back solves ............................. 1.530409e-03
Forward solves .......................... 7.338524e-04


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Number of iterations: 0         
Function evaluations: 0         
Gradient evaluations: 0         

!!  HYDROELL   1009       1       1       1       0       0       0       6      44     0    6.4034251e-08   -3.5855468e+06    0.020898
 Final f                         = -3.5855468e+06  
 Function value at final x       = -3.5855468e+06  
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   HYDROELM

 Problem name: HYDROELM

 Double precision version will be formed

 The objective function uses 1 nonlinear group
 
 There are 504 linear inequality constraints
 
 There are 503 variables bounded from below and above 
 There are 2 fixed variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully

 Problem: HYDROELM (n = 505)
walltime at start:     0.000001

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 2.502278e-08 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 2.502277687352751e-08    
Final f                               : -3.582015495693359e+06   

Iterations of gradient projection (GP): 1         
Iterations of active set GP           : 2         
Function evaluation in main code      : 1         
Function evaluations in GP            : 1         
Function evaluations in active set GP : 2         
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 1         
Gradient evaluations in active set GP : 2         


PPROJ run statistics (Version 2.0, May 1, 2018):

No. blocks in multilevel partition of A . 3
Depth of multilevel partition tree ...... 1
Phase 1 iterations ...................... 7
Coordinate ascent iterations ............ 3
    variables freed in coordinate ascent  83
    rows dropped in coordinate ascent ... 0
Gradient ascent iterations .............. 2
    variables freed in gradient ascent .. 0
    rows dropped in gradient ascent ..... 0
Preconditioned CG iterations ............ 31
    variables freed in CG ............... 3
    rows dropped in CG .................. 0
SpaRSA iterations ....................... 4
    change in column activity ........... 60
    change in row activity .............. 50
    failures of Armijo step ............. 12
Proximal updates ........................ 7
Cholesky factorizations ................. 8
    nonzeros in final factor ............ 594 99.5% sparse
    rows dropped from L ................. 82
    rows added to L ..................... 393
    rank 1 downdates to L ............... 26
    rank 1 updates to L ................. 317
    Size breakdown of the updates ([size]: number of this size):
        updowns [  1]: 41
        updowns [  2]: 4
        updowns [  3]: 3
        updowns [  4]: 5
        updowns [  5]: 3
        updowns [  6]: 10
        updowns [  7]: 2
        updowns [  8]: 1
        updowns [ 11]: 1
        updowns [ 12]: 12
        updowns [ 13]: 1
    No. of solves by depth in the multilevel partition tree:
        (deeper <=> further from root of tree <=> fewer flops)
        depth [ 0]: 0
        depth [ 1]: 271

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 4.510880e-04
Initialization (includes partition) ..... 5.910397e-04
Phase 1 ................................. 1.959801e-04
Coordinate ascent ....................... 1.001358e-05
SSOR0 ................................... 1.311302e-05
SSOR1 ................................... 1.440048e-04
SpaRSA .................................. 2.384186e-05
DASA .................................... 4.189730e-03
DASA line search ........................ 9.098053e-04
Check error ............................. 1.305103e-03
Proximal update ......................... 1.370907e-04
Invert permutation ...................... 1.168251e-05
Row modifications of Cholesky factor .... 4.622936e-04
Column modifications of Cholesky factor . 3.821850e-04
Cholesky factorization .................. 2.532005e-04
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 3.426075e-04
Forward solves .......................... 1.447201e-04


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Number of iterations: 0         
Function evaluations: 0         
Gradient evaluations: 0         

!!  HYDROELM    505       1       1       1       0       0       0       6       8     0    2.5022777e-08   -3.5820155e+06    0.006251
 Final f                         = -3.5820155e+06  
 Function value at final x       = -3.5820155e+06  
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   HYDROELS

 Problem name: HYDROELS

 Double precision version will be formed

 The objective function uses 1 nonlinear group
 
 There are 168 linear inequality constraints
 
 There are 167 variables bounded from below and above 
 There are 2 fixed variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully

 Problem: HYDROELS (n = 169)
walltime at start:     0.000000

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 1.247003e-08 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 1.247002501258976e-08    
Final f                               : -3.582268299810012e+06   

Iterations of gradient projection (GP): 1         
Iterations of active set GP           : 2         
Function evaluation in main code      : 1         
Function evaluations in GP            : 1         
Function evaluations in active set GP : 2         
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 1         
Gradient evaluations in active set GP : 2         


PPROJ run statistics (Version 2.0, May 1, 2018):

No. blocks in multilevel partition of A . 1
Depth of multilevel partition tree ...... 0
Phase 1 iterations ...................... 5
Coordinate ascent iterations ............ 3
    variables freed in coordinate ascent  62
    rows dropped in coordinate ascent ... 0
Gradient ascent iterations .............. 2
    variables freed in gradient ascent .. 0
    rows dropped in gradient ascent ..... 0
Preconditioned CG iterations ............ 66
    variables freed in CG ............... 8
    rows dropped in CG .................. 0
SpaRSA iterations ....................... 8
    change in column activity ........... 49
    change in row activity .............. 38
    failures of Armijo step ............. 16
Proximal updates ........................ 9
Cholesky factorizations ................. 8
    nonzeros in final factor ............ 182 98.7% sparse
    rows dropped from L ................. 24
    rows added to L ..................... 130
    rank 1 downdates to L ............... 7
    rank 1 updates to L ................. 102
    Size breakdown of the updates ([size]: number of this size):
        updowns [  1]: 25
        updowns [  2]: 3
        updowns [  3]: 2
        updowns [  4]: 1
        updowns [  5]: 3
        updowns [  6]: 3
        updowns [ 11]: 1
        updowns [ 12]: 2
    No. of solves:   71

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 9.799004e-05
Initialization (includes partition) ..... 1.637936e-04
Phase 1 ................................. 9.226799e-05
Coordinate ascent ....................... 1.025200e-05
SSOR0 ................................... 8.821487e-06
SSOR1 ................................... 1.759529e-04
SpaRSA .................................. 1.096725e-05
DASA .................................... 1.282454e-03
DASA line search ........................ 1.575947e-04
Check error ............................. 2.994537e-04
Proximal update ......................... 9.298325e-05
Invert permutation ...................... 8.344650e-06
Row modifications of Cholesky factor .... 1.404285e-04
Column modifications of Cholesky factor . 9.608269e-05
Cholesky factorization .................. 1.218319e-04
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 7.224083e-05
Forward solves .......................... 3.504753e-05


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Number of iterations: 0         
Function evaluations: 0         
Gradient evaluations: 0         

!!  HYDROELS    169       1       1       1       0       0       0       6       8     0    1.2470025e-08   -3.5822683e+06    0.002032
 Final f                         = -3.5822683e+06  
 Function value at final x       = -3.5822683e+06  
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   LIN

 Problem name: LIN

 Double precision version will be formed

 The objective function uses 1 nonlinear group
 
 There are 2 linear equality constraints
 
 There are 4 variables bounded from below and above 
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully

 Problem: LIN (n = 4)
walltime at start:     0.000001

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 3.783583e-10 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 3.783583446707096e-10    
Final f                               : -1.757754317621738e-02   

Iterations of gradient projection (GP): 1         
Iterations of active set GP           : 1         
Function evaluation in main code      : 1         
Function evaluations in GP            : 1         
Function evaluations in active set GP : 2         
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 1         
Gradient evaluations in active set GP : 1         


PPROJ run statistics (Version 2.0, May 1, 2018):

No. blocks in multilevel partition of A . 2
Depth of multilevel partition tree ...... 1
Phase 1 iterations ...................... 5
Coordinate ascent iterations ............ 2
    variables freed in coordinate ascent  4
    rows dropped in coordinate ascent ... 0
Gradient ascent iterations .............. 2
    variables freed in gradient ascent .. 0
    rows dropped in gradient ascent ..... 0
Preconditioned CG iterations ............ 2
    variables freed in CG ............... 0
    rows dropped in CG .................. 0
SpaRSA iterations ....................... 2
    change in column activity ........... 0
    change in row activity .............. 0
    failures of Armijo step ............. 10
Proximal updates ........................ 2
Cholesky factorizations ................. 2
    nonzeros in final factor ............ 2 33.3% sparse
    rows dropped from L ................. 0
    rows added to L ..................... 0
    rank 1 downdates to L ............... 0
    rank 1 updates to L ................. 0
    Size breakdown of the updates ([size]: number of this size):
    No. of solves by depth in the multilevel partition tree:
        (deeper <=> further from root of tree <=> fewer flops)
        depth [ 0]: 2
        depth [ 1]: 2

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 3.504753e-05
Initialization (includes partition) ..... 6.198883e-05
Phase 1 ................................. 3.194809e-05
Coordinate ascent ....................... 2.861023e-06
SSOR0 ................................... 3.337860e-06
SSOR1 ................................... 4.053116e-06
SpaRSA .................................. 4.053116e-06
DASA .................................... 7.915497e-05
DASA line search ........................ 5.483627e-06
Check error ............................. 1.287460e-05
Proximal update ......................... 7.390976e-06
Invert permutation ...................... 5.006790e-06
Row modifications of Cholesky factor .... 9.536743e-07
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 1.716614e-05
Partial Cholesky factorization .......... 9.536743e-07
Back solves ............................. 2.861023e-06
Forward solves .......................... 3.814697e-06


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             : -1.757754317621667e-02
sup-norm of gradient:  3.783583446707096e-10
Number of iterations: 1         
Function evaluations: 2         
Gradient evaluations: 1         

!!       LIN      4       1       1       1       1       2       1       5       2     0    3.7835834e-10   -1.7577543e-02    0.000308
 Final f                         = -1.7577543e-02  
 Function value at final x       = -1.7577543e-02  
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   LOADBAL

 Problem name: LOADBAL

 Double precision version will be formed

 The objective function uses 51 nonlinear groups
 
 There are 11 linear equality constraints
 There are 20 linear inequality constraints
 
 There are 20 variables bounded only from below 
 There are 11 variables bounded from below and above 
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully

 Problem: LOADBAL (n = 31)
walltime at start:     0.000001

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 4.561474e-07 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 4.561474282880398e-07    
Final f                               : 4.528510394395828e-01    

Iterations of gradient projection (GP): 1         
Iterations of active set GP           : 8         
Function evaluation in main code      : 1         
Function evaluations in GP            : 2         
Function evaluations in active set GP : 11        
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 1         
Gradient evaluations in active set GP : 8         


PPROJ run statistics (Version 2.0, May 1, 2018):

No. blocks in multilevel partition of A . 1
Depth of multilevel partition tree ...... 0
Phase 1 iterations ...................... 5
Coordinate ascent iterations ............ 12
    variables freed in coordinate ascent  16
    rows dropped in coordinate ascent ... 4
Gradient ascent iterations .............. 0
    variables freed in gradient ascent .. 0
    rows dropped in gradient ascent ..... 0
Preconditioned CG iterations ............ 0
    variables freed in CG ............... 0
    rows dropped in CG .................. 0
SpaRSA iterations ....................... 10
    change in column activity ........... 10
    change in row activity .............. 0
    failures of Armijo step ............. 5
Proximal updates ........................ 9
Cholesky factorizations ................. 5
    nonzeros in final factor ............ 21 95.8% sparse
    rows dropped from L ................. 1
    rows added to L ..................... 7
    rank 1 downdates to L ............... 10
    rank 1 updates to L ................. 6
    Size breakdown of the updates ([size]: number of this size):
        updowns [  1]: 11
        updowns [  2]: 1
        updowns [  3]: 1
    No. of solves:   15

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 4.887581e-05
Initialization (includes partition) ..... 9.965897e-05
Phase 1 ................................. 7.653236e-05
Coordinate ascent ....................... 2.121925e-05
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 3.099442e-06
DASA .................................... 2.722740e-04
DASA line search ........................ 1.740456e-05
Check error ............................. 7.748604e-05
Proximal update ......................... 4.553795e-05
Invert permutation ...................... 8.821487e-06
Row modifications of Cholesky factor .... 2.312660e-05
Column modifications of Cholesky factor . 3.099442e-05
Cholesky factorization .................. 4.005432e-05
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 9.775162e-06
Forward solves .......................... 9.775162e-06


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             :  4.528510394425120e-01
sup-norm of gradient:  4.561474282880398e-07
Number of iterations: 10        
Function evaluations: 18        
Gradient evaluations: 10        

!!   LOADBAL     31       1       2       1      10      18      10      12       5     0    4.5614743e-07    4.5285104e-01    0.000912
 Final f                         = 4.5285104e-01   
 Function value at final x       = 4.5285104e-01   
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   LSNNODOC

 Problem name: LSNNODOC

 Double precision version will be formed

 The objective function uses 1 nonlinear group
 
 There are 4 linear equality constraints
 
 There are 2 free variables
 There are 3 variables bounded from below and above 
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully

 Problem: LSNNODOC (n = 5)
walltime at start:     0.000002

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 1.119105e-12 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 1.119104808822158e-12    
Final f                               : 1.231124487914435e+02    

Iterations of gradient projection (GP): 1         
Iterations of active set GP           : 2         
Function evaluation in main code      : 1         
Function evaluations in GP            : 1         
Function evaluations in active set GP : 2         
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 1         
Gradient evaluations in active set GP : 2         


PPROJ run statistics (Version 2.0, May 1, 2018):

No. blocks in multilevel partition of A . 1
Depth of multilevel partition tree ...... 0
Phase 1 iterations ...................... 5
Coordinate ascent iterations ............ 3
    variables freed in coordinate ascent  3
    rows dropped in coordinate ascent ... 0
Gradient ascent iterations .............. 0
    variables freed in gradient ascent .. 0
    rows dropped in gradient ascent ..... 0
Preconditioned CG iterations ............ 0
    variables freed in CG ............... 0
    rows dropped in CG .................. 0
SpaRSA iterations ....................... 3
    change in column activity ........... 1
    change in row activity .............. 0
    failures of Armijo step ............. 2
Proximal updates ........................ 3
Cholesky factorizations ................. 3
    nonzeros in final factor ............ 9 10.0% sparse
    rows dropped from L ................. 0
    rows added to L ..................... 0
    rank 1 downdates to L ............... 1
    rank 1 updates to L ................. 0
    Size breakdown of the updates ([size]: number of this size):
        updowns [  1]: 1
    No. of solves:   3

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 3.695488e-05
Initialization (includes partition) ..... 6.866455e-05
Phase 1 ................................. 3.528595e-05
Coordinate ascent ....................... 3.814697e-06
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 9.536743e-07
DASA .................................... 6.580353e-05
DASA line search ........................ 3.814697e-06
Check error ............................. 1.192093e-05
Proximal update ......................... 1.478195e-05
Invert permutation ...................... 6.437302e-06
Row modifications of Cholesky factor .... 0.000000e+00
Column modifications of Cholesky factor . 7.867813e-06
Cholesky factorization .................. 1.788139e-05
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 0.000000e+00
Forward solves .......................... 4.291534e-06


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             :  1.231124487914517e+02
sup-norm of gradient:  3.057753799820549e+01
Number of iterations: 1         
Function evaluations: 1         
Gradient evaluations: 1         

!!  LSNNODOC      5       1       1       1       1       1       1       5       3     0    1.1191048e-12    1.2311245e+02    0.000321
 Final f                         = 1.2311245e+02   
 Function value at final x       = 1.2311245e+02   
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   ODFITS

 Problem name: ODFITS

 Double precision version will be formed

 The objective function uses 10 nonlinear groups
 
 There are 6 linear equality constraints
 
 There are 10 variables bounded only from below 
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully

 Problem: ODFITS (n = 10)
walltime at start:     0.000000

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 2.871987e-08 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 2.871987195935885e-08    
Final f                               : -2.380026775403124e+03   

Iterations of gradient projection (GP): 0         
Iterations of active set GP           : 1         
Function evaluation in main code      : 1         
Function evaluations in GP            : 0         
Function evaluations in active set GP : 1         
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 0         
Gradient evaluations in active set GP : 1         


PPROJ run statistics (Version 2.0, May 1, 2018):

No. blocks in multilevel partition of A . 2
Depth of multilevel partition tree ...... 1
Phase 1 iterations ...................... 5
Coordinate ascent iterations ............ 2
    variables freed in coordinate ascent  0
    rows dropped in coordinate ascent ... 0
Gradient ascent iterations .............. 0
    variables freed in gradient ascent .. 0
    rows dropped in gradient ascent ..... 0
Preconditioned CG iterations ............ 0
    variables freed in CG ............... 0
    rows dropped in CG .................. 0
SpaRSA iterations ....................... 2
    change in column activity ........... 0
    change in row activity .............. 0
    failures of Armijo step ............. 0
Proximal updates ........................ 2
Cholesky factorizations ................. 2
    nonzeros in final factor ............ 12 42.9% sparse
    rows dropped from L ................. 0
    rows added to L ..................... 0
    rank 1 downdates to L ............... 0
    rank 1 updates to L ................. 0
    Size breakdown of the updates ([size]: number of this size):
    No. of solves by depth in the multilevel partition tree:
        (deeper <=> further from root of tree <=> fewer flops)
        depth [ 0]: 2
        depth [ 1]: 2

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 3.981590e-05
Initialization (includes partition) ..... 6.890297e-05
Phase 1 ................................. 3.194809e-05
Coordinate ascent ....................... 1.907349e-06
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 9.536743e-07
DASA .................................... 7.200241e-05
DASA line search ........................ 5.245209e-06
Check error ............................. 1.287460e-05
Proximal update ......................... 9.298325e-06
Invert permutation ...................... 2.861023e-06
Row modifications of Cholesky factor .... 9.536743e-07
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 1.502037e-05
Partial Cholesky factorization .......... 3.099442e-06
Back solves ............................. 3.814697e-06
Forward solves .......................... 4.053116e-06


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             : -2.380026775403071e+03
sup-norm of gradient:  2.871987195935885e-08
Number of iterations: 8         
Function evaluations: 16        
Gradient evaluations: 8         

!!    ODFITS     10       0       0       0       8      16       8       3       2     0    2.8719872e-08   -2.3800268e+03    0.000348
 Final f                         = -2.3800268e+03  
 Function value at final x       = -2.3800268e+03  
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   PENTAGON

 Problem name: PENTAGON

 Double precision version will be formed

 The objective function uses 1 nonlinear group
 
 There are 15 linear inequality constraints
 
 There are 6 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully

 Problem: PENTAGON (n = 6)
walltime at start:     0.000001

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 2.133831e-07 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 2.133831170346309e-07    
Final f                               : 1.365216752183141e-04    

Iterations of gradient projection (GP): 0         
Iterations of active set GP           : 2         
Function evaluation in main code      : 1         
Function evaluations in GP            : 0         
Function evaluations in active set GP : 2         
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 0         
Gradient evaluations in active set GP : 2         


PPROJ run statistics (Version 2.0, May 1, 2018):

No. blocks in multilevel partition of A . 3
Depth of multilevel partition tree ...... 1
Phase 1 iterations ...................... 5
Coordinate ascent iterations ............ 0
    variables freed in coordinate ascent  0
    rows dropped in coordinate ascent ... 0
Gradient ascent iterations .............. 0
    variables freed in gradient ascent .. 0
    rows dropped in gradient ascent ..... 0
Preconditioned CG iterations ............ 0
    variables freed in CG ............... 0
    rows dropped in CG .................. 0
SpaRSA iterations ....................... 2
    change in column activity ........... 0
    change in row activity .............. 0
    failures of Armijo step ............. 1
Proximal updates ........................ 2
Cholesky factorizations ................. 2
    nonzeros in final factor ............ 3 97.5% sparse
    rows dropped from L ................. 1
    rows added to L ..................... 1
    rank 1 downdates to L ............... 0
    rank 1 updates to L ................. 0
    Size breakdown of the updates ([size]: number of this size):
    No. of solves by depth in the multilevel partition tree:
        (deeper <=> further from root of tree <=> fewer flops)
        depth [ 0]: 2
        depth [ 1]: 4

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 4.196167e-05
Initialization (includes partition) ..... 7.081032e-05
Phase 1 ................................. 4.029274e-05
Coordinate ascent ....................... 0.000000e+00
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 1.907349e-06
DASA .................................... 8.392334e-05
DASA line search ........................ 6.437302e-06
Check error ............................. 1.215935e-05
Proximal update ......................... 1.096725e-05
Invert permutation ...................... 4.768372e-06
Row modifications of Cholesky factor .... 1.811981e-05
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 1.788139e-05
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 5.006790e-06
Forward solves .......................... 2.861023e-06


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             :  1.365216752183521e-04
sup-norm of gradient:  2.133831170346309e-07
Number of iterations: 7         
Function evaluations: 14        
Gradient evaluations: 9         

!!  PENTAGON      6       0       0       0       7      14       9       4       2     0    2.1338312e-07    1.3652168e-04    0.000347
 Final f                         = 1.3652168e-04   
 Function value at final x       = 1.3652168e-04   
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   QC

 Problem name: QC

 Double precision version will be formed

 The objective function uses 17 nonlinear groups
 
 There are 4 linear inequality constraints
 
 There are 7 variables bounded from below and above 
 There are 2 fixed variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully

 Problem: QC (n = 9)
walltime at start:     0.000001

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 0.000000e+00 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 0.000000000000000e+00    
Final f                               : -9.565377333039573e+02   

Iterations of gradient projection (GP): 1         
Iterations of active set GP           : 5         
Function evaluation in main code      : 1         
Function evaluations in GP            : 1         
Function evaluations in active set GP : 5         
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 1         
Gradient evaluations in active set GP : 5         


PPROJ run statistics (Version 2.0, May 1, 2018):

No. blocks in multilevel partition of A . 4
Depth of multilevel partition tree ...... 1
Phase 1 iterations ...................... 5
Coordinate ascent iterations ............ 1
    variables freed in coordinate ascent  0
    rows dropped in coordinate ascent ... 0
Gradient ascent iterations .............. 1
    variables freed in gradient ascent .. 0
    rows dropped in gradient ascent ..... 0
Preconditioned CG iterations ............ 1
    variables freed in CG ............... 0
    rows dropped in CG .................. 0
SpaRSA iterations ....................... 1
    change in column activity ........... 0
    change in row activity .............. 0
    failures of Armijo step ............. 0
Proximal updates ........................ 1
Cholesky factorizations ................. 0
    nonzeros in final factor ............ 0 100.0% sparse
    rows dropped from L ................. 0
    rows added to L ..................... 0
    rank 1 downdates to L ............... 0
    rank 1 updates to L ................. 0
    Size breakdown of the updates ([size]: number of this size):
    No. of solves by depth in the multilevel partition tree:
        (deeper <=> further from root of tree <=> fewer flops)
        depth [ 0]: 0
        depth [ 1]: 0

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 3.504753e-05
Initialization (includes partition) ..... 6.175041e-05
Phase 1 ................................. 3.075600e-05
Coordinate ascent ....................... 9.536743e-07
SSOR0 ................................... 9.536743e-07
SSOR1 ................................... 1.907349e-06
SpaRSA .................................. 3.099442e-06
DASA .................................... 1.692772e-05
DASA line search ........................ 0.000000e+00
Check error ............................. 8.821487e-06
Proximal update ......................... 5.245209e-06
Invert permutation ...................... 8.106232e-06
Row modifications of Cholesky factor .... 0.000000e+00
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 0.000000e+00
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 0.000000e+00
Forward solves .......................... 0.000000e+00


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             : -9.565377333039573e+02
sup-norm of gradient:  5.172572909420166e+00
Number of iterations: 5         
Function evaluations: 8         
Gradient evaluations: 8         

!!        QC      9       1       1       1       5       8       8       8       0     0    0.0000000e+00   -9.5653773e+02    0.000318
 Final f                         = -9.5653773e+02  
 Function value at final x       = -9.5653773e+02  
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   QCNEW

 Problem name: QCNEW

 Double precision version will be formed

 The objective function uses 17 nonlinear groups
 
 There are 3 linear inequality constraints
 
 There are 7 variables bounded from below and above 
 There are 2 fixed variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully

 Problem: QCNEW (n = 9)
walltime at start:     0.000001

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 0.000000e+00 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 0.000000000000000e+00    
Final f                               : -8.065218543888329e+02   

Iterations of gradient projection (GP): 1         
Iterations of active set GP           : 0         
Function evaluation in main code      : 1         
Function evaluations in GP            : 1         
Function evaluations in active set GP : 0         
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 1         
Gradient evaluations in active set GP : 0         


PPROJ run statistics (Version 2.0, May 1, 2018):

No. blocks in multilevel partition of A . 3
Depth of multilevel partition tree ...... 1
Phase 1 iterations ...................... 5
Coordinate ascent iterations ............ 0
    variables freed in coordinate ascent  0
    rows dropped in coordinate ascent ... 0
Gradient ascent iterations .............. 0
    variables freed in gradient ascent .. 0
    rows dropped in gradient ascent ..... 0
Preconditioned CG iterations ............ 0
    variables freed in CG ............... 0
    rows dropped in CG .................. 0
SpaRSA iterations ....................... 0
    change in column activity ........... 0
    change in row activity .............. 0
    failures of Armijo step ............. 0
Proximal updates ........................ 0
Cholesky factorizations ................. 0
    nonzeros in final factor ............ 0 100.0% sparse
    rows dropped from L ................. 0
    rows added to L ..................... 0
    rank 1 downdates to L ............... 0
    rank 1 updates to L ................. 0
    Size breakdown of the updates ([size]: number of this size):
    No. of solves by depth in the multilevel partition tree:
        (deeper <=> further from root of tree <=> fewer flops)
        depth [ 0]: 0
        depth [ 1]: 0

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 3.910065e-05
Initialization (includes partition) ..... 6.508827e-05
Phase 1 ................................. 3.194809e-05
Coordinate ascent ....................... 0.000000e+00
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 0.000000e+00
DASA .................................... 0.000000e+00
DASA line search ........................ 0.000000e+00
Check error ............................. 0.000000e+00
Proximal update ......................... 0.000000e+00
Invert permutation ...................... 5.722046e-06
Row modifications of Cholesky factor .... 0.000000e+00
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 0.000000e+00
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 0.000000e+00
Forward solves .......................... 0.000000e+00


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Number of iterations: 0         
Function evaluations: 0         
Gradient evaluations: 0         

!!     QCNEW      9       1       1       1       0       0       0       4       0     0    0.0000000e+00   -8.0652185e+02    0.000191
 Final f                         = -8.0652185e+02  
 Function value at final x       = -8.0652185e+02  
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   SMBANK

 Problem name: SMBANK

 Double precision version will be formed

 The objective function uses 1 nonlinear group
 
 There are 64 linear equality constraints
 
 There are 117 variables bounded from below and above 
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully

 Problem: SMBANK (n = 117)
walltime at start:     0.000000

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 7.216248e-07 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 7.216248268391082e-07    
Final f                               : -7.129291999999844e+06   

Iterations of gradient projection (GP): 23        
Iterations of active set GP           : 47        
Function evaluation in main code      : 1         
Function evaluations in GP            : 101       
Function evaluations in active set GP : 110       
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 26        
Gradient evaluations in active set GP : 80        


PPROJ run statistics (Version 2.0, May 1, 2018):

No. blocks in multilevel partition of A . 1
Depth of multilevel partition tree ...... 0
Phase 1 iterations ...................... 5
Coordinate ascent iterations ............ 116
    variables freed in coordinate ascent  234
    rows dropped in coordinate ascent ... 0
Gradient ascent iterations .............. 0
    variables freed in gradient ascent .. 0
    rows dropped in gradient ascent ..... 0
Preconditioned CG iterations ............ 0
    variables freed in CG ............... 0
    rows dropped in CG .................. 0
SpaRSA iterations ....................... 86
    change in column activity ........... 418
    change in row activity .............. 0
    failures of Armijo step ............. 17
Proximal updates ........................ 86
Cholesky factorizations ................. 57
    nonzeros in final factor ............ 297 85.7% sparse
    rows dropped from L ................. 0
    rows added to L ..................... 0
    rank 1 downdates to L ............... 179
    rank 1 updates to L ................. 321
    Size breakdown of the updates ([size]: number of this size):
        updowns [  1]: 101
        updowns [  2]: 23
        updowns [  3]: 29
        updowns [  4]: 18
        updowns [  5]: 12
        updowns [  6]: 7
        updowns [  7]: 3
        updowns [  8]: 1
        updowns [ 14]: 1
        updowns [ 15]: 1
        updowns [ 16]: 1
        updowns [ 18]: 1
    No. of solves:   215

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 9.322166e-05
Initialization (includes partition) ..... 4.172325e-04
Phase 1 ................................. 4.839897e-04
Coordinate ascent ....................... 4.069805e-04
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 5.006790e-06
DASA .................................... 4.608631e-03
DASA line search ........................ 3.845692e-04
Check error ............................. 9.152889e-04
Proximal update ......................... 6.699562e-04
Invert permutation ...................... 8.678436e-05
Row modifications of Cholesky factor .... 5.769730e-05
Column modifications of Cholesky factor . 7.171631e-04
Cholesky factorization .................. 1.086712e-03
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 2.574921e-04
Forward solves .......................... 1.792908e-04


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             : -7.129291999999844e+06
sup-norm of gradient:  7.216248268391082e-07
Number of iterations: 1262      
Function evaluations: 2253      
Gradient evaluations: 1769      
Subspace iterations: 550       
Number of subspaces: 65        


!!    SMBANK    117      23     101      26    1262    2253    1769      96      57     0    7.2162483e-07   -7.1292920e+06    0.057487
 Final f                         = -7.1292920e+06  
 Function value at final x       = -7.1292920e+06  
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   SPANHYD

 Problem name: SPANHYD

 Double precision version will be formed

 The objective function uses 1 nonlinear group
 
 There are 33 linear equality constraints
 
 There are 81 variables bounded from below and above 
 There are 16 fixed variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully

 Problem: SPANHYD (n = 97)
walltime at start:     0.000001

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 4.163608e-09 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 4.163608124940765e-09    
Final f                               : 2.397380007047549e+02    

Iterations of gradient projection (GP): 4         
Iterations of active set GP           : 10        
Function evaluation in main code      : 1         
Function evaluations in GP            : 6         
Function evaluations in active set GP : 10        
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 4         
Gradient evaluations in active set GP : 10        


PPROJ run statistics (Version 2.0, May 1, 2018):

No. blocks in multilevel partition of A . 1
Depth of multilevel partition tree ...... 0
Phase 1 iterations ...................... 5
Coordinate ascent iterations ............ 43
    variables freed in coordinate ascent  106
    rows dropped in coordinate ascent ... 0
Gradient ascent iterations .............. 0
    variables freed in gradient ascent .. 0
    rows dropped in gradient ascent ..... 0
Preconditioned CG iterations ............ 0
    variables freed in CG ............... 0
    rows dropped in CG .................. 0
SpaRSA iterations ....................... 15
    change in column activity ........... 61
    change in row activity .............. 0
    failures of Armijo step ............. 4
Proximal updates ........................ 29
Cholesky factorizations ................. 53
    nonzeros in final factor ............ 105 81.3% sparse
    rows dropped from L ................. 0
    rows added to L ..................... 0
    rank 1 downdates to L ............... 33
    rank 1 updates to L ................. 53
    Size breakdown of the updates ([size]: number of this size):
        updowns [  1]: 53
        updowns [  2]: 8
        updowns [  3]: 3
        updowns [  4]: 2
    No. of solves:   112

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 7.891655e-05
Initialization (includes partition) ..... 1.449585e-04
Phase 1 ................................. 1.585484e-04
Coordinate ascent ....................... 1.318455e-04
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 4.053116e-06
DASA .................................... 1.740932e-03
DASA line search ........................ 1.695156e-04
Check error ............................. 4.279613e-04
Proximal update ......................... 1.645088e-04
Invert permutation ...................... 1.478195e-05
Row modifications of Cholesky factor .... 2.145767e-05
Column modifications of Cholesky factor . 1.549721e-04
Cholesky factorization .................. 4.642010e-04
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 9.751320e-05
Forward solves .......................... 8.440018e-05


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             :  2.397380007047549e+02
sup-norm of gradient:  2.161139071518714e-09
Number of iterations: 12        
Function evaluations: 24        
Gradient evaluations: 12        
Subspace iterations: 1         
Number of subspaces: 1         


!!   SPANHYD     97       4       6       4      12      24      12      18      53     0    4.1636081e-09    2.3973800e+02    0.002932
 Final f                         = 2.3973800e+02   
 Function value at final x       = 2.3973800e+02   
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   STANCMIN

 Problem name: STANCMIN

 Double precision version will be formed

 The objective function uses 1 nonlinear group
 
 There are 2 linear inequality constraints
 
 There are 3 variables bounded only from below 
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully

 Problem: STANCMIN (n = 3)
walltime at start:     0.000001

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 1.592371e-11 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 1.592370679759370e-11    
Final f                               : 4.249999999967638e+00    

Iterations of gradient projection (GP): 0         
Iterations of active set GP           : 0         
Function evaluation in main code      : 1         
Function evaluations in GP            : 0         
Function evaluations in active set GP : 0         
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 0         
Gradient evaluations in active set GP : 0         


PPROJ run statistics (Version 2.0, May 1, 2018):

No. blocks in multilevel partition of A . 1
Depth of multilevel partition tree ...... 0
Phase 1 iterations ...................... 5
Coordinate ascent iterations ............ 3
    variables freed in coordinate ascent  0
    rows dropped in coordinate ascent ... 0
Gradient ascent iterations .............. 0
    variables freed in gradient ascent .. 0
    rows dropped in gradient ascent ..... 0
Preconditioned CG iterations ............ 0
    variables freed in CG ............... 0
    rows dropped in CG .................. 0
SpaRSA iterations ....................... 2
    change in column activity ........... 1
    change in row activity .............. 0
    failures of Armijo step ............. 0
Proximal updates ........................ 2
Cholesky factorizations ................. 5
    nonzeros in final factor ............ 3  0.0% sparse
    rows dropped from L ................. 0
    rows added to L ..................... 0
    rank 1 downdates to L ............... 0
    rank 1 updates to L ................. 0
    Size breakdown of the updates ([size]: number of this size):
    No. of solves:   5

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 3.004074e-05
Initialization (includes partition) ..... 5.888939e-05
Phase 1 ................................. 3.695488e-05
Coordinate ascent ....................... 5.006790e-06
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 9.536743e-07
DASA .................................... 8.583069e-05
DASA line search ........................ 5.960464e-06
Check error ............................. 1.859665e-05
Proximal update ......................... 9.775162e-06
Invert permutation ...................... 2.384186e-06
Row modifications of Cholesky factor .... 0.000000e+00
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 2.408028e-05
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 5.960464e-06
Forward solves .......................... 2.861023e-06


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Number of iterations: 0         
Function evaluations: 0         
Gradient evaluations: 0         

!!  STANCMIN      3       0       0       0       0       0       0       2       5     0    1.5923707e-11    4.2500000e+00    0.000270
 Final f                         = 4.2500000e+00   
 Function value at final x       = 4.2500000e+00   
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   STEENBRB

 Problem name: STEENBRB

 Double precision version will be formed

 The objective function uses 1 nonlinear group
 
 There are 108 linear equality constraints
 
 There are 468 variables bounded only from below 
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully

 Problem: STEENBRB (n = 468)
walltime at start:     0.000000

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 5.330074e-07 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 5.330073977669048e-07    
Final f                               : 9.075855376557705e+03    

Iterations of gradient projection (GP): 3         
Iterations of active set GP           : 27        
Function evaluation in main code      : 1         
Function evaluations in GP            : 3         
Function evaluations in active set GP : 30        
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 3         
Gradient evaluations in active set GP : 27        


PPROJ run statistics (Version 2.0, May 1, 2018):

No. blocks in multilevel partition of A . 12
Depth of multilevel partition tree ...... 1
Phase 1 iterations ...................... 5
Coordinate ascent iterations ............ 3
    variables freed in coordinate ascent  11
    rows dropped in coordinate ascent ... 0
Gradient ascent iterations .............. 0
    variables freed in gradient ascent .. 0
    rows dropped in gradient ascent ..... 0
Preconditioned CG iterations ............ 0
    variables freed in CG ............... 0
    rows dropped in CG .................. 0
SpaRSA iterations ....................... 29
    change in column activity ........... 187
    change in row activity .............. 0
    failures of Armijo step ............. 6
Proximal updates ........................ 30
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 ............... 143
    rank 1 updates to L ................. 256
    Size breakdown of the updates ([size]: number of this size):
        updowns [  1]: 36
        updowns [  2]: 14
        updowns [  3]: 5
        updowns [  4]: 9
        updowns [  5]: 1
        updowns [  6]: 3
        updowns [  7]: 2
        updowns [  8]: 2
        updowns [  9]: 3
        updowns [ 10]: 2
        updowns [ 11]: 2
        updowns [ 12]: 1
        updowns [ 13]: 1
        updowns [ 16]: 1
        updowns [ 20]: 1
        updowns [ 21]: 1
        updowns [ 29]: 1
        updowns [ 51]: 1
    No. of solves by depth in the multilevel partition tree:
        (deeper <=> further from root of tree <=> fewer flops)
        depth [ 0]: 46
        depth [ 1]: 508

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 1.120567e-04
Initialization (includes partition) ..... 2.839565e-04
Phase 1 ................................. 3.790855e-04
Coordinate ascent ....................... 2.694130e-05
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 1.120567e-05
DASA .................................... 3.148079e-03
DASA line search ........................ 6.072521e-04
Check error ............................. 3.168583e-04
Proximal update ......................... 3.342628e-04
Invert permutation ...................... 3.123283e-05
Row modifications of Cholesky factor .... 6.103516e-05
Column modifications of Cholesky factor . 3.159046e-04
Cholesky factorization .................. 2.431870e-04
Partial Cholesky factorization .......... 1.692772e-05
Back solves ............................. 3.859997e-04
Forward solves .......................... 8.988380e-05


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             :  9.075855376571944e+03
sup-norm of gradient:  5.330073977669048e-07
Number of iterations: 80        
Function evaluations: 168       
Gradient evaluations: 128       
Subspace iterations: 14        
Number of subspaces: 3         


!!  STEENBRB    468       3       3       3      80     168     128      33       9     0    5.3300740e-07    9.0758554e+03    0.006972
 Final f                         = 9.0758554e+03   
 Function value at final x       = 9.0758554e+03   
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   STEENBRC

 Problem name: STEENBRC

 Double precision version will be formed

 The objective function uses 1 nonlinear group
 
 There are 126 linear equality constraints
 
 There are 540 variables bounded only from below 
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully

 Problem: STEENBRC (n = 540)
walltime at start:     0.000001

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 7.109280e-07 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 7.109280291696905e-07    
Final f                               : 2.750493682670092e+04    

Iterations of gradient projection (GP): 3         
Iterations of active set GP           : 31        
Function evaluation in main code      : 1         
Function evaluations in GP            : 3         
Function evaluations in active set GP : 44        
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 3         
Gradient evaluations in active set GP : 31        


PPROJ run statistics (Version 2.0, May 1, 2018):

No. blocks in multilevel partition of A . 14
Depth of multilevel partition tree ...... 1
Phase 1 iterations ...................... 5
Coordinate ascent iterations ............ 2
    variables freed in coordinate ascent  20
    rows dropped in coordinate ascent ... 0
Gradient ascent iterations .............. 0
    variables freed in gradient ascent .. 0
    rows dropped in gradient ascent ..... 0
Preconditioned CG iterations ............ 0
    variables freed in CG ............... 0
    rows dropped in CG .................. 0
SpaRSA iterations ....................... 31
    change in column activity ........... 330
    change in row activity .............. 0
    failures of Armijo step ............. 6
Proximal updates ........................ 32
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 ............... 216
    rank 1 updates to L ................. 417
    Size breakdown of the updates ([size]: number of this size):
        updowns [  1]: 42
        updowns [  2]: 18
        updowns [  3]: 10
        updowns [  4]: 5
        updowns [  5]: 8
        updowns [  6]: 4
        updowns [  7]: 1
        updowns [  8]: 1
        updowns [  9]: 5
        updowns [ 10]: 4
        updowns [ 11]: 2
        updowns [ 12]: 1
        updowns [ 13]: 1
        updowns [ 15]: 1
        updowns [ 16]: 1
        updowns [ 19]: 1
        updowns [ 21]: 1
        updowns [ 22]: 1
        updowns [ 23]: 2
        updowns [ 35]: 1
        updowns [ 40]: 1
        updowns [>= 69]: 1
    No. of solves by depth in the multilevel partition tree:
        (deeper <=> further from root of tree <=> fewer flops)
        depth [ 0]: 59
        depth [ 1]: 709

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 1.199245e-04
Initialization (includes partition) ..... 3.135204e-04
Phase 1 ................................. 4.410744e-04
Coordinate ascent ....................... 2.002716e-05
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 3.814697e-06
DASA .................................... 4.220963e-03
DASA line search ........................ 8.244514e-04
Check error ............................. 4.289150e-04
Proximal update ......................... 3.955364e-04
Invert permutation ...................... 3.099442e-05
Row modifications of Cholesky factor .... 7.438660e-05
Column modifications of Cholesky factor . 4.169941e-04
Cholesky factorization .................. 3.011227e-04
Partial Cholesky factorization .......... 2.098083e-05
Back solves ............................. 5.846024e-04
Forward solves .......................... 1.258850e-04


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             :  2.750493682676248e+04
sup-norm of gradient:  7.109280291696905e-07
Number of iterations: 331       
Function evaluations: 730       
Gradient evaluations: 527       
Subspace iterations: 68        
Number of subspaces: 8         


!!  STEENBRC    540       3       3       3     331     730     527      37      10     0    7.1092803e-07    2.7504937e+04    0.017066
 Final f                         = 2.7504937e+04   
 Function value at final x       = 2.7504937e+04   
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   STEENBRD

 Problem name: STEENBRD

 Double precision version will be formed

 The objective function uses 1 nonlinear group
 
 There are 108 linear equality constraints
 
 There are 468 variables bounded only from below 
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully

 Problem: STEENBRD (n = 468)
walltime at start:     0.000000

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 6.406732e-07 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 6.406731880043582e-07    
Final f                               : 9.144724932648325e+03    

Iterations of gradient projection (GP): 2         
Iterations of active set GP           : 32        
Function evaluation in main code      : 1         
Function evaluations in GP            : 3         
Function evaluations in active set GP : 39        
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 2         
Gradient evaluations in active set GP : 32        


PPROJ run statistics (Version 2.0, May 1, 2018):

No. blocks in multilevel partition of A . 12
Depth of multilevel partition tree ...... 1
Phase 1 iterations ...................... 5
Coordinate ascent iterations ............ 4
    variables freed in coordinate ascent  23
    rows dropped in coordinate ascent ... 0
Gradient ascent iterations .............. 0
    variables freed in gradient ascent .. 0
    rows dropped in gradient ascent ..... 0
Preconditioned CG iterations ............ 0
    variables freed in CG ............... 0
    rows dropped in CG .................. 0
SpaRSA iterations ....................... 25
    change in column activity ........... 159
    change in row activity .............. 0
    failures of Armijo step ............. 14
Proximal updates ........................ 25
Cholesky factorizations ................. 11
    nonzeros in final factor ............ 200 96.6% sparse
    rows dropped from L ................. 0
    rows added to L ..................... 0
    rank 1 downdates to L ............... 186
    rank 1 updates to L ................. 318
    Size breakdown of the updates ([size]: number of this size):
        updowns [  1]: 35
        updowns [  2]: 17
        updowns [  3]: 10
        updowns [  4]: 6
        updowns [  5]: 2
        updowns [  6]: 3
        updowns [  7]: 3
        updowns [  8]: 4
        updowns [  9]: 3
        updowns [ 10]: 3
        updowns [ 12]: 1
        updowns [ 14]: 1
        updowns [ 15]: 2
        updowns [ 20]: 2
        updowns [ 27]: 1
        updowns [ 29]: 1
        updowns [ 42]: 1
        updowns [ 49]: 1
    No. of solves by depth in the multilevel partition tree:
        (deeper <=> further from root of tree <=> fewer flops)
        depth [ 0]: 45
        depth [ 1]: 557

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 1.091957e-04
Initialization (includes partition) ..... 2.915859e-04
Phase 1 ................................. 3.936291e-04
Coordinate ascent ....................... 2.813339e-05
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 5.006790e-06
DASA .................................... 3.399849e-03
DASA line search ........................ 6.544590e-04
Check error ............................. 3.821850e-04
Proximal update ......................... 2.920628e-04
Invert permutation ...................... 3.314018e-05
Row modifications of Cholesky factor .... 7.057190e-05
Column modifications of Cholesky factor . 3.545284e-04
Cholesky factorization .................. 2.727509e-04
Partial Cholesky factorization .......... 1.716614e-05
Back solves ............................. 4.224777e-04
Forward solves .......................... 1.080036e-04


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             :  9.144724932655166e+03
sup-norm of gradient:  6.406731880043582e-07
Number of iterations: 153       
Function evaluations: 308       
Gradient evaluations: 220       
Subspace iterations: 51        
Number of subspaces: 7         


!!  STEENBRD    468       2       3       2     153     308     220      37      11     0    6.4067319e-07    9.1447249e+03    0.008665
 Final f                         = 9.1447249e+03   
 Function value at final x       = 9.1447249e+03   
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   STEENBRE

 Problem name: STEENBRE

 Double precision version will be formed

 The objective function uses 1 nonlinear group
 
 There are 126 linear equality constraints
 
 There are 540 variables bounded only from below 
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully

 Problem: STEENBRE (n = 540)
walltime at start:     0.000001

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 8.519218e-07 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 8.519217756085967e-07    
Final f                               : 2.745916331250055e+04    

Iterations of gradient projection (GP): 3         
Iterations of active set GP           : 28        
Function evaluation in main code      : 1         
Function evaluations in GP            : 5         
Function evaluations in active set GP : 43        
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 3         
Gradient evaluations in active set GP : 28        


PPROJ run statistics (Version 2.0, May 1, 2018):

No. blocks in multilevel partition of A . 14
Depth of multilevel partition tree ...... 1
Phase 1 iterations ...................... 5
Coordinate ascent iterations ............ 2
    variables freed in coordinate ascent  14
    rows dropped in coordinate ascent ... 0
Gradient ascent iterations .............. 0
    variables freed in gradient ascent .. 0
    rows dropped in gradient ascent ..... 0
Preconditioned CG iterations ............ 0
    variables freed in CG ............... 0
    rows dropped in CG .................. 0
SpaRSA iterations ....................... 27
    change in column activity ........... 162
    change in row activity .............. 0
    failures of Armijo step ............. 6
Proximal updates ........................ 28
Cholesky factorizations ................. 11
    nonzeros in final factor ............ 237 97.0% sparse
    rows dropped from L ................. 0
    rows added to L ..................... 0
    rank 1 downdates to L ............... 241
    rank 1 updates to L ................. 383
    Size breakdown of the updates ([size]: number of this size):
        updowns [  1]: 40
        updowns [  2]: 20
        updowns [  3]: 10
        updowns [  4]: 5
        updowns [  5]: 6
        updowns [  6]: 7
        updowns [  7]: 9
        updowns [  8]: 2
        updowns [  9]: 2
        updowns [ 10]: 1
        updowns [ 11]: 1
        updowns [ 12]: 2
        updowns [ 13]: 1
        updowns [ 14]: 1
        updowns [ 15]: 1
        updowns [ 16]: 2
        updowns [ 23]: 2
        updowns [ 26]: 1
        updowns [ 40]: 1
        updowns [ 41]: 1
        updowns [ 53]: 1
    No. of solves by depth in the multilevel partition tree:
        (deeper <=> further from root of tree <=> fewer flops)
        depth [ 0]: 61
        depth [ 1]: 747

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 1.399517e-04
Initialization (includes partition) ..... 3.397465e-04
Phase 1 ................................. 4.527569e-04
Coordinate ascent ....................... 1.907349e-05
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 5.006790e-06
DASA .................................... 4.387856e-03
DASA line search ........................ 9.272099e-04
Check error ............................. 5.140305e-04
Proximal update ......................... 4.043579e-04
Invert permutation ...................... 3.004074e-05
Row modifications of Cholesky factor .... 7.534027e-05
Column modifications of Cholesky factor . 4.100800e-04
Cholesky factorization .................. 3.015995e-04
Partial Cholesky factorization .......... 2.050400e-05
Back solves ............................. 6.134510e-04
Forward solves .......................... 1.342297e-04


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             :  2.745916331251922e+04
sup-norm of gradient:  8.519217756085967e-07
Number of iterations: 244       
Function evaluations: 564       
Gradient evaluations: 441       
Subspace iterations: 58        
Number of subspaces: 6         


!!  STEENBRE    540       3       5       3     244     564     441      35      11     0    8.5192178e-07    2.7459163e+04    0.015231
 Final f                         = 2.7459163e+04   
 Function value at final x       = 2.7459163e+04   
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   STEENBRF

 Problem name: STEENBRF

 Double precision version will be formed

 The objective function uses 1 nonlinear group
 
 There are 108 linear equality constraints
 
 There are 468 variables bounded only from below 
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully

 Problem: STEENBRF (n = 468)
walltime at start:     0.000001

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 8.700360e-07 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 8.700360173102654e-07    
Final f                               : 8.991848223146952e+03    

Iterations of gradient projection (GP): 1         
Iterations of active set GP           : 21        
Function evaluation in main code      : 1         
Function evaluations in GP            : 1         
Function evaluations in active set GP : 26        
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 1         
Gradient evaluations in active set GP : 21        


PPROJ run statistics (Version 2.0, May 1, 2018):

No. blocks in multilevel partition of A . 12
Depth of multilevel partition tree ...... 1
Phase 1 iterations ...................... 5
Coordinate ascent iterations ............ 3
    variables freed in coordinate ascent  11
    rows dropped in coordinate ascent ... 0
Gradient ascent iterations .............. 0
    variables freed in gradient ascent .. 0
    rows dropped in gradient ascent ..... 0
Preconditioned CG iterations ............ 0
    variables freed in CG ............... 0
    rows dropped in CG .................. 0
SpaRSA iterations ....................... 24
    change in column activity ........... 182
    change in row activity .............. 0
    failures of Armijo step ............. 9
Proximal updates ........................ 25
Cholesky factorizations ................. 9
    nonzeros in final factor ............ 196 96.7% sparse
    rows dropped from L ................. 0
    rows added to L ..................... 0
    rank 1 downdates to L ............... 130
    rank 1 updates to L ................. 243
    Size breakdown of the updates ([size]: number of this size):
        updowns [  1]: 30
        updowns [  2]: 10
        updowns [  3]: 3
        updowns [  4]: 8
        updowns [  5]: 2
        updowns [  6]: 3
        updowns [  7]: 1
        updowns [  8]: 2
        updowns [  9]: 3
        updowns [ 10]: 2
        updowns [ 11]: 3
        updowns [ 13]: 1
        updowns [ 16]: 1
        updowns [ 20]: 1
        updowns [ 21]: 1
        updowns [ 30]: 1
        updowns [ 51]: 1
    No. of solves by depth in the multilevel partition tree:
        (deeper <=> further from root of tree <=> fewer flops)
        depth [ 0]: 40
        depth [ 1]: 435

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 1.120567e-04
Initialization (includes partition) ..... 2.596378e-04
Phase 1 ................................. 3.557205e-04
Coordinate ascent ....................... 2.074242e-05
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 5.006790e-06
DASA .................................... 2.841234e-03
DASA line search ........................ 5.354881e-04
Check error ............................. 2.737045e-04
Proximal update ......................... 2.791882e-04
Invert permutation ...................... 2.121925e-05
Row modifications of Cholesky factor .... 5.555153e-05
Column modifications of Cholesky factor . 3.008842e-04
Cholesky factorization .................. 2.410412e-04
Partial Cholesky factorization .......... 1.692772e-05
Back solves ............................. 3.674030e-04
Forward solves .......................... 8.440018e-05


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             :  8.991848223232580e+03
sup-norm of gradient:  8.700360173102654e-07
Number of iterations: 97        
Function evaluations: 215       
Gradient evaluations: 161       
Subspace iterations: 31        
Number of subspaces: 2         


!!  STEENBRF    468       1       1       1      97     215     161      25       9     0    8.7003602e-07    8.9918482e+03    0.006789
 Final f                         = 8.9918482e+03   
 Function value at final x       = 8.9918482e+03   
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   STEENBRG

 Problem name: STEENBRG

 Double precision version will be formed

 The objective function uses 1 nonlinear group
 
 There are 126 linear equality constraints
 
 There are 540 variables bounded only from below 
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully

 Problem: STEENBRG (n = 540)
walltime at start:     0.000001

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 5.675515e-07 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 5.675514770648975e-07    
Final f                               : 2.742092967326234e+04    

Iterations of gradient projection (GP): 4         
Iterations of active set GP           : 33        
Function evaluation in main code      : 1         
Function evaluations in GP            : 5         
Function evaluations in active set GP : 44        
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 4         
Gradient evaluations in active set GP : 33        


PPROJ run statistics (Version 2.0, May 1, 2018):

No. blocks in multilevel partition of A . 14
Depth of multilevel partition tree ...... 1
Phase 1 iterations ...................... 5
Coordinate ascent iterations ............ 2
    variables freed in coordinate ascent  20
    rows dropped in coordinate ascent ... 0
Gradient ascent iterations .............. 0
    variables freed in gradient ascent .. 0
    rows dropped in gradient ascent ..... 0
Preconditioned CG iterations ............ 0
    variables freed in CG ............... 0
    rows dropped in CG .................. 0
SpaRSA iterations ....................... 32
    change in column activity ........... 346
    change in row activity .............. 0
    failures of Armijo step ............. 6
Proximal updates ........................ 33
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 ............... 247
    rank 1 updates to L ................. 448
    Size breakdown of the updates ([size]: number of this size):
        updowns [  1]: 60
        updowns [  2]: 16
        updowns [  3]: 17
        updowns [  4]: 6
        updowns [  5]: 8
        updowns [  6]: 4
        updowns [  7]: 1
        updowns [  8]: 1
        updowns [  9]: 6
        updowns [ 10]: 4
        updowns [ 11]: 2
        updowns [ 12]: 1
        updowns [ 13]: 1
        updowns [ 14]: 1
        updowns [ 15]: 1
        updowns [ 16]: 1
        updowns [ 19]: 1
        updowns [ 21]: 1
        updowns [ 22]: 1
        updowns [ 23]: 2
        updowns [ 35]: 1
        updowns [ 40]: 1
        updowns [>= 69]: 1
    No. of solves by depth in the multilevel partition tree:
        (deeper <=> further from root of tree <=> fewer flops)
        depth [ 0]: 74
        depth [ 1]: 785

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 1.230240e-04
Initialization (includes partition) ..... 3.340244e-04
Phase 1 ................................. 4.494190e-04
Coordinate ascent ....................... 2.002716e-05
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 5.006790e-06
DASA .................................... 4.699230e-03
DASA line search ........................ 9.598732e-04
Check error ............................. 5.092621e-04
Proximal update ......................... 4.298687e-04
Invert permutation ...................... 3.790855e-05
Row modifications of Cholesky factor .... 9.918213e-05
Column modifications of Cholesky factor . 4.677773e-04
Cholesky factorization .................. 2.989769e-04
Partial Cholesky factorization .......... 2.074242e-05
Back solves ............................. 6.370544e-04
Forward solves .......................... 1.387596e-04


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             :  2.742092967326756e+04
sup-norm of gradient:  5.675514770648975e-07
Number of iterations: 395       
Function evaluations: 867       
Gradient evaluations: 608       
Subspace iterations: 91        
Number of subspaces: 10        


!!  STEENBRG    540       4       5       4     395     867     608      40      10     0    5.6755148e-07    2.7420930e+04    0.019514
 Final f                         = 2.7420930e+04   
 Function value at final x       = 2.7420930e+04   
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   TFI3

 Problem name: TFI3

 Double precision version will be formed

 The objective function uses 1 nonlinear group
 
 There are 101 linear inequality constraints
 
 There are 3 free variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully

 Problem: TFI3 (n = 3)
walltime at start:     0.000000

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 6.900813e-12 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 6.900813254162586e-12    
Final f                               : 4.301157878304718e+00    

Iterations of gradient projection (GP): 2         
Iterations of active set GP           : 2         
Function evaluation in main code      : 1         
Function evaluations in GP            : 2         
Function evaluations in active set GP : 2         
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 2         
Gradient evaluations in active set GP : 2         


PPROJ run statistics (Version 2.0, May 1, 2018):

No. blocks in multilevel partition of A . 1
Depth of multilevel partition tree ...... 0
Phase 1 iterations ...................... 5
Coordinate ascent iterations ............ 10
    variables freed in coordinate ascent  0
    rows dropped in coordinate ascent ... 27
Gradient ascent iterations .............. 72
    variables freed in gradient ascent .. 0
    rows dropped in gradient ascent ..... 62
Preconditioned CG iterations ............ 28
    variables freed in CG ............... 0
    rows dropped in CG .................. 63
SpaRSA iterations ....................... 7
    change in column activity ........... 0
    change in row activity .............. 2
    failures of Armijo step ............. 1
Proximal updates ........................ 5
Cholesky factorizations ................. 6
    nonzeros in final factor ............ 6 99.9% sparse
    rows dropped from L ................. 139
    rows added to L ..................... 9
    rank 1 downdates to L ............... 0
    rank 1 updates to L ................. 0
    Size breakdown of the updates ([size]: number of this size):
    No. of solves:   105

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 4.196167e-05
Initialization (includes partition) ..... 9.703636e-05
Phase 1 ................................. 9.202957e-05
Coordinate ascent ....................... 1.740456e-05
SSOR0 ................................... 1.058578e-04
SSOR1 ................................... 9.179115e-05
SpaRSA .................................. 3.814697e-06
DASA .................................... 2.127409e-03
DASA line search ........................ 1.292229e-04
Check error ............................. 7.581711e-05
Proximal update ......................... 4.506111e-05
Invert permutation ...................... 8.106232e-06
Row modifications of Cholesky factor .... 9.224415e-04
Column modifications of Cholesky factor . 0.000000e+00
Cholesky factorization .................. 3.950596e-04
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 1.451969e-04
Forward solves .......................... 1.287460e-05


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Number of iterations: 0         
Function evaluations: 0         
Gradient evaluations: 0         

!!      TFI3      3       2       2       2       0       0       0       7       6     0    6.9008133e-12    4.3011579e+00    0.002554
 Final f                         = 4.3011579e+00   
 Function value at final x       = 4.3011579e+00   
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   WATER

 Problem name: WATER

 Double precision version will be formed

 The objective function uses 1 linear group
 The objective function uses 8 nonlinear groups
 
 There are 10 linear equality constraints
 
 There are 31 variables bounded from below and above 
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully

 Problem: WATER (n = 31)
walltime at start:     0.000001

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 7.237944e-07 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 7.237943811244651e-07    
Final f                               : 1.054937946581441e+04    

Iterations of gradient projection (GP): 1         
Iterations of active set GP           : 7         
Function evaluation in main code      : 1         
Function evaluations in GP            : 2         
Function evaluations in active set GP : 8         
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 1         
Gradient evaluations in active set GP : 7         


PPROJ run statistics (Version 2.0, May 1, 2018):

No. blocks in multilevel partition of A . 1
Depth of multilevel partition tree ...... 0
Phase 1 iterations ...................... 5
Coordinate ascent iterations ............ 8
    variables freed in coordinate ascent  3
    rows dropped in coordinate ascent ... 0
Gradient ascent iterations .............. 0
    variables freed in gradient ascent .. 0
    rows dropped in gradient ascent ..... 0
Preconditioned CG iterations ............ 0
    variables freed in CG ............... 0
    rows dropped in CG .................. 0
SpaRSA iterations ....................... 6
    change in column activity ........... 4
    change in row activity .............. 0
    failures of Armijo step ............. 2
Proximal updates ........................ 6
Cholesky factorizations ................. 3
    nonzeros in final factor ............ 34 38.2% sparse
    rows dropped from L ................. 0
    rows added to L ..................... 0
    rank 1 downdates to L ............... 10
    rank 1 updates to L ................. 2
    Size breakdown of the updates ([size]: number of this size):
        updowns [  1]: 5
        updowns [  2]: 2
        updowns [  3]: 1
    No. of solves:   8

-------- Time spent in routines ---------
Multilevel partition and reorder A ...... 4.601479e-05
Initialization (includes partition) ..... 8.702278e-05
Phase 1 ................................. 5.817413e-05
Coordinate ascent ....................... 1.430511e-05
SSOR0 ................................... 0.000000e+00
SSOR1 ................................... 0.000000e+00
SpaRSA .................................. 1.907349e-06
DASA .................................... 1.623631e-04
DASA line search ........................ 1.168251e-05
Check error ............................. 4.243851e-05
Proximal update ......................... 2.646446e-05
Invert permutation ...................... 6.198883e-06
Row modifications of Cholesky factor .... 0.000000e+00
Column modifications of Cholesky factor . 2.980232e-05
Cholesky factorization .................. 2.503395e-05
Partial Cholesky factorization .......... 0.000000e+00
Back solves ............................. 3.814697e-06
Forward solves .......................... 8.344650e-06


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             :  1.054937946582709e+04
sup-norm of gradient:  7.237943811244651e-07
Number of iterations: 11        
Function evaluations: 21        
Gradient evaluations: 11        
Subspace iterations: 4         
Number of subspaces: 1         


!!     WATER     31       1       2       1      11      21      11      10       3     0    7.2379438e-07    1.0549379e+04    0.000667
 Final f                         = 1.0549379e+04   
 Function value at final x       = 1.0549379e+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

 ** SUBROUTINE CUTEST_csetup: Warning. The problem has no general constraints. 
 ** Other tools may be preferable ** 

 Problem: ALLINIT (n = 4)
walltime at start:     0.000001

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 3.745345e-08 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 3.745344834271691e-08    
Final f                               : 1.670596843287990e+01    

Iterations of gradient projection (GP): 2         
Iterations of active set GP           : 2         
Function evaluation in main code      : 1         
Function evaluations in GP            : 2         
Function evaluations in active set GP : 2         
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 1         
Gradient evaluations in active set GP : 2         


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             :  1.670596843287990e+01
sup-norm of gradient:  3.745344834271691e-08
Number of iterations: 11        
Function evaluations: 23        
Gradient evaluations: 12        

!!   ALLINIT      4       2       2       1      11      23      12       1       0     0    3.7453448e-08    1.6705968e+01    0.000139
 Final f                         = 1.6705968e+01   
 Function value at final x       = 1.6705968e+01   
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   BDEXP

 Problem name: BDEXP

 Double precision version will be formed

 The objective function uses 4998 nonlinear groups
 
 There are 5000 variables bounded only from below 
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully

 ** SUBROUTINE CUTEST_csetup: Warning. The problem has no general constraints. 
 ** Other tools may be preferable ** 

 Problem: BDEXP (n = 5000)
walltime at start:     0.000000

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 4.725601e-07 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 4.725600693112168e-07    
Final f                               : 2.859346747312323e-05    

Iterations of gradient projection (GP): 0         
Iterations of active set GP           : 1         
Function evaluation in main code      : 1         
Function evaluations in GP            : 0         
Function evaluations in active set GP : 1         
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 0         
Gradient evaluations in active set GP : 1         


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             :  2.859346747312323e-05
sup-norm of gradient:  4.725600693112168e-07
Number of iterations: 4         
Function evaluations: 8         
Gradient evaluations: 4         

!!     BDEXP   5000       0       0       0       4       8       4       1       0     0    4.7256007e-07    2.8593467e-05    0.011544
 Final f                         = 2.8593467e-05   
 Function value at final x       = 2.8593467e-05   
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   BRATU1D

 Problem name: BRATU1D

 Double precision version will be formed

 The objective function uses 3004 nonlinear groups
 
 There are 1001 free variables
 There are 2 fixed variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully

 ** SUBROUTINE CUTEST_csetup: Warning. The problem has no general constraints. 
 ** Other tools may be preferable ** 

 Problem: BRATU1D (n = 1003)
walltime at start:     0.000001

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 9.785188e-07 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 9.785187558009056e-07    
Final f                               : -8.518927279087505e+00   

Iterations of gradient projection (GP): 0         
Iterations of active set GP           : 0         
Function evaluation in main code      : 1         
Function evaluations in GP            : 0         
Function evaluations in active set GP : 0         
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 0         
Gradient evaluations in active set GP : 0         


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             : -8.518927279087505e+00
sup-norm of gradient:  9.785187558009056e-07
Number of iterations: 5551      
Function evaluations: 5772      
Gradient evaluations: 11414     

!!   BRATU1D   1003       0       0       0    5551    5772   11414       1       0     0    9.7851876e-07   -8.5189273e+00    4.050710
 Final f                         = -8.5189273e+00  
 Function value at final x       = -8.5189273e+00  
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   CAMEL6

 Problem name: CAMEL6

 Double precision version will be formed

 The objective function uses 1 nonlinear group
 
 There are 2 variables bounded from below and above 
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully

 ** SUBROUTINE CUTEST_csetup: Warning. The problem has no general constraints. 
 ** Other tools may be preferable ** 

 Problem: CAMEL6 (n = 2)
walltime at start:     0.000001

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 1.593640e-09 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 1.593639886721121e-09    
Final f                               : -1.031628453489878e+00   

Iterations of gradient projection (GP): 0         
Iterations of active set GP           : 1         
Function evaluation in main code      : 1         
Function evaluations in GP            : 0         
Function evaluations in active set GP : 1         
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 0         
Gradient evaluations in active set GP : 1         


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             : -1.031628453489878e+00
sup-norm of gradient:  1.593639886721121e-09
Number of iterations: 8         
Function evaluations: 16        
Gradient evaluations: 8         

!!    CAMEL6      2       0       0       0       8      16       8       1       0     0    1.5936399e-09   -1.0316285e+00    0.000124
 Final f                         = -1.0316285e+00  
 Function value at final x       = -1.0316285e+00  
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   CLPLATEA

 Problem name: CLPLATEA

 Double precision version will be formed

 The objective function uses 1 linear group
 The objective function uses 19600 nonlinear groups
 
 There are 4970 free variables
 There are 71 fixed variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully

 ** SUBROUTINE CUTEST_csetup: Warning. The problem has no general constraints. 
 ** Other tools may be preferable ** 

 Problem: CLPLATEA (n = 5041)
walltime at start:     0.000001

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 7.196110e-07 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 7.196109657390919e-07    
Final f                               : -1.259209481446316e-02   

Iterations of gradient projection (GP): 0         
Iterations of active set GP           : 0         
Function evaluation in main code      : 1         
Function evaluations in GP            : 0         
Function evaluations in active set GP : 0         
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 0         
Gradient evaluations in active set GP : 0         


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             : -1.259209481446316e-02
sup-norm of gradient:  7.196109657390919e-07
Number of iterations: 986       
Function evaluations: 1975      
Gradient evaluations: 990       
Subspace iterations: 4         
Number of subspaces: 1         


!!  CLPLATEA   5041       0       0       0     986    1975     990       1       0     0    7.1961097e-07   -1.2592095e-02    4.303647
 Final f                         = -1.2592095e-02  
 Function value at final x       = -1.2592095e-02  
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   CLPLATEB

 Problem name: CLPLATEB

 Double precision version will be formed

 The objective function uses 1 linear group
 The objective function uses 19600 nonlinear groups
 
 There are 4970 free variables
 There are 71 fixed variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully

 ** SUBROUTINE CUTEST_csetup: Warning. The problem has no general constraints. 
 ** Other tools may be preferable ** 

 Problem: CLPLATEB (n = 5041)
walltime at start:     0.000001

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 9.766287e-07 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 9.766286836685556e-07    
Final f                               : -5.094786167855425e-03   

Iterations of gradient projection (GP): 0         
Iterations of active set GP           : 0         
Function evaluation in main code      : 1         
Function evaluations in GP            : 0         
Function evaluations in active set GP : 0         
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 0         
Gradient evaluations in active set GP : 0         


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             : -5.094786167855425e-03
sup-norm of gradient:  9.766286836685556e-07
Number of iterations: 307       
Function evaluations: 615       
Gradient evaluations: 309       

!!  CLPLATEB   5041       0       0       0     307     615     309       1       0     0    9.7662868e-07   -5.0947862e-03    1.358289
 Final f                         = -5.0947862e-03  
 Function value at final x       = -5.0947862e-03  
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   CLPLATEC

 Problem name: CLPLATEC

 Double precision version will be formed

 The objective function uses 1 linear group
 The objective function uses 19600 nonlinear groups
 
 There are 4970 free variables
 There are 71 fixed variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully

 ** SUBROUTINE CUTEST_csetup: Warning. The problem has no general constraints. 
 ** Other tools may be preferable ** 

 Problem: CLPLATEC (n = 5041)
walltime at start:     0.000001

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 9.328728e-07 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 9.328727523124592e-07    
Final f                               : -5.020724214436474e-03   

Iterations of gradient projection (GP): 0         
Iterations of active set GP           : 0         
Function evaluation in main code      : 1         
Function evaluations in GP            : 0         
Function evaluations in active set GP : 0         
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 0         
Gradient evaluations in active set GP : 0         


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             : -5.020724214436474e-03
sup-norm of gradient:  9.328727523124592e-07
Number of iterations: 36547     
Function evaluations: 36553     
Gradient evaluations: 73088     

!!  CLPLATEC   5041       0       0       0   36547   36553   73088       1       0     0    9.3287275e-07   -5.0207242e-03  196.670227
 Final f                         = -5.0207242e-03  
 Function value at final x       = -5.0207242e-03  
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   DRCAV1LQ

 Problem name: DRCAV1LQ

 Double precision version will be formed

 The objective function uses 3969 nonlinear groups
 
 There are 3969 free variables
 There are 520 fixed variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully

 ** SUBROUTINE CUTEST_csetup: Warning. The problem has no general constraints. 
 ** Other tools may be preferable ** 

 Problem: DRCAV1LQ (n = 4489)
walltime at start:     0.000001

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 9.779752e-07 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 9.779751664782760e-07    
Final f                               : 1.546422182653122e-07    

Iterations of gradient projection (GP): 0         
Iterations of active set GP           : 0         
Function evaluation in main code      : 1         
Function evaluations in GP            : 0         
Function evaluations in active set GP : 0         
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 0         
Gradient evaluations in active set GP : 0         


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             :  1.546422182653122e-07
sup-norm of gradient:  9.779751664782760e-07
Number of iterations: 194500    
Function evaluations: 216361    
Gradient evaluations: 367139    

!!  DRCAV1LQ   4489       0       0       0  194500  216361  367139       1       0     0    9.7797517e-07    1.5464222e-07  504.475351
 Final f                         = 1.5464222e-07   
 Function value at final x       = 1.5464222e-07   
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   DRCAV2LQ

 Problem name: DRCAV2LQ

 Double precision version will be formed

 The objective function uses 3969 nonlinear groups
 
 There are 3969 free variables
 There are 520 fixed variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully

 ** SUBROUTINE CUTEST_csetup: Warning. The problem has no general constraints. 
 ** Other tools may be preferable ** 

 Problem: DRCAV2LQ (n = 4489)
walltime at start:     0.000001

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 9.972724e-07 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 9.972724117213008e-07    
Final f                               : 1.301764858747571e-07    

Iterations of gradient projection (GP): 0         
Iterations of active set GP           : 0         
Function evaluation in main code      : 1         
Function evaluations in GP            : 0         
Function evaluations in active set GP : 0         
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 0         
Gradient evaluations in active set GP : 0         


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             :  1.301764858747571e-07
sup-norm of gradient:  9.972724117213008e-07
Number of iterations: 405201    
Function evaluations: 429021    
Gradient evaluations: 786582    

!!  DRCAV2LQ   4489       0       0       0  405201  429021  786582       1       0     0    9.9727241e-07    1.3017649e-07 1046.444083
 Final f                         = 1.3017649e-07   
 Function value at final x       = 1.3017649e-07   
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   DRCAV3LQ

 Problem name: DRCAV3LQ

 Double precision version will be formed

 The objective function uses 3969 nonlinear groups
 
 There are 3969 free variables
 There are 520 fixed variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully

 ** SUBROUTINE CUTEST_csetup: Warning. The problem has no general constraints. 
 ** Other tools may be preferable ** 

 Problem: DRCAV3LQ (n = 4489)
walltime at start:     0.000001

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 9.403050e-07 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 9.403049986364553e-07    
Final f                               : 3.116561572225344e-07    

Iterations of gradient projection (GP): 0         
Iterations of active set GP           : 0         
Function evaluation in main code      : 1         
Function evaluations in GP            : 0         
Function evaluations in active set GP : 0         
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 0         
Gradient evaluations in active set GP : 0         


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             :  3.116561572225344e-07
sup-norm of gradient:  9.403049986364553e-07
Number of iterations: 5356802   
Function evaluations: 10713605  
Gradient evaluations: 5356804   

!!  DRCAV3LQ   4489       0       0       0 5356802 10713605 5356804       1       0     0    9.4030500e-07    3.1165616e-07 6006.972354
 Final f                         = 3.1165616e-07   
 Function value at final x       = 3.1165616e-07   
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   EG1

 Problem name: EG1

 Double precision version will be formed

 The objective function uses 3 nonlinear groups
 
 There is 1 free variable 
 There are 2 variables bounded from below and above 
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully

 ** SUBROUTINE CUTEST_csetup: Warning. The problem has no general constraints. 
 ** Other tools may be preferable ** 

 Problem: EG1 (n = 3)
walltime at start:     0.000001

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 2.138020e-09 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 2.138019816744219e-09    
Final f                               : -1.132800782583661e+00   

Iterations of gradient projection (GP): 0         
Iterations of active set GP           : 1         
Function evaluation in main code      : 1         
Function evaluations in GP            : 0         
Function evaluations in active set GP : 1         
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 0         
Gradient evaluations in active set GP : 1         


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             : -1.132800782583661e+00
sup-norm of gradient:  2.138019816744219e-09
Number of iterations: 6         
Function evaluations: 12        
Gradient evaluations: 6         

!!       EG1      3       0       0       0       6      12       6       1       0     0    2.1380198e-09   -1.1328008e+00    0.000075
 Final f                         = -1.1328008e+00  
 Function value at final x       = -1.1328008e+00  
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   EXPLIN

 Problem name: EXPLIN

 Double precision version will be formed

 The objective function uses 1 nonlinear group
 
 There are 1200 variables bounded from below and above 
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully

 ** SUBROUTINE CUTEST_csetup: Warning. The problem has no general constraints. 
 ** Other tools may be preferable ** 

 Problem: EXPLIN (n = 1200)
walltime at start:     0.000001

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 6.153576e-07 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 6.153576350698131e-07    
Final f                               : -7.192548399947344e+07   

Iterations of gradient projection (GP): 5         
Iterations of active set GP           : 53        
Function evaluation in main code      : 1         
Function evaluations in GP            : 3         
Function evaluations in active set GP : 101       
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 3         
Gradient evaluations in active set GP : 74        


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             : -7.192548399947344e+07
sup-norm of gradient:  6.153576350698131e-07
Number of iterations: 220       
Function evaluations: 392       
Gradient evaluations: 260       

!!    EXPLIN   1200       5       3       3     220     392     260       1       0     0    6.1535764e-07   -7.1925484e+07    0.007745
 Final f                         = -7.1925484e+07  
 Function value at final x       = -7.1925484e+07  
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   EXPLIN2

 Problem name: EXPLIN2

 Double precision version will be formed

 The objective function uses 1 nonlinear group
 
 There are 1200 variables bounded from below and above 
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully

 ** SUBROUTINE CUTEST_csetup: Warning. The problem has no general constraints. 
 ** Other tools may be preferable ** 

 Problem: EXPLIN2 (n = 1200)
walltime at start:     0.000000

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 3.810740e-07 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 3.810739599430235e-07    
Final f                               : -7.199883367983921e+07   

Iterations of gradient projection (GP): 16        
Iterations of active set GP           : 32        
Function evaluation in main code      : 1         
Function evaluations in GP            : 9         
Function evaluations in active set GP : 40        
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 8         
Gradient evaluations in active set GP : 38        


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             : -7.199883367983921e+07
sup-norm of gradient:  3.810739599430235e-07
Number of iterations: 67        
Function evaluations: 115       
Gradient evaluations: 75        

!!   EXPLIN2   1200      16       9       8      67     115      75       1       0     0    3.8107396e-07   -7.1998834e+07    0.002861
 Final f                         = -7.1998834e+07  
 Function value at final x       = -7.1998834e+07  
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   EXPQUAD

 Problem name: EXPQUAD

 Double precision version will be formed

 The objective function uses 1 nonlinear group
 
 There are 1100 free variables
 There are 100 variables bounded from below and above 
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully

 ** SUBROUTINE CUTEST_csetup: Warning. The problem has no general constraints. 
 ** Other tools may be preferable ** 

 Problem: EXPQUAD (n = 1200)
walltime at start:     0.000000

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 4.168569e-07 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 4.168568921159022e-07    
Final f                               : -3.684939565731813e+09   

Iterations of gradient projection (GP): 14        
Iterations of active set GP           : 98        
Function evaluation in main code      : 1         
Function evaluations in GP            : 4         
Function evaluations in active set GP : 156       
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 4         
Gradient evaluations in active set GP : 121       


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             : -3.684939565731813e+09
sup-norm of gradient:  4.168568921159022e-07
Number of iterations: 316       
Function evaluations: 588       
Gradient evaluations: 419       
Subspace iterations: 17        
Number of subspaces: 8         


!!   EXPQUAD   1200      14       4       4     316     588     419       1       0     0    4.1685689e-07   -3.6849396e+09    0.034584
 Final f                         = -3.6849396e+09  
 Function value at final x       = -3.6849396e+09  
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   HADAMALS

 Problem name: HADAMALS

 Double precision version will be formed

 The objective function uses 590 nonlinear groups
 
 There are 380 variables bounded from below and above 
 There are 20 fixed variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully

 ** SUBROUTINE CUTEST_csetup: Warning. The problem has no general constraints. 
 ** Other tools may be preferable ** 

 Problem: HADAMALS (n = 400)
walltime at start:     0.000001

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 9.645373e-07 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 9.645373164612892e-07    
Final f                               : 7.311843149959055e+03    

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         


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             :  7.311843149959055e+03
sup-norm of gradient:  9.645373164612892e-07
Number of iterations: 7         
Function evaluations: 16        
Gradient evaluations: 13        

!!  HADAMALS    400       0       0       0       7      16      13       1       0     0    9.6453732e-07    7.3118431e+03    0.003162
 Final f                         = 7.3118431e+03   
 Function value at final x       = 7.3118431e+03   
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   HART6

 Problem name: HART6

 Double precision version will be formed

 The objective function uses 4 nonlinear groups
 
 There are 6 variables bounded from below and above 
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully

 ** SUBROUTINE CUTEST_csetup: Warning. The problem has no general constraints. 
 ** Other tools may be preferable ** 

 Problem: HART6 (n = 6)
walltime at start:     0.000001

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 1.154592e-07 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 1.154592402013141e-07    
Final f                               : -3.322886891589317e+00   

Iterations of gradient projection (GP): 0         
Iterations of active set GP           : 1         
Function evaluation in main code      : 1         
Function evaluations in GP            : 0         
Function evaluations in active set GP : 1         
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 0         
Gradient evaluations in active set GP : 1         


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             : -3.322886891589317e+00
sup-norm of gradient:  1.154592402013141e-07
Number of iterations: 11        
Function evaluations: 22        
Gradient evaluations: 11        

!!     HART6      6       0       0       0      11      22      11       1       0     0    1.1545924e-07   -3.3228869e+00    0.000124
 Final f                         = -3.3228869e+00  
 Function value at final x       = -3.3228869e+00  
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   HIMMELP1

 Problem name: HIMMELP1

 Double precision version will be formed

 The objective function uses 1 nonlinear group
 
 There are 2 variables bounded from below and above 
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully

 ** SUBROUTINE CUTEST_csetup: Warning. The problem has no general constraints. 
 ** Other tools may be preferable ** 

 Problem: HIMMELP1 (n = 2)
walltime at start:     0.000001

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 1.002758e-07 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 1.002758098778145e-07    
Final f                               : -2.389741895043875e+01   

Iterations of gradient projection (GP): 0         
Iterations of active set GP           : 2         
Function evaluation in main code      : 1         
Function evaluations in GP            : 0         
Function evaluations in active set GP : 3         
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 0         
Gradient evaluations in active set GP : 2         


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             : -2.389741895043875e+01
sup-norm of gradient:  1.002758098778145e-07
Number of iterations: 3         
Function evaluations: 6         
Gradient evaluations: 3         

!!  HIMMELP1      2       0       0       0       3       6       3       1       0     0    1.0027581e-07   -2.3897419e+01    0.000076
 Final f                         = -2.3897419e+01  
 Function value at final x       = -2.3897419e+01  
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   HOLMES

 Problem name: HOLMES

 Double precision version will be formed

 The objective function uses 2039 nonlinear groups
 
 There are 180 variables bounded only from below 
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully

 ** SUBROUTINE CUTEST_csetup: Warning. The problem has no general constraints. 
 ** Other tools may be preferable ** 

 Problem: HOLMES (n = 180)
walltime at start:     0.000001

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 4.124119e-07 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 4.124119420967354e-07    
Final f                               : 1.248150348141313e+03    

Iterations of gradient projection (GP): 2         
Iterations of active set GP           : 22        
Function evaluation in main code      : 1         
Function evaluations in GP            : 3         
Function evaluations in active set GP : 27        
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 1         
Gradient evaluations in active set GP : 22        


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             :  1.248150348141313e+03
sup-norm of gradient:  4.124119420967354e-07
Number of iterations: 21        
Function evaluations: 31        
Gradient evaluations: 23        

!!    HOLMES    180       2       3       1      21      31      23       1       0     0    4.1241194e-07    1.2481503e+03    0.076357
 Final f                         = 1.2481503e+03   
 Function value at final x       = 1.2481503e+03   
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   HS38

 Problem name: HS38

 Double precision version will be formed

 The objective function uses 7 nonlinear groups
 
 There are 4 variables bounded from below and above 
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully

 ** SUBROUTINE CUTEST_csetup: Warning. The problem has no general constraints. 
 ** Other tools may be preferable ** 

 Problem: HS38 (n = 4)
walltime at start:     0.000001

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 1.296644e-09 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 1.296644125404940e-09    
Final f                               : 1.406953689070665e-21    

Iterations of gradient projection (GP): 0         
Iterations of active set GP           : 1         
Function evaluation in main code      : 1         
Function evaluations in GP            : 0         
Function evaluations in active set GP : 1         
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 0         
Gradient evaluations in active set GP : 1         


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             :  1.406953689070665e-21
sup-norm of gradient:  1.296644125404940e-09
Number of iterations: 24        
Function evaluations: 53        
Gradient evaluations: 31        

!!      HS38      4       0       0       0      24      53      31       1       0     0    1.2966441e-09    1.4069537e-21    0.000131
 Final f                         = 1.4069537e-21   
 Function value at final x       = 1.4069537e-21   
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   HS4

 Problem name: HS4

 Double precision version will be formed

 The objective function uses 1 linear group
 The objective function uses 1 nonlinear group
 
 There are 2 variables bounded only from below 
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully

 ** SUBROUTINE CUTEST_csetup: Warning. The problem has no general constraints. 
 ** Other tools may be preferable ** 

 Problem: HS4 (n = 2)
walltime at start:     0.000001

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 0.000000e+00 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 0.000000000000000e+00    
Final f                               : 2.666666664000000e+00    

Iterations of gradient projection (GP): 0         
Iterations of active set GP           : 1         
Function evaluation in main code      : 1         
Function evaluations in GP            : 0         
Function evaluations in active set GP : 1         
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 0         
Gradient evaluations in active set GP : 1         


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Number of iterations: 0         
Function evaluations: 0         
Gradient evaluations: 0         

!!       HS4      2       0       0       0       0       0       0       1       0     0    0.0000000e+00    2.6666667e+00    0.000053
 Final f                         = 2.6666667e+00   
 Function value at final x       = 2.6666667e+00   
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   HS45

 Problem name: HS45

 Double precision version will be formed

 The objective function uses 1 nonlinear group
 
 There are 5 variables bounded from below and above 
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully

 ** SUBROUTINE CUTEST_csetup: Warning. The problem has no general constraints. 
 ** Other tools may be preferable ** 

 Problem: HS45 (n = 5)
walltime at start:     0.000001

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 0.000000e+00 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 0.000000000000000e+00    
Final f                               : 1.000000000400000e+00    

Iterations of gradient projection (GP): 1         
Iterations of active set GP           : 2         
Function evaluation in main code      : 1         
Function evaluations in GP            : 0         
Function evaluations in active set GP : 2         
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 0         
Gradient evaluations in active set GP : 2         


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Number of iterations: 0         
Function evaluations: 0         
Gradient evaluations: 0         

!!      HS45      5       1       0       0       0       0       0       1       0     0    0.0000000e+00    1.0000000e+00    0.000064
 Final f                         = 1.0000000e+00   
 Function value at final x       = 1.0000000e+00   
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   HS5

 Problem name: HS5

 Double precision version will be formed

 The objective function uses 1 linear group
 The objective function uses 2 nonlinear groups
 
 There are 2 variables bounded from below and above 
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully

 ** SUBROUTINE CUTEST_csetup: Warning. The problem has no general constraints. 
 ** Other tools may be preferable ** 

 Problem: HS5 (n = 2)
walltime at start:     0.000001

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 2.229711e-07 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 2.229710558410147e-07    
Final f                               : -1.913222954981016e+00   

Iterations of gradient projection (GP): 0         
Iterations of active set GP           : 1         
Function evaluation in main code      : 1         
Function evaluations in GP            : 0         
Function evaluations in active set GP : 1         
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 0         
Gradient evaluations in active set GP : 1         


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             : -1.913222954981016e+00
sup-norm of gradient:  2.229710558410147e-07
Number of iterations: 5         
Function evaluations: 10        
Gradient evaluations: 5         

!!       HS5      2       0       0       0       5      10       5       1       0     0    2.2297106e-07   -1.9132230e+00    0.000097
 Final f                         = -1.9132230e+00  
 Function value at final x       = -1.9132230e+00  
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   LMINSURF

 Problem name: LMINSURF

 Double precision version will be formed

 The objective function uses 5476 nonlinear groups
 
 There are 5329 free variables
 There are 296 fixed variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully

 ** SUBROUTINE CUTEST_csetup: Warning. The problem has no general constraints. 
 ** Other tools may be preferable ** 

 Problem: LMINSURF (n = 5625)
walltime at start:     0.000000

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 9.320803e-07 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 9.320802718225385e-07    
Final f                               : 8.999999994040602e+00    

Iterations of gradient projection (GP): 0         
Iterations of active set GP           : 0         
Function evaluation in main code      : 1         
Function evaluations in GP            : 0         
Function evaluations in active set GP : 0         
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 0         
Gradient evaluations in active set GP : 0         


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             :  8.999999994040602e+00
sup-norm of gradient:  9.320802718225385e-07
Number of iterations: 511       
Function evaluations: 1025      
Gradient evaluations: 514       

!!  LMINSURF   5625       0       0       0     511    1025     514       1       0     0    9.3208027e-07    9.0000000e+00    0.516202
 Final f                         = 9.0000000e+00   
 Function value at final x       = 9.0000000e+00   
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   LOGROS

 Problem name: LOGROS

 Double precision version will be formed

 The objective function uses 1 nonlinear group
 
 There are 2 variables bounded only from below 
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully

 ** SUBROUTINE CUTEST_csetup: Warning. The problem has no general constraints. 
 ** Other tools may be preferable ** 

 Problem: LOGROS (n = 2)
walltime at start:     0.000001

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 5.781819e-08 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 5.781819467642860e-08    
Final f                               : 5.107025913275707e-15    

Iterations of gradient projection (GP): 0         
Iterations of active set GP           : 1         
Function evaluation in main code      : 1         
Function evaluations in GP            : 0         
Function evaluations in active set GP : 1         
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 0         
Gradient evaluations in active set GP : 1         


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             :  5.107025913275707e-15
sup-norm of gradient:  5.781819467642860e-08
Number of iterations: 73        
Function evaluations: 187       
Gradient evaluations: 119       

!!    LOGROS      2       0       0       0      73     187     119       1       0     0    5.7818195e-08    5.1070259e-15    0.000215
 Final f                         = 5.1070259e-15   
 Function value at final x       = 5.1070259e-15   
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   MAXLIKA

 Problem name: MAXLIKA

 Double precision version will be formed

 The objective function uses 235 nonlinear groups
 
 There are 8 variables bounded from below and above 
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully

 ** SUBROUTINE CUTEST_csetup: Warning. The problem has no general constraints. 
 ** Other tools may be preferable ** 

 Problem: MAXLIKA (n = 8)
walltime at start:     0.000001

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 6.021850e-12 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 6.021849685566849e-12    
Final f                               : 1.136307296897004e+03    

Iterations of gradient projection (GP): 5         
Iterations of active set GP           : 6         
Function evaluation in main code      : 1         
Function evaluations in GP            : 4         
Function evaluations in active set GP : 7         
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 2         
Gradient evaluations in active set GP : 6         


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             :  1.136307296897004e+03
sup-norm of gradient:  6.021849685566849e-12
Number of iterations: 98        
Function evaluations: 191       
Gradient evaluations: 108       

!!   MAXLIKA      8       5       4       2      98     191     108       1       0     0    6.0218497e-12    1.1363073e+03    0.016373
 Final f                         = 1.1363073e+03   
 Function value at final x       = 1.1363073e+03   
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   MCCORMCK

 Problem name: MCCORMCK

 Double precision version will be formed

 The objective function uses 4999 nonlinear groups
 
 There are 5000 variables bounded from below and above 
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully

 ** SUBROUTINE CUTEST_csetup: Warning. The problem has no general constraints. 
 ** Other tools may be preferable ** 

 Problem: MCCORMCK (n = 5000)
walltime at start:     0.000000

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 9.702605e-07 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 9.702605399120046e-07    
Final f                               : -4.566580552800192e+03   

Iterations of gradient projection (GP): 0         
Iterations of active set GP           : 2         
Function evaluation in main code      : 1         
Function evaluations in GP            : 0         
Function evaluations in active set GP : 2         
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 0         
Gradient evaluations in active set GP : 2         


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             : -4.566580552800192e+03
sup-norm of gradient:  9.702605399120046e-07
Number of iterations: 11        
Function evaluations: 19        
Gradient evaluations: 14        

!!  MCCORMCK   5000       0       0       0      11      19      14       1       0     0    9.7026054e-07   -4.5665806e+03    0.019852
 Final f                         = -4.5665806e+03  
 Function value at final x       = -4.5665806e+03  
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   MDHOLE

 Problem name: MDHOLE

 Double precision version will be formed

 The objective function uses 1 linear group
 The objective function uses 1 nonlinear group
 
 There is 1 free variable 
 There is 1 variable bounded only from below 
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully

 ** SUBROUTINE CUTEST_csetup: Warning. The problem has no general constraints. 
 ** Other tools may be preferable ** 

 Problem: MDHOLE (n = 2)
walltime at start:     0.000000

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 8.673617e-17 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 8.673617379884035e-17    
Final f                               : 1.880790961315660e-35    

Iterations of gradient projection (GP): 0         
Iterations of active set GP           : 2         
Function evaluation in main code      : 1         
Function evaluations in GP            : 0         
Function evaluations in active set GP : 3         
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 0         
Gradient evaluations in active set GP : 2         


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             :  1.880790961315660e-35
sup-norm of gradient:  8.673617379884035e-17
Number of iterations: 56        
Function evaluations: 135       
Gradient evaluations: 83        

!!    MDHOLE      2       0       0       0      56     135      83       1       0     0    8.6736174e-17    1.8807910e-35    0.000185
 Final f                         = 1.8807910e-35   
 Function value at final x       = 1.8807910e-35   
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   MINSURF

 Problem name: MINSURF

 Double precision version will be formed

 The objective function uses 49 nonlinear groups
 
 There are 36 free variables
 There are 28 fixed variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully

 ** SUBROUTINE CUTEST_csetup: Warning. The problem has no general constraints. 
 ** Other tools may be preferable ** 

 Problem: MINSURF (n = 64)
walltime at start:     0.000001

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 2.453373e-07 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 2.453372871253928e-07    
Final f                               : 1.000000001700355e+00    

Iterations of gradient projection (GP): 0         
Iterations of active set GP           : 0         
Function evaluation in main code      : 1         
Function evaluations in GP            : 0         
Function evaluations in active set GP : 0         
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 0         
Gradient evaluations in active set GP : 0         


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             :  1.000000001700355e+00
sup-norm of gradient:  2.453372871253928e-07
Number of iterations: 12        
Function evaluations: 24        
Gradient evaluations: 12        
Subspace iterations: 6         
Number of subspaces: 1         


!!   MINSURF     64       0       0       0      12      24      12       1       0     0    2.4533729e-07    1.0000000e+00    0.000245
 Final f                         = 1.0000000e+00   
 Function value at final x       = 1.0000000e+00   
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   MINSURFO

 Problem name: MINSURFO

 Double precision version will be formed

 The objective function uses 10302 nonlinear groups
 
 There are 5002 variables bounded only from below 
 There are 304 fixed variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully

 ** SUBROUTINE CUTEST_csetup: Warning. The problem has no general constraints. 
 ** Other tools may be preferable ** 

 Problem: MINSURFO (n = 5306)
walltime at start:     0.000001

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 8.727574e-07 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 8.727573747648607e-07    
Final f                               : 2.506949264276260e+00    

Iterations of gradient projection (GP): 4         
Iterations of active set GP           : 4         
Function evaluation in main code      : 1         
Function evaluations in GP            : 0         
Function evaluations in active set GP : 9         
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 0         
Gradient evaluations in active set GP : 6         


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             :  2.506949264276260e+00
sup-norm of gradient:  8.727573747648607e-07
Number of iterations: 420       
Function evaluations: 841       
Gradient evaluations: 421       

!!  MINSURFO   5306       4       0       0     420     841     421       1       0     0    8.7275737e-07    2.5069493e+00    0.659912
 Final f                         = 2.5069493e+00   
 Function value at final x       = 2.5069493e+00   
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   NLMSURF

 Problem name: NLMSURF

 Double precision version will be formed

 The objective function uses 5476 nonlinear groups
 
 There are 5329 free variables
 There are 296 fixed variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully

 ** SUBROUTINE CUTEST_csetup: Warning. The problem has no general constraints. 
 ** Other tools may be preferable ** 

 Problem: NLMSURF (n = 5625)
walltime at start:     0.000001

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 9.690489e-07 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 9.690488527395319e-07    
Final f                               : 3.894898481589055e+01    

Iterations of gradient projection (GP): 0         
Iterations of active set GP           : 0         
Function evaluation in main code      : 1         
Function evaluations in GP            : 0         
Function evaluations in active set GP : 0         
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 0         
Gradient evaluations in active set GP : 0         


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             :  3.894898481589055e+01
sup-norm of gradient:  9.690488527395319e-07
Number of iterations: 3557      
Function evaluations: 7095      
Gradient evaluations: 3582      

!!   NLMSURF   5625       0       0       0    3557    7095    3582       1       0     0    9.6904885e-07    3.8948985e+01    3.129326
 Final f                         = 3.8948985e+01   
 Function value at final x       = 3.8948985e+01   
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   ODC

 Problem name: ODC

 Double precision version will be formed

 The objective function uses 10082 nonlinear groups
 
 There are 4900 free variables
 There are 284 fixed variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully

 ** SUBROUTINE CUTEST_csetup: Warning. The problem has no general constraints. 
 ** Other tools may be preferable ** 

 Problem: ODC (n = 5184)
walltime at start:     0.000001

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 9.719933e-07 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 9.719932557891416e-07    
Final f                               : -1.137179620585191e-02   

Iterations of gradient projection (GP): 0         
Iterations of active set GP           : 0         
Function evaluation in main code      : 1         
Function evaluations in GP            : 0         
Function evaluations in active set GP : 0         
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 0         
Gradient evaluations in active set GP : 0         


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             : -1.137179620585191e-02
sup-norm of gradient:  9.719932557891416e-07
Number of iterations: 263       
Function evaluations: 526       
Gradient evaluations: 263       

!!       ODC   5184       0       0       0     263     526     263       1       0     0    9.7199326e-07   -1.1371796e-02    0.558765
 Final f                         = -1.1371796e-02  
 Function value at final x       = -1.1371796e-02  
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   POWELLBC

 Problem name: POWELLBC

 Double precision version will be formed

 The objective function uses 1 nonlinear group
 
 There are 1000 variables bounded from below and above 
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully

 ** SUBROUTINE CUTEST_csetup: Warning. The problem has no general constraints. 
 ** Other tools may be preferable ** 

 Problem: POWELLBC (n = 1000)
walltime at start:     0.000001

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 7.359629e-07 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 7.359628694247888e-07    
Final f                               : 3.103622303961614e+05    

Iterations of gradient projection (GP): 0         
Iterations of active set GP           : 121       
Function evaluation in main code      : 1         
Function evaluations in GP            : 0         
Function evaluations in active set GP : 166       
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 0         
Gradient evaluations in active set GP : 121       


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             :  3.103622303961614e+05
sup-norm of gradient:  7.359628694247888e-07
Number of iterations: 2498      
Function evaluations: 3934      
Gradient evaluations: 4112      

!!  POWELLBC   1000       0       0       0    2498    3934    4112       1       0     0    7.3596287e-07    3.1036223e+05   21.870692
 Final f                         = 3.1036223e+05   
 Function value at final x       = 3.1036223e+05   
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   PROBPENL

 Problem name: PROBPENL

 Double precision version will be formed

 The objective function uses 500 nonlinear groups
 
 There are 500 variables bounded from below and above 
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully

 ** SUBROUTINE CUTEST_csetup: Warning. The problem has no general constraints. 
 ** Other tools may be preferable ** 

 Problem: PROBPENL (n = 500)
walltime at start:     0.000001

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 1.992004e-07 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 1.992004347982958e-07    
Final f                               : 3.991983927190978e-07    

Iterations of gradient projection (GP): 0         
Iterations of active set GP           : 1         
Function evaluation in main code      : 1         
Function evaluations in GP            : 0         
Function evaluations in active set GP : 1         
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 0         
Gradient evaluations in active set GP : 1         


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             :  3.991983927190978e-07
sup-norm of gradient:  1.992004347982958e-07
Number of iterations: 1         
Function evaluations: 2         
Gradient evaluations: 1         

!!  PROBPENL    500       0       0       0       1       2       1       1       0     0    1.9920043e-07    3.9919839e-07    0.000364
 Final f                         = 3.9919839e-07   
 Function value at final x       = 3.9919839e-07   
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   QRTQUAD

 Problem name: QRTQUAD

 Double precision version will be formed

 The objective function uses 1 nonlinear group
 
 There are 3900 free variables
 There are 1100 variables bounded from below and above 
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully

 ** SUBROUTINE CUTEST_csetup: Warning. The problem has no general constraints. 
 ** Other tools may be preferable ** 

 Problem: QRTQUAD (n = 5000)
walltime at start:     0.000000

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 8.658236e-07 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 8.658235515213164e-07    
Final f                               : -2.648560227067253e+11   

Iterations of gradient projection (GP): 16        
Iterations of active set GP           : 266       
Function evaluation in main code      : 1         
Function evaluations in GP            : 0         
Function evaluations in active set GP : 474       
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 0         
Gradient evaluations in active set GP : 429       


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             : -2.648560227067253e+11
sup-norm of gradient:  8.658235515213164e-07
Number of iterations: 4520      
Function evaluations: 6220      
Gradient evaluations: 10636     
Subspace iterations: 1632      
Number of subspaces: 267       


!!   QRTQUAD   5000      16       0       0    4520    6220   10636       1       0     0    8.6582355e-07   -2.6485602e+11    1.897248
 Final f                         = -2.6485602e+11  
 Function value at final x       = -2.6485602e+11  
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   RAYBENDL

 Problem name: RAYBENDL

 Double precision version will be formed

 The objective function uses 1024 nonlinear groups
 
 There are 2046 free variables
 There are 4 fixed variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully

 ** SUBROUTINE CUTEST_csetup: Warning. The problem has no general constraints. 
 ** Other tools may be preferable ** 

 Problem: RAYBENDL (n = 2050)
walltime at start:     0.000000

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 9.490021e-07 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 9.490021052327435e-07    
Final f                               : 9.624237838109690e+01    

Iterations of gradient projection (GP): 0         
Iterations of active set GP           : 0         
Function evaluation in main code      : 1         
Function evaluations in GP            : 0         
Function evaluations in active set GP : 0         
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 0         
Gradient evaluations in active set GP : 0         


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             :  9.624237838109690e+01
sup-norm of gradient:  9.490021052327435e-07
Number of iterations: 13044     
Function evaluations: 22434     
Gradient evaluations: 16706     

!!  RAYBENDL   2050       0       0       0   13044   22434   16706       1       0     0    9.4900211e-07    9.6242378e+01    2.844176
 Final f                         = 9.6242378e+01   
 Function value at final x       = 9.6242378e+01   
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   RAYBENDS

 Problem name: RAYBENDS

 Double precision version will be formed

 The objective function uses 1026 nonlinear groups
 
 There are 2046 free variables
 There are 4 fixed variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully

 ** SUBROUTINE CUTEST_csetup: Warning. The problem has no general constraints. 
 ** Other tools may be preferable ** 

 Problem: RAYBENDS (n = 2050)
walltime at start:     0.000000

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 9.512090e-07 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 9.512089507168753e-07    
Final f                               : 9.624171097879515e+01    

Iterations of gradient projection (GP): 0         
Iterations of active set GP           : 0         
Function evaluation in main code      : 1         
Function evaluations in GP            : 0         
Function evaluations in active set GP : 0         
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 0         
Gradient evaluations in active set GP : 0         


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             :  9.624171097879515e+01
sup-norm of gradient:  9.512089507168753e-07
Number of iterations: 1765      
Function evaluations: 3349      
Gradient evaluations: 1954      

!!  RAYBENDS   2050       0       0       0    1765    3349    1954       1       0     0    9.5120895e-07    9.6241711e+01   11.556063
 Final f                         = 9.6241711e+01   
 Function value at final x       = 9.6241711e+01   
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   S368

 Problem name: S368

 Double precision version will be formed

 The objective function uses 128 nonlinear groups
 
 There are 8 variables bounded from below and above 
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully

 ** SUBROUTINE CUTEST_csetup: Warning. The problem has no general constraints. 
 ** Other tools may be preferable ** 

 Problem: S368 (n = 8)
walltime at start:     0.000001

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 6.332060e-07 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 6.332059878655372e-07    
Final f                               : -7.499999999998372e-01   

Iterations of gradient projection (GP): 0         
Iterations of active set GP           : 2         
Function evaluation in main code      : 1         
Function evaluations in GP            : 0         
Function evaluations in active set GP : 2         
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 0         
Gradient evaluations in active set GP : 2         


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             : -7.499999999998372e-01
sup-norm of gradient:  6.332059878655372e-07
Number of iterations: 6         
Function evaluations: 12        
Gradient evaluations: 6         

!!      S368      8       0       0       0       6      12       6       1       0     0    6.3320599e-07   -7.5000000e-01    0.000188
 Final f                         = -7.5000000e-01  
 Function value at final x       = -7.5000000e-01  
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   SINEALI

 Problem name: SINEALI

 Double precision version will be formed

 The objective function uses 1 linear group
 The objective function uses 999 nonlinear groups
 
 There are 1000 variables bounded from below and above 
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully

 ** SUBROUTINE CUTEST_csetup: Warning. The problem has no general constraints. 
 ** Other tools may be preferable ** 

 Problem: SINEALI (n = 1000)
walltime at start:     0.000001

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 6.266982e-07 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 6.266982072994291e-07    
Final f                               : -9.990096164870949e+04   

Iterations of gradient projection (GP): 0         
Iterations of active set GP           : 1         
Function evaluation in main code      : 1         
Function evaluations in GP            : 0         
Function evaluations in active set GP : 1         
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 0         
Gradient evaluations in active set GP : 1         


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             : -9.990096164870949e+04
sup-norm of gradient:  6.266982072994291e-07
Number of iterations: 43        
Function evaluations: 74        
Gradient evaluations: 62        

!!   SINEALI   1000       0       0       0      43      74      62       1       0     0    6.2669821e-07   -9.9900962e+04    0.014695
 Final f                         = -9.9900962e+04  
 Function value at final x       = -9.9900962e+04  
 ====================================================

sifdecoder -A pc64.lnx.gfo -st   SSC

 Problem name: SSC

 Double precision version will be formed

 The objective function uses 10082 nonlinear groups
 
 There are 4900 free variables
 There are 284 fixed variables
 
 
 File successfully decoded
 CUTEST: tools (double precision version) compiled successfully
 CUTEst: pasa (double precision version) compiled successfully

 ** SUBROUTINE CUTEST_csetup: Warning. The problem has no general constraints. 
 ** Other tools may be preferable ** 

 Problem: SSC (n = 5184)
walltime at start:     0.000001

PASA run status (Version 1.0, May 1, 2018): 0

PASA success: Error 7.878113e-07 satisfies error tolerance 1.000000e-06.


PASA run statistics (Version 1.0, May 1, 2018):
|| P (x - g) - x ||                   : 7.878113489443329e-07    
Final f                               : -2.078173275083308e+00   

Iterations of gradient projection (GP): 0         
Iterations of active set GP           : 0         
Function evaluation in main code      : 1         
Function evaluations in GP            : 0         
Function evaluations in active set GP : 0         
Gradient evaluations in main code     : 1         
Gradient evaluations in GP            : 0         
Gradient evaluations in active set GP : 0         


CG_DESCENT (Version 7.0, May 1, 2018) run statistics:

Final f             : -2.078173275083308e+00
sup-norm of gradient:  7.878113489443329e-07
Number of iterations: 132       
Function evaluations: 186       
Gradient evaluations: 210       

!!       SSC   5184       0       0       0     132     186     210       1       0     0    7.8781135e-07   -2.0781733e+00    0.407261
 Final f                         = -2.0781733e+00  
 Function value at final x       = -2.0781733e+00  
 ====================================================

