L-BFGS-B
3.0
Large-scale Bound-constrained Optimization
|
Go to the source code of this file.
Functions/Subroutines | |
subroutine | freev (n, nfree, index, nenter, ileave, indx2, iwhere, wrk, updatd, cnstnd, iprint, iter) |
This subroutine counts the entering and leaving variables when iter > 0, and finds the index set of free and active variables at the GCP. More... | |
subroutine freev | ( | integer | n, |
integer | nfree, | ||
integer, dimension(n) | index, | ||
integer | nenter, | ||
integer | ileave, | ||
integer, dimension(n) | indx2, | ||
integer, dimension(n) | iwhere, | ||
logical | wrk, | ||
logical | updatd, | ||
logical | cnstnd, | ||
integer | iprint, | ||
integer | iter | ||
) |
This subroutine counts the entering and leaving variables when iter > 0, and finds the index set of free and active variables at the GCP.
n | number of parameters |
nfree | number of free parameters, i.e., those not at their bounds |
index | for i=1,...,nfree, index(i) are the indices of free variables for i=nfree+1,...,n, index(i) are the indices of bound variables On entry after the first iteration, index gives the free variables at the previous iteration. On exit it gives the free variables based on the determination in cauchy using the array iwhere. |
nenter | TODO |
ileave | TODO |
indx2 | On entry indx2 is unspecified. On exit with iter>0, indx2 indicates which variables have changed status since the previous iteration. For i= 1,...,nenter, indx2(i) have changed from bound to free. For i= ileave+1,...,n, indx2(i) have changed from free to bound. |
iwhere | TODO |
wrk | TODO |
updatd | TODO |
cnstnd | indicating whether bounds are present |
iprint | control screen output |
iter | TODO |
Definition at line 32 of file freev.f.
Referenced by mainlb().