Welcome to BCLS!


Data Fields
void *	print_info
	Transit pointer passed (untouched) to the routine print_hook.
int(*	print_hook )(void info, char msg)
	User-defined print-hook routine.
void *	fault_info
	Transit point passed (untouched) to the routine fault_hook.
int(*	fault_hook )(void info, char msg)
	User-defined fault-hook routine.
int(*	Aprod )(int mode, int m, int n, int nix, int ix[], double x[], double y[], void *UsrWrk)
	User-defined matrix-vector multiply routine.
int(*	Usolve )(int mode, int m, int n, int nix, int ix[], double v[], double w[], void *UsrWrk)
	User-defined preconditioning routine.
int(*	CallBack )(BCLS ls, void UsrWrk)
	User-defined callback function.
double *	anorm
	User-defined column weights. Length n. Optional.
void *	UsrWrk
	User workspace. Passed (untouched) to Aprod.
int	print_level
	Log verbosity.
int	proj_search
	Type of linesearch.
int	newton_step
	Method for computing Newton step.
FILE *	minor_file
	Output file for minor iteration log. Timers.
BCLS_timer	stopwatch [4]
int	itnMaj
	No. of major iterations.
int	itnMajLim
	Max no. of major iterations.
int	itnMin
	No. of cummulative minor (LSQR) iterations.
int	itnMinLim
	Max no. of minor (LSQR) iterations.
int	nAprodT
	No. of mat-vec calls, with len(ix) = n.
int	nAprodF
	No. of mat-vec calls, with 1 < len(ix) < n.
int	nAprod1
	No. of mat-vec calls, with 1 = len(ix).
int	nUsolve
	No. of call to Usolve.
int	m
	Number of rows in A.
int	n
	Number of columns in A.
int	mmax
	Maximum no. of rows in A allocated for.
int	nmax
	Maximum no. of columns in A allocated for.
int	unconstrained
	Properties of the problem. 0 if constrained; 1 if unconstrained.
double	damp
	Set by user. Must be >= 0.
double	damp_min
	Only used when there's a linear term.
double	damp_actual
	Set in newton_step, used in aprod_free.
int	exit
	Exit condition.
double	soln_obj
	Objective value.
double	soln_rNorm
	Residual at solution.
double	soln_dInf
	Dual infeasibility of solution.
int	soln_jInf
	Variable with maximum dual infeasibility.
int	soln_stat
	Status of the solution.
double	optTol
	Optimality tolerance.
double	conlim
	Upper limit on cond. no. of [A; gamma I].
double	mu
	Armijo sufficient decrease factor.
double	backtrack
	Reduction factor for Armijo linesearch.
int	backtrack_limit
	Limit on no. of backtracks in linesearch.
double	eps
	Machine precision.
double	eps2
	eps ^ 0.50.
double	eps3
	eps ^ 0.75.
double	epsx
	Tolerance for x "on bound".
double	epsfixed
	Tolerance for x considered "fixed".
double	BigNum
	Biggest number we'll allow in x.
double *	x
	x(n) solution (allocated by user).
double *	b
	b(m): right-hand-side vector (allocated by user).
double *	c
	c(n): linear term (allocated by user).
double *	bl
	bl(n): lower bounds (allocated by user).
double *	bu
	bu(n): upper bounds (allocated by user).
double *	r
	(max(n, m)) Residual.
double *	g
	(n) Gradient.
double *	dx
	(n) Search direction, full space.
double *	dxFree
	(n) Search direction, subspace.
double *	aBreak
	(n) Step to each breakpoint.
int *	iBreak
	(n) Indices of each breakpoint.
int *	ix
	(n) Indices of free variables.
double *	wrk_u
	(max(n, m)) Workspace.
double *	wrk_v
	(max(n, m)) Workspace.
double *	wrk_w
	(max(n, m)) Workspace.
jmp_buf	jmp_env
	Long jump environment.