Stop the projected line search from extrapolating on good CG directions only.
BQP modifications to properly implement a Steihaug-like trust region method.
- the algorithm stops as soon as it hits the TR boundary
- no more line search extrapolation on CG search directions
Minor updates to SBMin.
Use correct format for first line of output.
Count total number of CG iterations.
Report number of CG iterations of subsolver.
Add logging to derivative checker.
Only do one projected gradient iteration for speed. (Especially when Hessian-products are expensive.)
Merge in latest changes to CG counter in BQP and SBMIN.

Merge branch 'sylvain-lancelot-dev' into auglag-QN

Conflicts:
	nlpy/optimize/solvers/bqp2.py
Clean up initialization of augmented Lagrangian class to use NLPModel.__init__()
Log the total number of CG iterations taken by BQP.
Merge in latest updates to code to revisit this branch.

Merge branch 'auglag-QN' into bqp-mod-test

Conflicts:
	nlpy/optimize/solvers/bqp2.py
Cleaned up line search to use minimum break point and projected gradient for backtracking.
Also fixed white space issue left over from merge.
Merge branch 'bqp-mod-test' into auglag-QN