Ji, JunPotra, FlorianTapia, RichardZhang, Yin2018-06-182018-06-181991-07Ji, Jun, Potra, Florian, Tapia, Richard, et al.. "An Interior-Point Method with Polynomial Complexity and Superlinear Convergence for Linear Complementarity Problems." (1991) <a href="https://hdl.handle.net/1911/101724">https://hdl.handle.net/1911/101724</a>.https://hdl.handle.net/1911/101724For linear programming, a primal-dual interior-point algorithm was recently constructed by Zhang and Tapia that achieves both polynomial complexity and Q-superlinear convergence (Q-quadratic in the nondegenerate case). In this paper, we extend their results to quadratic programming and linear complementarity problems.25 ppengTechnical reportTR91-23