bqp_control_type structure#

    struct bqp_control_type{T,INT}
      f_indexing::Bool
      error::INT
      out::INT
      print_level::INT
      start_print::INT
      stop_print::INT
      print_gap::INT
      maxit::INT
      cold_start::INT
      ratio_cg_vs_sd::INT
      change_max::INT
      cg_maxit::INT
      sif_file_device::INT
      infinity::T
      stop_p::T
      stop_d::T
      stop_c::T
      identical_bounds_tol::T
      stop_cg_relative::T
      stop_cg_absolute::T
      zero_curvature::T
      cpu_time_limit::T
      exact_arcsearch::Bool
      space_critical::Bool
      deallocate_error_fatal::Bool
      generate_sif_file::Bool
      sif_file_name::NTuple{31,Cchar}
      prefix::NTuple{31,Cchar}
      sbls_control::sbls_control_type{T,INT}

detailed documentation#

control derived type as a Julia structure

components#

Bool f_indexing

use C or Fortran sparse matrix indexing

INT error

unit number for error and warning diagnostics

INT out

general output unit number

INT print_level

the level of output required

INT start_print

on which iteration to start printing

INT stop_print

on which iteration to stop printing

INT print_gap

how many iterations between printing

INT maxit

how many iterations to perform (-ve reverts to HUGE(1)-1)

INT cold_start

cold_start should be set to 0 if a warm start is required (with variable assigned according to B_stat, see below), and to any other value if the values given in prob.X suffice

INT ratio_cg_vs_sd

the ratio of how many iterations use CG rather steepest descent

INT change_max

the maximum number of per-iteration changes in the working set permitted when allowing CG rather than steepest descent

INT cg_maxit

how many CG iterations to perform per BQP iteration (-ve reverts to n+1)

INT sif_file_device

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

T infinity

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

T stop_p

the required accuracy for the primal infeasibility

T stop_d

the required accuracy for the dual infeasibility

T stop_c

the required accuracy for the complementary slackness

T identical_bounds_tol

any pair of constraint bounds (x_l,x_u) that are closer than i dentical_bounds_tol will be reset to the average of their values

T stop_cg_relative

the CG iteration will be stopped as soon as the current norm of the preconditioned gradient is smaller than max( stop_cg_relative * initial preconditioned gradient, stop_cg_absolute)

T stop_cg_absolute

see stop_cg_relative

T zero_curvature

threshold below which curvature is regarded as zero

T cpu_time_limit

the maximum CPU time allowed (-ve = no limit)

Bool exact_arcsearch

exact_arcsearch is true if an exact arcsearch is required, and false if approximation suffices

Bool space_critical

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

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, a SIF file describing the current problem will be generated

NTuple{31,Cchar} sif_file_name

name (max 30 characters) of generated SIF file containing input problem

NTuple{31,Cchar} prefix

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

struct sbls_control_type sbls_control

control parameters for SBLS