dqp_inform_type structure

#include <galahad_dqp.h>

struct dqp_inform_type {
    // components

    ipc_ status;
    ipc_ alloc_status;
    char bad_alloc[81];
    ipc_ iter;
    ipc_ cg_iter;
    ipc_ factorization_status;
    int64_t factorization_integer;
    int64_t factorization_real;
    ipc_ nfacts;
    ipc_ threads;
    rpc_ obj;
    rpc_ primal_infeasibility;
    rpc_ dual_infeasibility;
    rpc_ complementary_slackness;
    rpc_ non_negligible_pivot;
    bool feasible;
    ipc_ checkpointsIter[16];
    rpc_ checkpointsTime[16];
    struct dqp_time_type time;
    struct fdc_inform_type fdc_inform;
    struct sls_inform_type sls_inform;
    struct sbls_inform_type sbls_inform;
    struct gltr_inform_type gltr_inform;
    ipc_ scu_status;
    struct scu_inform_type scu_inform;
    struct rpd_inform_type rpd_inform;
};

detailed documentation

inform derived type as a C struct

components

ipc_ status

return status. See DQP_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_ cg_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_ threads

the number of threads used

rpc_ obj

the value of the objective function at the best estimate of the solution determined by DQP_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_ non_negligible_pivot

the smallest pivot that was not judged to be zero when detecting linearly 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 dqp_time_type time

timings (see above)

struct fdc_inform_type fdc_inform

inform parameters for FDC

struct sls_inform_type sls_inform

inform parameters for SLS

struct sbls_inform_type sbls_inform

inform parameters for SBLS

struct gltr_inform_type gltr_inform

return information from GLTR

ipc_ scu_status

inform parameters for SCU

struct scu_inform_type scu_inform

see scu_status

struct rpd_inform_type rpd_inform

inform parameters for RPD