bqpb_inform_type structure#
struct bqpb_inform_type{T} status::Int32 alloc_status::Int32 bad_alloc::NTuple{81,Cchar} iter::Int32 factorization_status::Int32 factorization_integer::Int64 factorization_real::Int64 nfacts::Int32 nbacts::Int32 threads::Int32 obj::T primal_infeasibility::T dual_infeasibility::T complementary_slackness::T init_primal_infeasibility::T init_dual_infeasibility::T init_complementary_slackness::T potential::T non_negligible_pivot::T feasible::Bool checkpointsIter::NTuple{16,Cint} checkpointsTime::NTuple{16,T} time::bqpb_time_type{T} fdc_inform::fdc_inform_type{T} sbls_inform::sbls_inform_type{T} fit_inform::fit_inform_type roots_inform::roots_inform_type cro_inform::cro_inform_type{T} rpd_inform::rpd_inform_type
detailed documentation#
inform derived type as a Julia structure
components#
Int32 status
return status. See BQPB_solve for details
Int32 alloc_status
the status of the last attempted allocation/deallocation
NTuple{81,Cchar} bad_alloc
the name of the array for which an allocation/deallocation error occurred
Int32 iter
the total number of iterations required
Int32 factorization_status
the return status from the factorization
Int64 factorization_integer
the total integer workspace required for the factorization
Int64 factorization_real
the total real workspace required for the factorization
Int32 nfacts
the total number of factorizations performed
Int32 nbacts
the total number of “wasted” function evaluations during the linesearch
Int32 threads
the number of threads used
T obj
the value of the objective function at the best estimate of the solution determined by BQPB_solve
T primal_infeasibility
the value of the primal infeasibility
T dual_infeasibility
the value of the dual infeasibility
T complementary_slackness
the value of the complementary slackness
T init_primal_infeasibility
these values at the initial point (needed by GALAHAD_CCQP)
T init_dual_infeasibility
see init_primal_infeasibility
T init_complementary_slackness
see init_primal_infeasibility
T potential
the value of the logarithmic potential function sum -log(distance to constraint boundary)
T non_negligible_pivot
the smallest pivot which was not judged to be zero when detecting linear dependent constraints
Bool feasible
is the returned “solution” feasible?
Int32 checkpointsIter[16]
checkpoints(i) records the iteration at which the criticality measures first fall below \(10^{-i-1}\), i = 0, …, 15 (-1 means not achieved)
T checkpointsTime[16]
see checkpointsIter
struct bqpb_time_type time
timings (see above)
struct fdc_inform_type fdc_inform
inform parameters for FDC
struct sbls_inform_type sbls_inform
inform parameters for SBLS
struct fit_inform_type fit_inform
return information from FIT
struct roots_inform_type roots_inform
return information from ROOTS
struct cro_inform_type cro_inform
inform parameters for CRO
struct rpd_inform_type rpd_inform
inform parameters for RPD