KNITRO 5.2.0: 
======================================
  Academic Ziena License (NOT FOR COMMERCIAL USE)
             KNITRO 5.2.0
       Ziena Optimization, Inc.
       website:  www.ziena.com
       email:   info@ziena.com
======================================

The problem is identified as a QP.
The problem is identified as bound constrained only.
KNITRO changing algorithm from AUTO to 1.
KNITRO changing bar_murule from AUTO to 4.
KNITRO changing bar_initpt from AUTO to 1.
KNITRO changing bar_penaltyrule from AUTO to 2.
KNITRO changing bar_penaltycons from AUTO to 1.
KNITRO shifted start point to honor bounds (80000 variables).

Problem Characteristics
-----------------------
Objective goal:  Minimize
Number of variables:                160000
    bounded below:                  160000
    bounded above:                       0
    bounded below and above:             0
    fixed:                               0
    free:                                0
Number of constraints:                   0
    linear equalities:                   0
    nonlinear equalities:                0
    linear inequalities:                 0
    nonlinear inequalities:              0
    range:                               0
Number of nonzeros in Jacobian:          0
Number of nonzeros in Hessian:      479200

  Iter      Objective      FeasError   OptError    ||Step||    CGits 
--------  --------------  ----------  ----------  ----------  -------
       0    1.620512e+03   0.000e+00
      10   -1.529523e-01   0.000e+00   7.070e-05   1.541e+00        0
      11   -1.541807e-01   0.000e+00   5.010e-08   2.475e-01        0

EXIT: Locally optimal solution found.

Final Statistics
----------------
Final objective value               =  -1.54180689584817e-01
Final feasibility error (abs / rel) =   0.00e+00 / 0.00e+00
Final optimality error  (abs / rel) =   5.01e-08 / 5.01e-08
# of iterations                     =         11 
# of CG iterations                  =          0 
# of function evaluations           =         12
# of gradient evaluations           =         12
# of Hessian evaluations            =         11
Total program time (secs)           =      52.15013 (    52.151 CPU time)
Time spent in evaluations (secs)    =      10.45687

===============================================================================

Locally optimal solution.
objective -0.1541806896; feasibility error 0
11 major iterations; 12 function evaluations
93.95user 1.68system 1:35.65elapsed 99%CPU (0avgtext+0avgdata 0maxresident)k
0inputs+0outputs (0major+309018minor)pagefaults 0swaps