An Interior-Point Method with Polynomial Complexity and Superlinear Convergence for Linear Complementarity Problems
For 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.
Citable link to this pagehttps://hdl.handle.net/1911/101724
MetadataShow full item record
- CAAM Technical Reports