cqp_inform_type structure#
#include <galahad_cqp.h> struct cqp_inform_type { // components ipc_ status; ipc_ alloc_status; char bad_alloc[81]; ipc_ iter; ipc_ factorization_status; int64_t factorization_integer; int64_t factorization_real; ipc_ nfacts; ipc_ nbacts; ipc_ threads; rpc_ obj; rpc_ primal_infeasibility; rpc_ dual_infeasibility; rpc_ complementary_slackness; rpc_ init_primal_infeasibility; rpc_ init_dual_infeasibility; rpc_ init_complementary_slackness; rpc_ potential; rpc_ non_negligible_pivot; bool feasible; ipc_ checkpointsIter[16]; rpc_ checkpointsTime[16]; struct cqp_time_type time; struct fdc_inform_type fdc_inform; struct sbls_inform_type sbls_inform; struct fit_inform_type fit_inform; struct roots_inform_type roots_inform; struct cro_inform_type cro_inform; struct rpd_inform_type rpd_inform; };
detailed documentation#
inform derived type as a C struct
components#
ipc_ status
return status. See CQP_solve for details.
ipc_ alloc_status
the status of the last attempted allocation/deallocation.
char bad_alloc[81]
the name of the array for which an allocation/deallocation error occurred.
ipc_ iter
the total number of iterations required
ipc_ factorization_status
the return status from the factorization
int64_t factorization_integer
the total integer workspace required for the factorization
int64_t factorization_real
the total real workspace required for the factorization
ipc_ nfacts
the total number of factorizations performed
ipc_ nbacts
the total number of “wasted” function evaluations during the linesearch
ipc_ threads
the number of threads used
rpc_ obj
the value of the objective function at the best estimate of the solution determined by CQP_solve
rpc_ primal_infeasibility
the value of the primal infeasibility
rpc_ dual_infeasibility
the value of the dual infeasibility
rpc_ complementary_slackness
the value of the complementary slackness
rpc_ init_primal_infeasibility
these values at the initial point (needed by GALAHAD_CQP)
rpc_ init_dual_infeasibility
see init_primal_infeasibility
rpc_ init_complementary_slackness
see init_primal_infeasibility
rpc_ potential
the value of the logarithmic potential function sum -log(distance to constraint boundary)
rpc_ 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?
ipc_ 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)
rpc_ checkpointsTime[16]
see checkpointsIter
struct cqp_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