Polynomial barrier function algorithms for convex quadratic programming

الملخص EN

We present a primal polynomial-time barrier function algorithm for convex quadratic programming.

The algorithm considers the formulations with inequality constraints so that an unconstrained nonlinear programming subproblem is solved at each iteration.

The algorithm requires 0((nm15 + n2m)L) arithmetic operations