#include <qp_structs.h>

Detailed Description

Important results are collected in the Output struct

Definition at line 50 of file qp_structs.h.

Field Documentation

real_t* Output::ds_vector

Vector storing all the value of the dual suboptimality every iteration

Definition at line 60 of file qp_structs.h.

uint32_t Output::exitflag_inner

Exitflag for the inner problem. Values: 1 = feasible point found, 2 = Maximum number of iterations exceeded

Definition at line 58 of file qp_structs.h.

uint32_t Output::flag_last_satisfied

Flag spesifies which stopping criteria was resolved last. Value: 0 = dual suboptimality, 1 = primal feasibility

Definition at line 55 of file qp_structs.h.

uint32_t Output::iterations

Number of outer iterations

Definition at line 51 of file qp_structs.h.

uint32_t Output::iterations_inner_tot

Total number of iterations for the inner problem

Definition at line 52 of file qp_structs.h.

uint32_t Output::niter_feasible_ds

Number of iterations the criterion for dual suboptimality was satisfied

Definition at line 56 of file qp_structs.h.

uint32_t Output::niter_feasible_pf

Number of iterations the criterion for primal feasibility was satisfied

Definition at line 57 of file qp_structs.h.

uint32_t Output::num_exceeded_max_niter_inner

Total number of times the inner problem exceeded the number of iterations

Definition at line 59 of file qp_structs.h.

real_t* Output::pf_vector

Vector storing all the value of the primal feasibility every iteration

Definition at line 61 of file qp_structs.h.

real_t Output::time

Runtime of the algorithm after all initialization is done

Definition at line 53 of file qp_structs.h.

real_t Output::time_tot_inner

Total time spent on solving the inner problem

Definition at line 54 of file qp_structs.h.

The documentation for this struct was generated from the following file: