# - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
# - - - - - - - - - - - - - - BDSMBundleCfg.txt - - - - - - - - - - - - - -
#
# The ComputeConfig of the BundleSolver on the master problem of
# BendersDecompositionSolver in the convex regime, shared by
# BDSMCfg-CVX.txt and BDSMCfg-CVX-int.txt.
#
# - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -

ComputeConfig # exact type of the ComputeConfig object

1  # f_diff == 0 ==> all non-provided parameters are set to the default value
   # f_diff == 1 ==> all non-provided parameters are not changed

14 # number of integer parameters

# now all the integer parameters
intMPStbl         0 # stabilization: 0 = proximal, 1 = level,
                    # 2 = doubly stabilized
intMaxIter   100000 # MaxIter, max number of iterations for each call
intLogVerb        0 # LogVerb, log verbosity of main Bundle algorithm
intBPar1         20 # discard items when they have been useless for <this>
                    # iterations
intBPar2        400 # max bundle size per component
intBPar3          1 # max n. of items to fetch from Fi() at each iteration
intBPar4          1 # min n. of items to fetch from Fi() at each iteration
intBPar6          0 # second parameter for dynamic max n. of items per
                    # iteration
intBPar7         11 # how to deal with the global pools
intMnSSC          0 # min number of consecutive SS with the same t for a t
                    # increase
intMnNSC          1 # min number of consecutive NS with the same t for a t
                    # decrease
inttSPar1        12 # long-term t-strategy (0 = none, 4 = soft, 8 = hard,
                    # 12 = balancing): the master knows nothing of the scale
                    # of the design Variable, and letting it balance the
                    # stabilization against the model is what finds it
intMaxNrEvls      2 # maximum number of function evaluations per iteration
intMaxThread      8 # threads evaluating the components (the subproblems)
                    # of an iteration in ParallelBundleSolver, as the 8 of
                    # BDSCfg.txt in the MILP regime

15 # number of double parameters

# now all the double parameters
dblRelAcc      1e-8 # relative accuracy required to solution: with 1e-6
                    # the bundle may stop short of it where the scenarios
                    # differ the most, and give an upper bound instead of
                    # a value
dblNZEps       1e-4 # stopping parameter: threshold to declare 0 the
                    # || residual ||, below which the lower bound is
                    # certified: the linearizations of subproblems solved
                    # by a Lagrangian dual are accurate to its dblRelAcc
                    # (1e-5 in TSSBSCfg-LDrec.txt), and with a smaller
                    # threshold the Solver reports the optimum without a
                    # bound
dbltStar       1e+4 # stopping parameter: multiplied to || residual || to
                    # estimate gap
dblBPar5          4 # first parameter for dynamic max n. of items per
                    # iteration
dblm1         -0.01 # a NS is possible if (~) Fi( Lambda1 ) >= Fi( Lambda )
                    # + | m1 | v*
dblm2          0.99 # a SS is possible if Fi( Lambda1 ) <= Fi( Lambda )
                    # + ( 1 - m2 ) v*
dblm3          0.99 # a NR is computed if \sigma^* < - t * m3 * || z* ||
dblmxIncr        10 # max increase of t
dblmnIncr       1.5 # min increase of t (each time it is increased)
dblmxDecr       0.1 # max decrease of t
dblmnDecr      0.66 # min decrease of t (each time it is decreased)
dbltMaior      1e+6 # maximum value for t
dbltMinor      1e-4 # minimum value for t
dbltInit       1e+3 # initial value for t, at the scale of a design in MW:
                    # with 1e+5 the bundle may stop before the optimum
dbltSPar2     0.001 # parameter for the long-term t-strategy

1 # number of string parameters

# now all the string parameters
strMPBSolverCfg  MPBCfg.txt     # BlockSolverConfig of the
                                # MasterProblemBlock Solver

0 # number of vector-of-int parameters

# now all the vector-of-int parameters
# [none]

0 # number of vector-of-double parameters

# now all the vector-of-double parameters
# [none]

0 # number of vector-of-string parameters

# now all the vector-of-string parameters
# [none]

# pointer to the "extra" Configuration
* # [none]

# - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
# - - - - - - - - - - - - - END BDSMBundleCfg.txt - - - - - - - - - - - - -
# - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
