L-BFGS-B  3.0
Large-scale Bound-constrained Optimization
freev.f File Reference

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...
 

Function/Subroutine Documentation

◆ freev()

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.

Parameters
nnumber of parameters
nfreenumber of free parameters, i.e., those not at their bounds
indexfor 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.
nenterTODO
ileaveTODO
indx2On 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.
iwhereTODO
wrkTODO
updatdTODO
cnstndindicating whether bounds are present
iprintcontrol screen output
iterTODO

Definition at line 32 of file freev.f.

Referenced by mainlb().

Here is the caller graph for this function: