bqpb_control_type structure#

    struct bqpb_control_type{T}
      f_indexing::Bool
      error::Int32
      out::Int32
      print_level::Int32
      start_print::Int32
      stop_print::Int32
      maxit::Int32
      infeas_max::Int32
      muzero_fixed::Int32
      restore_problem::Int32
      indicator_type::Int32
      arc::Int32
      series_order::Int32
      sif_file_device::Int32
      qplib_file_device::Int32
      infinity::T
      stop_abs_p::T
      stop_rel_p::T
      stop_abs_d::T
      stop_rel_d::T
      stop_abs_c::T
      stop_rel_c::T
      perturb_h::T
      prfeas::T
      dufeas::T
      muzero::T
      tau::T
      gamma_c::T
      gamma_f::T
      reduce_infeas::T
      obj_unbounded::T
      potential_unbounded::T
      identical_bounds_tol::T
      mu_pounce::T
      indicator_tol_p::T
      indicator_tol_pd::T
      indicator_tol_tapia::T
      cpu_time_limit::T
      clock_time_limit::T
      remove_dependencies::Bool
      treat_zero_bounds_as_general::Bool
      treat_separable_as_general::Bool
      just_feasible::Bool
      getdua::Bool
      puiseux::Bool
      every_order::Bool
      feasol::Bool
      balance_initial_complentarity::Bool
      crossover::Bool
      space_critical::Bool
      deallocate_error_fatal::Bool
      generate_sif_file::Bool
      generate_qplib_file::Bool
      sif_file_name::NTuple{31,Cchar}
      qplib_file_name::NTuple{31,Cchar}
      prefix::NTuple{31,Cchar}
      fdc_control::fdc_control_type{T}
      sbls_control::sbls_control_type{T}
      fit_control::fit_control_type
      roots_control::roots_control_type{T}
      cro_control::cro_control_type{T}

detailed documentation#

control derived type as a Julia structure

components#

Bool f_indexing

use C or Fortran sparse matrix indexing

Int32 error

error and warning diagnostics occur on stream error

Int32 out

general output occurs on stream out

Int32 print_level

the level of output required is specified by print_level

  • \(\leq\) 0 gives no output,

  • = 1 gives a one-line summary for every iteration,

  • = 2 gives a summary of the inner iteration for each iteration,

  • \(\geq\) 3 gives increasingly verbose (debugging) output

Int32 start_print

any printing will start on this iteration

Int32 stop_print

any printing will stop on this iteration

Int32 maxit

at most maxit inner iterations are allowed

Int32 infeas_max

the number of iterations for which the overall infeasibility of the problem is not reduced by at least a factor .reduce_infeas before the problem is flagged as infeasible (see reduce_infeas)

Int32 muzero_fixed

the initial value of the barrier parameter will not be changed for the first muzero_fixed iterations

Int32 restore_problem

indicate whether and how much of the input problem should be restored on output. Possible values are

  • 0 nothing restored

  • 1 scalar and vector parameters

  • 2 all parameters

Int32 indicator_type

specifies the type of indicator function used. Pssible values are

  • 1 primal indicator: a constraint is active if and only if the distance to its nearest bound \(\leq\).indicator_p_tol

  • 2 primal-dual indicator: a constraint is active if and only if the distance to its nearest bound \(\leq\).indicator_tol_pd \* size of corresponding multiplier

  • 3 primal-dual indicator: a constraint is active if and only if the distance to its nearest bound \(\leq\).indicator_tol_tapia \* distance to same bound at previous iteration

Int32 arc

which residual trajectory should be used to aim from the current iterate to the solution. Possible values are

  • 1 the Zhang linear residual trajectory

  • 2 the Zhao-Sun quadratic residual trajectory

  • 3 the Zhang arc ultimately switching to the Zhao-Sun residual trajectory

  • 4 the mixed linear-quadratic residual trajectory

  • 5 the Zhang arc ultimately switching to the mixed linear-quadratic residual trajectory

Int32 series_order

the order of (Taylor/Puiseux) series to fit to the path data

Int32 sif_file_device

specifies the unit number to write generated SIF file describing the current problem

Int32 qplib_file_device

specifies the unit number to write generated QPLIB file describing the current problem

T infinity

any bound larger than infinity in modulus will be regarded as infinite

T stop_abs_p

the required absolute and relative accuracies for the primal infeasibility

T stop_rel_p

see stop_abs_p

T stop_abs_d

the required absolute and relative accuracies for the dual infeasibility

T stop_rel_d

see stop_abs_d

T stop_abs_c

the required absolute and relative accuracies for the complementarity

T stop_rel_c

see stop_abs_c

T perturb_h

.perturb_h will be added to the Hessian

T prfeas

initial primal variables will not be closer than .prfeas from their bounds

T dufeas

initial dual variables will not be closer than .dufeas from their bounds

T muzero

the initial value of the barrier parameter. If muzero is not positive, it will be reset to an appropriate value

T tau

the weight attached to primal-dual infeasibility compared to complementa when assessing step acceptance

T gamma_c

individual complementarities will not be allowed to be smaller than gamma_c times the average value

T gamma_f

the average complementarity will not be allowed to be smaller than gamma_f times the primal/dual infeasibility

T reduce_infeas

if the overall infeasibility of the problem is not reduced by at least a factor .reduce_infeas over .infeas_max iterations, the problem is flagged as infeasible (see infeas_max)

T obj_unbounded

if the objective function value is smaller than obj_unbounded, it will be flagged as unbounded from below.

T potential_unbounded

if W=0 and the potential function value is smaller than .potential_unbounded \(\ast\) number of one-sided bounds, the analytic center will be flagged as unbounded

T identical_bounds_tol

any pair of constraint bounds \((c_l,c_u)\) or \((x_l,x_u)\) that are closer than .identical_bounds_tol will be reset to the average of their values

T mu_pounce

start terminal extrapolation when mu reaches mu_pounce

T indicator_tol_p

if .indicator_type = 1, a constraint/bound will be deemed to be active if and only if the distance to its nearest bound \(\leq\).indicator_p_tol

T indicator_tol_pd

if .indicator_type = 2, a constraint/bound will be deemed to be active if and only if the distance to its nearest bound \(\leq\).indicator_tol_pd \* size of corresponding multiplier

T indicator_tol_tapia

if .indicator_type = 3, a constraint/bound will be deemed to be active if and only if the distance to its nearest bound \(\leq\).indicator_tol_tapia \* distance to same bound at previous iteration

T cpu_time_limit

the maximum CPU time allowed (-ve means infinite)

T clock_time_limit

the maximum elapsed clock time allowed (-ve means infinite)

Bool remove_dependencies

the equality constraints will be preprocessed to remove any linear dependencies if true

Bool treat_zero_bounds_as_general

any problem bound with the value zero will be treated as if it were a general value if true

Bool treat_separable_as_general

if .just_feasible is true, the algorithm will stop as soon as a feasible point is found. Otherwise, the optimal solution to the problem will be found

Bool just_feasible

if .treat_separable_as_general, is true, any separability in the problem structure will be ignored

Bool getdua

if .getdua, is true, advanced initial values are obtained for the dual variables

Bool puiseux

decide between Puiseux and Taylor series approximations to the arc

Bool every_order

try every order of series up to series_order?

Bool feasol

if .feasol is true, the final solution obtained will be perturbed so that variables close to their bounds are moved onto these bounds

Bool balance_initial_complentarity

if .balance_initial_complentarity is true, the initial complemetarity is required to be balanced

Bool crossover

if .crossover is true, cross over the solution to one defined by linearly-independent constraints if possible

Bool space_critical

if .space_critical true, every effort will be made to use as little space as possible. This may result in longer computation time

Bool deallocate_error_fatal

if .deallocate_error_fatal is true, any array/pointer deallocation error will terminate execution. Otherwise, computation will continue

Bool generate_sif_file

if .generate_sif_file is .true. if a SIF file describing the current problem is to be generated

Bool generate_qplib_file

if .generate_qplib_file is .true. if a QPLIB file describing the current problem is to be generated

NTuple{31,Cchar} sif_file_name

name of generated SIF file containing input problem

NTuple{31,Cchar} qplib_file_name

name of generated QPLIB file containing input problem

NTuple{31,Cchar} prefix

all output lines will be prefixed by .prefix(2:LEN(TRIM(.prefix))-1) where .prefix contains the required string enclosed in quotes, e.g. “string” or ‘string’

struct fdc_control_type fdc_control

control parameters for FDC

struct sbls_control_type sbls_control

control parameters for SBLS

struct fit_control_type fit_control

control parameters for FIT

struct roots_control_type roots_control

control parameters for ROOTS

struct cro_control_type cro_control

control parameters for CRO