anchor.diff:    20  continue
   
         if (iprint .ge. 0) then
  -         if (prjctd) write (6,*)
  +         if (prjctd) write (0,*)
        +   'The initial X is infeasible.  Restart with its projection.'
            if (.not. cnstnd)
  -     +      write (6,*) 'This problem is unconstrained.'
  +     +      write (0,*) 'This problem is unconstrained.'
         endif
   
         if (iprint .gt. 0) write (6,1001) nbdd
  
positive.code:       if (info .ne. 0) then
  c          nonpositive definiteness in Cholesky factorization;
  c          refresh the lbfgs memory and restart the iteration.
           if(iprint .ge. 1) write (6, 1006)
           info   = 0
           col    = 0
           head   = 1
  
negative.code:             goto 999
           else
  c             refresh the lbfgs memory and restart the iteration.
              if(iprint .ge. 1) write (0, 1008)
              if (info .eq. 0) nfgv = nfgv - 1
              info   = 0
              col    = 0
  