CPLEX example problem - qpex

CPXPARAM_Read_DataCheck                          1
CPXPARAM_QPMethod                                4
CPXPARAM_Barrier_Crossover                       1
Number of nonzeros in lower triangle of Q = 2
Using Approximate Minimum Degree ordering
Total time for automatic ordering = 0.00 sec. (0.00 ticks)
Summary statistics for factor of Q:
  Rows in Factor            = 3
  Integer space required    = 3
  Total non-zeros in factor = 6
  Total FP ops to factor    = 14
Tried aggregator 1 time.
No QP presolve or aggregator reductions.
Presolve time = 0.00 sec. (0.00 ticks)
Number of nonzeros in lower triangle of Q = 2
Using Approximate Minimum Degree ordering
Total time for automatic ordering = 0.00 sec. (0.00 ticks)
Summary statistics for factor of Q:
  Rows in Factor            = 3
  Integer space required    = 3
  Total non-zeros in factor = 6
  Total FP ops to factor    = 14
Tried aggregator 1 time.
QP Presolve added 0 rows and 3 columns.
Reduced QP has 5 rows, 6 columns, and 14 nonzeros.
Reduced QP objective Q matrix has 3 nonzeros.
Presolve time = 0.00 sec. (0.00 ticks)
Parallel mode: using up to 32 threads for barrier.
Number of nonzeros in lower triangle of A*A' = 9
Using Approximate Minimum Degree ordering
Total time for automatic ordering = 0.00 sec. (0.00 ticks)
Summary statistics for Cholesky factor:
  Threads                   = 32
  Rows in Factor            = 5
  Integer space required    = 5
  Total non-zeros in factor = 15
  Total FP ops to factor    = 55
 Itn      Primal Obj        Dual Obj  Prim Inf Upper Inf  Dual Inf
   0   1.0636929e+02   4.0119631e+04  3.00e+02  2.20e+01  4.02e+03
   1  -4.2647339e+03   1.3830857e+04  8.95e+00  6.58e-01  1.20e+02
   2  -5.7244038e+02   2.1778053e+03  3.69e-14  0.00e+00  2.02e-13
   3  -1.3359320e+02   2.1366540e+02  1.60e-14  0.00e+00  2.40e-14
   4  -1.5446636e+01   4.4803921e+01  9.33e-15  0.00e+00  1.81e-14
   5   3.4390904e-01   7.1112812e+00  6.88e-15  0.00e+00  4.50e-15
   6   1.9389541e+00   2.6972949e+00  1.78e-15  0.00e+00  2.55e-15
   7   2.0140768e+00   2.1563147e+00  1.15e-14  0.00e+00  1.75e-15
   8   2.0155916e+00   2.0388811e+00  6.66e-16  7.11e-15  8.28e-16
   9   2.0156158e+00   2.0194824e+00  1.13e-14  7.11e-15  8.69e-16
  10   2.0156165e+00   2.0162605e+00  1.50e-14  7.11e-15  1.71e-15
  11   2.0156165e+00   2.0157238e+00  8.22e-15  0.00e+00  2.50e-15
  12   2.0156165e+00   2.0156344e+00  4.44e-15  0.00e+00  2.23e-15
  13   2.0156165e+00   2.0156195e+00  8.44e-15  7.11e-15  2.29e-15
  14   2.0156165e+00   2.0156170e+00  1.18e-14  7.11e-15  1.32e-15
  15   2.0156165e+00   2.0156166e+00  1.52e-14  0.00e+00  5.56e-16
  16   2.0156165e+00   2.0156165e+00  1.49e-14  7.11e-15  2.01e-15
  17   2.0156165e+00   2.0156165e+00  4.00e-15  0.00e+00  7.96e-16
Barrier time = 0.02 sec. (0.04 ticks)

Total time on 32 threads = 0.02 sec. (0.05 ticks)
Barrier time = 0.02 sec. (0.04 ticks)
Number of nonzeros in lower triangle of Q = 2
Using Approximate Minimum Degree ordering
Total time for automatic ordering = 0.00 sec. (0.00 ticks)
Summary statistics for factor of Q:
  Rows in Factor            = 3
  Integer space required    = 3
  Total non-zeros in factor = 6
  Total FP ops to factor    = 14

QP crossover.
  Primal:  Fixed no variables.
  Dual  :  Fixed no variables.
Total crossover time = 0.00 sec. (0.01 ticks)

Total time on 32 threads = 0.02 sec. (0.05 ticks)