lsqp_inform_type structure

    struct lsqp_inform_type{T,INT}
      status::INT
      alloc_status::INT
      bad_alloc::NTuple{81,Cchar}
      iter::INT
      factorization_status::INT
      factorization_integer::Int64
      factorization_real::Int64
      nfacts::INT
      nbacts::INT
      obj::T
      potential::T
      non_negligible_pivot::T
      feasible::Bool
      time::lsqp_time_type{T}
      fdc_inform::fdc_inform_type{T,INT}
      sbls_inform::sbls_inform_type{T,INT}

detailed documentation

inform derived type as a Julia structure

components

INT status

return status. See LSQP_solve for details

INT 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

INT iter

the total number of iterations required

INT 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

INT nfacts

the total number of factorizations performed

INT nbacts

the total number of “wasted” function evaluations during the linesearch

T obj

the value of the objective function at the best estimate of the solution determined by LSQP_solve_qp

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?

struct lsqp_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