An O(n3L) primal-dual potential reduction algorithm for solving convex quadratic programs

@article{Goldfarb1993AnOP,
  title={An O(n3L) primal-dual potential reduction algorithm for solving convex quadratic programs},
  author={Donald Goldfarb and Shucheng Liu},
  journal={Math. Program.},
  year={1993},
  volume={61},
  pages={161-170}
}
The convex quadratic programming problem has been extensively studied and numerous algorithms have been proposed for solving it. However, in the worst case, most of these algorithms require an exponential number of steps. The first provably polynomial-time algorithm for convex quadratic programming was proposed by Kozlov et al. [14] and was based on the… CONTINUE READING