lpa_control_type structure#

    struct lpa_control_type{T}
      f_indexing::Bool
      error::Int32
      out::Int32
      print_level::Int32
      start_print::Int32
      stop_print::Int32
      maxit::Int32
      max_iterative_refinements::Int32
      min_real_factor_size::Int32
      min_integer_factor_size::Int32
      random_number_seed::Int32
      sif_file_device::Int32
      qplib_file_device::Int32
      infinity::T
      tol_data::T
      feas_tol::T
      relative_pivot_tolerance::T
      growth_limit::T
      zero_tolerance::T
      change_tolerance::T
      identical_bounds_tol::T
      cpu_time_limit::T
      clock_time_limit::T
      scale::Bool
      dual::Bool
      warm_start::Bool
      steepest_edge::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}

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 (>= 2 turns on LA04 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 max_iterative_refinements

maximum number of iterative refinements allowed

Int32 min_real_factor_size

initial size for real array for the factors and other data

Int32 min_integer_factor_size

initial size for integer array for the factors and other data

Int32 random_number_seed

the initial seed used when generating random numbers

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 tol_data

the tolerable relative perturbation of the data (A,g,..) defining the problem

T feas_tol

any constraint violated by less than feas_tol will be considered to be satisfied

T relative_pivot_tolerance

pivot threshold used to control the selection of pivot elements in the matrix factorization. Any potential pivot which is less than the largest entry in its row times the threshold is excluded as a candidate

T growth_limit

limit to control growth in the upated basis factors. A refactorization occurs if the growth exceeds this limit

T zero_tolerance

any entry in the basis smaller than this is considered zero

T change_tolerance

any solution component whose change is smaller than a tolerence times the largest change may be considered to be zero

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 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 scale

if .scale is true, the problem will be automatically scaled prior to solution. This may improve computation time and accuracy

Bool dual

should the dual problem be solved rather than the primal?

Bool warm_start

should a warm start using the data in C_stat and X_stat be attempted?

Bool steepest_edge

should steepest-edge weights be used to detetrmine the variable leaving the basis?

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 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’